Sciweavers

231 search results - page 8 / 47
» Computational experience with exterior point algorithms for ...
Sort
View
EMMCVPR
2009
Springer
13 years 4 months ago
Intrinsic Second-Order Geometric Optimization for Robust Point Set Registration without Correspondence
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
Dirk Breitenreicher, Christoph Schnörr
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
ICCV
2005
IEEE
14 years 9 days ago
Robust Point Matching for Two-Dimensional Nonrigid Shapes
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
Yefeng Zheng, David S. Doermann
CP
2008
Springer
13 years 8 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
RTSS
2003
IEEE
13 years 12 months ago
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
Dakai Zhu, Daniel Mossé, Rami G. Melhem