28 search results - page 4 / 6 » Fast nearest neighbor retrieval for bregman divergences |
86
Voted
ETVC
2008
14 years 11 months ago
2008
Abstract. This paper presents a framework to define an objective measure of the similarity (or dissimilarity) between two images for image processing. The problem is twofold: 1) de...
100
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
During this talk, I will introduce a novel family of contextual measures of similarity between distributions: the similarity between two distributions q and p is measured in the co...
111
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
ICDE
2006
IEEE
15 years 3 months ago
2006
IEEE
Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, an efficient algorithm is crucial to quickly cat...
105
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...