By Topic

A Computationally Simple Procedure for Imagery Data Compression by the Karhunen-Loève Method

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

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

Of the several methods that have been proposed for imagery data compression, the Karhunen-Lo¿¿ve procedure minimizes the meansquare error between the original and reconstructed imagery data. In spite of its optimality property, the Karhunen-Lo¿¿ve procedure has not been widely used because of its computational complexity. The main difficulty is in the computation of the eigenvectors and the eigenvalues of the covariance matrix of the imagery data since the dimension of the covariance matrix is usually large. A computationally short procedure for calculating the eigenvalues and eigenvectors of the covariance matrix is presented. We show that the eigenvalues and eigenvectors of the N ¿¿ N bisymmetric covariance matrix can be obtained from the eigenvalues and eigenvectors of two N/2 ¿¿ N/2 submatrices. Since the eigenvector calculations are proportional to the third power of the matrix dimension, the proposed procedure reduces the computations by a factor of four.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-3 ,  Issue: 2 )