Efficient algorithm for sparse coding and dictionary learning with applications to face recognition

Zhong Zhao; Guocan Feng

doi:10.1117/1.JEI.24.2.023009

10 March 2015 Efficient algorithm for sparse coding and dictionary learning with applications to face recognition

Zhong Zhao, Guocan Feng

Author Affiliations +

Journal of Electronic Imaging, Vol. 24, Issue 2, 023009 (March 2015). https://doi.org/10.1117/1.JEI.24.2.023009

Abstract

Sparse representation has been successfully applied to pattern recognition problems in recent years. The most common way for producing sparse coding is to use the l₁-norm regularization. However, the l₁-norm regularization only favors sparsity and does not consider locality. It may select quite different bases for similar samples to favor sparsity, which is disadvantageous to classification. Besides, solving the l₁-minimization problem is time consuming, which limits its applications in large-scale problems. We propose an improved algorithm for sparse coding and dictionary learning. This algorithm takes both sparsity and locality into consideration. It selects part of the dictionary columns that are close to the input sample for coding and imposes locality constraint on these selected dictionary columns to obtain discriminative coding for classification. Because an analytic solution of the coding is derived by only using part of the dictionary columns, the proposed algorithm is much faster than the l₁-based algorithms for classification. Besides, we also derive an analytic solution for updating the dictionary in the training process. Experiments conducted on five face databases show that the proposed algorithm has better performance than the competing algorithms in terms of accuracy and efficiency.

Citation Download Citation

Zhong Zhao and Guocan Feng "Efficient algorithm for sparse coding and dictionary learning with applications to face recognition," Journal of Electronic Imaging 24(2), 023009 (10 March 2015). https://doi.org/10.1117/1.JEI.24.2.023009

Published: 10 March 2015

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available