2009
DOI: 10.1016/j.sigpro.2009.04.001
|View full text |Cite
|
Sign up to set email alerts
|

KFCE: A dictionary generation algorithm for sparse representation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…This method involves iterative computation of Singular Value Decomposition (SVD) of residual matrix as well as computation of inverse of the obtained matrix. In a different work, Xie and Feng (2009) propose the Kernel Fuzzy Codebook Estimation (KFCE) algorithm, which integrates the distance kernel trick with fuzzy clustering algorithm to obtain the basis matrix . A major shortcoming that is common to all the aforementioned techniques is that they require complete data to construct the basis matrix, which restricts their usage in applications with missing data.…”
Section: Introductionmentioning
confidence: 99%
“…This method involves iterative computation of Singular Value Decomposition (SVD) of residual matrix as well as computation of inverse of the obtained matrix. In a different work, Xie and Feng (2009) propose the Kernel Fuzzy Codebook Estimation (KFCE) algorithm, which integrates the distance kernel trick with fuzzy clustering algorithm to obtain the basis matrix . A major shortcoming that is common to all the aforementioned techniques is that they require complete data to construct the basis matrix, which restricts their usage in applications with missing data.…”
Section: Introductionmentioning
confidence: 99%