Practical, Fast and Robust Point Cloud Registration for 3D Scene Stitching and Object Localization

• URL: http://arxiv.org/abs/2111.04228v1
• Date: Mon, 8 Nov 2021 01:49:04 GMT
• Title: Practical, Fast and Robust Point Cloud Registration for 3D Scene Stitching and Object Localization
• Authors: Lei Sun
• Abstract summary: 3D point cloud registration is a fundamental problem in remote sensing, photogrammetry, robotics and geometric computer vision. We propose a novel, fast and highly robust solution, named VOCRA, for the point cloud registration problem with extreme outlier rates. We show that our solver VOCRA is robust against over 99% outliers and more time-efficient than the state-of-the-art competitors.
• Score: 6.8858952804978335
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: 3D point cloud registration ranks among the most fundamental problems in remote sensing, photogrammetry, robotics and geometric computer vision. Due to the limited accuracy of 3D feature matching techniques, outliers may exist, sometimes even in very large numbers, among the correspondences. Since existing robust solvers may encounter high computational cost or restricted robustness, we propose a novel, fast and highly robust solution, named VOCRA (VOting with Cost function and Rotating Averaging), for the point cloud registration problem with extreme outlier rates. Our first contribution is to employ the Tukey's Biweight robust cost to introduce a new voting and correspondence sorting technique, which proves to be rather effective in distinguishing true inliers from outliers even with extreme (99%) outlier rates. Our second contribution consists in designing a time-efficient consensus maximization paradigm based on robust rotation averaging, serving to seek inlier candidates among the correspondences. Finally, we apply Graduated Non-Convexity with Tukey's Biweight (GNC-TB) to estimate the correct transformation with the inlier candidates obtained, which is then used to find the complete inlier set. Both standard benchmarking and realistic experiments with application to two real-data problems are conducted, and we show that our solver VOCRA is robust against over 99% outliers and more time-efficient than the state-of-the-art competitors.

Related papers

• Scalable 3D Registration via Truncated Entry-wise Absolute Residuals [65.04922801371363]
  A $3$D registration approach can process more than ten million ($107$) point pairs with over $99%$ random outliers. We call our method TEAR, as it involves minimizing an outlier-robust loss that computes Truncated Entry-wise Absolute Residuals.
  arXiv  Detail & Related papers  (2024-04-01T04:43:39Z)
• Outlier Robust Adversarial Training [57.06824365801612]
  We introduce Outlier Robust Adversarial Training (ORAT) in this work. ORAT is based on a bi-level optimization formulation of adversarial training with a robust rank-based loss function. We show that the learning objective of ORAT satisfies the $mathcalH$-consistency in binary classification, which establishes it as a proper surrogate to adversarial 0/1 loss.
  arXiv  Detail & Related papers  (2023-09-10T21:36:38Z)
• Robust Outlier Rejection for 3D Registration with Variational Bayes [70.98659381852787]
  We develop a novel variational non-local network-based outlier rejection framework for robust alignment. We propose a voting-based inlier searching strategy to cluster the high-quality hypothetical inliers for transformation estimation.
  arXiv  Detail & Related papers  (2023-04-04T03:48:56Z)
• TriVoC: Efficient Voting-based Consensus Maximization for Robust Point Cloud Registration with Extreme Outlier Ratios [6.8858952804978335]
  We present a novel, fast, deterministic and guaranteed robust solver, named TriVoC, for the robust registration problem. We show that TriVoC is robust against up to 99% outliers, highly accurate, time-efficient even with extreme outlier ratios, and also practical for real-world applications.
  arXiv  Detail & Related papers  (2021-11-01T02:03:40Z)
• DANIEL: A Fast and Robust Consensus Maximization Method for Point Cloud Registration with High Outlier Ratios [6.8858952804978335]
  Correspondence-based point cloud registration is a cornerstone in computer vision, robotics perception, photogrammetry and remote sensing. Current 3D keypoint matching techniques are very prone to yield outliers, probably even in very large numbers. We present a novel time-efficient RANSAC-type consensus solver, named DANIEL, for robust registration.
  arXiv  Detail & Related papers  (2021-10-11T08:27:00Z)
• Efficient Person Search: An Anchor-Free Approach [86.45858994806471]
  Person search aims to simultaneously localize and identify a query person from realistic, uncropped images. To achieve this goal, state-of-the-art models typically add a re-id branch upon two-stage detectors like Faster R-CNN. In this work, we present an anchor-free approach to efficiently tackling this challenging task, by introducing the following dedicated designs.
  arXiv  Detail & Related papers  (2021-09-01T07:01:33Z)
• ICOS: Efficient and Highly Robust Point Cloud Registration with Correspondences [6.8858952804978335]
  Point Cloud Registration is a fundamental problem in robotics and computer vision. In this paper, we present ICOS, a novel, efficient and highly robust solution for the correspondence-based point cloud registration problem.
  arXiv  Detail & Related papers  (2021-04-30T05:41:53Z)
• On Efficient and Robust Metrics for RANSAC Hypotheses and 3D Rigid Registration [51.64236850960365]
  This paper focuses on developing efficient and robust evaluation metrics for RANSAC hypotheses to achieve accurate 3D rigid registration. We analyze the contributions of inliers and outliers, and then proposing several efficient and robust metrics with different designing motivations for RANSAC hypotheses.
  arXiv  Detail & Related papers  (2020-11-10T02:22:45Z)
• Quasi-Newton Solver for Robust Non-Rigid Registration [35.66014845211251]
  We propose a formulation for robust non-rigid registration based on a globally smooth robust estimator for data fitting and regularization. We apply the majorization-minimization algorithm to the problem, which reduces each iteration to solving a simple least-squares problem with L-BFGS.
  arXiv  Detail & Related papers  (2020-04-09T01:45:05Z)
• Triple Wins: Boosting Accuracy, Robustness and Efficiency Together by Enabling Input-Adaptive Inference [119.19779637025444]
  Deep networks were recently suggested to face the odds between accuracy (on clean natural images) and robustness (on adversarially perturbed images) This paper studies multi-exit networks associated with input-adaptive inference, showing their strong promise in achieving a "sweet point" in cooptimizing model accuracy, robustness and efficiency.
  arXiv  Detail & Related papers  (2020-02-24T00:40:22Z)
• TEASER: Fast and Certifiable Point Cloud Registration [30.19476775410544]
  First fast and robust certifiable algorithm for the registration of 3D points in the presence of large amounts of outliers. Second fast and robust certifiable translation, named TEASER++, uses graduated non-componentity to solve a large subproblem.
  arXiv  Detail & Related papers  (2020-01-21T18:56:00Z)

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.