.png){kind=icon}
.png){kind=icon}
Return
Efficient Face Recognition Using Regularized Adaptive Non-Local Sparse Coding
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2890845.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the sparse representation-based classification (SRC), the object recognition procedure depends on local sparsity identification from sparse coding coefficients, where many existing SRC methods have focused on the local sparsity and the samples correlation to improve the classifier performance. However, the coefficients often do not accurately represent the local sparsity due to several factors that affect the data acquisition process such as noise, blurring, and downsampling. Therefore, this paper presents an effective method that exploits nonlocal sparsity by estimating the sparse code changes, which can be done by adding a nonlocal constraint term to the local constraint one. In addition, for generality, the sparse coding and regularization parameters are adaptively estimated. A comparative study demonstrated that the proposed method has better accuracy rates compared to the existing state-of-the-art methods.
Keywords:
Face recognition
sparse representation based classification (SRC)
regularization parameters
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.7W
Citations:
29.4W
Organization
View more organizations