This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Decomposition of Convex Polygonal Morphological Structuring Elements into Neighborhood Subsets
February 1991 (vol. 13 no. 2)
pp. 153-162

A discussion is presented of the decomposition of convex polygon-shaped structuring elements into neighborhood subsets. Such decompositions will lead to efficient implementation of corresponding morphological operations on neighborhood-processing-based parallel image computers. It is proved that all convex polygons are decomposable. Efficient decomposition algorithms are developed for different machine structures. An O(1) time algorithm, with respect to the image size, is developed for the four-neighbor-connected mesh machines; a linear time algorithm for determining the optimal decomposition is provided for the machines that can quickly perform 3*3 morphological operations.

[1] G. Matheron,Random Sets and Integral Geometry. New York: Wiley, 1975.
[2] J. Serra,Image Analysis and Mathematical Morphology. London: Academic, 1982.
[3] C. R. Giardina and E. R. Dougherty,Morphological Methods in Image and Signal Processing. Englewood Cliffs, N.J.: Prentice-Hall, 1988.
[4] R.M. Haralick, S.R. Sternberg, and X. Zhuang, "Image analysis using mathematical morphology,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, no. 4, pp. 532-550, 1987.
[5] V. Cantoni and S. Levialdi, "Multiprocessor computing for images,"Proc. IEEE, vol. 76, no. 8, Aug. 1988.
[6] A. P. Reeves, "Parallel computer architectures for image processing,"Comput. Vision, Graphics, and Image Process., vol. 25, pp. 68-88, 1984.
[7] M. J. B. Duff, D. M. Watson, T. M. Fountain, and G. K. Shaw, "A cellular logic array for image processing,"Pattern Recognition, vol. 5, 1973.
[8] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. C-29, pp. 836-840, Sept. 1980.
[9] A. P. Reeves, "A systematically designed binary array processor,"IEEE Trans. Comput., vol. C-29, pp. 278-287, 1980.
[10] S. R. Sternberg, "Cellular computers and biomedical image processing," inBiomedical Images and Computers, J. Sklansky and J. C. Bisconte, Eds. Berlin: Springer-Verlag, 1982, pp. 294-319.
[11] S. R. Sternberg, "Pipeline architectures for image processing," inMulticomputers and Image Processing, K. Preston and L. Uhr, Eds. New York: Academic, 1982, pp. 291-305.
[12] S. R. Sternberg, "Biomedical image processing,"Computer, vol. 16, no. 1, pp. 22-34, Jan. 1983.
[13] X. Zhuang and R. M. Haralick, "Morphological structuring element decomposition,"Comput. Vision, Graphics, Image Processing, vol. 35, pp. 370-382, 1986.
[14] H. Freeman, "Computer processing of line-drawing images,"Computer Surveys, vol. 6, no. 1, Mar. 1974.
[15] T. Pavlidis,Algorithms for Graphics and Image Processing. Rockville, MD: Computer Science Press, 1982.
[16] J. Xu, "The optimal implementation of morphological operations on neighborhood connected array processors,"Proc. IEEE Comput. Society Conf. Comput. Vision Pattern Recognition, San Diego, CA, June 1989.

Index Terms:
computerised picture processing; parallel architectures; convex polygonal morphological structuring elements; neighborhood subsets; neighborhood-processing-based parallel image computers; O(1) time algorithm; four-neighbor-connected mesh machines; linear time algorithm; optimal decomposition; 3*3 morphological operations; computerised picture processing; parallel architectures; set theory
Citation:
J. Xu, "Decomposition of Convex Polygonal Morphological Structuring Elements into Neighborhood Subsets," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 2, pp. 153-162, Feb. 1991, doi:10.1109/34.67644
Usage of this product signifies your acceptance of the Terms of Use.