190 search results - page 3 / 38 » Constraint-Based Subspace Clustering. |
SDM
2008
SIAM
13 years 7 months ago
2008
SIAM
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
We combine linear discriminant analysis (LDA) and K-means clustering into a coherent framework to adaptively select the most discriminative subspace. We use K-means clustering to ...
SADM
2008
13 years 5 months ago
2008
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
ICCV
2009
IEEE
13 years 3 months ago
2009
IEEE
Perceiving dynamic scenes of rigid bodies, through affine projections of moving 3D point clouds, boils down to clustering the rigid motion subspaces supported by the points' ...
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...