165 search results - page 6 / 33 » Dominant Sets and Pairwise Clustering |
ECCV
2010
Springer
14 years 1 days ago
2010
Springer
Abstract. This paper presents a simple, yet effective method of building a codebook for pairs of spatially close SIFT descriptors. Integrating such codebook into the popular bag-o...
ICCV
2005
IEEE
14 years 9 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...
BMVC
2010
13 years 5 months ago
2010
Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clusterin...
IDA
2009
Springer
14 years 1 months ago
2009
Springer
One of the most important and challenging questions in the area of clustering is how to choose the best-fitting algorithm and parameterization to obtain an optiml clustering for t...
ESA
2004
Springer
14 years 11 days ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...