A Speech Signal Sparse Representation Algorithm Based on Adaptive Overcomplete Dictionary

Wang  Tian-Jing; Zheng  Bao-Yu; Yang Zhen

doi:10.3724/SP.J.1146.2011.00125

Volume 33 Issue 10

Nov. 2011

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2011 > 33(10): 2372-2377

Wang Tian-Jing, Zheng Bao-Yu, Yang Zhen. A Speech Signal Sparse Representation Algorithm Based on Adaptive Overcomplete Dictionary[J]. Journal of Electronics & Information Technology, 2011, 33(10): 2372-2377. doi: 10.3724/SP.J.1146.2011.00125

Citation:

Wang Tian-Jing, Zheng Bao-Yu, Yang Zhen. A Speech Signal Sparse Representation Algorithm Based on Adaptive Overcomplete Dictionary[J]. Journal of Electronics & Information Technology, 2011, 33(10): 2372-2377. doi: 10.3724/SP.J.1146.2011.00125

Citation:

PDF( 347 KB)

A Speech Signal Sparse Representation Algorithm Based on Adaptive Overcomplete Dictionary

doi: 10.3724/SP.J.1146.2011.00125

Received Date: 2011-02-21
Rev Recd Date: 2011-07-22
Publish Date: 2011-10-19

Abstract

Abstract

The sparse representation based on overcomplete dictionary is a new signal representation theory. Recent activities in this field concentrate mainly on the study of dictionary design algorithm and sparse decomposition algorithm. In this paper, a novel speech signal sparse representation algorithm is proposed based on adaptive overcomplete dictionary. Considering stationary signal with autocorrelation function of exponential decay, an adaptive overcomplete dictionary is constructed in terms of the Karhunen-Love (K-L) expansion. Furthermore, an effective algorithm based on the nonlinear approximation is proposed to obtain sparse decomposition of signal with the adaptive dictionary. The experimental results indicate that short-term stationary speech signal sparse representation based on the adaptability and algebraic structure of atom in the overcomplete dictionary has higher sparsity and better reconstructive precision. The sparse representation algorithm can preferably be used in compressed sensing.
- Speech signal processing,
- Compressed Sensing (CS),
- Sparse representation,
- Karhunen-Love (K-L) expansion,
- Overcomplete dictionary

FullText(HTML)

References(1)

References

Mallat S and Zhang Z. Matching pursuit with time-frequency dictionaries[J].IEEE Transactions on Signal Processing.1993, 41(12):3397-3415[4]Cheng P, Zhao J Q, Si X C, et al.. L-R imaging algorithm for passive millimeter wave based on sparse representation[J].Journal of Electronics Information Technology.2010, 32(7):1706-1711[5]Wright J and Yang A Y. Robust face recognition via sparse representation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence.2009, 31(2):210-227[6]傅霆, 尧德中. 稀疏分解的加权迭代方法及其初步应用[J].电子学报.2004, 32(4):567-570[11]Daubechies I. Time-frequency localization operators: a geometric phase space approach[J].IEEE Transactions on Information Theory.1988, 34(4):605-612[12]Donoho D L. Compressed sensing[J].IEEE Transactions on Information Theory.2006, 52(4):1289-1306[17]Rubinstein R and Elad M. Double sparsity: learning sparse dictionaries for sparse signal approximation[J].IEEE Transactions on Signal Processing.2010, 58(3):1553-1564[18]Aharon M, Elad M, and Bruckstein A M. The K-SVD: an algorithm for designing of overcomplete dictionaries for sparse representation[J].IEEE Transactions on Signal Processing.2006, 54(11):4311-4322[19]郭海燕, 杨震. 基于近似KLT域的语音信号压缩感知[J].电子与信息学报.2009, 31(12):2948-2952浏览[20]Guo H Y and Yang Z. Compressed speech signal sensing based on approximate KLT[J].Journal of Electronics Information Technology.2009, 31(12):2948-2952[23]Cohen A and Dales J. Nonlinear approximation of random functions[J].SIAM Journal on Applied Mathematics.1997, 57(2):518-540

Relative Articles

Supplements(0)

Cited By

Proportional views