.png){kind=icon}
返回
Subspace segmentation by dense block and sparse representation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2015.11.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Subspace segmentation is a fundamental topic in computer vision and machine learning. However, the success of many popular methods is about independent subspace segmentation instead of the more flexible and realistic disjoint subspace segmentation. Focusing on the disjoint subspaces, we provide theoretical and empirical evidence of inferior performance for popular algorithms such as LRR. To solve these problems, we propose a novel dense block and sparse representation (DBSR) for subspace segmentation and provide related theoretical results. DBSR minimizes a combination of the 1,1-norm and maximum singular value of the representation matrix, leading to a combination of dense block and sparsity. We provide experimental results for synthetic and benchmark data showing that our method can outperform the state-of-the-art. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Disjoint
LRR
Subspace segmentation
2-norm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
引用论文
Abstract 22: Late Functional Improvement in Acute Ischemic Stroke Patients: Pooled Analysis of Three Multicenter Clinical Trials.png)
Stroke
StrokeIF0
PREAI
分享收藏Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
PREAI
分享收藏The National Natural Landmark Program: A Natural Areas Protection Technique for the 1980s and Beyond
OAAI
OAAI分享收藏
查看更多内容