Papers
Topics
Authors
Recent
Search
2000 character limit reached

Memory-Efficient Point Cloud Registration via Overlapping Region Sampling

Published 29 Oct 2024 in cs.CV | (2410.21753v1)

Abstract: Recent advances in deep learning have improved 3D point cloud registration but increased graphics processing unit (GPU) memory usage, often requiring preliminary sampling that reduces accuracy. We propose an overlapping region sampling method to reduce memory usage while maintaining accuracy. Our approach estimates the overlapping region and intensively samples from it, using a k-nearest-neighbor (kNN) based point compression mechanism with multi layer perceptron (MLP) and transformer architectures. Evaluations on 3DMatch and 3DLoMatch datasets show our method outperforms other sampling methods in registration recall, especially at lower GPU memory levels. For 3DMatch, we achieve 94% recall with 33% reduced memory usage, with greater advantages in 3DLoMatch. Our method enables efficient large-scale point cloud registration in resource-constrained environments, maintaining high accuracy while significantly reducing memory requirements.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. N. D. M. Paul J Bes, “A Method for Registration of 3-D Shapes,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, no. 2, pp. 239–256, 1992.
  2. J. Yang, H. Li, D. Campbell, and Y. Jia, “Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 38, no. 11, pp. 2241–2254, 2015.
  3. M. A. Fischler and R. C. Bolles, “Random Sample Consensus: a Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography,” Communications of the ACM, vol. 24, no. 6, pp. 381–395, 1981.
  4. H. M. Le, T.-T. Do, T. Hoang, and N.-M. Cheung, “SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration without Correspondences,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 124–133.
  5. X. Zhang, J. Yang, S. Zhang, and Y. Zhang, “3D Registration with Maximal Cliques,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023, pp. 17 745–17 754.
  6. H. Yang, J. Shi, and L. Carlone, “TEASER: Fast and Certifiable Point Cloud Registration,” IEEE Transactions on Robotics, vol. 37, no. 2, pp. 314–333, 2020.
  7. Z. Gojcic, C. Zhou, J. D. Wegner, and A. Wieser, “The Perfect Match: 3D Point Cloud Matching with Smoothed Densities,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 5545–5554.
  8. S. Huang, Z. Gojcic, M. Usvyatsov, A. Wieser, and K. Schindler, “PREDATOR: Registration of 3D Point Clouds with Low Overlap,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2021, pp. 4267–4276.
  9. H. Deng, T. Birdal, and S. Ilic, “PPFNet: Global Context Aware Local Features for Robust 3D Point Matching,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2018, pp. 195–205.
  10. H. Yu, F. Li, M. Saleh, B. Busam, and S. Ilic, “CoFiNet: Reliable Coarse-to-Fine Correspondences for Robust Point Cloud Registration,” in Advances in Neural Information Processing Systems, vol. 29, 2021.
  11. W. Peng, Y. Wang, H. Zhang, Y. Cao, J. Zhao, and Y. Jiang, “Deep Correspondence Matching-Based Robust Point Cloud Registration of Profiled Parts,” IEEE Transactions on Industrial Informatics, vol. 20, pp. 2129–2143, 2024.
  12. C. Choy, J. Park, and V. Koltun, “Fully Convolutional Geometric Features,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 8958–8966.
  13. Y. Li and T. Harada, “Lepard: Learning Partial Point Cloud Matching in Rigid and Deformable Scenes,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022, pp. 5554–5564.
  14. H. Yu, Z. Qin, J. Hou, M. Saleh, D. Li, B. Busam, and S. Ilic, “Rotation-Invariant Transformer for Point Cloud Matching,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023, pp. 5384–5393.
  15. S. Ao, Q. Hu, B. Yang, A. Markham, and Y. Guo, “SpinNet: Learning a General Surface Descriptor for 3D Point Cloud Registration,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2021, pp. 11 748–11 757.
  16. X. Bai, Z. Luo, L. Zhou, H. Fu, L. Quan, and C.-L. Tai, “D3Feat: Joint Learning of Dense Detection and Description of 3D Local Features,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 6359–6367.
  17. Z. Qin, H. Yu, C. Wang, Y. Guo, Y. Peng, and K. Xu, “Geometric Transformer for Fast and Robust Point Cloud Registration,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022, pp. 11 143–11 152.
  18. M. Corsini, P. Cignoni, and R. Scopigno, “Efficient and Flexible Sampling with Blue Noise Properties of Triangular Meshes,” IEEE Transactions on Visualization and Computer Graphics, vol. 18, no. 6, pp. 914–924, 2012.
  19. Y. Zhou and O. Tuzel, “Voxelnet: End-to-end Learning for Point Cloud Based 3D Object Detection,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2018, pp. 4490–4499.
  20. C. R. Qi, L. Yi, H. Su, and L. J. Guibas, “PointNet++: Deep Hierarchical Feature Learning on Point Sets in A Metric Space,” in Advances in Neural Information Processing Systems, vol. 30, 2017.
  21. C. R. Qi, O. Litany, K. He, and L. J. Guibas, “Deep Hough Voting for 3D Object Detection in Point Clouds,” in IEEE/CVF International Conference on Computer Vision, 2019, pp. 9277–9286.
  22. A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is All You Need,” in Advances in Neural Information Processing Systems, vol. 30, 2017.
  23. A. Zeng, S. Song, M. Nießner, M. Fisher, J. Xiao, and T. Funkhouser, “3DMatch: Learning Local Geometric Descriptors from RGB-D Reconstructions,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2017, pp. 1802–1811.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.