Recovery of short, complex linear combinations via l1 minimization

IEEE Transactions on Information Theory

Volumn 51, Issue 4, 2005, Pages 1568-1570

  Tropp, Joel A ^a,b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Algorithms; Approximation; Basis pursuit; Linear program; Redundant dictionaries; Sparse representations

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; MATRIX ALGEBRA; THEOREM PROVING; VECTORS;

FUCHS THEORY; REDUNDANT DICTIONARIES; SPARSE REPRESENTATIONS;

OPTIMIZATION;

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

References (8)

1. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
2. 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, 1999.
3. 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.
4. 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.
5. 1 minimization," Proc. Natl. Acad. Sci., vol. 100, pp. 2197-2202, Mar. 2003.
6. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49. no. 12, pp. 3320-3325. Dec. 2003.
7. J.-J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inf. Th., vol. 50, no. 6, pp. 1341-1344, Jun. 2004.
8. R. Gribonval and M Nielsen, "On the Exponential Convergence of Matching Pursuits in Quasi-Incoherent Dictionaries," Université de Rennes I, Rennes, France, IRISA Rep. 1619, 2004.