Sciweavers

11 search results - page 2 / 3
» What Is a Good Nearest Neighbors Algorithm for Finding Simil...
Sort
View
TIP
2011
217views more  TIP 2011»
13 years 16 days ago
Contextual Object Localization With Multiple Kernel Nearest Neighbor
—Recently, many object localization models have shown that incorporating contextual cues can greatly improve accuracy over using appearance features alone. Therefore, many of the...
Brian McFee, Carolina Galleguillos, Gert R. G. Lan...
CVPR
2007
IEEE
14 years 7 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
CACM
2008
65views more  CACM 2008»
13 years 4 months ago
Scene completion using millions of photographs
What can you do with a million images? In this paper we present a new image completion algorithm powered by a huge database of photographs gathered from the Web. The algorithm pat...
James Hays, Alexei A. Efros
CVPR
2004
IEEE
14 years 7 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
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...
Kristen Grauman, Trevor Darrell
CIVR
2008
Springer
138views Image Analysis» more  CIVR 2008»
13 years 7 months ago
MyPlaces: detecting important settings in a visual diary
We describe a novel approach to identifying specific settings in large collections of passively captured images corresponding to a visual diary. An algorithm developed for setting...
Michael Blighe, Noel E. O'Connor