By Topic

On the selection of image compression algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chaur-Chin Chen ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan

This paper attempts to give a recipe for selecting one of the popular image compression algorithms based on: 1) wavelet, 2) JPEG/DCT, 3) vector quantisation, and 4) fractal approaches. We review and discuss the advantages and disadvantages of these algorithms for compressing gray-scale images, give an experimental comparison on four 256×256 commonly used images (Jet, Lenna, Mandrill, Peppers, and one 400×400 fingerprint image). Our experiments show that all of the four approaches perform satisfactorily when the 0.5 bits per pixel (bpp) is desired. However, for a low bit rate compression like 0.25 bpp or lower, the embedded zerotree wavelet approach and DCT-based JPEG approach are more practical

Published in:

Pattern Recognition, 1998. Proceedings. Fourteenth International Conference on  (Volume:2 )

Date of Conference:

16-20 Aug 1998