Orthogonalization of the Sensing Matrix Through Dominant Columns in Compressive Sensing for Speech Enhancement

被引:0
作者
Shukla, Vasundhara [1 ]
Swami, Preety D. D. [1 ]
机构
[1] Univ Inst Technol RGPV, Dept Elect & Commun Engn, Bhopal 462033, India
来源
APPLIED SCIENCES-BASEL | 2023年 / 13卷 / 15期
关键词
compressive sensing (CS); orthogonal matching pursuit (OMP); sensing matrix optimization; voice activity detection (VAD); speech enhancement; particle swarm optimization (PSO); SIGNAL RECOVERY; UNDERDETERMINED SYSTEMS; UNCERTAINTY PRINCIPLES; LINEAR-EQUATIONS; PERFORMANCE; PURSUIT; NOISE;
D O I
10.3390/app13158954
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
This paper introduces a novel speech enhancement approach called dominant columns group orthogonalization of the sensing matrix (DCGOSM) in compressive sensing (CS). DCGOSM optimizes the sensing matrix using particle swarm optimization (PSO), ensuring separate basis vectors for speech and noise signals. By utilizing an orthogonal matching pursuit (OMP) based CS signal reconstruction with this optimized matrix, noise components are effectively avoided, resulting in lower noise in the reconstructed signal. The reconstruction process is accelerated by iterating only through the known speech-contributing columns. DCGOSM is evaluated against various noise types using speech quality measures such as SNR, SSNR, STOI, and PESQ. Compared to other OMP-based CS algorithms and deep neural network (DNN)-based speech enhancement techniques, DCGOSM demonstrates significant improvements, with maximum enhancements of 42.54%, 62.97%, 27.48%, and 8.72% for SNR, SSNR, PESQ, and STOI, respectively. Additionally, DCGOSM outperforms DNN-based techniques by 20.32% for PESQ and 8.29% for STOI. Furthermore, it reduces recovery time by at least 13.2% compared to other OMP-based CS algorithms.
引用
收藏
页数:23
相关论文
共 67 条
[1]  
Abrol V, 2013, IEEE INT ADV COMPUT, P1159
[2]   Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices [J].
Amini, Arash ;
Marvasti, Farokh .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) :2360-2370
[3]  
[Anonymous], 1965, Journal of the Society for Industrial and Applied Mathematics, Series B: Numerical Analysis, DOI [DOI 10.1137/0702016, 10.1137/0702016]
[4]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[5]   Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise [J].
Ben-Haim, Zvika ;
Eldar, Yonina C. ;
Elad, Michael .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (10) :5030-5043
[6]   Constrained Backtracking Matching Pursuit Algorithm for Image Reconstruction in Compressed Sensing [J].
Bi, Xue ;
Leng, Lu ;
Kim, Cheonshik ;
Liu, Xinwen ;
Du, Yajun ;
Liu, Feng .
APPLIED SCIENCES-BASEL, 2021, 11 (04) :1-14
[7]   WHATS THE DEAL WITH THE DCT [J].
BLINN, JF .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1993, 13 (04) :78-83
[8]   Gradient pursuits [J].
Blumensath, Thomas ;
Davies, Mike E. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (06) :2370-2382
[9]   Compressed sensing in fluorescence microscopy [J].
Calisesi, Gianmaria ;
Ghezzi, Alberto ;
Ancora, Daniele ;
D'Andrea, Cosimo ;
Valentini, Gianluca ;
Farina, Andrea ;
Bassi, Andrea .
PROGRESS IN BIOPHYSICS & MOLECULAR BIOLOGY, 2022, 168 :66-80
[10]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509