2014 IEEE International Conference on Image Processing (ICIP) 2014
DOI: 10.1109/icip.2014.7026054
|View full text |Cite
|
Sign up to set email alerts
|

Analysis sparse coding models for image-based classification

Abstract: Data-driven sparse models have been shown to give superior performance for image classification tasks. Most of these works depend on learning a synthesis dictionary and the corresponding sparse code for recognition. However in recent years, an alternate analysis coding based framework (also known as co-sparse model) has been proposed for learning sparse models. In this paper, we study this framework for image classification. We demonstrate that the proposed approach is robust and efficient, while giving a comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
35
0
2

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 55 publications
(37 citation statements)
references
References 19 publications
0
35
0
2
Order By: Relevance
“…where Y is the matrix containing all the input images, W denotes the coefficient matrix that is initialized as a label matrix of the training samples, and T is the parameter used for constricted sparsity. To ensure that the solution is solvable and well-regularized, the set Γ is constrained to be unity row-wise norm or relatively small Frobenius norm [26].…”
Section: Analysis Dictionary Learningmentioning
confidence: 99%
See 1 more Smart Citation
“…where Y is the matrix containing all the input images, W denotes the coefficient matrix that is initialized as a label matrix of the training samples, and T is the parameter used for constricted sparsity. To ensure that the solution is solvable and well-regularized, the set Γ is constrained to be unity row-wise norm or relatively small Frobenius norm [26].…”
Section: Analysis Dictionary Learningmentioning
confidence: 99%
“…for image representation and denoising. Shekhar [26] made improvements by adding a full-rank constraint to the analysis dictionary. Meanwhile, local feature based dictionary learning methods have been also developed to enhance the performance of collaborative representation based pattern classification.…”
Section: Introductionmentioning
confidence: 99%
“…To evaluate our proposed DCADL, we carry out a comparative study with the following methods: The first one is ADL+SVM [16], which serves as a baseline. LC-KSVD [6] is a state-of-the-art SDL.…”
Section: Four Widely Used Visual Classification Datasets Extendedmentioning
confidence: 99%
“…To the best of our knowledge, few attempts have been carried out for task-driven ADL. For example, in [27], Shekhar et al [27] learned an analysis dictionary and subsequently trained SVM for the digital and face recognition tasks. Their results demonstrate that ADL is more stable than SDL under noise and occlusion, and achieves a competitive performance.…”
Section: Introductionmentioning
confidence: 99%