Best wavelet packet bases in a rate-distortion sense

Author

Ramchandran, Kannan ; Vetterli, Martin

Author_Institution

Dept. of Electr. Eng., Columbia Univ., New York, NY, USA

Volume

2

Issue

2

fYear

1993

fDate

4/1/1993 12:00:00 AM

Firstpage

160

Lastpage

175

Abstract

A fast rate-distortion (R-D) optimal scheme for coding adaptive trees whose individual nodes spawn descendents forming a disjoint and complete basis cover for the space spanned by their parent nodes is presented. The scheme guarantees operation on the convex hull of the operational R-D curve and uses a fast dynamic programing pruning algorithm to markedly reduce computational complexity. Applications for this coding technique include R. Coefman et al.´s (Yale Univ., 1990) generalized multiresolution wavelet packet decomposition, iterative subband coders, and quadtree structures. Applications to image processing involving wavelet packets as well as discrete cosine transform (DCT) quadtrees are presented

Keywords

discrete cosine transforms; dynamic programming; image coding; trees (mathematics); wavelet transforms; DCT; adaptive trees coding; computational complexity; convex hull; discrete cosine transform; dynamic programing pruning algorithm; generalized multiresolution wavelet packet decomposition; image processing; iterative subband coders; quadtree structures; wavelet packets; Bit rate; Discrete cosine transforms; Discrete wavelet transforms; Image coding; Image segmentation; Kernel; Rate-distortion; Transform coding; Tree data structures; Wavelet packets;

fLanguage

English

Journal_Title

Image Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7149

Type

jour

DOI

10.1109/83.217221

Filename

217221