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.
['Yun Ding', 'Qing Yan', 'Jingjing Zhang', 'Lina Xun', 'Chun-Hou Zheng']
Leaf Clustering Based on Sparse Subspace Clustering