Hierarchical partition priority wavelet image compression

  • Authors:
  • S. N. Efstratiadis;D. Tzovaras;M. G. Strintzis

  • Affiliations:
  • Lab. of Inf. Process., Aristotelian Univ. of Thessaloniki;-;-

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 1996

Quantified Score

Hi-index 0.01

Visualization

Abstract

Image compression methods for progressive transmission using optimal hierarchical decomposition, partition priority coding (PPC), and multiple distribution entropy coding (MDEC) are presented. In the proposed coder, a hierarchical subband/wavelet decomposition transforms the original image. The analysis filter banks are selected to maximize the reproduction fidelity in each stage of progressive image transmission. An efficient triple-state differential pulse code modulation (DPCM) method is applied to the smoothed subband coefficients, and the corresponding prediction error is Lloyd-Max quantized. Such a quantizer is also designed to fit the characteristics of the detail transform coefficients in each subband, which are then coded using novel hierarchical PPC (HPPC) and predictive HPPC (PHPPC) algorithms. More specifically, given a suitable partitioning of their absolute range, the quantized detail coefficients are ordered based on both their decomposition level and partition and then are coded along with the corresponding address map. Space filling scanning further reduces the coding cost by providing a highly spatially correlated address map of the coefficients in each PPC partition. Finally, adaptive MDEC is applied to both the DPCM and HPPC/PHPPC outputs by considering a division of the source (quantized coefficients) into multiple subsources and adaptive arithmetic coding based on their corresponding histograms. Experimental results demonstrate the great performance of the proposed compression methods