TY - JOUR
T1 - Discriminant WSRC for large-scale plant species recognition
AU - Zhang, Shanwen
AU - Zhang, Chuanlei
AU - Zhu, Yihai
AU - You, Zhuhong
N1 - Publisher Copyright:
Copyright © 2017 Shanwen Zhang et al.
PY - 2017/12/25
Y1 - 2017/12/25
N2 - In sparse representation based classification (SRC) and weighted SRC (WSRC), it is time-consuming to solve the global sparse representation problem.AdiscriminantWSRC(DWSRC) is proposed for large-scale plant species recognition, including two stages. Firstly, several subdictionaries are constructed by dividing the dataset into several similar classes, and a subdictionary is chosen by the maximum similarity between the test sample and the typical sample of each similar class. Secondly, the weighted sparse representation of the test image is calculated with respect to the chosen subdictionary, and then the leaf category is assigned through the minimum reconstruction error. Different from the traditional SRC and its improved approaches, we sparsely represent the test sample on a subdictionary whose base elements are the training samples of the selected similar class, instead of using the generic overcomplete dictionary on the entire training samples.Thus, the complexity to solving the sparse representation problem is reduced. Moreover, DWSRC is adapted to newly added leaf species without rebuilding the dictionary. Experimental results on the ICL plant leaf database show that the method has low computational complexity and high recognition rate and can be clearly interpreted.
AB - In sparse representation based classification (SRC) and weighted SRC (WSRC), it is time-consuming to solve the global sparse representation problem.AdiscriminantWSRC(DWSRC) is proposed for large-scale plant species recognition, including two stages. Firstly, several subdictionaries are constructed by dividing the dataset into several similar classes, and a subdictionary is chosen by the maximum similarity between the test sample and the typical sample of each similar class. Secondly, the weighted sparse representation of the test image is calculated with respect to the chosen subdictionary, and then the leaf category is assigned through the minimum reconstruction error. Different from the traditional SRC and its improved approaches, we sparsely represent the test sample on a subdictionary whose base elements are the training samples of the selected similar class, instead of using the generic overcomplete dictionary on the entire training samples.Thus, the complexity to solving the sparse representation problem is reduced. Moreover, DWSRC is adapted to newly added leaf species without rebuilding the dictionary. Experimental results on the ICL plant leaf database show that the method has low computational complexity and high recognition rate and can be clearly interpreted.
UR - http://www.scopus.com/inward/record.url?scp=85039899492&partnerID=8YFLogxK
U2 - 10.1155/2017/9581292
DO - 10.1155/2017/9581292
M3 - 文章
C2 - 29434636
AN - SCOPUS:85039899492
SN - 1687-5265
VL - 2017
JO - Computational Intelligence and Neuroscience
JF - Computational Intelligence and Neuroscience
M1 - 9581292
ER -