Efficient and Robust Registration on the 3D Special Euclidean Group

• URL: http://arxiv.org/abs/1904.05519v3
• Date: Fri, 22 Nov 2024 22:57:30 GMT
• Title: Efficient and Robust Registration on the 3D Special Euclidean Group
• Authors: Uttaran Bhattacharya, Venu Madhav Govindu,
• Abstract summary: We present an accurate, robust and fast method for registration of 3D scans. We exploit the geometric properties of Lie groups as well as the robustness afforded by an iteratively reweighted least squares optimization.
• Score: 11.805432720871263
• License:
• Abstract: We present an accurate, robust and fast method for registration of 3D scans. Our motion estimation optimizes a robust cost function on the intrinsic representation of rigid motions, i.e., the Special Euclidean group $\mathbb{SE}(3)$. We exploit the geometric properties of Lie groups as well as the robustness afforded by an iteratively reweighted least squares optimization. We also generalize our approach to a joint multiview method that simultaneously solves for the registration of a set of scans. We demonstrate the efficacy of our approach by thorough experimental validation. Our approach significantly outperforms the state-of-the-art robust 3D registration method based on a line process in terms of both speed and accuracy. We also show that this line process method is a special case of our principled geometric solution. Finally, we also present scenarios where global registration based on feature correspondences fails but multiview ICP based on our robust motion estimation is successful.

Related papers

• DynaWeightPnP: Toward global real-time 3D-2D solver in PnP without correspondences [7.191124861153032]
  This paper addresses a special Perspective-n-Point (Weight) problem: estimating the optimal pose to align 3D and 2D shapes in real-time without correspondences. Experiments were conducted on a typical case, that is, a 3D-2D centerline registration task within Endovascular Image-Guided Interventions. Results demonstrated that the proposed algorithm achieves registration processing rates of 60 Hz (without post-refinement) and 31 (with post-refinement) with competitive accuracy comparable to existing methods.
  arXiv  Detail & Related papers  (2024-09-27T05:31:33Z)
• Uncertainty-Aware Testing-Time Optimization for 3D Human Pose Estimation [68.75387874066647]
  We propose an Uncertainty-Aware testing-time optimization framework for 3D human pose estimation. Our approach outperforms the previous best result by a large margin of 4.5% on Human3.6M.
  arXiv  Detail & Related papers  (2024-02-04T04:28:02Z)
• Modeling Continuous Motion for 3D Point Cloud Object Tracking [54.48716096286417]
  This paper presents a novel approach that views each tracklet as a continuous stream. At each timestamp, only the current frame is fed into the network to interact with multi-frame historical features stored in a memory bank. To enhance the utilization of multi-frame features for robust tracking, a contrastive sequence enhancement strategy is proposed.
  arXiv  Detail & Related papers  (2023-03-14T02:58:27Z)
• GraphReg: Dynamical Point Cloud Registration with Geometry-aware Graph Signal Processing [0.0]
  This study presents a high-accuracy, efficient, and physically induced method for 3D point cloud registration. We explore geometry aware rigid-body dynamics to regulate the particle (point) motion, which results in more precise and robust registration. Results demonstrate that our proposed method outperforms state-of-the-art approaches in terms of accuracy and is more suitable for registering large-scale point clouds.
  arXiv  Detail & Related papers  (2023-02-02T14:06:46Z)
• Multiway Non-rigid Point Cloud Registration via Learned Functional Map Synchronization [105.14877281665011]
  We present SyNoRiM, a novel way to register multiple non-rigid shapes by synchronizing the maps relating learned functions defined on the point clouds. We demonstrate via extensive experiments that our method achieves a state-of-the-art performance in registration accuracy.
  arXiv  Detail & Related papers  (2021-11-25T02:37:59Z)
• Dynamic Iterative Refinement for Efficient 3D Hand Pose Estimation [87.54604263202941]
  We propose a tiny deep neural network of which partial layers are iteratively exploited for refining its previous estimations. We employ learned gating criteria to decide whether to exit from the weight-sharing loop, allowing per-sample adaptation in our model. Our method consistently outperforms state-of-the-art 2D/3D hand pose estimation approaches in terms of both accuracy and efficiency for widely used benchmarks.
  arXiv  Detail & Related papers  (2021-11-11T23:31:34Z)
• Boosting RANSAC via Dual Principal Component Pursuit [24.942079487458624]
  We introduce Dual Principal Component Pursuit (DPCP) as a robust subspace learning method with strong theoretical support and efficient algorithms. Experiments on estimating two-view homographies, fundamental and essential matrices, and three-view homographic tensors show that our approach consistently has higher accuracy than state-of-the-art alternatives.
  arXiv  Detail & Related papers  (2021-10-06T17:04:45Z)
• Fast and Robust Certifiable Estimation of the Relative Pose Between Two Calibrated Cameras [0.0]
  Relative Pose problem (RPp) for cameras aims to the relative orientation translation (pose) given a set of pair-wise rotations between two cameras. In this paper, we introduce a family of certifiers that is shown to increase the ratio of detected optimal solutions. We prove through synthetic and real data that the proposed framework provides a fast and robust relative pose estimation.
  arXiv  Detail & Related papers  (2021-01-21T10:07:05Z)
• Canny-VO: Visual Odometry with RGB-D Cameras based on Geometric 3D-2D Edge Alignment [85.32080531133799]
  This paper reviews the classical problem of free-form curve registration and applies it to an efficient RGBD visual odometry system called Canny-VO. Two replacements for the distance transformation commonly used in edge registration are proposed: Approximate Nearest Neighbour Fields and Oriented Nearest Neighbour Fields. 3D2D edge alignment benefits from these alternative formulations in terms of both efficiency and accuracy.
  arXiv  Detail & Related papers  (2020-12-15T11:42:17Z)
• Robust Uncertainty-Aware Multiview Triangulation [20.02647320786556]
  We propose a robust and efficient method for multiview triangulation and uncertainty estimation. Our contribution is threefold: First, we propose an outlier rejection scheme using two-view RANSAC with the midpoint method. Second, we compare different local optimization methods for refining the initial solution and the inlier set. Third, we model the uncertainty of a triangulated point as a function of three factors: the number of cameras, the mean reprojection error and the maximum parallax angle.
  arXiv  Detail & Related papers  (2020-08-04T00:47:42Z)
• Learning 3D-3D Correspondences for One-shot Partial-to-partial Registration [66.41922513553367]
  We show that learning-based partial-to-partial registration can be achieved in a one-shot manner. We propose an Optimal Transport layer able to account for occluded points thanks to the use of bins. The resulting OPRNet framework outperforms the state of the art on standard benchmarks.
  arXiv  Detail & Related papers  (2020-06-08T12:35:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.