Manifold-Manifold Distance with application to face recognition based on image set

In this paper, we address the problem of classifying image sets, each of which contains images belonging to the same class but covering large variations in, for instance, viewpoint and illumination. We innovatively formulate the problem as the computation of Manifold-Manifold Distance (MMD), i.e., c...

Full description

Saved in:
Bibliographic Details
Published in2008 IEEE Conference on Computer Vision and Pattern Recognition pp. 1 - 8
Main Authors Ruiping Wang, Shiguang Shan, Xilin Chen, Gao, Wen
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2008
Subjects
Online AccessGet full text
ISBN9781424422425
1424422426
ISSN1063-6919
1063-6919
DOI10.1109/CVPR.2008.4587719

Cover

Loading…
More Information
Summary:In this paper, we address the problem of classifying image sets, each of which contains images belonging to the same class but covering large variations in, for instance, viewpoint and illumination. We innovatively formulate the problem as the computation of Manifold-Manifold Distance (MMD), i.e., calculating the distance between nonlinear manifolds each representing one image set. To compute MMD, we also propose a novel manifold learning approach, which expresses a manifold by a collection of local linear models, each depicted by a subspace. MMD is then converted to integrating the distances between pair of subspaces respectively from one of the involved manifolds. The proposed MMD method is evaluated on the task of Face Recognition based on Image Set (FRIS). In FRIS, each known subject is enrolled with a set of facial images and modeled as a gallery manifold, while a testing subject is modeled as a probe manifold, which is then matched against all the gallery manifolds by MMD. Identification is achieved by seeking the minimum MMD. Experimental results on two public face databases, Honda/UCSD and CMU MoBo, demonstrate that the proposed MMD method outperforms the competing methods.
ISBN:9781424422425
1424422426
ISSN:1063-6919
1063-6919
DOI:10.1109/CVPR.2008.4587719