Leaf Clustering Based on Sparse Subspace Clustering

Leaf recognition is one of the important techniques for species automatic identification. Because of not needing prior knowledge, clustering based method is a good choice to accomplish this task. Moreover, the high dimensions of leaf feature are always a challenge for traditional clustering algorithm. While the Sparse Subspace Clustering (SSC) can overcome the defect of traditional method in dealing with the high dimensional data. In this paper we propose to use SSC for leaf clustering. The experiments are performed on the database of leaves with noise and no noise respectively, and compared with some conventional algorithm such as k-means, k-medoids, etc. The results show that the clustering effect of SSC is more accurate and robust than others.

[1]  René Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications , 2012, IEEE transactions on pattern analysis and machine intelligence.

[2]  Shahram Jafari,et al.  Comparison of Supervised and Unsupervised Learning Classifiers for Travel Recommendations , 2012 .

[3]  Guan Yong,et al.  Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm , 2010, 2010 Third International Symposium on Intelligent Information Technology and Security Informatics.

[4]  Yi Yang,et al.  Discriminative Nonnegative Spectral Clustering with Out-of-Sample Extension , 2013, IEEE Transactions on Knowledge and Data Engineering.

[5]  W. John Kress,et al.  Leafsnap: A Computer Vision System for Automatic Plant Species Identification , 2012, ECCV.

[6]  Ming Fan,et al.  Class Imbalance Oriented Logistic Regression , 2014, 2014 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery.

[7]  Weiwei Sun,et al.  Band Selection Using Improved Sparse Subspace Clustering for Hyperspectral Imagery Classification , 2015, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.

[8]  J.A. O'Sullivan.  Message passing expectation-maximization algorithms , 2005, IEEE/SP 13th Workshop on Statistical Signal Processing, 2005.

[9]  Xinlei Chen,et al.  Large Scale Spectral Clustering Via Landmark-Based Sparse Representation , 2015, IEEE Transactions on Cybernetics.

[10]  Ming-ming Gao,et al.  Research in data stream clustering based on Gaussian Mixture Model Genetic Algorithm , 2010, The 2nd International Conference on Information Science and Engineering.

[11]  Othman O. Khalifa,et al.  Comparison of supervised and unsupervised learning classifiers for human posture recognition , 2010, International Conference on Computer and Communication Engineering (ICCCE'10).

[12]  Yuan Yan Tang,et al.  Minimum Error Entropy Based Sparse Representation for Robust Subspace Clustering , 2015, IEEE Transactions on Signal Processing.

[13]  Li Yingying.  Estimating parameters of GMM based on split EM , 2012 .

[14]  Jiawei Han,et al.  Document clustering using locality preserving indexing , 2005, IEEE Transactions on Knowledge and Data Engineering.

[15]  René Vidal,et al.  Sparse subspace clustering , 2009, CVPR.

[16]  Lixin Gao,et al.  Accelerating Expectation-Maximization Algorithms with Frequent Updates , 2012, 2012 IEEE International Conference on Cluster Computing.

[17]  Cemil Oz,et al.  Leaf recognition using K-NN classification algorithm , 2012, 2012 20th Signal Processing and Communications Applications Conference (SIU).

[18]  Xiaoming Liu,et al.  Mass Classification in Mammograms Using Selected Geometry and Texture Features, and a New SVM-Based Feature Selection Method , 2014, IEEE Systems Journal.