190 search results - page 8 / 38 » Constraint-Based Subspace Clustering. |
ICPP
2000
IEEE
14 years 4 days ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
ICA
2004
Springer
14 years 1 months ago
2004
Springer
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
AUSAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a novel algorithm called DBSC, which finds subspace clusters in numerical datasets based on the concept of ”dependency”. This algorithm employs a depth-...
ICCV
2009
IEEE
15 years 21 days ago
2009
IEEE
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...
ISBI
2006
IEEE
14 years 8 months ago
2006
IEEE
Given a volume of cardiac MR images, we consider the problem of segmenting the heart based on intensity and dynamics. We first segment the heart and the chest from the background ...