Department of Information Engineering, Xijing University, Xi'an 710123, China.
Tableau Software, Seattle, WA 98103, USA.
Comput Intell Neurosci. 2017;2017:9581292. doi: 10.1155/2017/9581292. Epub 2017 Dec 25.
In sparse representation based classification (SRC) and weighted SRC (WSRC), it is time-consuming to solve the global sparse representation problem. A discriminant WSRC (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.
在基于稀疏表示的分类 (SRC) 和加权 SRC (WSRC) 中,求解全局稀疏表示问题非常耗时。针对大规模植物种类识别问题,提出了一种判别加权 SRC (DWSRC),它包括两个阶段。首先,通过将数据集划分为若干相似的类别来构建若干子字典,并通过测试样本与每个相似类别的典型样本之间的最大相似度来选择一个子字典。其次,通过选择的子字典计算测试图像的加权稀疏表示,然后通过最小重构误差来分配叶类别。与传统的 SRC 及其改进方法不同,我们在子字典上对测试样本进行稀疏表示,子字典的基元是所选相似类别的训练样本,而不是使用整个训练样本的通用过完备字典。因此,求解稀疏表示问题的复杂度降低了。此外,DWSRC 适用于新添加的叶类,无需重新构建字典。在 ICL 植物叶片数据库上的实验结果表明,该方法具有较低的计算复杂度和较高的识别率,并且可以进行清晰的解释。