Discriminant analysis on Riemannian manifold of gaussian distributions for face recognition with Image sets
Discriminant analysis on Riemannian manifold of gaussian distributions for face recognition with Image sets
To address the problem of face recognition with image sets, we aim to capture the underlying data distribution in each set and thus facilitate more robust classification. To this end, we represent image set as the Gaussian mixture model (GMM) comprising a number of Gaussian components with prior probabilities and seek to discriminate Gaussian components from different classes. Since in the light of information geometry, the Gaussians lie on a specific Riemannian manifold, this paper presents a method named discriminant analysis on Riemannian manifold of Gaussian distributions (DARG). We investigate several distance metrics between Gaussians and accordingly two discriminative learning frameworks are presented to meet the geometric and statistical characteristics of the specific manifold. The first framework derives a series of provably positive definite probabilistic kernels to embed the manifold to a high-dimensional Hilbert space, where conventional discriminant analysis methods developed in Euclidean space can be applied, and a weighted Kernel discriminant analysis is devised which learns discriminative representation of the Gaussian components in GMMs with their prior probabilities as sample weights. Alternatively, the other framework extends the classical graph embedding method to the manifold by utilizing the distance metrics between Gaussians to construct the adjacency graph, and hence the original manifold is embedded to a lower-dimensional and discriminative target manifold with the geometric structure preserved and the interclass separability maximized. The proposed method is evaluated by face identification and verification tasks on four most challenging and largest databases, YouTube Celebrities, COX, YouTube Face DB, and Point-and-Shoot Challenge, to demonstrate its superiority over the state-of-the-art.
151 - 163
Wang, Wen
45476218-a919-409e-8bc4-c8b9666f2943
Wang, Ruiping
52991ab2-4e3b-4430-9f97-12f6eb305a56
Huang, Zhiwu
84f477cd-9097-44dd-a33e-ff71f253d36b
Shan, Shiguang
78e49abb-f490-480f-b534-0b7e05c9cbe4
Chen, Xilin
48380269-4169-4310-ae77-30dade3b551b
30 August 2017
Wang, Wen
45476218-a919-409e-8bc4-c8b9666f2943
Wang, Ruiping
52991ab2-4e3b-4430-9f97-12f6eb305a56
Huang, Zhiwu
84f477cd-9097-44dd-a33e-ff71f253d36b
Shan, Shiguang
78e49abb-f490-480f-b534-0b7e05c9cbe4
Chen, Xilin
48380269-4169-4310-ae77-30dade3b551b
Wang, Wen, Wang, Ruiping, Huang, Zhiwu, Shan, Shiguang and Chen, Xilin
(2017)
Discriminant analysis on Riemannian manifold of gaussian distributions for face recognition with Image sets.
IEEE Transactions on Image Processing, 27 (1), .
(doi:10.1109/TIP.2017.2746993).
Abstract
To address the problem of face recognition with image sets, we aim to capture the underlying data distribution in each set and thus facilitate more robust classification. To this end, we represent image set as the Gaussian mixture model (GMM) comprising a number of Gaussian components with prior probabilities and seek to discriminate Gaussian components from different classes. Since in the light of information geometry, the Gaussians lie on a specific Riemannian manifold, this paper presents a method named discriminant analysis on Riemannian manifold of Gaussian distributions (DARG). We investigate several distance metrics between Gaussians and accordingly two discriminative learning frameworks are presented to meet the geometric and statistical characteristics of the specific manifold. The first framework derives a series of provably positive definite probabilistic kernels to embed the manifold to a high-dimensional Hilbert space, where conventional discriminant analysis methods developed in Euclidean space can be applied, and a weighted Kernel discriminant analysis is devised which learns discriminative representation of the Gaussian components in GMMs with their prior probabilities as sample weights. Alternatively, the other framework extends the classical graph embedding method to the manifold by utilizing the distance metrics between Gaussians to construct the adjacency graph, and hence the original manifold is embedded to a lower-dimensional and discriminative target manifold with the geometric structure preserved and the interclass separability maximized. The proposed method is evaluated by face identification and verification tasks on four most challenging and largest databases, YouTube Celebrities, COX, YouTube Face DB, and Point-and-Shoot Challenge, to demonstrate its superiority over the state-of-the-art.
This record has no associated files available for download.
More information
Published date: 30 August 2017
Identifiers
Local EPrints ID: 501111
URI: http://eprints.soton.ac.uk/id/eprint/501111
ISSN: 1057-7149
PURE UUID: 1bccdff8-a3eb-47d2-a220-7f6891528e95
Catalogue record
Date deposited: 23 May 2025 17:17
Last modified: 25 May 2025 05:21
Export record
Altmetrics
Contributors
Author:
Wen Wang
Author:
Ruiping Wang
Author:
Zhiwu Huang
Author:
Shiguang Shan
Author:
Xilin Chen
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics