348 search results - page 30 / 70 » A Tutorial on Spectral Clustering |
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
BMVC
2000
13 years 8 months ago
2000
This paper presents a spectral method for identifying multiple texture planes. We commence by showing how pairs of spectral peaks can be used to make direct estimates of the slant...
KDD
2005
ACM
14 years 7 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
ISMIR
2004
Springer
14 years 22 days ago
2004
Springer
In order to map the spectral characteristics of the large variety of sounds a musical instrument may produce, different notes were performed and sampled in several intensity level...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We introduce a class of geodesic distances and extend the K-means clustering algorithm to employ this distance metric. Empirically, we demonstrate that our geodesic K-means algori...