Fast implementation of orthogonal greedy algorithm for tight wavelet frames

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/79/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/79/7 bases for a fixed number of decomposition terms.