Paper
28 December 1998 New color image compression algorithm based on DCT and hierarchical data structure
Alan C. K. Ng, Bing Zeng
Author Affiliations +
Proceedings Volume 3653, Visual Communications and Image Processing '99; (1998) https://doi.org/10.1117/12.334611
Event: Electronic Imaging '99, 1999, San Jose, CA, United States
Abstract
Nowadays, since the bandwidth is very expensive in most cases of the real-world telecommunications, we need to compress the amount of image data being transmitted. The main drawback for lossy compression is that we cannot completely restore the original images. We have to make a compromise between bit-rate and distortion. In the paper, we propose a new scalable image compression algorithm using (1) Quad Tree data structure, (2) DCT and (3) Hierarchical DPCM encoding. For high compression, we are able to achieve compression factor of 48 (at 0.25 bpp), with PSNR of about 32 dB. For small distortion compressed image, we can obtain high PNSR of 49 dB at 2.5 dpp result is promising. Due to the hierarchial data structure, the encoded image can be transmitted progressively for practical Internet applications.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alan C. K. Ng and Bing Zeng "New color image compression algorithm based on DCT and hierarchical data structure", Proc. SPIE 3653, Visual Communications and Image Processing '99, (28 December 1998); https://doi.org/10.1117/12.334611
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Quantization

Computer programming

Image transmission

Image processing

Distortion

Evolutionary algorithms

Back to Top