Compressed Sensing based Speech Compression using Dictionary Learning and IRLS algorithm

被引:0
作者
Derouaz, Wafa [1 ]
Meksen, Thouraya Merazi [1 ]
机构
[1] USTHB, Dept Comp Sci & Elect, Algiers, Algeria
来源
PROCEEDINGS 2018 3RD INTERNATIONAL CONFERENCE ON ELECTRICAL SCIENCES AND TECHNOLOGIES IN MAGHREB (CISTEM) | 2018年
关键词
Dictionary learning; Speech compression; Compressed sensing; Sparse representation; K-SVD;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Compressed sensing (CS) has gained much interests in the speech processing community and especially in compression. The success of this appealing paradigm relies, heavily, on the sparsity of speech signals in a given dictionary. Thanks to machine learning, it is possible to go beyond the limits of analytical dictionaries by designing learned dictionaries, which are more able to fit the nature of data. In this paper, we propose speech compression scheme based on CS using K-singular value decomposition (K-SVD) algorithm to learn a dictionary for sparse representation and iteratively reweighted least square (IRLS) algorithm for signal reconstruction from randomly generated measurements. Different sizes of dictionaries are trained and compared with discrete cosine transform (DCT). Signal quality results, measured with perceptual evaluation speech quality (PESQ) revealed that learned dictionary using K-SVD improves the performance of speech compressed sensing comparing to DCT.
引用
收藏
页码:614 / 618
页数:5
相关论文
共 18 条
[1]   Voiced/nonvoiced detection in compressively sensed speech signals [J].
Abrol, Vinayak ;
Sharma, Pulkit ;
Sao, Anil Kumar .
SPEECH COMMUNICATION, 2015, 72 :194-207
[2]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[3]   Combined speech compression and encryption using chaotic compressive sensing with large key size [J].
Al-Azawi, Maher K. Mahmood ;
Gaze, Ali M. .
IET SIGNAL PROCESSING, 2018, 12 (02) :214-218
[4]  
[Anonymous], 2005, l1-magic: Recovery of sparse signals via convex programming
[5]  
[Anonymous], 2009, KYBERNETES, V38
[6]   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
[7]  
Chang-qing Z., 2016, 2016 6 INT C EL INF
[8]   Exact reconstruction of sparse signals via nonconvex minimization [J].
Chartrand, Rick .
IEEE SIGNAL PROCESSING LETTERS, 2007, 14 (10) :707-710
[9]  
Derouaz W, 2017, 2017 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING - BOUMERDES (ICEE-B)
[10]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306