Adaptive Selection and Rearrangement of Wavelet Packets for Quad-Tree Image Coding

  • Authors:
  • Hsi-Chin Hsin;Tze-Yun Sung

  • Affiliations:
  • -;-

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Embedded zero-tree image coding in wavelet domain has drawn a lot of attention. Among noteworthy algorithms is the set partitioning in hierarchical trees (SPIHT). Typically, most of images' energy is concentrated in low frequency subbands. For an image with textures, however many middle-high frequency wavelet coefficients are likely to become significant in the early passes of SPIHT; thus the coding results are often insufficient. Middle and high frequency subbands of images may demand further decompositions using adaptive basis functions. As wavelet packet transform offers a great diversity of basis functions, we propose a quad-tree based adaptive wavelet packet transform to construct adaptive wavelet packet trees for zero-tree image coding. Experimental results show that coding performances can be significantly improved especially for fingerprints images.