Kernel group sparse representation classifier via structural and non-convex constraints

NEUROCOMPUTING

卷:296

Article

Zheng, Jianwei^1,2  Qiu, Hong¹  Sheng, Weiguo³  Yang, Xi¹  Yu, Hongchuan² 

[1] Zhejiang Univ Technol, Sch Comp Sci & Technol, 288 Liuhe Rd, Hangzhou, Zhejiang, Peoples R China

[2] Bournemouth Univ, Natl Ctr Comp Animat, Poole BH12 5BB, Dorset, England

[3] Hangzhou Normal Univ, Inst Serv Engn, 2318 Yuhangtang Rd, Hangzhou, Zhejiang, Peoples R China

关键词: Sparse representation;    Locality constraint;    Group sparse;    Kernel trick;    Non-convex penalty;   

DOI  :  10.1016/j.neucom.2018.03.035

来源: Elsevier

【 摘 要 】

In this paper, we propose a new classifier named kernel group sparse representation via structural and non-convex constraints (KGSRSN) for image recognition. The new approach integrates both group sparsity and structure locality in the kernel feature space and then penalties a non-convex function to the representation coefficients. On the one hand, by mapping the training samples into the kernel space, the so-called norm normalization problem will be naturally alleviated. On the other hand, an interval for the parameter of penalty function is provided to promote more sparsity without sacrificing the uniqueness of the solution and robustness of convex optimization. Our method is computationally efficient due to the utilization of the Alternating Direction Method of Multipliers (ADMM) and Majorization-Minimization (MM). Experimental results on three real-world benchmark datasets, i.e., AR face database, PIE face database and MNIST handwritten digits database, demonstrate that KGSRSN can achieve more discriminative sparse coefficients, and it outperforms many state-of-the-art approaches for classification with respect to both recognition rates and running time. (C) 2018 Elsevier B.V. All rights reserved.

【 授权许可】

Free