Robust Sparse Learning Based on Kernel Non-Second Order Minimization
- Publication Type:
- Conference Proceeding
- Proceedings - International Conference on Image Processing, ICIP, 2019, 2019-September, pp. 2045-2049
- Issue Date:
|Robust Sparse Learning Based on Kernel Non-Second Order Minimization.pdf||Accepted Manuscript Version||391.2 kB|
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is currently unavailable due to the publisher's embargo.
The embargo period expires on 1 Sep 2021
© 2019 IEEE. Partial occlusions in face images pose a great problem for most face recognition algorithms due to the fact that most of these algorithms mainly focus on solving a second order loss function, e.g., mean square error (MSE), which will magnify the effect from occlusion parts. In this paper, we proposed a kernel non-second order loss function for sparse representation (KNS-SR) to recognize or restore partially occluded facial images, which both take the advantages of the correntropy and the non-second order statistics measurement. The resulted framework is more accurate than the MSE-based ones in locating and eliminating outliers information. Experimental results from image reconstruction and recognition tasks on publicly available databases show that the proposed method achieves better performances compared with existing methods.
Please use this identifier to cite or link to this item: