Compression of color facial images using feature correction two-stage vector quantization

Authors:
Jincheng Huang;Yao Wang
Affiliations:
Dept. of Electr. Eng., Polytech. Univ., Brooklyn, NY;-
Venue:
IEEE Transactions on Image Processing
Year:
1999

Citing 0
Cited 3

Compression of facial images using the K-SVD algorithm

Journal of Visual Communication and Image Representation
Does decorrelation really improve color image compression?

ISTASC'05 Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation
A method for compact image representation using sparse matrix and tensor projections onto exemplar orthonormal bases

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A feature correction two-stage vector quantization (FC2VQ) algorithm was previously developed to compress gray-scale photo identification (ID) pictures. This algorithm is extended to color images in this work. Three options are compared, which apply the FC2VQ algorithm in RGB, YCbCr, and Karhunen-Loeve transform (KLT) color spaces, respectively. The RGB-FC2VQ algorithm is found to yield better image quality than KLT-FC2VQ or YCbCr-FC2VQ at similar bit rates. With the RGB-FC2VQ algorithm, a 128×128 24-b color ID image (49152 bytes) can be compressed down to about 500 bytes with satisfactory quality. When the codeword indices are further compressed losslessly using a first order Huffman coder, this size is further reduced to about 450 bytes