Abstract
Abstract Analysis of colour images in the Red, Green and Blue acquisition space and in the intensity and chrominance spaces shows that colour components are closely correlated (Carron, Ph.D. Thesis, Univ. Savoie, France, 1995; Ocadis, Ph.D. Thesis, Univ. Grenoble, France, 1985). These have to be decorrelated so that each component of the colour image can be studied separately. The Karhunen–Loeve transformation provides optimal decorrelation of these colour data. However, this transformation is related to the colour distribution in the image, i.e. to the statistical properties of the colour image and is therefore dependent on the image under analysis. In order to enjoy the advantages of direct, independent and rapid transformation and the advantages of the Karhunen–Loeve properties, this paper presents the study of the approximation of the Karhunen–Loeve transformation. The approximation is arrived at through exploitation of the properties of Toeplitz matrices. The search for eigenvectors of a Toeplitz matrix shows that complex or real orthogonal mappings such as the discrete Fourier transform and its decompositions approximate the Karhunen–Loeve transformation in the case of first-order Markov processes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
