Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Among the most dangerous cancers, there is the Melanoma that affects millions of people. As this is a type of malignant pigmented… 
2016
2016
In this paper, we propose a discriminative dictionary learning framework for vehicle classification to improve the classification… 
2015
2015
We present a locality preserving K-SVD (LP-KSVD) algorithm for joint dictionary and classifier learning, and further incorporate… 
2015
2015
This paper proposes a content adaptive transform based on singular value decomposition (SVD) with HEVC intra coding. In the… 
2014
2014
Semantic search engines aim at improving conventional search with semantic information, or meta-data, on the data searched for… 
2013
2013
Non-rigid 3D shape recognition is an important and challenging research topic in computer vision and pattern recognition. This… 
2010
2010
Introduction: Statistical parametric mapping (SPM) is widely used for the statistical analysis of brain activity with fMRI… 
2008
2008
The use of sparse representations in signal processing is gradually increasing in the past several years. In a previous work we… 
2007
2007
Sparse representation of images has been a recent area of growing interest. It finds applications in many problems in image…