31 search results - page 4 / 7 » Kernel k-means: spectral clustering and normalized cuts |
146
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
151
click to vote
MM
2004
ACM
15 years 11 months ago
2004
ACM
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
189
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
152
click to vote
CVPR
2008
IEEE
16 years 15 days ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
197
click to vote
Source Code
The code is a (good, in my opinion) implementation of a segmentation engine based on normalised cuts (a spectral clustering algorithm) and a pixel affinity matrix calculation algor...