Anisotropic 2D wavelet packets and rectangular tiling: theory and algorithms

Dan Xu; Minh N. Do

doi:10.1117/12.506601

13 November 2003 Anisotropic 2D wavelet packets and rectangular tiling: theory and algorithms

Dan Xu, Minh N. Do

Proceedings Volume 5207, Wavelets: Applications in Signal and Image Processing X; (2003) https://doi.org/10.1117/12.506601
Event: Optical Science and Technology, SPIE's 48th Annual Meeting, 2003, San Diego, California, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available