scholarly journals A Novel Sparse Representation Classification Method for Gas Identification Using Self-Adapted Temperature Modulated Gas Sensors

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2173 ◽  
Author(s):  
Aixiang He ◽  
Guangfen Wei ◽  
Jun Yu ◽  
Meihua Li ◽  
Zhongzhou Li ◽  
...  
Keyword(s):  
Sparse Representation ◽  
Gas Sensors ◽  
Operating Temperature ◽  
Reconstruction Error ◽  
Classification Method ◽  
Training Samples ◽  
Gas Identification ◽  
Coefficient Vector ◽  
Sparse Representation Classification ◽  
Electronic Nose System

A novel sparse representation classification method (SRC), namly SRC based on Method of Optimal Directions (SRC_MOD), is proposed for electronic nose system in this paper. By finding both a synthesis dictionary and a corresponding coefficient vector, the i-th class training samples are approximated as a linear combination of a few of the dictionary atoms. The optimal solutions of the synthesis dictionary and coefficient vector are found by MOD. Finally, testing samples are identified by evaluating which class causes the least reconstruction error. The proposed algorithm is evaluated on the analysis of hydrogen, methane, carbon monoxide, and benzene at self-adapted modulated operating temperature. Experimental results show that the proposed method is quite efficient and computationally inexpensive to obtain excellent identification for the target gases.

scholarly journals Sparse Representation Based SAR Vehicle Recognition along with Aspect Angle

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Xiangwei Xing ◽  
Kefeng Ji ◽  
Huanxin Zou ◽  
Jixiang Sun
Keyword(s):  
Sparse Representation ◽  
Test Sample ◽  
Automatic Target Recognition ◽  
Reconstruction Error ◽  
Stationary Target ◽  
Vehicle Recognition ◽  
Aspect Angle ◽  
Training Samples ◽  
Coefficient Vector ◽  
Sparse Representation Classification

As a method of representing the test sample with few training samples from an overcomplete dictionary, sparse representation classification (SRC) has attracted much attention in synthetic aperture radar (SAR) automatic target recognition (ATR) recently. In this paper, we develop a novel SAR vehicle recognition method based on sparse representation classification along with aspect information (SRCA), in which the correlation between the vehicle’s aspect angle and the sparse representation vector is exploited. The detailed procedure presented in this paper can be summarized as follows. Initially, the sparse representation vector of a test sample is solved by sparse representation algorithm with a principle component analysis (PCA) feature-based dictionary. Then, the coefficient vector is projected onto a sparser one within a certain range of the vehicle’s aspect angle. Finally, the vehicle is classified into a certain category that minimizes the reconstruction error with the novel sparse representation vector. Extensive experiments are conducted on the moving and stationary target acquisition and recognition (MSTAR) dataset and the results demonstrate that the proposed method performs robustly under the variations of depression angle and target configurations, as well as incomplete observation.

Integrating Sparse and Collaborative Representation Classifications for Image Classification

2017 ◽  
Vol 17 (02) ◽  
pp. 1750007 ◽  
Author(s):  
Chunwei Tian ◽  
Guanglu Sun ◽  
Qi Zhang ◽  
Weibing Wang ◽  
Teng Chen ◽  
...  
Keyword(s):  
Sparse Representation ◽  
Image Classification ◽  
Linear Combination ◽  
Image Recognition ◽  
Test Sample ◽  
Collaborative Representation ◽  
Training Samples ◽  
Sparse Representation Classification ◽  
The Difference ◽  
Representation Method

Collaborative representation classification (CRC) is an important sparse method, which is easy to carry out and uses a linear combination of training samples to represent a test sample. CRC method utilizes the offset between representation result of each class and the test sample to implement classification. However, the offset usually cannot well express the difference between every class and the test sample. In this paper, we propose a novel representation method for image recognition to address the above problem. This method not only fuses sparse representation and CRC method to improve the accuracy of image recognition, but also has novel fusion mechanism to classify images. The implementations of the proposed method have the following steps. First of all, it produces collaborative representation of the test sample. That is, a linear combination of all the training samples is first determined to represent the test sample. Then, it gets the sparse representation classification (SRC) of the test sample. Finally, the proposed method respectively uses CRC and SRC representations to obtain two kinds of scores of the test sample and fuses them to recognize the image. The experiments of face recognition show that the combination of CRC and SRC has satisfactory performance for image classification.

