Skip to main content
SpringerLink
Log in

Morphological iterative closest point algorithm

  • Mathematical Morphology
  • Conference paper
  • First Online:
Computer Analysis of Images and Patterns (CAIP 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1296))

Included in the following conference series:

Abstract

This paper describes a method for accurate and computationally efficient registration of 3-D shapes including curves and surfaces. The method is based on the iterative closest point (ICP) algorithm. The real strength of our algorithm is the use of Morphological Voronoi tessellation method to construct the Voronoi regions around the seed points with respect to a certain distance metric. The tessellated domain can be used to avoid the most computationally expensive step in the ICP, namely to find the closest points. Thus the proposed algorithm is much faster than classical ICP.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pitas, I., Venetsanopoulos, A.N.: Nonlinear Digital Filters: Principles and Applications. Boston: Kluwer Academic (1990)

    Google Scholar 

  2. Pitas, L: Digital Image Processing Algorithms. Prentice Hall (1993)

    Google Scholar 

  3. Preparata, F.P., Shamos, M.L. Computational Geometry. New York: Springer-Verlag (1985)

    Google Scholar 

  4. Haralick, R.M., Shapiro, L.G.: Computer and Robot Vision. Addison-Wesley (1992)

    Google Scholar 

  5. Besl, P.J., McKay, N.D.: A method for Registration of 3-D Shapes. IEEE Trans. on Pattern Analysis and Machine Intelligence 14 (1992) 239–256

    Article  Google Scholar 

  6. Pitas, L: Performance Analysis and Parallel Implementation of Voronoi Tessellation Algorithms Based on Mathematical Morphology. IEEE Trans. on Pattern Analysis and Machine Intelligence (Submitted)

    Google Scholar 

  7. Kotropoulos, C., Pitas, L, Maglara, A.: Voronoi Tessellation and Delaunay Triangulation Using Euclidean Disk Growing in Z2 Int. Conf. on Acoust. Speech and Signal Processing (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Thessaloniki, 540 06, Thessaloniki, Greece

    C. P. Vavoulidis & I. Pitas

Authors
  1. C. P. Vavoulidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Pitas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerald Sommer Kostas Daniilidis Josef Pauli

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vavoulidis, C.P., Pitas, I. (1997). Morphological iterative closest point algorithm. In: Sommer, G., Daniilidis, K., Pauli, J. (eds) Computer Analysis of Images and Patterns. CAIP 1997. Lecture Notes in Computer Science, vol 1296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63460-6_145

Download citation

  • DOI: https://doi.org/10.1007/3-540-63460-6_145

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63460-7

  • Online ISBN: 978-3-540-69556-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation