A Sparse Representation Method with Maximum Probability of Partial Ranking for Face Recognition

Abstract

  Face recognition is a popular topic in computer vision applications. Compressive sensing is a novel sampling technique for finding sparse solutions to underdetermined linear systems. Recently, a sparse representation-based classification (SRC) method based on compressive sensing is presented. It has been successfully applied in face recognition. In this paper, we proposed a maximum probability of partial ranking method based on the framework of SRC, called SRC-MP, for face recognition. Eigenfiaces, fisherfaces, 2DPCA and 2DLDA are used for feature extraction. Experiments are implemented on two public face databases, Entended Yale B and ORL. In order to show our proposed method is robust for face recognition in the real world, experiment is also implemented on a web female album (WFA) face database. We utilize AdaBoost method to automatically detect human face from web album images with complex background, illumination variation and image misalignment to construct WFA database. Furthermore, we compare our proposed method with the classical projection-based methods such as principal component analysis (PCA), linear discriminant analysis (LDA), 2DPCA and 2DLDA. The experimental results demonstrate our proposed method not only is robust for varied viewing angles, expressions, and illumination, but also has higher recognition rates than other methods.

Authors and Affiliations

Yi-Haur Shiau , Chaur-Chin Chen

Keywords

Related Articles

 Improved Framework for Breast Cancer Detection using Hybrid Feature Extraction Technique and FFNN

 Breast Cancer early detection using terminologies of image processing is suffered from the less accuracy performance in different automated medical tools. To improve the accuracy, still there are many research stud...

 Application of distributed lighting control architecture in dementia-friendly smart homes

 Dementia is a growing problem in societies with aging populations, not only for patients, but also for family members and for the society in terms of the associated costs of providing health care. Helping patients...

Method for 3D Object Reconstruction Using Several Portion of 2D Images from the Different Aspects Acquired with Image Scopes Included in the Fiber Retractor

Method for 3D object reconstruction using several portions of 2D images from the different aspects which are acquired with image scopes included in the fiber retractor is proposed. Experimental results show a great possi...

Imputation And Classification Of Missing Data Using Least Square Support Vector Machines – A New Approach In Dementia Diagnosis

This paper presents a comparison of different data imputation approaches used in filling missing data and proposes a combined approach to estimate accurately missing attribute values in a patient database. The present st...

 An Empirical Comparison of Tree-Based Learning Algorithms: An Egyptian Rice Diseases Classification Case Study

 Applications of learning algorithms in knowledge discovery are promising and relevant area of research. The classification algorithms of data mining have been successfully applied in the recent years to predict Egy...

Download PDF file
  • EP ID EP119592
  • DOI -
  • Views 99
  • Downloads 0

How To Cite

Yi-Haur Shiau, Chaur-Chin Chen (2012).  A Sparse Representation Method with Maximum Probability of Partial Ranking for Face Recognition. International Journal of Advanced Research in Artificial Intelligence(IJARAI), 1(1), 6-10. https://europub.co.uk/articles/-A-119592