Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction

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. piecewisesmooth 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.

• Type: Conference
• Year: 2006
• Where: ICIP
• Authors: Chinh La, Minh N. Do
• Keywords: ICIP 2006, Image Processing, Linear Inverse Problems, Significant Better Reconstruction, Significant Coefficients, Sparse Representation Assumption, Sparse Tree Representation