An Improved Dictionary-Based Method for Gas Identification with Electronic Nose

被引:1
作者
Han, Jingang [1 ]
Jin, Heqing [1 ]
Gao, Chenyang [1 ]
Sun, Shibin [1 ]
机构
[1] Shanghai Maritime Univ, Sch Logist Engn, Shanghai 201306, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2022年 / 12卷 / 13期
关键词
sparse representation; dictionary learning; pattern recognition; electronic nose; OVERCOMPLETE DICTIONARIES; PATTERN-RECOGNITION; K-SVD; CLASSIFICATION; ALGORITHM;
D O I
10.3390/app12136650
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The dictionary learning algorithm has been successfully applied to electronic noses because of its high recognition rate. However, most dictionary learning algorithms use l0-norm or l1-norm to regularize the sparse coefficients, which means that the electronic nose takes a long time to test samples and results in the inefficiency of the system. Aiming at accelerating the recognition speed of the electronic nose system, an efficient dictionary learning algorithm is proposed in this paper where the algorithm performs a multi-column atomic update. Meanwhile, to solve the problem that the singular value decomposition of the k-means (K-SVD) dictionary has little discriminative power, a novel classification model is proposed, a coefficient matrix is achieved by a linear projection to the training sample, and a constraint is imposed where the coefficients in the same category should keep a large coefficient and be closer to their class centers while coefficients in the different categories should keep sparsity. The algorithm was evaluated and analyzed based on the comparisons of several traditional classification algorithms. When the dimension of the sample was larger than 10, the average recognition rate of the algorithm was maintained above 92%, and the average training time was controlled within 4 s. The experimental results show that the improved algorithm is an effective method for the development of an electronic nose.
引用
收藏
页数:20
相关论文
共 50 条
  • [1] K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    Aharon, Michal
    Elad, Michael
    Bruckstein, Alfred
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) : 4311 - 4322
  • [2] Compressive sensing
    Baraniuk, Richard G.
    [J]. IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (04) : 118 - +
  • [3] Guest editors' introduction to the special section on syntactic and structural pattern recognition
    Basu, M
    Bunke, H
    Del Bimbo, A
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (07) : 1009 - 1012
  • [4] Generalized Approximate Message Passing for Massive MIMO mmWave Channel Estimation With Laplacian Prior
    Bellili, Faouzi
    Sohrabi, Foad
    Yu, Wei
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (05) : 3205 - 3219
  • [5] Bezdek J.C., 1981, PATTERN RECOGN, P43, DOI 10.1007/978-1-4757-0450-1
  • [6] In defense of Nearest-Neighbor based image classification
    Boiman, Oren
    Shechtman, Eli
    Irani, Michal
    [J]. 2008 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-12, 2008, : 1992 - +
  • [7] From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
    Bruckstein, Alfred M.
    Donoho, David L.
    Elad, Michael
    [J]. SIAM REVIEW, 2009, 51 (01) : 34 - 81
  • [8] Highly sensitive acetone sensor based on WO3 nanosheets derived from WS2 nanoparticles with inorganic fullerene-like structures
    Chang, Xueting
    Xu, Shuai
    Liu, Song
    Wang, Nannan
    Sun, Shibin
    Zhu, Xiaojie
    Li, Junfeng
    Ola, Oluwafunmilola
    Zhu, Yanqiu
    [J]. SENSORS AND ACTUATORS B-CHEMICAL, 2021, 343
  • [9] Support vector machines for histogram-based image classification
    Chapelle, O
    Haffner, P
    Vapnik, VN
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 1999, 10 (05): : 1055 - 1064
  • [10] Di Natale C., 2001, ELECT NOSES OLFACTIO