Journal
IEEE TRANSACTIONS ON IMAGE PROCESSING
Volume 20, Issue 8, Pages 2329-2338Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIP.2011.2109729
Keywords
Face recognition; graph Laplace (GL); occluded face completion
Funding
- National Basic Research Project [2010CB731800]
- Key Project of the National Natural Science Foundation of China (NSFC) [61035002, U0935001]
- NSFC [61021063]
- Microsoft Research Asia
Ask authors/readers for more resources
This paper proposes a spectral-graph-based algorithm for face image repairing, which can improve the recognition performance on occluded faces. The face completion algorithm proposed in this paper includes three main procedures: 1) sparse representation for partially occluded face classification; 2) image-based data mining; and 3) graph Laplace (GL) for face image completion. The novel part of the proposed framework is GL, as named from graphical models and the Laplace equation, and can achieve a high-quality repairing of damaged or occluded faces. The relationship between the GL and the traditional Poisson equation is proven. We apply our face repairing algorithm to produce completed faces, and use face recognition to evaluate the performance of the algorithm. Experimental results verify the effectiveness of the GL method for occluded face completion.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available