Optimized projections for compressed sensing

IEEE Transactions on Signal Processing

Volumn 55, Issue 12, 2007, Pages 5695-5702

  Elad, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Basis pursuit (BP); Compressed sensing (CS); Mutual coherence; OFDM modulation; Optimization; Optimized projections; Orthogonal matching pursuit (OMP); Sparse and redundant representations

Indexed keywords

DATA COMPRESSION; OPTIMIZATION; SIGNAL RECONSTRUCTION;

BASIS PURSUIT; COMPRESSED SENSING; MUTUAL COHERENCE; ORTHOGONAL MATCHING PURSUIT; SPARSE REPRESENTATION;

ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING;

EID: 36749022762     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2007.900760     Document Type: Article

References (16)

1. 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.
2. E. J. Candès and J. Romberg, "Quantitative robust uncertainty principles and optimally sparse decompositions," in Found. Comput. Math., 2005, pp. 227-254.
3. E. J. Candès and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies," IEEE Trans. Inf. Theory vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
4. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
5. Y. Tsaig and D. L. Donoho, "Extensions of compressed sensing," Signal Process., vol. 86, pp. 549-571, Mar. 2006.
6. J. A. Tropp and A. C. Gilbert, "Signal recovery from partial information via orthogonal matching pursuit," IEEE Trans. Inf. Theory, 2006, submitted for publication.
7. J. A. Tropp, M. B. Wakin, M. F. Duarte, D. Baron, and R. G. Baraniuk, "Random filters for compressive sampling and reconstruction," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP), Toulouse, France, May 2006.
8. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, pp. 227-234, 1995.
9. G. Davis, S. Mallat, and M. Avellaneda, "Greedy adaptive approximation," J. Constr. Approx., vol. 13, pp. 57-98, 1997.
10. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev., vol. 43, no. 1, pp. 129-59, 2001.
11. S. Mallat and Z. Zhang, "Matching pursuit in a time-frequency dictionary," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
12. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Annu. Asilomar Conf. Signals, Syst. Comput., 1993.
13. 1 minimization," Proc. Nat. Acad. Sci., vol. 100, pp. 2197-2202, 2002.
14. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2004.
15. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
16. I. S. Dhillon, R. W. Heath, Jr, and T. Strohmer, "Designing structured tight frames via alternating projection," IEEE Trans. Inf. Theory vol. 51, no. 1, pp. 188-209, Jan. 2005.