- Citation
- Abstract
- Reference
- Full PDF
ABSTRACT: This document presents two distinct approaches to compressive sensing for the acquisition and reconstruction of non-sparse signals. The first approach directly compresses the original signal using a measurement matrix, while the second approach first transforms the signal into a sparse representation before compression. The reconstruction phases employ the Orthogonal Matching Pursuit (OMP) algorithm to solve the minimization problem. The quality of reconstruction is evaluated using the Mean Squared Error (MSE), with both visual and numerical comparisons for different measurement sizes......
Key Word: Compressive sensing, sparse signal, Orthogonal Matching Pursuit, Mean Squared Error
[1] David L. Donoho, « Compressed Sensing », IEEE Transactions On Information Theory, Vol. 52, No. 4, Pp. 1289–1306, 2006
[2] E. J. Candès, J. Romberg, And T. Tao, « Stable Signal Recovery From Incomplete And Inaccurate Measurements », Communications On Pure And Applied Mathematics, Vol. 59, No. 8, Pp. 1207–1223, 2006
[3] Vishal M. Patel And Rama Chellappa, « Sparse Representations, Compressive Sensing And Dictionaries For Pattern Recognition », In 1st Asian Conference On Pattern Recognition (ACPR 2011), 2011
[4] C. A. Wong, « Can An Underdetermined System Have A Unique Solution? », Mathematics Stack Exchange, 2012
[5] J. Laska And R. G. Baraniuk, « Regime Change: Bit-Rate Reduction And Mismatch In Compressed Sensing », IEEE Signal Processing Letters, Vol. 14, No. 8, Pp. 521–524, 2007.