CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2010 vol.32 Issue No.11 - November
Issue No.11 - November (2010 vol.32)
Imran Naseem , The University of Western Australia, Crawley
Roberto Togneri , The University of Western Australia, Crawley
Mohammed Bennamoun , The University of Western Australia, Crawley
In this paper, we present a novel approach of face identification by formulating the pattern recognition problem in terms of linear regression. Using a fundamental concept that patterns from a single-object class lie on a linear subspace, we develop a linear model representing a probe image as a linear combination of class-specific galleries. The inverse problem is solved using the least-squares method and the decision is ruled in favor of the class with the minimum reconstruction error. The proposed Linear Regression Classification (LRC) algorithm falls in the category of nearest subspace classification. The algorithm is extensively evaluated on several standard databases under a number of exemplary evaluation protocols reported in the face recognition literature. A comparative study with state-of-the-art algorithms clearly reflects the efficacy of the proposed approach. For the problem of contiguous occlusion, we propose a Modular LRC approach, introducing a novel Distance-based Evidence Fusion (DEF) algorithm. The proposed methodology achieves the best results ever reported for the challenging problem of scarf occlusion.
Face recognition, linear regression, nearest subspace classification.
Imran Naseem, Roberto Togneri, Mohammed Bennamoun, "Linear Regression for Face Recognition", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.32, no. 11, pp. 2106-2112, November 2010, doi:10.1109/TPAMI.2010.128