Name
Abstract | ||
|---|---|---|
Occlusion is a common yet challenging problem in face recognition. Most of the existing approaches cannot achieve the accuracy of the recognition with high efficiency in the occlusion case. To address this problem, this paper proposes a novel algorithm, called efficient locality-constrained occlusion coding (ELOC), improving the previous sparse error correction with Markov random fields (SEC_MRF) algorithm. The proposed approach estimates and excludes occluded region by locality-constrained linear coding (LLC), which avoids the time-consuming l1-minimization and exhaustive subject-by-subject search during the occlusion estimation, and greatly reduces the running time of recognition. Moreover, by simplifying the regularization, the ELOC can be further accelerated. Experimental results on several face databases show that our algorithms significantly improve the previous algorithms in efficiency without losing too much accuracy. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.neucom.2017.04.001 | Neurocomputing |
Keywords | Field | DocType |
Face recognition,Occlusion estimating,Locality-constrained Linear Coding,Sparse Error Correction with Markov Random Fields,Efficiency | Facial recognition system,Locality,Occlusion,Pattern recognition,Computer science,Markov chain,Coding (social sciences),Error detection and correction,Minification,Regularization (mathematics),Artificial intelligence,Machine learning | Journal |
Volume | ISSN | Citations |
260 | 0925-2312 | 1 |
PageRank | References | Authors |
0.37 | 18 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuli Fu | 1 | 200 | 29.90 |
| Xiaosi Wu | 2 | 1 | 0.37 |
| Yandong Wen | 3 | 115 | 8.27 |
| Youjun Xiang | 4 | 9 | 2.49 |