Combining sparse representation and singular value decomposition for plant recognition

被引:24
|
作者
Zhang, Shanwen [1 ]
Zhang, Chuanlei [2 ]
Wang, Zhen [1 ]
Kong, Weiwei [1 ]
机构
[1] XiJing Univ, Dept Informat Engn, Xian 710123, Shaanxi, Peoples R China
[2] Tianjin Univ Sci & Technol, Sch Comp Sci & Informat Engn, 1038 Da Gu Nan Lu, Tianjin 300222, Peoples R China
关键词
Plant leaf image; Plant species recognition; Sparse representation (SR); Singular value decomposition (SVD); SHAPE; TEXTURE; FEATURES; COLOR;
D O I
10.1016/j.asoc.2018.02.052
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Plant recognition is one of important research areas of pattern recognition. As plant leaves are extremely irregular, complex and diverse, many existing plant classification and recognition methods cannot meet the requirements of the automatic plant recognition system. A plant recognition approach is proposed by combining singular value decomposition (SVD) and sparse representation (SR) in this paper. The difference from the traditional plant classification methods is that, instead of establishing a classification model by extracting the classification features, the proposed method directly reduces the image dimensionality and recognizes the test samples based on the sparse coefficients, and uses the class-specific dictionary learning for sparse modeling to reduce the recognition time. The proposed method is verified on two plant leaf datasets and is compared with other four existing plant recognition methods The overall recognition accuracy of the proposed approach for the 6 kinds of plant leaves is over 96%, which is the best classification rate. The experimental results show the feasibility and effectiveness of the proposed method. (C) 2018 Published by Elsevier B.V.
引用
收藏
页码:164 / 171
页数:8
相关论文
共 50 条
  • [31] Sparse principal component regression via singular value decomposition approach
    Shuichi Kawano
    Advances in Data Analysis and Classification, 2021, 15 : 795 - 823
  • [32] Robust biclustering by sparse singular value decomposition incorporating stability selection
    Sill, Martin
    Kaiser, Sebastian
    Benner, Axel
    Kopp-Schneider, Annette
    BIOINFORMATICS, 2011, 27 (15) : 2089 - 2097
  • [33] Singular value decomposition versus sparse grids: refined complexity estimates
    Griebel, Michael
    Harbrecht, Helmut
    IMA JOURNAL OF NUMERICAL ANALYSIS, 2019, 39 (04) : 1652 - 1671
  • [34] A Sparse Singular Value Decomposition Method for High-Dimensional Data
    Yang, Dan
    Ma, Zongming
    Buja, Andreas
    JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2014, 23 (04) : 923 - 942
  • [35] ASSVD: Adaptive Sparse Singular Value Decomposition for High Dimensional Matrices
    Ding, Xiucai
    Chen, Xianyi
    Zou, Mengling
    Zhang, Guangxing
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2020, 14 (06): : 2634 - 2648
  • [36] Sparse principal component regression via singular value decomposition approach
    Kawano, Shuichi
    ADVANCES IN DATA ANALYSIS AND CLASSIFICATION, 2021, 15 (03) : 795 - 823
  • [37] A noisy speech recognition method based on singular value decomposition
    Xu, J.
    Wei, G.
    Leung, S.
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2001, 29 (01): : 91 - 93
  • [38] Adaptive singular value decomposition for lighting compensation in face recognition
    Wang, Jing-Wein
    IEICE ELECTRONICS EXPRESS, 2009, 6 (23): : 1638 - 1642
  • [39] Combining extremal optimization with singular value decomposition for effective point matching
    Meshoul, S
    Batouche, M
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2003, 17 (07) : 1111 - 1126
  • [40] Candid incremental singular value decomposition and classifier for face recognition
    Hu, Rong
    Xu, Weihong
    Kuang, Fangjun
    Sun, Mingming
    Xia, Ye
    Journal of Computational Information Systems, 2012, 8 (08): : 3207 - 3214