A Sparse Classification Based on a Linear Regression Method for Spectral Recognition

• Published in: Applied sciences Vol. 9; no. 10; p. 2053
• Main Authors: Ye, Pengchao, Ji, Guoli, Yuan, Lei-Ming, Li, Limin, Chen, Xiaojing, Karimidehcheshmeh, Fatemeh, Chen, Xi, Huang, Guangzao
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.05.2019
• Subjects: Algorithms; Classification; Discriminant analysis; Linear programming; linear regression; Methods; Noise; Optimization; Principal components analysis; Regression analysis; regression residuals; sparse classification; spectral analysis
• ISSN: 2076-3417; 2076-3417
• DOI: 10.3390/app9102053

This study introduces a spectral-recognition method based on sparse representation. The proposed method, the linear regression sparse classification (LRSC) algorithm, uses different classes of training samples to linearly represent the prediction samples and to further classify them according to residuals in a linear regression model. Two kinds of spectral data with completely different physical properties were used in this study. These included infrared spectral data and laser-induced breakdown spectral (LIBS) data for Tegillarca granosa samples polluted by heavy metals. LRSC algorithm was employed to recognize the two classes of data, and the results were compared with common spectral-recognition algorithms, such as partial least squares discriminant analysis (PLS-DA), soft independent modeling of class analogy (SIMCA), artificial neural network (ANN), random forest (RF), and support vector machine (SVM), in terms of recognition rate and parameter stability. The results show that LRSC algorithm is not only simple and convenient, but it also has a high recognition rate.