The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2012 vol. 34)
ISSN: 0162-8828
pp: 1992-2004
Yiqun Hu , The University of Western Australia, Crawley
Ajmal S. Mian , The University of Western Australia, Crawley
Robyn Owens , The University of Western Australia, Crawley
We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and their affine hull model. The model accounts for unseen appearances in the form of affine combinations of sample images. To calculate the between-set distance, we introduce the Sparse Approximated Nearest Point (SANP). SANPs are the nearest points of two image sets such that each point can be sparsely approximated by the image samples of its respective set. This novel sparse formulation enforces sparsity on the sample coefficients and jointly optimizes the nearest points as well as their sparse approximations. Unlike standard sparse coding, the data to be sparsely approximated are not fixed. A convex formulation is proposed to find the optimal SANPs between two sets and the accelerated proximal gradient method is adapted to efficiently solve this optimization. We also derive the kernel extension of the SANP and propose an algorithm for dynamically tuning the RBF kernel parameter while matching each pair of image sets. Comprehensive experiments on the UCSD/Honda, CMU MoBo, and YouTube Celebrities face datasets show that our method consistently outperforms the state of the art.
Approximation methods, Optimization, Data models, Vectors, Hidden Markov models, Adaptation models, convex optimization., Image set classification, face recognition, sparse modeling

R. Owens, A. S. Mian and Y. Hu, "Face Recognition Using Sparse Approximated Nearest Points between Image Sets," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 34, no. , pp. 1992-2004, 2012.
162 ms
(Ver 3.3 (11022016))