Decision PCR: Decision version of the Point Cloud Registration task
- URL: http://arxiv.org/abs/2507.14965v1
- Date: Sun, 20 Jul 2025 13:51:42 GMT
- Title: Decision PCR: Decision version of the Point Cloud Registration task
- Authors: Yaojie Zhang, Tianlun Huang, Weijun Wang, Wei Feng,
- Abstract summary: Low-overlap point cloud registration remains a significant challenge in 3D vision.<n>Traditional evaluation metrics, such as Maximum Inlier Count, become ineffective under extremely low inlier ratios.
- Score: 7.315456136190114
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Low-overlap point cloud registration (PCR) remains a significant challenge in 3D vision. Traditional evaluation metrics, such as Maximum Inlier Count, become ineffective under extremely low inlier ratios. In this paper, we revisit the registration result evaluation problem and identify the Decision version of the PCR task as the fundamental problem. To address this Decision PCR task, we propose a data-driven approach. First, we construct a corresponding dataset based on the 3DMatch dataset. Then, a deep learning-based classifier is trained to reliably assess registration quality, overcoming the limitations of traditional metrics. To our knowledge, this is the first comprehensive study to address this task through a deep learning framework. We incorporate this classifier into standard PCR pipelines. When integrated with our approach, existing state-of-the-art PCR methods exhibit significantly enhanced registration performance. For example, combining our framework with GeoTransformer achieves a new SOTA registration recall of 86.97\% on the challenging 3DLoMatch benchmark. Our method also demonstrates strong generalization capabilities on the unseen outdoor ETH dataset.
Related papers
- Micro-Structures Graph-Based Point Cloud Registration for Balancing Efficiency and Accuracy [5.70403503863614]
We propose a novel micro-structures graph-based global point cloud registration method.
Our proposed method performs well on the 3DMatch and ETH datasets.
arXiv Detail & Related papers (2024-10-29T08:36:23Z) - Sight View Constraint for Robust Point Cloud Registration [13.216523566864641]
Partial to Partial Point Cloud Registration (partial PCR) is a challenging task, particularly when dealing with a low overlap rate.
We propose a novel and general Sight View Constraint (SVC) to conclusively identify incorrect transformations.
On the challenging 3DLoMatch dataset, our approach increases the registration recall from 78% to 82%, achieving the state-of-the-art result.
arXiv Detail & Related papers (2024-09-08T11:58:20Z) - RAGEval: Scenario Specific RAG Evaluation Dataset Generation Framework [66.93260816493553]
This paper introduces RAGEval, a framework designed to assess RAG systems across diverse scenarios.<n>With a focus on factual accuracy, we propose three novel metrics: Completeness, Hallucination, and Irrelevance.<n> Experimental results show that RAGEval outperforms zero-shot and one-shot methods in terms of clarity, safety, conformity, and richness of generated samples.
arXiv Detail & Related papers (2024-08-02T13:35:11Z) - ACTRESS: Active Retraining for Semi-supervised Visual Grounding [52.08834188447851]
A previous study, RefTeacher, makes the first attempt to tackle this task by adopting the teacher-student framework to provide pseudo confidence supervision and attention-based supervision.
This approach is incompatible with current state-of-the-art visual grounding models, which follow the Transformer-based pipeline.
Our paper proposes the ACTive REtraining approach for Semi-Supervised Visual Grounding, abbreviated as ACTRESS.
arXiv Detail & Related papers (2024-07-03T16:33:31Z) - Deep Learning-Based Point Cloud Registration: A Comprehensive Survey and Taxonomy [79.66031973540946]
We present a comprehensive survey and taxonomy on deep learning-based point cloud registration (DL-PCR)<n>For supervised DL-PCR methods, we organize the discussion based on key aspects, including the registration procedure.<n>We classify them into correspondence-based and correspondence-free approaches, depending on whether they require explicit identification of point-to-point correspondences.
arXiv Detail & Related papers (2024-04-22T02:05:15Z) - What Stops Learning-based 3D Registration from Working in the Real
World? [53.68326201131434]
This work identifies the sources of 3D point cloud registration failures, analyze the reasons behind them, and propose solutions.
Ultimately, this translates to a best-practice 3D registration network (BPNet), constituting the first learning-based method able to handle previously-unseen objects in real-world data.
Our model generalizes to real data without any fine-tuning, reaching an accuracy of up to 67% on point clouds of unseen objects obtained with a commercial sensor.
arXiv Detail & Related papers (2021-11-19T19:24:27Z) - Open-Set Recognition: A Good Closed-Set Classifier is All You Need [146.6814176602689]
We show that the ability of a classifier to make the 'none-of-above' decision is highly correlated with its accuracy on the closed-set classes.
We use this correlation to boost the performance of the cross-entropy OSR 'baseline' by improving its closed-set accuracy.
We also construct new benchmarks which better respect the task of detecting semantic novelty.
arXiv Detail & Related papers (2021-10-12T17:58:59Z) - ReAgent: Point Cloud Registration using Imitation and Reinforcement
Learning [28.244027792644097]
We present a novel point cloud registration agent (ReAgent) for 3D computer vision tasks.
We employ imitation learning to initialize its discrete registration policy based on a steady expert policy.
We compare our approach to classical and learning-based registration methods on both ModelNet40 (synthetic) and ScanObjectNN (real data) and show that our ReAgent achieves state-of-the-art accuracy.
arXiv Detail & Related papers (2021-03-28T22:04: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.