Sciweavers

283 search results - page 22 / 57
» Versatile spectral methods for point set matching
Sort
View
ICPR
2010
IEEE
13 years 10 months ago
Quasi-Dense Wide Baseline Matching for Three Views
This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...
Pekka Koskenkorva, Juho Kannala, Sami Sebastian Br...
VISUALIZATION
2003
IEEE
14 years 20 days ago
A Frequency-Sensitive Point Hierarchy for Images and Volumes
This paper introduces a method for converting an image or volume sampled on a regular grid into a space-efficient irregular point hierarchy. The conversion process retains the ori...
Tomihisa Welsh, Klaus Mueller
ICRA
2010
IEEE
108views Robotics» more  ICRA 2010»
13 years 5 months ago
Robust place recognition for 3D range data based on point features
Abstract— The problem of place recognition appears in different mobile robot navigation problems including localization, SLAM, or change detection in dynamic environments. Wherea...
Bastian Steder, Giorgio Grisetti, Wolfram Burgard
CVPR
2009
IEEE
15 years 2 months ago
Shape Classification Through Structured Learning of Matching Measures
Many traditional methods for shape classification involve establishing point correspondences between shapes to produce matching scores, which are in turn used as similarity meas...
Longbin Chen, Julian John McAuley, Rogério ...
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...