2012
DOI: 10.1109/tsp.2011.2179539
|View full text |Cite
|
Sign up to set email alerts
|

Kernel Sparse Representation-Based Classifier

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
154
0
1

Year Published

2013
2013
2015
2015

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 300 publications
(155 citation statements)
references
References 34 publications
0
154
0
1
Order By: Relevance
“…The sample membership functions can be got by the rule of fuzzy neighbour [10]: First of all we make up the distance matrix 1 D by the distance between the training samples. Second, we set the second diagonal matrix 1 D to infinity; then by size order matrix of each line, we can get the matrix 2 D , by which K nearest neighbor points and the corresponding category information can be obtained. Finally by (1), the corresponding membership degree matrix P is the priori probability of i th class sample, which is defined as follows:…”
Section: A Two-dimensional Fuzzy Basic Idea Of Kernel Principal Compmentioning
confidence: 99%
See 1 more Smart Citation
“…The sample membership functions can be got by the rule of fuzzy neighbour [10]: First of all we make up the distance matrix 1 D by the distance between the training samples. Second, we set the second diagonal matrix 1 D to infinity; then by size order matrix of each line, we can get the matrix 2 D , by which K nearest neighbor points and the corresponding category information can be obtained. Finally by (1), the corresponding membership degree matrix P is the priori probability of i th class sample, which is defined as follows:…”
Section: A Two-dimensional Fuzzy Basic Idea Of Kernel Principal Compmentioning
confidence: 99%
“…Face recognition has become an important research direction of biometrics, face feature description is one of the key steps [1], mainly by extracting the effective face identification and the design of complex classifier [2]. Principal component analysis (PCA) [3] and two dimensional principal component analysis of (2DPCA) [4] are both the linear feature extraction method of minimum square error sense.…”
Section: Introductionmentioning
confidence: 99%
“…According to [1] the classifier shows the good performance results on face image data in which they combined the result of machine leaning and compressed sensing. This paper overcomes the drawback of sparse representation classifier.…”
Section: Related Workmentioning
confidence: 99%
“…Several other methods have also been proposed that essentially exploit the non-linear structure of data by sparse coding in the feature space [12], [13]. In [14], Yuan and Yan propose a multi-task joint sparse representation for visual recognition.…”
Section: Introductionmentioning
confidence: 99%
“…Their method is formulated as the solution to the problem of multitask least squares regression problem with ℓ 1,2 mixed-norm regularization. In [13], Zhang et al propose a kernel version of the sparse representation-based classification algorithm which was originally proposed for robust face recognition [15]. The optimization approach presented in [11] is purely generative.…”
Section: Introductionmentioning
confidence: 99%