13 search results - page 3 / 3 » Graph Partitioning by Spectral Rounding: Applications in Ima... |
KDD
2010
ACM
13 years 8 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
CVPR
2000
IEEE
13 years 9 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
PAMI
2010
13 years 3 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...