ICOS: Efficient and Highly Robust Point Cloud Registration with Correspondences

• URL: http://arxiv.org/abs/2104.14763v1
• Date: Fri, 30 Apr 2021 05:41:53 GMT
• Title: ICOS: Efficient and Highly Robust Point Cloud Registration with Correspondences
• Authors: Lei Sun
• Abstract summary: 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.
• Score: 6.8858952804978335
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Point Cloud Registration is a fundamental problem in robotics and computer vision. Due to the limited accuracy in the matching process of 3D keypoints, the presence of outliers, probably in very large numbers, is common in many real-world applications. In this paper, we present ICOS (Inlier searching using COmpatible Structures), a novel, efficient and highly robust solution for the correspondence-based point cloud registration problem. Specifically, we (i) propose and construct a series of compatible structures for the registration problem where various invariants can be established, and (ii) design two time-efficient frameworks, one for known-scale registration and the other for unknown-scale registration, to filter out outliers and seek inliers from the invariant-constrained random sampling built upon the compatible structures. In this manner, even with extreme outlier ratios, inliers can be detected and collected for solving the optimal transformation, leading to our robust registration solver ICOS. Through plentiful experiments over standard real datasets, we demonstrate that: (i) our solver ICOS is fast, accurate, robust against as many as 99% outliers with nearly 100% recall ratio of inliers whether the scale is known or unknown, outperforming other state-of-the-art methods, (ii) ICOS is practical for use in real-world applications.

Related papers

• Global Point Cloud Registration Network for Large Transformations [46.7301374772952]
  We present ReLaTo, an architecture that faces the cases where large transformations happen while maintaining good performance for local transformations. This paper uses a novel Softmax pooling layer to find correspondences in a bilateral consensus manner between two point sets, sampling the most confident matches. A target-guided denoising step is then applied to both the obtained matches and latent features, estimating the final fine registration.
  arXiv  Detail & Related papers  (2024-03-26T18:52:48Z)
• RegFormer: An Efficient Projection-Aware Transformer Network for Large-Scale Point Cloud Registration [73.69415797389195]
  We propose an end-to-end transformer network (RegFormer) for large-scale point cloud alignment. Specifically, a projection-aware hierarchical transformer is proposed to capture long-range dependencies and filter outliers. Our transformer has linear complexity, which guarantees high efficiency even for large-scale scenes.
  arXiv  Detail & Related papers  (2023-03-22T08:47:37Z)
• Practical, Fast and Robust Point Cloud Registration for 3D Scene Stitching and Object Localization [6.8858952804978335]
  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.
  arXiv  Detail & Related papers  (2021-11-08T01:49:04Z)
• 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)
• Adaptive Anomaly Detection for Internet of Things in Hierarchical Edge Computing: A Contextual-Bandit Approach [81.5261621619557]
  We propose an adaptive anomaly detection scheme with hierarchical edge computing (HEC) We first construct multiple anomaly detection DNN models with increasing complexity, and associate each of them to a corresponding HEC layer. Then, we design an adaptive model selection scheme that is formulated as a contextual-bandit problem and solved by using a reinforcement learning policy network.
  arXiv  Detail & Related papers  (2021-08-09T08:45:47Z)
• IRON: Invariant-based Highly Robust Point Cloud Registration [6.8858952804978335]
  In this paper, we present a non-minimal and highly robust solution for point cloud registration with a great number of outliers. We show that IRON is efficient, highly accurate and robust against as many as 99% outliers whether the scale is known or unknown.
  arXiv  Detail & Related papers  (2021-03-07T13:46:56Z)
• 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)
• DeepGMR: Learning Latent Gaussian Mixture Models for Registration [113.74060941036664]
  Point cloud registration is a fundamental problem in 3D computer vision, graphics and robotics. In this paper, we introduce Deep Gaussian Mixture Registration (DeepGMR), the first learning-based registration method. Our proposed method shows favorable performance when compared with state-of-the-art geometry-based and learning-based registration methods.
  arXiv  Detail & Related papers  (2020-08-20T17:25:16Z)

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.