Abstract

Recent studies in linear inverse problems have recognized the sparse representation of unknown signal in a certain basis as an useful and effective prior information to solve those problems. In many multiscale bases (e.g. wavelets), signals of interest (e.g. piecewise-smooth signals) not only have few significant coefficients, but also those significant coefficients are well-organized in trees. We propose to exploit this sparse tree representation as additional prior information for linear inverse problems with limited numbers of measurements. In particular, our proposed algorithm named Tree-based Orthogonal Matching Pursuit (TOMP) is shown to provide significant better reconstruction compared to methods that only use sparse representation assumption.

Original languageEnglish (US)
Title of host publication2006 IEEE International Conference on Image Processing, ICIP 2006 - Proceedings
Pages1277-1280
Number of pages4
DOIs
StatePublished - 2006
Event2006 IEEE International Conference on Image Processing, ICIP 2006 - Atlanta, GA, United States
Duration: Oct 8 2006Oct 11 2006

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Other

Other2006 IEEE International Conference on Image Processing, ICIP 2006
Country/TerritoryUnited States
CityAtlanta, GA
Period10/8/0610/11/06

Keywords

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

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Fingerprint

Dive into the research topics of 'Tree-based orthogonal matching pursuit algorithm for signal reconstruction'. Together they form a unique fingerprint.

Cite this