2015
DOI: 10.1016/j.neucom.2015.03.071
|View full text |Cite
|
Sign up to set email alerts
|

Discriminative dictionary learning via Fisher discrimination K-SVD algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 48 publications
(15 citation statements)
references
References 29 publications
0
15
0
Order By: Relevance
“…DL on the other hand is to learn a good dictionary from training samples so that a given signal could be well represented; hence the quality of the dictionary is very crucial for efficient SR [4]. The dictionary could be determined by either using all the training samples as the dictionary to code the test samples (e.g., locality-constrained linear coding (LLC) in [5]) or adopting a learned dictionary for the sparse representation for each training sample in the set (e.g., KSVD in [6], Fisher discriminative dictionary learning (FDDL) [7]). Besides, group-centered sparse coding likened to rank minimization problem is used to measure the sparse coefficient of each group by estimating the values of each grouping in [8].…”
Section: Introductionmentioning
confidence: 99%
“…DL on the other hand is to learn a good dictionary from training samples so that a given signal could be well represented; hence the quality of the dictionary is very crucial for efficient SR [4]. The dictionary could be determined by either using all the training samples as the dictionary to code the test samples (e.g., locality-constrained linear coding (LLC) in [5]) or adopting a learned dictionary for the sparse representation for each training sample in the set (e.g., KSVD in [6], Fisher discriminative dictionary learning (FDDL) [7]). Besides, group-centered sparse coding likened to rank minimization problem is used to measure the sparse coefficient of each group by estimating the values of each grouping in [8].…”
Section: Introductionmentioning
confidence: 99%
“…The bandelets introduced by Mallat et al were spatially adapted to better treat images by orienting the regular wavelet atoms along the principal direction of the local area processed [43]. The Method of Optimal Directions (MOD) and K-singular value decomposition (K-SVD) [44,45] are popular dictionary learning algorithms. Fisher discriminative dictionary, using three dictionary training mechanisms, has attracted considerable attention.…”
Section: Sparse Dictionary Constructed Based On Fisher Discriminativementioning
confidence: 99%
“…In the coding phase, training samples are combined together as a dictionary. In recent years, lots of methods for constructing dictionary have appeared, such as FDDL [18], JDDLDR [20] and DKSVD [21] etc. These methods have one thing in common: the dictionary is constructed by a learning algorithm to improve its discrimination ability as much as possible.…”
Section: Transform Domain Sparse Representation-based Classification mentioning
confidence: 99%