Please use this identifier to cite or link to this item:

A New Color Image Compression Algorithm Based on DCT and Hierarchical Data Structure

Authors Ng, Alan Chi Kit
Zeng, Bing
Issue Date 1998
Source Proceedings of SPIE--the International Society for Optical Engineering , v. 3653, 1998, p. 1050-1061
Summary 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.25bpp), with PSNR of about 32dB. For small distortion compressed image, we can obtain high PSNR of 49dB at 2.5dpp! The result is promising. Due to the hierarchical data structure, the encoded image can be transmitted progressively for practical Internet applications.
ISSN 0277-786X
ISBN 0819431249
Rights Copyright 1998 Society of Photo-Optical Instrumentation Engineers. This paper was published in Visual Communications and Image Processing '99, Kiyoharu Aizawa, Robert L. Stevenson, Ya-Qin Zhang, Editors, Proceedings of SPIE Vol. 3653, p. 1050-1061 (1999) and is made available as an electronic reprint with permission of SPIE. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
3653.pdf 1572167 B Adobe PDF