Robust patch-based sparse representation for hyperspectral image classification

2017 ◽  
Vol 15 (03) ◽  
pp. 1750028 ◽  
Author(s):  
Haoliang Yuan
Keyword(s):  
Sparse Representation ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Real Life ◽  
Test Sample ◽  
Classification Performance ◽  
Iteration Algorithm ◽  
Frobenius Norm ◽  
Training Samples ◽  
Sparse Representation Classification

Sparse representation classification (SRC) has been successfully applied into hyperspectral image (HSI). A test sample (pixel) can be linearly represented by a few training samples of the training set. The class label of the test sample is then decided by the reconstruction residuals. To incorporate the spatial information to improve the classification performance, a patch matrix, which includes a spatial neighborhood set, is used to replace the original pixel. Generally, the objective function of the reconstruction residuals is represented as Frobenius-norm, which actually treats the elements in the reconstruction residuals in the same way. However, when a patch locates in the image edge, the samples in the patch may belong to different classes. Frobenius-norm is not suitable to compute the reconstruction residuals. In this paper, we propose a robust patch-based sparse representation classification (RPSRC) based on [Formula: see text]-norm. An iteration algorithm is given to compute RPSRC efficiently. Extensive experimental results on two real-life HSI datasets demonstrate the effectiveness of RPSRC.

scholarly journals Optimized Coefficient Vector and Sparse Representation-Based Classification Method for Face Recognition

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 8668-8674 ◽  
Author(s):  
Shigang Liu ◽  
Lingjun Li ◽  
Ming Jin ◽  
Sujuan Hou ◽  
Yali Peng
Keyword(s):  
Face Recognition ◽  
Sparse Representation ◽  
Classification Method ◽  
Coefficient Vector

scholarly journals Discriminant WSRC for Large-Scale Plant Species Recognition

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Shanwen Zhang ◽  
Chuanlei Zhang ◽  
Yihai Zhu ◽  
Zhuhong You
Keyword(s):  
Sparse Representation ◽  
Plant Species ◽  
Large Scale ◽  
Species Recognition ◽  
Recognition Rate ◽  
Test Sample ◽  
Reconstruction Error ◽  
Representation Problem ◽  
Training Samples ◽  
Similar Class

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.

scholarly journals Active Sonar Target Classification Method Based on Fisher’s Dictionary Learning

2021 ◽  
Vol 11 (22) ◽  
pp. 10635
Author(s):  
Tongjing Sun ◽  
Jiwei Jin ◽  
Tong Liu ◽  
Jun Zhang
Keyword(s):  
Sparse Representation ◽  
Dictionary Learning ◽  
Classification Performance ◽  
Classification Method ◽  
Support Vector ◽  
Target Classification ◽  
Active Sonar ◽  
Reconstructed Signal ◽  
Sparse Representation Classification ◽  
Value Decomposition

The marine environment is complex and changeable, and the interference of noise and reverberation seriously affects the classification performance of active sonar equipment. In particular, when the targets to be measured have similar characteristics, underwater classification becomes more complex. Therefore, a strong, recognizable algorithm needs to be developed that can handle similar feature targets in a reverberation environment. This paper combines Fisher’s discriminant criterion and a dictionary-learning-based sparse representation classification algorithm, and proposes an active sonar target classification method based on Fisher discriminant dictionary learning (FDDL). Based on the learning dictionaries, the proposed method introduces the Fisher restriction criterion to limit the sparse coefficients, thereby obtaining a more discriminating dictionary; finally, it distinguishes the category according to the reconstruction errors of the reconstructed signal and the signal to be measured. The classification performance is compared with the existing methods, such as SVM (Support Vector Machine), SRC (Sparse Representation Based Classification), D-KSVD (Discriminative K-Singular Value Decomposition), and LC-KSVD (label-consistent K-SVD), and the experimental results show that FDDL has a better classification performance than the existing classification methods.

Sign in / Sign up

Export Citation Format

Share Document