DocumentCode
3311591
Title
Joint Sparsity Model with Matrix Completion for an ensemble of face images
Author
Zhang, Qiang ; Li, Baoxin
Author_Institution
Compute Sci. & Eng., Arizona State Univ., Tempe, AZ, USA
fYear
2010
fDate
26-29 Sept. 2010
Firstpage
1665
Lastpage
1668
Abstract
An ensemble of correlated signals are often encountered in many applications of image processing, such as a set of face images of the same subject. In this paper, we propose a new model, called Joint Sparsity Model with Matrix Completion (JSM-MC), which extracts a common component, an innovation component, and a low-rank component from an ensemble of face images. These components have their respective physical significance in terms of representing different types of information in the original ensemble, hence facilitating an analysis task such as recognition. An algorithm is proposed under the model to solve for the components, based on Block Coordinate Descent and Singular Value Thresholding. Experimental results show that the proposed method has unique advantages over existing methods in dealing with challenging face images with extreme illumination conditions or occlusions.
Keywords
face recognition; sparse matrices; block coordinate descent; correlated signal ensemble; face image ensemble; illumination condition; image processing; joint sparsity model; matrix completion; occlusion; singular value thresholding; Face; Joints; Lighting; Principal component analysis; Robustness; Sparse matrices; Technological innovation; Face image; compressive sensing; joint sparsity; matrix completion;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing (ICIP), 2010 17th IEEE International Conference on
Conference_Location
Hong Kong
ISSN
1522-4880
Print_ISBN
978-1-4244-7992-4
Electronic_ISBN
1522-4880
Type
conf
DOI
10.1109/ICIP.2010.5650188
Filename
5650188
Link To Document