13 search results - page 2 / 3 » Graph Partitioning by Spectral Rounding: Applications in Ima... |
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
MM
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
ICIP
2007
IEEE
13 years 11 months ago
2007
IEEE
Many natural textures comprise structural patterns and show strong self-similarity. We use affine symmetry to segment an image into self-similar regions; that is a patch of textu...