By Topic

Experiments in simple one-dimensional lossy image compression schemes

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
$31 $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

3 Author(s)
Modayil, J. ; Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada ; Cheng, H. ; Xiaobo Li

The paper examines some one-dimensional lossy image compression schemes. To perform one-dimensional compression, an image is scanned into a one-dimensional array which is then compressed. Three types of scanning are considered: raster scan, Hilbert scan, and binary scan. Hilbert and binary scan are found to outperform raster scan. The methods considered for compression are integer wavelet transforms, a piecewise approximation with triggers (PAT) procedure introduced by Walach and Karnin (1986), and a modified PAT algorithm (MPAT). Wavelets outperform MPAT in compression, and MPAT in turn outperforms PAT; however, MPAT and PAT are computationally far simpler than wavelet transforms

Published in:

Multimedia Computing and Systems '97. Proceedings., IEEE International Conference on

Date of Conference:

3-6 Jun 1997