Skip to main content

A Matching Algorithm for Featureless Sparse Point Cloud Registration

  • Conference paper
  • First Online:
  • 1530 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12595))

Abstract

Be confronted with the challenges of efficiency and accuracy, point cloud registration, as a universal technique adopted in vision system, has always been used for large-dimension workpieces measurement. In this paper, we present a matching algorithm for determining the transformation relation between local point cloud and global point cloud with corresponding points unknown. First, multilinked lists of distance for point clouds are constructed with k-D tree. Then, a closed-traversal matching algorithm is proposed, which uses subgraph isomorphism to find possible matching results. The possible results still need further verification by recursive to get a credible matching result. In the end, a method is designed to solve and verify the transformation matrix by singular value decomposition. The performance of the algorithm is evaluated with the actual data obtained from vision measuring system. The experiments show that the algorithm is of high performance and efficiency and can be applied to practical problems of point cloud registration.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Besl, P.J., Mckay, N.D.: A method for registration of 3-D shapes. In: Sensor Fusion IV: Control Paradigms and Data Structures. IEEE Computer Society (1992)

    Google Scholar 

  2. ARUN, K. S. Least-squares fitting of two 3-D point sets. IEEE Trans. Pattern Anal. Mach. Intell. (1987)

    Google Scholar 

  3. Li, J., Chen, M., Jin, X., et al.: Calibration of a multiple axes 3-D laser scanning system consisting of robot, portable laser scanner and turntable. Optik - Int. J. Light Electron Opt. 122(4), 324–329 (2011)

    Article  Google Scholar 

  4. Ye, Y., Song, Z.: An accurate 3D point cloud registration approach for the turntable-based 3D scanning system. In: IEEE International Conference on Information & Automation. IEEE (2015)

    Google Scholar 

  5. Kim, S.H., Seo, J., Jho, C.W.: Automatic registration of 3D data sets from unknown viewpoints. Proc. Workshop Front. Comput. Vers. 12(2), 155–159 (2003)

    Google Scholar 

  6. Rusu, R.B., Blodow, N., Beetz, M.: Fast point feature histograms (FPFH) for 3D registration. In: IEEE International Conference on Robotics & Automation. IEEE (2009)

    Google Scholar 

  7. Seo, J.K., Sharp, G.C., Lee, S.W.: Range data registration using photometric features. In: IEEE Computer Society Conference on Computer Vision & Pattern Recognition. IEEE (2005)

    Google Scholar 

  8. Zhang, W., Zhang, L., Zhang, H., et al.: 3D reconstruction from multiple perspective views with marked points. China Mech. Eng. 17(16), 1711–1715 (2006)

    Google Scholar 

  9. David, P., Dementhon, D., Duraiswami, R., et al.: SoftPOSIT: simultaneous pose and correspondence determination. In: European Conference on Computer Vision. Springer, Berlin, Heidelberg (2002)

    Google Scholar 

  10. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)

    Article  Google Scholar 

  11. Preparata, F.P, Shamos, M.I.: Computational Geometry (1985).https://doi.org/10.1007/978-1-4612-1098-6

  12. Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)

    Article  Google Scholar 

  13. Martin, A., Fischler, et al. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM, 24(6), 381–395 (1981)

    Google Scholar 

  14. Luhmann, T., Robson, S., Kyle, S.A, et al.: Close Range Photogrammetry: Principles, Techniques and Applications. Blackwell Publishing Ltd, Hoboken (2006)

    Google Scholar 

  15. Ozturk, A.O., Halici, U., Ulusoy, I., et al.: 3D face reconstruction using stereo images and structured light. In: IEEE 16th Signal Processing and Communications Applications Conference, Didim, Turkey, vol. 1–2, pp. 878–881. IEEE (2008)

    Google Scholar 

Download references

Acknowledgments

This research was partially supported by the key research project of the Ministry of Science and Technology (Grant No. 2017YFB1301503) and the National Natural Science Foundation of China (Grant No. 51975344).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xu Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, Z., Yang, Y., Zhang, X., Zhang, L. (2020). A Matching Algorithm for Featureless Sparse Point Cloud Registration. In: Chan, C.S., et al. Intelligent Robotics and Applications. ICIRA 2020. Lecture Notes in Computer Science(), vol 12595. Springer, Cham. https://doi.org/10.1007/978-3-030-66645-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-66645-3_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-66644-6

  • Online ISBN: 978-3-030-66645-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics