Paper
13 November 2003 Anisotropic 2D wavelet packets and rectangular tiling: theory and algorithms
Author Affiliations +
Abstract
We propose a new subspace decomposition scheme called anisotropic wavelet packets which broadens the existing definition of 2-D wavelet packets. By allowing arbitrary order of row and column decompositions, this scheme fully considers the adaptivity, which helps find the best bases to represent an image. We also show that the number of candidate tree structures in the anisotropic case is much larger than isotropic case. The greedy algorithm and double-tree algorithm are then presented and experimental results are shown.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Dan Xu and Minh N. Do "Anisotropic 2D wavelet packets and rectangular tiling: theory and algorithms", Proc. SPIE 5207, Wavelets: Applications in Signal and Image Processing X, (13 November 2003); https://doi.org/10.1117/12.506601
Lens.org Logo
CITATIONS
Cited by 22 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelets

Wavelet transforms

Algorithms

Computer programming

Matrices

Wavelet packet decomposition

Anisotropy

Back to Top