Fast implementation of orthogonal greedy algorithm for tight wavelet frames

Authors:
Alexander Petukhov
Affiliations:
Department of Mathematics, University of Georgia, Athens, GA
Venue:
Signal Processing - Sparse approximations in signal and image processing
Year:
2006

Citing 2
Cited 2

Sparse Approximate Solutions to Linear Systems

SIAM Journal on Computing
Atomic Decomposition by Basis Pursuit

SIAM Review

Continuous wavelet based linear time-varying system identification

Signal Processing
An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce and study a fast implementation of orthogonal greedy algorithm for wavelet frames. The results of numerical simulation for N-term approximations of standard images by tight wavelet frames showed that to provide the same PSNR the popular 9/7 biorthogonal wavelet bases require 38-42% more terms of the expansion. This is equivalent to 2-4 dB advantage of the wavelet frames in PSNR over the 9/7 bases for a fixed number of decomposition terms.