Sciweavers

263 search results - page 9 / 53
» Efficient Variants of the ICP Algorithm
Sort
View
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
14 years 11 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
BMCBI
2010
139views more  BMCBI 2010»
14 years 12 months ago
A global optimization algorithm for protein surface alignment
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
Paola Bertolazzi, Concettina Guerra, Giampaolo Liu...
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
15 years 3 months ago
An Efficient LLL Gram Using Buffered Transformations
In this paper we introduce an improved variant of the LLL algorithm. Using the Gram matrix to avoid expensive correction steps necessary in the Schnorr-Euchner algorithm and introd...
Werner Backes, Susanne Wetzel
ICIP
2005
IEEE
15 years 5 months ago
Automatic registration of 3D datasets using Gaussian fields
—In this paper we introduce a new 3D automatic registration method based on Gaussian fields and energy minimization. The method defines a simple ∞ C energy function, which is c...
Faysal Boughorbel, Andreas Koschan, Mongi A. Abidi
ICRA
2010
IEEE
259views Robotics» more  ICRA 2010»
14 years 9 months ago
RANSAC matching: Simultaneous registration and segmentation
The iterative closest points (ICP) algorithm is widely used for ego-motion estimation in robotics, but subject to bias in the presence of outliers. We propose a random sample conse...
Shao-Wen Yang, Chieh-Chih Wang, Chun-Hua Chang