Robust face recognition via block sparse Bayesian learning

DOI10.1155/2013/695976MaRDI QIDQ474521zbMATH OpenOpenAlexWikidataFDO

Authors Zhilin Zhang, Taiyong Li

Publication date 24 November 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1301.6847

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Abstract: Face recognition (FR) is an important task in pattern recognition and computer vision. Sparse representation (SR) has been demonstrated to be a powerful framework for FR. In general, an SR algorithm treats each face in a training dataset as a basis function, and tries to find a sparse representation of a test face under these basis functions. The sparse representation coefficients then provide a recognition hint. Early SR algorithms are based on a basic sparse model. Recently, it has been found that algorithms based on a block sparse model can achieve better recognition rates. Based on this model, in this study we use block sparse Bayesian learning (BSBL) to find a sparse representation of a test face for recognition. BSBL is a recently proposed framework, which has many advantages over existing block-sparse-model based algorithms. Experimental results on the Extended Yale B, the AR and the CMU PIE face databases show that using BSBL can achieve better recognition rates and higher robustness than state-of-the-art algorithms in most cases.

Recommendations

• Sparse representation for face recognition based on constraint sampling and face alignment
• Pose-robust face recognition via sparse representation
• Expression-robust face recognition via part-based sparse representation
• scientific article; zbMATH DE number 6613418
• Improved combination of RPCA and MEL for sparse representation-based face recognition

Cites work

• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 1391397 (Why is no real title available?)
• 10.1162/15324430152748236
• Atomic Decomposition by Basis Pursuit
• Block-Sparse Recovery via Convex Optimization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Model Selection and Estimation in Regression with Grouped Variables
• Model-Based Compressive Sensing
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Pattern classification.
• Sparse Approximate Solutions to Linear Systems
• Sparse Bayesian Learning for Basis Selection
• The benefit of group sparsity

Cited in

(11)

• Weighted two-phase supervised sparse representation based on Gaussian for face recognition
• A face recognition algorithm by using sparse representation and Tchebychev moments
• Robust and discriminative dictionary learning for face recognition
• Face recognition via deep stacked denoising sparse autoencoders (DSDSA)
• Expression-robust face recognition via part-based sparse representation
• A modular weighted sparse representation based on Fisher discriminant and sparse residual for face recognition with occlusion
• Sparse representation for face recognition based on constraint sampling and face alignment
• Fast and robust face recognition via coding residual map learning based adaptive masking
• Sparse image coding with clustering property and its application to face recognition
• Pose-robust face recognition via sparse representation
• Improved combination of RPCA and MEL for sparse representation-based face recognition

Describes a project that uses

Uses Software

• AR face
• CMU PIE
• Yale Face
• PDCO

This page was built for publication: Robust face recognition via block sparse Bayesian learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474521)