On the systematic measurement matrix for compressed sensing in the presence of gross errors

Data Compression Conference Proceedings

Volumn , Issue , 2010, Pages 356-365

  Li, Zhi ^a   Wu, Feng ^b   Wright, John ^b  

^a STANFORD UNIVERSITY   (United States)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSED SENSING; GAUSSIANS; GROSS ERRORS; IDENTITY MATRICES; LINEAR ERROR-CORRECTING CODES; LOSSY-TO-LOSSLESS; MATRIX; MEASUREMENT MATRIX; NEW FORMS; RECONSTRUCTION DISTORTION; RECONSTRUCTION PROPERTY; RECOVERY PROPERTIES; SOURCE-CODING; STRONG STABILITY; SUBMATRIX;

ERRORS; INFORMATION THEORY; MATRIX ALGEBRA; SIGNAL RECONSTRUCTION; SYSTEMATIC ERRORS;

DATA COMPRESSION;

EID: 77952678682     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2010.38     Document Type: Conference Paper

References (16)

1. E. Candés and T. Tao, "Near-optimal signal recovery from random projections: universal encoding strategies," IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 5406-5425, February 2006.
2. D. Donoho, "Compressed sensing," IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1289-1306, April 2006.
3. M. Lustig, D. Donoho, and J. Pauly, "Sparse MRI: The application of compressed sensing for rapid mr imaging," Magnetic Resonance in Medicine, vol. 58, no. 6, pp. 1182-1195, December 2007.
4. M. Mishali and Y. C. Eldar, "From theory to practice: Sub-Nyquist sampling of sparse wideband analog signals," arXiv 0902.4291, Feb. 2009.
5. M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun, K. Kelly, and R. Baraniuk, "Singlepixel imaging via compressive sampling," IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 83-91, March 2008.
6. E. Candés and T. Tao, "Decoding by linear programming," IEEE Trans. on Information Theory, vol. 51, no. 12, pp. 4203-4215, December 2005.
7. T. Ancheta, "Syndrome source coding and its universal generalization," IEEE Trans. Information Theory, vol. 22, no. 4, pp. 432-436, July 1976.
8. G. Caire, S. Shamai, and S. Verdú, "Almost-noiseless joint sourcechannel coding-decoding of sources with memory," in Proc. 5th Int. ITG Conf. on Source and Channel Coding, January 2004.
9. S. S. Chen, D. L. Donoho, Michael, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Journal on Scientific Computing, vol. 20, pp. 33-61, 1998.
10. D. Donoho, "Neighborly polytopes and sparse solutions of undetermined linear equations," Preprint, 2005.
11. R. Tibshirani, "Regression shrinkage and selection via the lasso," Journal of the Royal Statistical Society, Series B, vol. 58, pp. 267-288, 1994.
12. 1 minimization," Preprint, 2008.
13. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 31, no. 2, 2009, preprint: http://perception.csl.uiuc.edu/ jnwright/Wright09-PAMI.pdf.
14. E. Candés, "The restricted isometry property and its implications for compressed sensing," Compte Rendus de l'Academie des Sciences, Paris, Serie I, vol. 346, pp. 589-592, 2008.
15. Z. Li, F. Wu, and J. Wright, "On the systematic measurement matrix for compressed sensing in the presence of gross errors: Proof of Corollary 6," Available online: http://www.stanford.edu/~leeoz/sysmtxproof.pdf.
16. S. J. Szarek, "Condition numbers of random matrices," J. Complexity, vol. 7, no. 1991, pp. 131-149.