Uncertainty relations and sparse signal recovery for pairs of general signal sets

IEEE Transactions on Information Theory

Volumn 58, Issue 1, 2012, Pages 263-277

  Kuppinger, Patrick ^a   Durisi, Giuseppe ^b   Bolcskei, Helmut ^a  

^a ETH ZURICH   (Switzerland)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Basis pursuit; frame theory; orthogonal matching pursuit; signal recovery; sparsity; uncertainty relations

Indexed keywords

BASIS PURSUITS; FRAME THEORY; ORTHOGONAL MATCHING PURSUIT; SIGNAL RECOVERY; SPARSITY; UNCERTAINTY RELATION;

RECOVERY; SIGNAL RECONSTRUCTION;

UNCERTAINTY ANALYSIS;

EID: 84855697999     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2167215     Document Type: Article

References (29)

1. D. L. Donoho and P. B. Stark, "Uncertainty principles and signal recovery," SIAM J. Appl. Math, vol. 49, no. 3, pp. 906-931, Jun. 1989.
2. M. Elad and A. M. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2558-2567, Sep. 2002. (Pubitemid 35032680)
3. O. Christensen, An Introduction to Frames and Riesz Bases. Boston, MA: Birkhäuser, 2003.
4. C. Studer, P. Kuppinger, G. Pope, and H. Bölcskei, "Recovery of sparsely corrupted signals," IEEE Trans. Inf. Theory, to be published.
5. M. Fadili, J. Starck, J. Bobin, and Y. Moudden, "Image decomposition and separation using sparse representations: An overview," Proc. IEEE, vol. 98, no. 6, pp. 983-994, Jun. 2010.
6. D. L. Donoho and G. Kutyniok, "Microlocal analysis of the geometric separation problem," Feb. 2010[Online]. Available: http://arxiv.org/abs/ 1004.3006v1
7. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2845-2862, Nov. 2001. (Pubitemid 33053488)
8. D. L. Donoho and M. Elad, "Optimally sparse representation in general (nonorthogonal) dictionaries via minimization," Proc. Natl. Acad. Sci. USA, vol. 100, no. 5, pp. 2197-2202, Mar. 2003. (Pubitemid 36297476)
9. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
10. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
11. E. J. Candès and J. Romberg, "Quantitative robust uncertainty principles and optimally sparse decompositions," Found. Comput. Math., vol. 6, no. 2, pp. 227-254, Apr. 2006. (Pubitemid 43824483)
12. J. A. Tropp, "On the conditioning of random subdictionaries," Appl. Comput. Harmon. Anal., vol. 25, pp. 1-24, Jul. 2008. (Pubitemid 351721018)
13. G. Davis, S. G. Mallat, and M. Avellaneda, "Adaptive greedy algorithms," Constr. Approx., vol. 13, pp. 57-98, 1997.
14. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1998. (Pubitemid 128689501)
15. Y. C. Pati, R. Rezaifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Asilomar Conf. Signals, Systems, and Comput., Pacific Grove, CA, Nov. 1993, pp. 40-44.
16. G. Davis, S. G. Mallat, and Z. Zhang, "Adaptive time-frequency decompositions," Opt. Eng., vol. 33, no. 7, pp. 2183-2191, Jul. 1994.
17. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
18. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
19. R. G. Baraniuk, M. Davenport, R. A. DeVore, and M. B. Wakin, "A simple proof of the restricted isometry property for random matrices," Constr. Approx., vol. 28, pp. 253-263, Jan. 2008.
20. A. Feuer and A. Nemirovski, "On sparse representations in pairs of bases," IEEE Trans. Inf. Theory, vol. 49, no. 6, pp. 1579-1581, Jun. 2003.
21. L. Welch, "Lower bounds on the maximum cross correlation of signals," IEEE Trans. Inf. Theory, vol. IT-20, no. 3, pp. 397-399, May 1974.
22. G. R. Grimmett and D. R. Stirzaker, Probability and Random Processes. Oxford, U.K.: Oxford Univ. Press, 2006.
23. J. A. Tropp, "Norms of random submatrices and sparse approximation," C. R. Acad. Sci. Paris, Ser. I, vol. 346, no. 23-24, pp. 1271-1274, 2008.
24. A. R. Calderbank, P. J. Cameron, W. M. Kantor, and J. J. Seidel, "Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets," Proc. London Math. Soc. (3), vol. 75, no. 2, pp. 436-480, 1997. (Pubitemid 127760569)
25. T. Strohmer and R. W. Heath, Jr, "Grassmannian frames with applications to coding and communication," Appl. Comput. Harmon. Anal., vol. 14, pp. 257-275, 2003.
26. E. J. Candès and Y. Plan, "Near-ideal model selection by minimization," Ann. Statist., vol. 37, pp. 2145-2177, 2007.
27. C. Studer and R. G. Baraniuk, "Stable restoration and separation of approximately sparse signals," Appl. Comput. Harmon. Anal., submitted.
28. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," 2003[Online]. Available: http://www.acm.caltech.edu/jtropp/ reports/Tro03-greed-good-tr.pdf
29. R. A. Horn and C. R. Johnson, Matrix Analysis. New York: Cambridge Univ. Press, 1985.