Sciweavers

52 search results - page 10 / 11
» Approximate nearest neighbors and the fast Johnson-Lindenstr...
Sort
View
ECCV
2006
Springer
14 years 8 months ago
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
Liran Goshen, Ilan Shimshoni
ICRA
2007
IEEE
107views Robotics» more  ICRA 2007»
14 years 17 days ago
Real-time keypoints matching: application to visual servoing
Abstract— Many computer vision problems such as recognition, image retrieval, and tracking require matching two images. Currently, ones try to find as reliable as possible match...
Thi-Thanh-Hai Tran, Éric Marchand
ICCV
2003
IEEE
14 years 8 months ago
Minimum Risk Distance Measure for Object Recognition
Recently, the optimal distance measure for a given object discrimination task under the nearest neighbor framework was derived [1]. For ease of implementation and efficiency consi...
Shyjan Mahamud, Martial Hebert
IJCV
2010
194views more  IJCV 2010»
13 years 4 months ago
Improving Bag-of-Features for Large Scale Image Search
This article improves recent methods for large scale image search. We first analyze the bag-of-features approach in the framework of approximate nearest neighbor search. This lea...
Herve Jegou, Matthijs Douze, Cordelia Schmid
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 6 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...