Matching Pursuit and Sparse Coding for Auditory Representation

被引:6
|
作者
Tran, Dung Kim [1 ]
Unoki, Masashi [1 ]
机构
[1] Japan Adv Inst Sci & Technol, Grad Sch Adv Sci & Technol, Nomi, Ishikawa 9231292, Japan
关键词
Kernel; Time-frequency analysis; Spectrogram; Matching pursuit algorithms; Bandwidth; Dictionaries; Psychoacoustics; Auditory filterbank; equivalent rectangular bandwidth; gammatone; gammachirp; masking effect; matching pursuit; perceptual features; sparse coding; spectrogram; spikegram; RECOGNITION; FILTER; DOMAIN;
D O I
10.1109/ACCESS.2021.3135011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Previous studies have revealed that by mimicking the neural activity patterns of the auditory periphery to obtain perceptual features of speech signals, the resultant auditory representation is beneficial to speech-coding and pattern-analysis applications in comparison with spectrogram and spikegram representations. However, current solutions use outdated techniques such as the Bark scale and gammatone basis to decompose speech signals. We propose a method of using more physiological accurate techniques such as the equivalent rectangular bandwidth scale, gammachirp basis, and auditory masking effects of gammachirp kernels. Our experimental results indicate that the auditory representation created with our proposed method requires the lowest bitrate (1066 coefficients per second on average) to achieve similar perceptual evaluation scores (0.89 PEMO-Q and 3.27 PESQ scores) compared with spectrogram and spikegram representations. The proposed method also provides the highest matching accuracy with a pattern-matching algorithm.
引用
收藏
页码:167084 / 167095
页数:12
相关论文
共 50 条
  • [1] MATCHING PURSUIT BASED CONVOLUTIONAL SPARSE CODING
    Plaut, Elad
    Giryes, Raja
    2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2018, : 6847 - 6851
  • [2] Multipath Sparse Coding Using Hierarchical Matching Pursuit
    Bo, Liefeng
    Ren, Xiaofeng
    Fox, Dieter
    2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2013, : 660 - 667
  • [3] Cauchy Matching Pursuit for Robust Sparse Representation and Classification
    Wang, Yulong
    Zou, Cuiming
    Tang, Yuan Yan
    Li, Luoqing
    2018 24TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2018, : 694 - 698
  • [4] Sparse Representation Classification via Fast Matching Pursuit for Face Recognition
    Abdel-Sayed, Michael M.
    Khattab, Ahmed
    Abu-Elyazeed, Mohamed F.
    2017 PROCEEDINGS OF THE JAPAN-AFRICA CONFERENCE ON ELECTRONICS, COMMUNICATIONS, AND COMPUTERS (JAC-ECC), 2017, : 103 - 106
  • [5] A perturbation analysis based on group sparse representation with orthogonal matching pursuit
    Liu, Chunyan
    Zhang, Feng
    Qiu, Wei
    Li, Chuan
    Leng, Zhenbei
    JOURNAL OF INVERSE AND ILL-POSED PROBLEMS, 2021, 29 (05): : 653 - 674
  • [6] Fast matching pursuit for sparse representation-based face recognition
    Melek, Michael
    Khattab, Ahmed
    Abu-Elyazeed, Mohamed F.
    IET IMAGE PROCESSING, 2018, 12 (10) : 1807 - 1814
  • [7] A sparse representation image denoising method based on Orthogonal Matching Pursuit
    Yu, Xiaojun
    Hu, Defa
    Telkomnika (Telecommunication Computing Electronics and Control), 2015, 13 (04) : 1330 - 1336
  • [8] Sequential Sparse Matching Pursuit
    Berinde, Radu
    Indyk, Piotr
    2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 36 - +
  • [9] Clustering Hyperspectral Imagery via Sparse Representation Features of the Generalized Orthogonal Matching Pursuit
    Guo, Wenqi
    Xu, Xu
    Xu, Xiaoqiang
    Gao, Shichen
    Wu, Zibu
    REMOTE SENSING, 2024, 16 (17)
  • [10] Sparse representation-based classification: Orthogonal least squares or orthogonal matching pursuit?
    Cui, Minshan
    Prasad, Saurabh
    PATTERN RECOGNITION LETTERS, 2016, 84 : 120 - 126