DocumentCode :
3064746
Title :
Age invariant face recognition using graph matching
Author :
Mahalingam, Gayathri ; Kambhamettu, Chandra
Author_Institution :
Dept. of Comput. Sci., Univ. of Delaware, Newark, DE, USA
fYear :
2010
fDate :
27-29 Sept. 2010
Firstpage :
1
Lastpage :
7
Abstract :
In this paper, we present a graph based face representation for efficient age invariant face recognition. The graph contains information on the appearance and geometry of facial feature points. An age model is learned for each individual and a graph space is built using the set of feature descriptors extracted from each face image. A two-stage method for matching is developed, where the first stage involves a Maximum a Posteriori solution based on PCA factorization to efficiently prune the search space and select very few candidate model sets. A simple deterministic algorithm which exploits the topology of the graphs is used for matching in the second stage. The experimental results on the FGnet database show that the proposed method is robust to age variations and provides better performance than existing techniques.
Keywords :
deterministic algorithms; face recognition; feature extraction; graph theory; image matching; maximum likelihood estimation; principal component analysis; FGnet database; PCA factorization; age invariant face recognition; deterministic algorithm; facial feature points; feature descriptors; graph matching; maximum a posteriori solution; Aging; Computational modeling; Face; Feature extraction; Kernel; Shape; Training;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Biometrics: Theory Applications and Systems (BTAS), 2010 Fourth IEEE International Conference on
Conference_Location :
Washington, DC
Print_ISBN :
978-1-4244-7581-0
Electronic_ISBN :
978-1-4244-7580-3
Type :
conf
DOI :
10.1109/BTAS.2010.5634496
Filename :
5634496
Link To Document :
بازگشت