Frequency and spatially adaptive wavelet packets
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4 (15206149) , 2233-2236
- https://doi.org/10.1109/icassp.1995.479921
Abstract
We consider a method for image compression based on frequency and spatially adaptive wavelet packets. We present a new fast directed acyclic graph (DAG) structured decomposition, with both spatial segmentation and orthogonal frequency branching from each node. Whereas traditional wavelet packet decomposition adapts to a global frequency distribution, this technique finds the best joint spatial segmentation and local frequency basis. The algorithm is derived from the fast double tree algorithm proposed by Herley, et. al. (see IEE Transactions on Signal Processing, December 1993), for 1-D signals, with an extension to 2-D and modification to include spatial segmentation of frequency nodes. By collecting redundant nodes in this full adaptive tree, we have derived a directed acyclic graph (DAG) structure which contains the same number of nodes as the double tree, but includes new connections between nodes. We present the adaptive wavelet packet DAG algorithm and examine image compression performance on test images.Keywords
This publication has 6 references indexed in Scilit:
- A filter family designed for use in quadrature mirror filter banksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Space-frequency localized image compressionIEEE Transactions on Image Processing, 1994
- Best wavelet packet bases in a rate-distortion senseIEEE Transactions on Image Processing, 1993
- Tilings of the time-frequency plane: construction of arbitrary orthogonal bases and fast tiling algorithmsIEEE Transactions on Signal Processing, 1993
- Entropy-based algorithms for best basis selectionIEEE Transactions on Information Theory, 1992
- Subband coding of imagesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986