Skip to main content
Springer Nature Link
Log in

Optimal implementation of morphological operations on neighborhood-connected parallel computers

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

To efficiently perform morphological operations on neighborhood-processing-based parallel image computers, we need to decompose structuring elements larger than the neighborhood that can be directly handled into neighborhood subsets. In the special case that the structuring element is a convex polygon, there are known decomposition algorithms in the literature. In this paper, we give an algorithm for the optimal decomposition of arbitrarily shaped structuring elements, enabling an optimal implementation of morphological operations on neighborhood-connected parallel computers in the general case.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. L. Abbott, R.M. Haralick and X.-H. Zhuang, Pipeline architectures for morphologic image analysis, Machine Vision and Appl. 1(1988)23–40.

    Google Scholar 

  2. C.R. Giardina and E.R. Dougherty,Morphological Methods in Image and Signal Processing (Prentice-Hall, Englewood Cliffs, NJ, 1988).

    Google Scholar 

  3. W. Gong, On decomposition of structure elements for mathematical morphology,Proc. 9th ICPR, Rome, 1988, pp. 836–838.

  4. R.M. Haralicj, S.R. Sternberg and X,-H. Zhuang, Image analysis using mathematical morphology, IEEE Trans. Pattern Anal. Machine Intellig. 9(1987)532–550.

    Google Scholar 

  5. G. Matheron,Random Sets and Integral Geometry (Wiley, New York, 1975).

    Google Scholar 

  6. I. Pitas and A.N. Venetsanopoulos, Morphological shape decomposition, IEEE Trans. Pattern Anal. Machine Intellig. 12(1990)38–45.

    Google Scholar 

  7. J.L. Potter, MPP architecture and programming, in:Multicomputers are Image Processing, eds. K. Preston and L. Uhr (Academic Press, New York, 1982).

    Google Scholar 

  8. A.P. Reeves and A. Rostampour, Computational cost of image registration with a parallel binary array processor, IEEE Trans. Pattern Anal. Machine Intellig. 4(1982)449–455.

    Google Scholar 

  9. C.H. Richardson and R.W. Schafer, A lower bound for structuring element decompositions, IEEE Trans. Pattern Anal. Machine Intellig. 13(1991)365–369.

    Google Scholar 

  10. J. Serra,Image Analysis and Mathematical Morphology (Academic Press, London, 1982).

    Google Scholar 

  11. J. Serra (ed.),Image Analysis and Mathematical Morphology, Vol. 2: Theoretical Advances (Academic Press, London, 1988).

    Google Scholar 

  12. J. Serra (ed.), Special Issue on Advances in Mathematical Morphology, Signal Processing 16(1989)297–433.

  13. S.R. Sternberg, Pipeline architectures for image processing: in:Multicomputers and Image Processing, eds. K. Preston and L. Uhr (Academic Press, New York, 1982).

    Google Scholar 

  14. S.R. Sternberg and J. Serra (eds), Special Section on Mathematical Morphology, Comp. Vision, Graphics, and Image Proc. 35(1986)279–383.

  15. J.-N. Xu, Decomposition of convex polygonal morphological structuring elements into neighborhood subsets, IEEE Trans. Pattern Anal. Machine Intellig. 13(1991)153–162.

    Google Scholar 

  16. X.-H. Zhuang and R.M. Haralick, Morphological structuring element decomposition, Comp. Vision, Graphics, and Image Proc. 35(1986)370–382.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und angewandte Mathematik, Universität Bern, Länggass-Strasse 51, CH-3012, Bern, Switzerland

    X. Y. Jiang & H. Bunke

Authors
  1. X. Y. Jiang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. H. Bunke
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiang, X.Y., Bunke, H. Optimal implementation of morphological operations on neighborhood-connected parallel computers. Ann Math Artif Intell 13, 301–315 (1995). https://doi.org/10.1007/BF01530833

Download citation

  • Issue Date:

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

Keywords