Sciweavers

873 search results - page 48 / 175
» Using Top-Points as Interest Points for Image Matching
Sort
View
ICRA
2010
IEEE
108views Robotics» more  ICRA 2010»
13 years 7 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
2005
IEEE
14 years 10 months ago
Shape Matching and Object Recognition Using Low Distortion Correspondences
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
Alexander C. Berg, Tamara L. Berg, Jitendra Malik
CGI
2009
IEEE
14 years 20 days ago
Visual analytics of time dependent 2D point clouds
Two dimensional point data can be considered one of the most basic, yet one of the most ubiquitous data types arising in a wide variety of applications. The basic scatter plot app...
Tatiana von Landesberger, Sebastian Bremm, Peyman ...
ISBI
2007
IEEE
14 years 3 months ago
Harp Tracking Refinement Using Seeded Region Growing
Tagged magnetic resonance (MR) imaging makes it possible to image the motion of tissues such as the muscles found in the heart and tongue. The harmonic phase (HARP) method largely...
Xiaofeng Liu, Emi Murano, Maureen C. Stone, Jerry ...
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
14 years 2 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...