A fast tree-based algorithm for Compressed Sensing with sparse-tree prior

H. Q. Bui, C. N.H. La, Minh N Do

Research output: Contribution to journalArticle

Abstract

In Compressed Sensing, the sparse representation property of an unknown signal in a certain basis has been used as the only prior knowledge for signal reconstruction from a limited number of measurements. Recently, more and more research has focused on model-based recovery algorithms, in which special structures of the unknown signal are exploited in addition to the sparse prior. A popular structure is the sparse-tree structure exhibited in the wavelet transform of piecewise smooth signals and in many practical models. In this paper, a reconstruction algorithm that exploits this sparse-tree prior, the Tree-based Orthogonal Matching Pursuit (TOMP) algorithm, is proposed and studied in detail. Theoretical analyses and empirical experiments show that the proposed algorithm gives reconstruction quality comparable with more sophisticated algorithms, while being much simpler.

Original languageEnglish (US)
Pages (from-to)628-641
Number of pages14
JournalSignal Processing
Volume108
DOIs
StatePublished - Mar 2015

Fingerprint

Compressed sensing
Signal reconstruction
Wavelet transforms
Recovery
Experiments

Keywords

  • Compressed Sensing
  • Greedy
  • Orthogonal Matching Pursuit
  • Sparse-tree prior
  • Tree structure
  • Tree-based algorithm

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition

Cite this

A fast tree-based algorithm for Compressed Sensing with sparse-tree prior. / Bui, H. Q.; La, C. N.H.; Do, Minh N.

In: Signal Processing, Vol. 108, 03.2015, p. 628-641.

Research output: Contribution to journalArticle

@article{f8cd913a55364e97b8b3bc539591356d,
title = "A fast tree-based algorithm for Compressed Sensing with sparse-tree prior",
abstract = "In Compressed Sensing, the sparse representation property of an unknown signal in a certain basis has been used as the only prior knowledge for signal reconstruction from a limited number of measurements. Recently, more and more research has focused on model-based recovery algorithms, in which special structures of the unknown signal are exploited in addition to the sparse prior. A popular structure is the sparse-tree structure exhibited in the wavelet transform of piecewise smooth signals and in many practical models. In this paper, a reconstruction algorithm that exploits this sparse-tree prior, the Tree-based Orthogonal Matching Pursuit (TOMP) algorithm, is proposed and studied in detail. Theoretical analyses and empirical experiments show that the proposed algorithm gives reconstruction quality comparable with more sophisticated algorithms, while being much simpler.",
keywords = "Compressed Sensing, Greedy, Orthogonal Matching Pursuit, Sparse-tree prior, Tree structure, Tree-based algorithm",
author = "Bui, {H. Q.} and La, {C. N.H.} and Do, {Minh N}",
year = "2015",
month = "3",
doi = "10.1016/j.sigpro.2014.10.026",
language = "English (US)",
volume = "108",
pages = "628--641",
journal = "Signal Processing",
issn = "0165-1684",
publisher = "Elsevier",

}

TY - JOUR

T1 - A fast tree-based algorithm for Compressed Sensing with sparse-tree prior

AU - Bui, H. Q.

AU - La, C. N.H.

AU - Do, Minh N

PY - 2015/3

Y1 - 2015/3

N2 - In Compressed Sensing, the sparse representation property of an unknown signal in a certain basis has been used as the only prior knowledge for signal reconstruction from a limited number of measurements. Recently, more and more research has focused on model-based recovery algorithms, in which special structures of the unknown signal are exploited in addition to the sparse prior. A popular structure is the sparse-tree structure exhibited in the wavelet transform of piecewise smooth signals and in many practical models. In this paper, a reconstruction algorithm that exploits this sparse-tree prior, the Tree-based Orthogonal Matching Pursuit (TOMP) algorithm, is proposed and studied in detail. Theoretical analyses and empirical experiments show that the proposed algorithm gives reconstruction quality comparable with more sophisticated algorithms, while being much simpler.

AB - In Compressed Sensing, the sparse representation property of an unknown signal in a certain basis has been used as the only prior knowledge for signal reconstruction from a limited number of measurements. Recently, more and more research has focused on model-based recovery algorithms, in which special structures of the unknown signal are exploited in addition to the sparse prior. A popular structure is the sparse-tree structure exhibited in the wavelet transform of piecewise smooth signals and in many practical models. In this paper, a reconstruction algorithm that exploits this sparse-tree prior, the Tree-based Orthogonal Matching Pursuit (TOMP) algorithm, is proposed and studied in detail. Theoretical analyses and empirical experiments show that the proposed algorithm gives reconstruction quality comparable with more sophisticated algorithms, while being much simpler.

KW - Compressed Sensing

KW - Greedy

KW - Orthogonal Matching Pursuit

KW - Sparse-tree prior

KW - Tree structure

KW - Tree-based algorithm

UR - http://www.scopus.com/inward/record.url?scp=84911461860&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84911461860&partnerID=8YFLogxK

U2 - 10.1016/j.sigpro.2014.10.026

DO - 10.1016/j.sigpro.2014.10.026

M3 - Article

AN - SCOPUS:84911461860

VL - 108

SP - 628

EP - 641

JO - Signal Processing

JF - Signal Processing

SN - 0165-1684

ER -