Hits:

Indexed by:Journal Papers

Date of Publication:2016-03-01

Journal:NEURAL NETWORKS

Included Journals:SCIE、EI、PubMed、Scopus

Volume:75

Page Number:66-76

ISSN No.:0893-6080

Key Words:Disjoint; LRR; Subspace segmentation; 2-norm

Abstract: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.