Skip to main content
SpringerLink
Log in

Medial axis transform on mesh-connected computers with hyperbus broadcasting

  • Published:
Computing Aims and scope Submit manuscript

Abstract

To represent a region of a digital image as the union of maximal upright squares contained in the region is called the medial axis transform. In this paper, we present anO(logn) time parallel algorithm for the medial axis transform of ann×n binary image on an SIMD mesh-connected computers with hyperbus broadcasting usingn 3 processors.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bar-Noy, A., Peleg, D.: Square meshes are not always optimal. IEEE Trans. ComputC-40, 196–204 (1991).

    Article  Google Scholar 

  2. Bhagavathi, D., Looges, P. J., Olariu, S., Schwing, J. L.: Selection on rectangular meshes with multiple broadcasting. BIT33, 7–14 (1993).

    Article  MATH  MathSciNet  Google Scholar 

  3. Blum, H.: Models for the perception of speech and visual form, pp. 362–380. Cambridge/Mass: MIT Press, 1967.

    Google Scholar 

  4. Chandran, S., Kim, S. K., Mount, D. M.: Parallel computational geometry of rectangles. Algorithmica7, 25–49 (1992).

    Article  MATH  MathSciNet  Google Scholar 

  5. Chen, Y. C., Chen, W. T., Chen, G. H., Sheu, J. P.: Designing efficient parallel algorithms on mesh-connected computers with multiple broadcasting. IEE Trans. Parallel Distr. Syst.1, 241–246 (1990).

    Article  Google Scholar 

  6. Chung, K. L.: Prefix computations on a generalized mesh-connected computer with multiple buses. IEEE Trans. Parallel Distr. Syst.6, 196–199 (1995).

    Article  Google Scholar 

  7. Cinque, L., Guerra, C., Levialdi, S.: Computing shape description transforms on a multiresolution architecture. CVGIP: Image Understanding55, 287–295 (1992).

    Article  MATH  Google Scholar 

  8. Fang, Z., Li, X., Ni, L. M.: Parallel algorithms for image template matching on hypercube SIMD computers. Proc. of the IEEE Workshop on Computer Architecture for Pattern Analysis and Image Database Management, pp. 33–40 (1985).

  9. Ferreira, A., Ubéda, S.: Computing the medial axis transform in parallel with O(1) scan operations. DIMACS Technical Report 94–96 (1994).

  10. Garey, M. R., Johnson, D. S.: Computers and intractability. San Francisco: W.H. Freeman, 1979.

    MATH  Google Scholar 

  11. Hillis, W. D.: The connection machine. Cambridge: MIT Press, 1986.

    Google Scholar 

  12. Horng, S. J.: Prefix computation and some related applications on mesh-connected computers with hyperbus broadcasting. Proc. of 1995 Int. Conf. on Computing and Information, pp. 365–388 (1995).

  13. Jenq, J. F., Sahni, S.: Serial and parallel algorithms for the medial axis transform. IEEE Trans. Pattern Anal. Machine Intell.14, 1218–1224 (1992).

    Article  Google Scholar 

  14. Jenq, J. F., Sahni, S.: Serial and parallel algorithms for the medial axis transform. The Sixth International Parallel Processing Symposium, pp. 326–333 (1992).

  15. Kim, S. K.: Optimal parallel algorithms for region labeling and medial axis transform of binary images. SIAM J. Discrete Math.4, 385–396 (1991).

    Article  MATH  MathSciNet  Google Scholar 

  16. Kruskal, C. P., Madej, T., Rudolph, L.: Parallel prefix on fully connected direct connection machines, Proceedings of the 1986 IEEE International Conference on Parallel Processing, pp. 278–284 (1986).

  17. Kumar, V. K. P., Raghavendra, C. S.: Array processor with multiple broadcasting. J. Parallel Distr. Comput.4, 173–190 (1987).

    Article  Google Scholar 

  18. Lee, D. T.: Medial axis transformation of a planar shape. IEEE Trans. Pattern Anal. Machine Intell.PAMI-4, 363–369 (1982).

    Article  Google Scholar 

  19. Leighton, F. T.: Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann, 1992.

  20. Moitra, D.: Finding a minimal cover for binary images: an optimal parallel algorithm. Algorithmica6, 624–657 (1991).

    Article  MATH  MathSciNet  Google Scholar 

  21. Pucknell, D. A., Eshraghian, K.: Basic VLSI design, pp. 134–138. Englewood Cliffs: Prentice Hall, 1994.

    Google Scholar 

  22. Rosenfeld, A., Kak, A. C.: Digital picture processing. New York: Academic Press, 1982.

    Google Scholar 

  23. Schwarzkopf, O.: Parallel computation of disease transforms. Algorithmica6, 685–697 (1991).

    Article  MATH  MathSciNet  Google Scholar 

  24. Stout, Q. F.: Meshes with multiple buses. Proc 27th IEEE Symp. Found. Comput. Sci., pp. 264–273 (1986).

  25. Vo, K.: Prob 80-4. Algorithms3, 366–368 (1982).

    Google Scholar 

  26. Wolf, W.: Modern VLSI design a systems approach, pp. 6–8. Englewood Cliffs: Prentice Hall, 1994.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, National Taiwan Institute of Technology, 43, Section 4, Kee-Lung Road, Taipei, Taiwan, R.O.C.

    Y.-J. Chen & S.-J. Horng

Authors
  1. Y.-J. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S.-J. Horng
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, YJ., Horng, SJ. Medial axis transform on mesh-connected computers with hyperbus broadcasting. Computing 59, 95–114 (1997). https://doi.org/10.1007/BF02684474

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02684474

Key words

Search

Navigation