HOG-based approach for leaf classification

Authors:
Xue-Yang Xiao;Rongxiang Hu;Shan-Wen Zhang;Xiao-Feng Wang
Affiliations:
Hefei Institute of Intelligent Machines, CAS, Hefei, China and Department of Automation, University of Science and Technology of China, Hefei, China;Hefei Institute of Intelligent Machines, CAS, Hefei, China and Department of Automation, University of Science and Technology of China, Hefei, China;Hefei Institute of Intelligent Machines, CAS, Hefei, China;Hefei Institute of Intelligent Machines, CAS, Hefei, China and Key Lab of Network and Intelligent Information Processing, Department of Computer Science and Technology, Hefei University, Hefei, Ch ...
Venue:
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Year:
2010

Citing 5
Cited 1

Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
Recognizing Plant Species by Leaf Shapes-A Case Study of the Acer Family

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Histograms of Oriented Gradients for Human Detection

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Using the Inner-Distance for Classification of Articulated Shapes

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Efficient and robust feature extraction by maximum margin criterion

IEEE Transactions on Neural Networks

An efficient multi-scale overlapped block LBP approach for leaf image recognition

ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new approach for plant leaf classification, which treat histogram of oriented gradients (HOG) as a new representation of shape, and use the Maximum Margin Criterion (MMC) for dimensionality reduction. We compare this algorithm with a classic shape classification method Inner-Distance Shape Context (IDSC) on Swedish leaf dataset and ICL dataset. The proposed method achieves better performance compared with IDSC.