arrow
Return

Locality-sensitive dictionary learning for sparse representation based classification

delete2013-05-01
delete98
PRE
AI
C
Chia-Po Wei
Y
Yu-Wei Chao
Y
Yi-Ren Yeh
Y
Yu-Chiang Frank Wang *
DOI:10.1016/j.patcog.2012.11.014delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Motivated by image reconstruction, sparse representation based classification (SRC) has been shown to be an effective method for applications like face recognition. In this paper, we propose a locality-sensitive dictionary learning algorithm for SRC, in which the designed dictionary is able to preserve local data structure, resulting in improved image classification. During the dictionary update and sparse coding stages in the proposed algorithm, we provide closed-form solutions and enforce the data locality constraint throughout the learning process. In contrast to previous dictionary learning approaches utilizing sparse representation techniques, which did not (or only partially) take data locality into consideration, our algorithm is able to produce a more representative dictionary and thus achieves better performance. We conduct experiments on databases designed for face and handwritten digit recognition. For such reconstruction-based classification problems, we will confirm that our proposed method results in better or comparable performance as state-of-the-art SRC methods do, while less training time for dictionary learning can be achieved. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Sparse representation
Dictionary learning
Data locality
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

A
academia sinica - taiwan
Scholars:
1.9W
Papers: 1.6W
Citations: 17
U
university of michigan system
Scholars:
9.1W
Papers: 8.6W
Citations: 133