Share Email Print

Proceedings Paper

New color image compression algorithm based on DCT and hierarchical data structure
Author(s): Alan C. K. Ng; Bing Zeng
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 28 December 1998
PDF: 12 pages
Proc. SPIE 3653, Visual Communications and Image Processing '99, (28 December 1998); doi: 10.1117/12.334611
Show Author Affiliations
Alan C. K. Ng, Hong Kong Univ. of Science and Technology (China)
Bing Zeng, Hong Kong Univ. of Science and Technology (Hong Kong)

Published in SPIE Proceedings Vol. 3653:
Visual Communications and Image Processing '99
Kiyoharu Aizawa; Robert L. Stevenson; Ya-Qin Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?