Efficient dense subspace clustering
In this paper, we tackle the problem of clustering data points drawn from a union of linear (or affine) subspaces. To this end, we introduce an efficient subspace clustering algorithm that estimates dense connections between the points lying in the same subspace. In particular, instead of following the standard compressive sensing approach, we formulate subspace clustering as a Frobenius norm minimization problem, which inherently yields denser con- nections between the data points. While in...[Show more]
|Collections||ANU Research Publications|
|Source:||2014 IEEE Winter Conference on Applications of Computer Vision, WACV 2014|
|01_Ji_Efficient_dense_subspace_2014.pdf||886.66 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.