K-SVD

Known as: KSVD 
In applied mathematics, K-SVD is a dictionary learning algorithm for creating a dictionary for sparse representations, via a singular value… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2013
Highly Cited
2013
The synthesis-based sparse representation model for signals has drawn considerable interest in the past decade. Such a model… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to… (More)
  • figure 1
  • table 4
  • table 1
  • table 2
  • table 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e… (More)
  • table 1
  • table 3
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The K-SVD algorithm is a highly effective method of training overcomplete dictionaries for sparse signal representation. In this… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The use of sparse representations in signal and image processing is gradually increasing in the past several years. Obtaining an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete… (More)
  • figure 2
  • figure 4
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In recent years there is a growing interest in the study of sparse representation for signals. Using an overcomplete dictionary… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In recent years there is a growing interest in the study of sparse representation for signals. Using an overcomplete dictionary… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?