Title
Subspace segmentation with a large number of subspaces using infinity norm minimization.
Abstract
•We find an observation important to the LSN subspace segmentation.•We provide the theoretical support of the mentioned observation.•Our paper is the first to adopt infinite norm in subspace segmentation.•The computational complexity of our ADM algorithm is lower than O(n3).•Our method achieve the state-of-the-art results in extensive experiments.
Year
DOI
Venue
2019
10.1016/j.patcog.2018.12.025
Pattern Recognition
Keywords
Field
DocType
Subspace segmentation,Large subspace number,Infinity norm,Spectral-clustering based methods
Diagonal,Uniform norm,Subspace segmentation,Pattern recognition,Subspace topology,Segmentation,Outlier,Linear subspace,Minification,Artificial intelligence,Mathematics
Journal
Volume
Issue
ISSN
89
1
0031-3203
Citations 
PageRank 
References 
4
0.39
39
Authors
6
Name
Order
Citations
PageRank
Kewei Tang1996.72
Zhixun Su2416.61
Yang Liu3182.17
Wei Jiang440.73
Jie Zhang51127.99
Xiyan Sun677.51