A New Outlier Removal Strategy Based on Reliability of Correspondence Graph for Fast Point Cloud Registration
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916455106215936 |
|---|---|
| author | Yan, Li Wei, Pengcheng Xie, Hong Dai, Jicheng Wu, Hao Huang, Ming |
| author_facet | Yan, Li Wei, Pengcheng Xie, Hong Dai, Jicheng Wu, Hao Huang, Ming |
| contents | Registration is a basic yet crucial task in point cloud processing. In correspondence-based point cloud registration, matching correspondences by point feature techniques may lead to an extremely high outlier ratio. Current methods still suffer from low efficiency, accuracy, and recall rate. We use a simple and intuitive method to describe the 6-DOF (degree of freedom) curtailment process in point cloud registration and propose an outlier removal strategy based on the reliability of the correspondence graph. The method constructs the corresponding graph according to the given correspondences and designs the concept of the reliability degree of the graph node for optimal candidate selection and the reliability degree of the graph edge to obtain the global maximum consensus set. The presented method could achieve fast and accurate outliers removal along with gradual aligning parameters estimation. Extensive experiments on simulations and challenging real-world datasets demonstrate that the proposed method can still perform effective point cloud registration even the correspondence outlier ratio is over 99%, and the efficiency is better than the state-of-the-art. Code is available at https://github.com/WPC-WHU/GROR. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_07404 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | A New Outlier Removal Strategy Based on Reliability of Correspondence Graph for Fast Point Cloud Registration Yan, Li Wei, Pengcheng Xie, Hong Dai, Jicheng Wu, Hao Huang, Ming Computer Vision and Pattern Recognition Registration is a basic yet crucial task in point cloud processing. In correspondence-based point cloud registration, matching correspondences by point feature techniques may lead to an extremely high outlier ratio. Current methods still suffer from low efficiency, accuracy, and recall rate. We use a simple and intuitive method to describe the 6-DOF (degree of freedom) curtailment process in point cloud registration and propose an outlier removal strategy based on the reliability of the correspondence graph. The method constructs the corresponding graph according to the given correspondences and designs the concept of the reliability degree of the graph node for optimal candidate selection and the reliability degree of the graph edge to obtain the global maximum consensus set. The presented method could achieve fast and accurate outliers removal along with gradual aligning parameters estimation. Extensive experiments on simulations and challenging real-world datasets demonstrate that the proposed method can still perform effective point cloud registration even the correspondence outlier ratio is over 99%, and the efficiency is better than the state-of-the-art. Code is available at https://github.com/WPC-WHU/GROR. |
| title | A New Outlier Removal Strategy Based on Reliability of Correspondence Graph for Fast Point Cloud Registration |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2205.07404 |