Information theoretic covariance complexity and its relation to pattern recognition
In this paper, the author utilizes the discrimination information of a set of stochastic vectors to define a measure of the information theoretic complexity of the associated covariance matrix. He develops bounds that relate the covariance complexity to the maximum distance b between the characteristic roots of the covariance. Finally, a computationally efficient algorithm is proposed for finding the elements of a diagonal operator for minimizing the covariance complexity when the covariance is of the Toeplitz form.
- scientific article; zbMATH DE number 3874655
- Information approach to the problems of pattern recognition
- On rates of convergence of general information criteria in signal processing when the noise covariance matrix is arbitrary
- scientific article; zbMATH DE number 3971958
- scientific article; zbMATH DE number 4041079
- Testing for nonlinearity using redundancies: Quantitative and qualitative aspects
- Detecting nonlinearity in multivariate time series
- Akaike's information criterion and recent developments in information complexity
- On Tsallis extropy with an application to pattern recognition
- On the information-based measure of covariance complexity and its application to the evaluation of multivariate linear models
- On the Choice of the Kernel Function in Kernel Discriminant Analysis Using Information Complexity
- scientific article; zbMATH DE number 3874655 (Why is no real title available?)
- Information Theory in Computer Vision and Pattern Recognition
This page was built for publication: Information theoretic covariance complexity and its relation to pattern recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3704714)