.png){kind=icon}
Return
Retrieving Sparse Patterns Using a Compressed Sensing Framework: Applications to Speech Coding Based on Sparse Linear Prediction
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2009.2034560.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Encouraged by the promising application of compressed sensing in signal compression, we investigate its formulation and application in the context of speech coding based on sparse linear prediction. In particular, a compressed sensing method can be devised to compute a sparse approximation of speech in the residual domain when sparse linear prediction is involved. We compare the method of computing a sparse prediction residual with the optimal technique based on an exhaustive search of the possible nonzero locations and the well known Multi-Pulse Excitation, the first encoding technique to introduce the sparsity concept in speech coding. Experimental results demonstrate the potential of compressed sensing in speech coding techniques, offering high perceptual quality with a very sparse approximated prediction residual.
Keywords:
Compressive sampling
compressed sensing
sparse approximation
speech analysis
speech coding
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
Generation of Native, Untagged Huntingtin Exon1 Monomer and Fibrils Using a SUMO Fusion Strategy
OAAI
.png){kind=icon}
OAAIShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more