Anisotropic 2-D Wavelet Packets and Rectangular Tiling: Theory and Algorithms

Dan Xu, Minh N. Do

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)619-630
Number of pages12
JournalProceedings of SPIE - The International Society for Optical Engineering
Issue number2
StatePublished - 2003
EventWavelets: Applications in Signal and Image Processing X - San Diego, CA, United States
Duration: Aug 4 2003Aug 8 2003


  • Anisotropic wavelet packets
  • Best bases
  • Dynamic programming
  • Rectangular tiling

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering


Dive into the research topics of 'Anisotropic 2-D Wavelet Packets and Rectangular Tiling: Theory and Algorithms'. Together they form a unique fingerprint.

Cite this