By Topic

Information theoretic covariance complexity and its relation to pattern recognition

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

1 Author(s)
Morgera, S.D. ; Dept. of Electr. Eng., Concordia Univ., Montreal, Que., Canada

The discrimination information of a set of stochastic vectors is utilized to define a measure of the information theoretic complexity of the associated covariance matrix. Bounds are developed that relate the covariance complexity to the maximum distance, or speed, between the characteristic roots of the covariance. A computationally efficient algorithm is devised for finding the elements of a diagonal operator for minimizing the covariance complexity when the covariance is of the Toeplitz form. Experimental results show that the algorithm reduces the information theoretic complexity and also is capable of appreciably increasing the maximum ratio of the characteristic roots of the covariance. A preprocessing operation of this type is important in data compression or feature selection for pattern recognition.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-15 ,  Issue: 5 )