Best wavelet packet bases in a rate-distortion sense
Related Experiment Video
Updated: Jul 7, 2026

Experimental Investigation of Secondary Flow Structures Downstream of a Model Type IV Stent Failure in a 180° Curved Artery Test Section
Published on: July 19, 2016
1Dept. of Electr. Eng., Columbia Univ., New York, NY.
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.
Related Concept Videos
Bandpass Sampling
A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2. The spectrum...
Bessel Function of Order Zero
Basic Discrete Time Signals
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
Properties of Fourier Transform I
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
¹³C NMR: Distortionless Enhancement by Polarization Transfer (DEPT)
Upsampling