.png){kind=icon}
返回
Adaptive weighted dictionary representation using anchor graph for subspace clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2024.110350.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Samples are commonly represented as sparse vectors in many dictionary representation algorithms. However, this method may result in loss of discriminatory information. Moreover, a redundant dictionary can increase the computational complexity of the algorithm. To tackle these challenges, we propose a novel method named Adaptive Weighted Dictionary Representation using Anchor Graph for Subspace Clustering (AWDR). First, AWDR constructs an anchor graph that encodes the classification information and establishes accurate connectivity components between anchors and clusters, thereby fully utilizing the discriminative information of the original samples. In addition, AWDR learns a complete -dictionary in the subspace to eliminate the noise and out -of -sample effects of the original sample space, while also improving computational efficiency. Finally, AWDR computes the coefficients for the samples in an adaptively weighted manner to find discriminative representation of the samples from the dictionary. Extensive experiments on real -world datasets demonstrate that our method is effective and efficient compared to the state-of-the-art methods.
Keyword:
Dictionary representation
Subspace clustering
Anchor graph
Projection learning
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
The FERET database and evaluation procedure for face-recognition algorithms人脸识别算法的FERET数据库和评估程序
PREAI
分享收藏Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance共识锚引导的无参数多视图子空间快速聚类
PREAI
分享收藏Learning a Low Tensor-Train Rank Representation for Hyperspectral Image Super-Resolution高光谱图像超分辨率的低张量训练秩表示学习
PREAI
分享收藏Geometric imbalanced deep learning with feature scaling and boundary sample mining.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容