Sciweavers

11 search results - page 1 / 3
» What Is a Good Nearest Neighbors Algorithm for Finding Simil...
Sort
View
ECCV
2008
Springer
14 years 6 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
11
Voted
ICASSP
2008
IEEE
13 years 11 months ago
Adaptable K-nearest neighbor for image interpolation
A variant of the k-nearest neighbor algorithm is proposed for image interpolation. Instead of using a static volume or static k, the proposed algorithm determines a dynamic k that...
Kenta S. Ni, Truong Q. Nguyen
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 2 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
CVPR
2008
IEEE
14 years 7 months ago
The patch transform and its applications to image editing
We introduce the patch transform, where an image is broken into non-overlapping patches, and modifications or constraints are applied in the "patch domain". A modified i...
Taeg Sang Cho, Moshe Butman, Shai Avidan, William ...
CIVR
2008
Springer
204views Image Analysis» more  CIVR 2008»
13 years 6 months ago
Image clustering based on a shared nearest neighbors approach for tagged collections
Browsing and finding pictures in large-scale and heterogeneous collections is an important issue, most particularly for online photo sharing applications. Since such services know...
Pierre-Alain Moëllic, Jean-Emmanuel Haugeard,...