This paper presents a new image compression scheme, called bracket classified coding (BCC), to be used during image transform coding. This scheme divides non-overlapping pixel groups called brackets into classes on the basis of spatial features. Each class is identified by a label. Only a subset of selected pixel values are sent for DPCM/DCT hybrid encoding. In addition, this scheme exploits cross correlation among class labels when encoding the class information. A scanning method is developed to generate drives. A drive represents a run of labels with the same class. It is the drives, rather than individual labels, that are coded with the Huffman algorithm. Simulation results show that the excellence of the visual quality, bit rate, and processing speed, with 2/spl times/2 bracket segments.
[1]
P. Yip,et al.
Discrete Cosine Transform: Algorithms, Advantages, Applications
,
1990
.
[2]
Didier Le Gall,et al.
MPEG: a video compression standard for multimedia applications
,
1991,
CACM.
[3]
D. Huffman.
A Method for the Construction of Minimum-Redundancy Codes
,
1952
.
[4]
Bhaskar Ramamurthi,et al.
Classified Vector Quantization of Images
,
1986,
IEEE Trans. Commun..
[5]
Sang Uk Lee,et al.
Image vector quantizer based on a classification in the DCT domain
,
1991,
IEEE Trans. Commun..