The architecture of modern image-compression algorithms built upon the embedded coding of wavelet coefficients is reviewed. The production of coefficients from wavelet filter banks is described along with the subsequent partitioning into significant and insigificant coefficient sets via bitplane coding. An overview of the zerotree and context-conditioning mechanisms for coding binary maps of significant coefficients is presented, and other less prominent approaches to significance-map coding are surveyed. Additionally, common approaches to refinement- and sign-bit coding are considered. Finally, the rate-distortion performance is empirically evaluated for several coders representative of each class, including the prominent Set Partitioning in Hierarchical Trees (SPIHT) algorithm and the recent JPEG-2000 standard.
Print ISSN: 1611-2776
Volume: 45, 05/2003
Pages: 256