Skip to main content

A Parallel Algorithm for Medial Axis Transformation

  • Conference paper
  • First Online:

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

Abstract

In this paper, we present a parallel algorithm for medial axis transformation, which is based on the parallel distance transformation presented in [1]. We first modify the parallel distance transformation as described in [1] and then apply this modified algorithm to develop a parallel algorithm for medial axis transformation. The algorithms are also simulated on two different input images.

The author to be communicated.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akihiro Fujiwara, Michiko Inoue, T. Masuzawa, H. Fujiwara, “A cost optimal parallel algorithm for weighted distance transforms,” Parallel Computing, Vol. 25, 1999, pp. 405–416.

    Article  MATH  MathSciNet  Google Scholar 

  2. D.T. Lee, “Medial axis transformation of a planar shape,” IEEE Trans. On Pattern analysis and machine Intelligence, Vol. 4, 1982, pp. 363–369.

    Article  MATH  Google Scholar 

  3. J.F. Jenq and S. Sahni, “Serial and parallel algorithms for the medial axis transform”, IEEE transactions on Pattern Analysis and Machine Intelligence, Vol. 14, 1992, pp. 1218–1224.

    Article  Google Scholar 

  4. A. Fujiwara, M. Inoue, T. Masuzawa, H. Fujiwara, “A simple parallel algorithm for the medial axis transform of binary images,” proceedings of the IEEE second International Conference on Algorithms and Architecture for Parallel Processing, 1996, pp. 1–8.

    Google Scholar 

  5. R.E. Ladner, M.J. Fisher, “Parallel prefix computation,” Journal of ACM, Vol. 27, 1980, pp. 831–838.

    Article  MATH  Google Scholar 

  6. Y.-H. Lee, S.-J. Horng, “The Chessboard distance transform and the medial axis transform are inter changeable,” Proceedings 10 th International Parallel Processing symposium, 1996, pp. 424–428.

    Google Scholar 

  7. Y.-H. Lee, S.-J. Horng, “Fast parallel chessboard distance transform algorithms,” Proceedings of International Conference on Parallel and Distributed Systems, 1996, pp. 488–493.

    Google Scholar 

  8. O. Berkman, B. Schieber and U. Vishkin, “Optimal doubly parallel algorithms based on finding all nearest smaller values,” Journal of Algorithms, Vol. 14, 1996, pp. 344–370.

    Article  MathSciNet  Google Scholar 

  9. R.C. Gonzalez, R.E. Woods, Digital Image Processing, New York: Addison-Wesley, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saha, S., Jana, P.K. (2003). A Parallel Algorithm for Medial Axis Transformation. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

  • Online ISBN: 978-3-540-37619-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics