Graph Embedding Discriminant Analysis on Grassmannian Manifolds for Improved Image Set Matching

A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analysis on such manifolds, the conventional formalism of discriminant analysis suffers from not considering the local structure of the data. We propose a discriminant analysis approach on Grassmannian manifolds, based on a graphembedding framework. We show that by introducing withinclass and between-class similarity graphs to characterise intra-class compactness and inter-class separability, the geometrical structure of data can be exploited. Experiments on several image datasets (PIE, BANCA, MoBo, ETH-80) show that the proposed algorithm obtains considerable improvements in discrimination accuracy, in comparison to three recent methods: Grassmann Discriminant Analysis (GDA), Kernel GDA, and the kernel version of Affine Hull Image Set Distance. We further propose a Grassmannian kernel, based on canonical correla...

• Type: Journal
• Year: 2011
• Where: CVPR
• Authors: Mehrtash Harandi, Sareh, Shirazi (National ICT Australia, Conrad, Sanderson (National ICT Australia, Brian Lovell
• Keywords: Computer Vision, CVPR 2011, Discriminant Analysis, Discrimination Accuracy, Image Set