title: Face recognition using sparse representation-based classification on k-nearest subspace.
abstract: The sparse representation-based classification (SRC) has been proven to be a robust face recognition method. However, its computational complexity is very high due to solving a complex l(1)-minimization problem. To improve the calculation efficiency, we propose a novel face recognition method, called sparse representation-based classification on k-nearest subspace (SRC-KNS). Our method first exploits the distance between the test image and the subspace of each individual class to determine the k nearest subspaces and then performs SRC on the k selected classes. Actually, SRC-KNS is able to reduce the scale of the sparse representation problem greatly and the computation to determine the k nearest subspaces is quite simple. Therefore, SRC-KNS has a much lower computational complexity than the original SRC. In order to well recognize the occluded face images, we propose the modular SRC-KNS. For this modular method, face images are partitioned into a number of blocks first and then we propose an indicator to remove the contaminated blocks and choose the k nearest subspaces. Finally, SRC is used to classify the occluded test sample in the new feature space. Compared to the approach used in the original SRC work, our modular SRC-KNS can greatly reduce the computational load. A number of face recognition experiments show that our methods have five times speed-up at least compared to the original SRC, while achieving comparable or even better recognition rates.
authors.affiliation: Bio-Computing Research Center, Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen, Guangdong Province, China.
authors.forename: Jian-Xun
authors.initials: JX
authors.lastname: Mi
authors.forename: Jin-Xing
authors.initials: JX
authors.lastname: Liu
mesh_terms: D000465:Algorithms; D003201:Computers; D005145:Face; D010363:Pattern Recognition, Automated / Q000379:methods*; D013997:Time Factors
references.citation: IEEE Trans Pattern Anal Mach Intell. 2004 Jan;26(1):131-7
references.pmid: 15382693
references.citation: IEEE Trans Image Process. 2005 Jun;14(6):705-12
references.pmid: 15971770
references.citation: IEEE Trans Neural Netw. 2001;12(2):181-201
references.pmid: 18244377
references.citation: IEEE Trans Neural Netw. 2002;13(6):1450-64
references.pmid: 18244540
references.citation: IEEE Trans Pattern Anal Mach Intell. 2012 Feb;34(2):372-86
references.pmid: 21646680
references.citation: IEEE Trans Pattern Anal Mach Intell. 2005 May;27(5):684-98
references.pmid: 15875791
references.citation: IEEE Trans Neural Netw. 2003;14(4):919-28
references.pmid: 18238070
references.citation: IEEE Trans Pattern Anal Mach Intell. 2010 Nov;32(11):2106-12
references.pmid: 20603520
references.citation: IEEE Trans Pattern Anal Mach Intell. 2009 Feb;31(2):210-27
references.pmid: 19110489
references.citation: J Cogn Neurosci. 1991 Winter;3(1):71-86
references.pmid: 23964806