350 search results - page 32 / 70 » Semidefinite spectral clustering |
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
A two microphone direction of arrival (DOA) estimation technique for multiple speech sources is developed which exploits speech specific properties, namely sparsity in time-frequ...
ICPR
2008
IEEE
15 years 4 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
14 years 11 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
15 years 10 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...