scholarly journals A robust algorithm for point set registration using mixture of Gaussians

2005 ◽  
Author(s):  
Bing Jian ◽  
B.C. Vemuri
Keyword(s):  
Robust Algorithm ◽  
Point Set Registration ◽  
Mixture Of Gaussians ◽  
Point Set

Multi-View Image Color Correction Using 3D Point Set Registration

2021 ◽  
Author(s):  
Hyeonwoo Jeong ◽  
Byunghyun Yoon ◽  
Honggu Jeong ◽  
Kang-Sun Choi
Keyword(s):  
Color Correction ◽  
Point Set Registration ◽  
Point Set

A robust non-rigid point set registration method based on inhomogeneous Gaussian mixture models

2017 ◽  
Vol 34 (10) ◽  
pp. 1399-1414 ◽  
Author(s):  
Wanxia Deng ◽  
Huanxin Zou ◽  
Fang Guo ◽  
Lin Lei ◽  
Shilin Zhou ◽  
...  
Keyword(s):  
Mixture Models ◽  
Gaussian Mixture Models ◽  
Gaussian Mixture ◽  
Registration Method ◽  
Point Set Registration ◽  
Point Set

scholarly journals Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Sk Aziz Ali ◽  
Kerem Kahraman ◽  
Christian Theobalt ◽  
Didier Stricker ◽  
Vladislav Golyanik
Keyword(s):  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Point Set Registration ◽  
Point Set

Point set registration for assembly feature pose estimation using simulated annealing nested Gauss-Newton optimization

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Kunyong Chen ◽  
Yong Zhao ◽  
Jiaxiang Wang ◽  
Hongwen Xing ◽  
Zhengjian Dong
Keyword(s):  
Simulated Annealing ◽  
Pose Estimation ◽  
Distance Metric ◽  
Implicit Representation ◽  
Registration Method ◽  
Content Type ◽  
Point Set Registration ◽  
Searching Strategy ◽  
Global Robustness ◽  
Point Set

Purpose This paper aims to propose a fast and robust 3D point set registration method for pose estimation of assembly features with few distinctive local features in the manufacturing process. Design/methodology/approach The distance between the two 3D objects is analytically approximated by the implicit representation of the target model. Specifically, the implicit B-spline surface is adopted as an interface to derive the distance metric. With the distance metric, the point set registration problem is formulated into an unconstrained nonlinear least-squares optimization problem. Simulated annealing nested Gauss-Newton method is designed to solve the non-convex problem. This integration of gradient-based optimization and heuristic searching strategy guarantees both global robustness and sufficient efficiency. Findings The proposed method improves the registration efficiency while maintaining high accuracy compared with several commonly used approaches. Convergence can be guaranteed even with critical initial poses or in partial overlapping conditions. The multiple flanges pose estimation experiment validates the effectiveness of the proposed method in real-world applications. Originality/value The proposed registration method is much more efficient because no feature estimation or point-wise correspondences update are performed. At each iteration of the Gauss–Newton optimization, the poses are updated in a singularity-free format without taking the derivatives of a bunch of scalar trigonometric functions. The advantage of the simulated annealing searching strategy is combined to improve global robustness. The implementation is relatively straightforward, which can be easily integrated to realize automatic pose estimation to guide the assembly process.

scholarly journals Non-Rigid Point Set Registration via Adaptive Weighted Objective Function

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 75947-75960 ◽  
Author(s):  
Changcai Yang ◽  
Yizhang Liu ◽  
Xingyu Jiang ◽  
Zejun Zhang ◽  
Lifang Wei ◽  
...  
Keyword(s):  
Objective Function ◽  
Point Set Registration ◽  
Point Set
Sign in / Sign up

Export Citation Format

Share Document