Coupled Kernel-Based Subspace Learning

It was prescriptive that an image matrix was transformed into a vector before the kernel-based subspace learning. In this paper, we take the Kernel Discriminant Analysis (KDA) algorithm as an example to perform kernel analysis on 2D image matrices directly. First, each image matrix is decomposed as the product of two orthogonal matrices and a diagonal one by using Singular Value Decomposition; then an image matrix is expanded to be of higher or even infinite dimensions by applying the kernel trick on the column vectors of the two orthogonal matrices; finally, two coupled discriminative kernel subspaces are iteratively learned for dimensionality reduction by optimizing the Fisher criterion measured by Frobenius norm. The derived algorithm, called Coupled Kernel Discriminant Analysis (CKDA), effectively utilizes the underlying spatial structure of objects and the discriminating information is encoded in two coupled kernel subspaces respectively. The experiments on real face databases co...

• Type: Conference
• Year: 2005
• Where: CVPR
• Authors: Shuicheng Yan, Dong Xu, Lei Zhang, Benyu Zhang, HongJiang Zhang
• Keywords: Computer Vision, Coupled Discriminative Kernel, Coupled Kernel Subspaces, CVPR 2005, Kernel Analysis, Kernel Discriminant Analysis, Kernel Trick