Cart (Loading....) | Create Account
Close category search window
 

Comparative Study of a Discrete Linear Basis for Image Data Compression

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

2 Author(s)
Haralick, R.M. ; Center for Research, Inc., Department of Electrical Engineering, University of Kansas, Lawrence, Kans. 66044. ; Shanmugam, K.

Transform image data compression consists of dividing the image into a number of nonoverlapping subimage regions and quantizing and coding the transform of the data from each subimage. Karhunen-Loÿve, Hadamard, and Fourier transforms are most commonly used in transform image compression. This paper presents a new discrete linear transform for image compression which we use in conjunction with differential pulse-code modulation on spatially adjacent transformed subimage samples. For a set of thirty-three 64 × 64 images of eleven different categories, we compare the performancea of the discrete linear transform compression technique with the Karhunen-Loÿve and Hadamard transform techniques. Our measure of performance is the mean-squared error between the original image and the reconstructed image. We multiply the mean-squared error with a factor indicating the degree to which the error is spatially correlated. We find that for low compression rates, the Karhunen-Loÿve outperforms both the Hadamard and the discrete linear basis method. However, for high compression rates, the performance of the discrete transform method is very close to that of the Karhunen-Loÿve transform. The discrete linear transform method performs much better than the Hadamard transform method for all compression rates.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-4 ,  Issue: 1 )

Date of Publication:

Jan. 1974

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.