Robust Sparse Learning Based on Kernel Non-Second Order Minimization

No Thumbnail Available
File version
Author(s)
Zhang, M
Gao, Y
Sun, C
Blumenstein, M
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2019
Size
File type(s)
Location

Taipei, Taiwan

License
Abstract

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.

Journal Title
Conference Title

Proceedings - International Conference on Image Processing, ICIP

Book Title
Edition
Volume

2019-September

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence

Persistent link to this record
Citation

Zhang, M; Gao, Y; Sun, C; Blumenstein, M, Robust Sparse Learning Based on Kernel Non-Second Order Minimization, Proceedings - International Conference on Image Processing, ICIP, 2019, 2019-September, pp. 2045-2049