Sciweavers

30 search results - page 3 / 6
» Fast Wide Baseline Matching for Visual Navigation
Sort
View
CASCON
1996
154views Education» more  CASCON 1996»
13 years 7 months ago
Navigating the textual redundancy web in legacy source
Understanding the source, data, and documentation files associated with legacy systems in preparation for maintenance or reengineering is an increasingly important problem for man...
J. Howard Johnson
CVPR
2005
IEEE
14 years 7 months ago
Randomized Trees for Real-Time Keypoint Recognition
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
Vincent Lepetit, Pascal Lagger, Pascal Fua
ICRA
2010
IEEE
267views Robotics» more  ICRA 2010»
13 years 4 months ago
FLIRT - Interest regions for 2D range data
— Local image features are used for a wide range of applications in computer vision and range imaging. While there is a great variety of detector-descriptor combinations for imag...
Gian Diego Tipaldi, Kai Oliver Arras
RAS
2008
139views more  RAS 2008»
13 years 5 months ago
Unsupervised identification of useful visual landmarks using multiple segmentations and top-down feedback
In this paper, we tackle the problem of unsupervised selection and posterior recognition of visual landmarks in images sequences acquired by an indoor mobile robot. This is a high...
Pablo Espinace, Daniel Langdon, Alvaro Soto
CVPR
2008
IEEE
14 years 7 months ago
Efficient sequential correspondence selection by cosegmentation
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
Jan Cech, Jiri Matas, Michal Perdoch