Tree-based orthogonal matching pursuit algorithm for signal reconstruction

Proceedings - International Conference on Image Processing, ICIP

Volumn , Issue , 2006, Pages 1277-1280

  La, Chinh ^a   Do, Minh N ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Greedy algorithms; Inverse problems; Sparse representations; Tree structures; Tree based orthogonal matching pursuit

Indexed keywords

GREEDY ALGORITHMS; LINEAR INVERSE PROBLEMS; MULTISCALES; ORTHOGONAL MATCHING PURSUIT; PIECE-WISE; PRIOR INFORMATION; SIGNALS OF INTERESTS; SPARSE REPRESENTATION; TREE REPRESENTATION; TREE STRUCTURES; TREE-BASED;

ALGORITHMS; DIFFERENTIAL EQUATIONS; IMAGE MATCHING; IMAGE PROCESSING; IMAGING SYSTEMS; PROBLEM SOLVING; TREES (MATHEMATICS);

INVERSE PROBLEMS;

EID: 77950195109     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2006.312578     Document Type: Conference Paper

References (5)

1. D. L. Donoho, "Compressed sensing," manuscript, Oct. 2004.
2. E. J. Candès and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?," submitted for publication, Nov. 2004.
3. J. A. Tropp and A. C. Gilbert, "Signal recovery from partial information via orthogonal matching pursuit," IEEE Trans. Inform. Th., Apr. 2005, submitted.
4. C. La and M. N. Do, "Signal reconstruction using sparse tree representation," in Proc. of SPIE Conf. on Wavelet Applications in Signal and Image Processing, San Diego, Aug. 2005.
5. M. F. Duarte, M. B. Wakin, and R. G. Baraniuk, "Fast reconstruction of piecewise smooth signals from random projections," in Proc. of Workshop on Signal Processing with Adaptative Sparse Structured Representations, Rennes, France, Nov. 2005.