Significance-linked connected component analysis for wavelet image coding

Bing-Bing Chai

doi:10.1109/83.766856

Return

Significance-linked connected component analysis for wavelet image coding

1999-06-01

115

PRE

Bing-Bing Chai *

J. Vass

Xinhua Zhuang

DOI：10.1109/83.766856

Original

Original request for help

Save

Abstract

En 中文

Recent success in wavelet image coding is mainly attributed to recognition of the importance of data organization and representation. There have been several very competitive wavelet coders developed, namely, Shapiro's embedded zerotree wavelets (EZW), Servetto et al.'s morphological representation of wavelet data (MRWD), and Said and Pearlman's set partitioning in hierarchical trees (SPIHT), In this paper, we develop a novel wavelet image coder called significance-linked connected component analysis (SLCCA) of wavelet coefficients that extends MRWD by exploiting both within-subband clustering of significant coefficients and cross-subband dependency in significant fields. Extensive computer experiments on both natural and texture images show convincingly that the proposed SLCCA outperforms EZW, MRWD, and SPIHT. For example, for the Barbara image, at 0.25 b/pixel, SLCCA outperforms EZW, MRWD, and SPIHT by 1.41 dB, 0.32 dB, and 0.60 dB in PSNR, respectively. It is also observed that SLCCA works extremely well for images with a large portion of texture. For eight typical 256 x 256 grayscale texture images compressed at 0.40 b/pixel, SLCCA outperforms SPIHT by 0.16 dB-0.63 dB in PSNR, This outstanding performance is achieved without using any optimal bit allocation procedure, Thus both the encoding and decoding procedures are fast.

Keywords:

clustering

connected component

image coding

morphology

significance-link

subband

wavelet