Robust face recognition via block sparse Bayesian learning (Q474521): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(12 intermediate revisions by 7 users not shown) | |||
Property / author | |||
Property / author: Tai Yong Li / rank | |||
Property / author | |||
Property / author: Tai Yong Li / rank | |||
Normal rank | |||
Property / review text | |||
Summary: 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. | |||
Property / review text: Summary: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68T10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68T05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6372946 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: PDCO / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Yale Face / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: CMU PIE / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: AR face / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59031703 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2084103825 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1301.6847 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2707395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4935997 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model Selection and Estimation in Regression with Grouped Variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Block-Sparse Recovery via Convex Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4864293 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Atomic Decomposition by Basis Pursuit / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model-Based Compressive Sensing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The benefit of group sparsity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 10.1162/15324430152748236 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse Bayesian Learning for Basis Selection / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:54, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Robust face recognition via block sparse Bayesian learning |
scientific article |
Statements
Robust face recognition via block sparse Bayesian learning (English)
0 references
24 November 2014
0 references
Summary: 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.
0 references