Data Mining:
ABSTRACT: Given
a collection of images, where each image contains several faces and is
associated with a few names in the corresponding caption, the goal of face
naming is to infer the correct name for each face. In this paper, we propose
two new methods to effectively solve this problem by learning two discriminative
affinity matrices from these weakly labeled images. We first propose a new
method called regularized low-rank representation by effectively utilizing
weakly supervised information to learn a
low-rank reconstruction coefficient matrix while exploring multiple subspace
structures of the data. Specifically, by introducing a specially designed
regularizer to the low-rank representation method, we penalize the
corresponding reconstruction coefficients related to the situations where a
face is reconstructed by using face images from other subjects or by using
itself. With the inferred reconstruction coefficient matrix, a discriminative
affinity matrix can be obtained. Moreover, we also develop a new distance
metric learning method called ambiguously supervised structural metric learning
by using weakly supervised information to seek a discriminative distance
metric. Hence, another discriminative affinity matrix can be obtained using the
similarity matrix (i.e., the kernel matrix) based on the Mahalanobis distances
of the data. Observing that these two affinity matrices contain complementary
information, we further combine them to obtain a fused affinity matrix, based
on which we develop a new iterative scheme to infer the name of each face.
Comprehensive experiments demonstrate the effectiveness of our approach.
No comments:
Post a Comment