An Effective Membership Probability Representation for Point Set Registration
نویسندگان
چکیده
منابع مشابه
Stochastic Optimization for Rigid Point Set Registration
In this paper we propose a new method for pairwise rigid point set registration. We pay special attention to noise robustness, outlier resistance and global optimal alignment. The problem of registering two point clouds in space is converted to a minimization of a nonlinear cost function. We propose a cost function that aims to reduce the impact of noise and outliers. Its definition is based on...
متن کاملDensity Adaptive Point Set Registration
Probabilistic methods for point set registration havedemonstrated competitive results in recent years. Thesetechniques estimate a probability distribution model of thepoint clouds. While such a representation has shownpromise, it is highly sensitive to variations in the den-sity of 3D points. This fundamental problem is primar-ily caused by changes in the sensor location...
متن کاملAffine iterative closest point algorithm for point set registration
Article history: Received 24 April 2009 Received in revised form 15 January 2010 Available online 25 January 2010 Communicated by Y. Liu
متن کاملSmooth point-set registration using neighboring constraints
We present an approach for Maximum Likelihood estimation of correspondence and alignment parameters that benefits from the representational skills of graphs. We pose the problem as one of mixture modelling within the framework of the Expectation-Maximization algorithm. Our mixture model encompasses a Gaussian density to model the point-position errors and a Bernoulli density to model the struct...
متن کاملN-View Point Set Registration: A Comparison
Recently 3 algorithms for registration of multiple partially overlapping point sets have been published by Pennec [11], Stoddart & Hilton [12] and Benjemma & Schmitt [1]. The problem is of particular interest in the building of surface models from multiple range images taken from several viewpoints. In this paper we perform a comparison of these three algorithms with respect to cpu time, ease o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2964840