This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors
March 1994 (vol. 16 no. 3)
pp. 304-313

A morphological operation using a large structuring element can be decomposed equivalently into a sequence of recursive operations, each using a smaller structuring element. However, an optimal decomposition of arbitrarily shaped structuring elements is yet to be found. In this paper, we have derived an optimal decomposition of a specific class of structuring elements/spl mdash/convex sets/spl mdash/for a specific type of machine/spl mdash/4-connected parallel array processors. The cost of morphological operation on 4-connected parallel array processors is the total number of 4-connected shifts required by the set of structuring elements. First, the original structuring element is decomposed into a set of prime factors, and then their locations are determined while minimizing the cost function. Proofs are presented to show the optimality of the decomposition. Examples of optimal decomposition are given and compared to an existing decomposition reported by Xu (1991).

[1] L. Abbott, R. M. Haralick, and X. Zhuang, "Pipeline architectures for morphologic image analysis,"Machine Vision Applicat., vol. 1, pp. 23-40, 1988.
[2] M.-H. Chen and P.-F. Yan, "A multiscaling approach based on morphological filtering,"IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 7, July 1989.
[3] P. E. Danielsson and S. Levialdi, "Computer architecture for pictorial information systems,"Comput., Nov. 1981.
[4] H. Freeman, "Computer processing of line-drawing images,"Computer Surveys, vol. 6, no. 1, Mar. 1974.
[5] J. Goutsias and D. Schonfeld, "Image coding via morphological transformation : A general theory," inProc. IEEE Conf. Computer Vision and Pattern Recognition, June 1989.
[6] 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.
[7] B. K. Jang and R. T. Chin, "Analysis of thinning algorithms using mathematical morphology,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 6, June 1990.
[8] J. S. J. Lee, R. M. Haralick, and L. G. Shapiro, "Morphologic edge detection,"IEEE Trans. Rob. Autom., vol. RA-3, pp. 142-156, Apr. 1987.
[9] P. A. Maragos, R. W. Schafer, "Morphological skeleton representation and coding of binary images,"IEEE Trans. Acoustics Speech Signal Processing, vol. ASSP-34, pp. 1228-1244, 1986.
[10] I. Pitas and A. N. Venetsanpoulos, "Morphological shape decomposition,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 1, Jan. 1990.
[11] J. L. Potter, "Image processing on the massively parallel processors,"Comput., Jan. 1983.
[12] K. Preston, Jr., "Cellular logic computers for pattern recognition,"Comput., Jan. 1983.
[13] A. Rosenfeld, "Parallel image processing using cellular arrays,"Comput., Jan. 1983.
[14] I. Serra, Ed.,Image Analysis and Mathematical Morphology, vol. 2: Theoretical Advances. London: Academic, 1988, Chapter 17.
[15] F. Y. Shih and O. R. Mitchell, "Industrial parts recognition and inspection by image morphology," inProc. IEEE Int. Conf. Robotics Automation, Apr. 1988.
[16] F. Y. Shih and O. R. Mitchell, "Automated fast recognition and location of arbitrarily shaped objects by image morphology," inProc. IEEE Conf. ComputerVision and Pattern Recongition, June 1988.
[17] S. R. Sternberg, "Biomedical image processing,"Comput., Jan. 1983.
[18] J. Xu, "Decomposition of convex polygonal morphological structuring elements into neighborhood subsets,"IEEE Trans. Pattern Anal. Machine Intell., vol. 13, no. 2, Feb. 1991.
[19] F. A. Gerristen, "A comparison of the CLIP4, DAP and MPP processorarray implementation," inComputer Structures for Image Processing, M.J.B. Duff, Ed. London: Academic, 1983.
[20] R. Cypher and J.L.C. Sanz, "SIMD architectures and algorithms for image processing and computer vision,"IEEE Trans. Acoust. Speech Signal Processing, vol. 37, no. 12, Dec. 1989.

Index Terms:
image reconstruction; mathematical morphology; optimisation; parallel processing; array signal processing; optimal decomposition; convex morphological structuring elements; 4-connected parallel array processors; recursive operation sequence; cost function minimization
Citation:
H. Park, R.T. Chin, "Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 3, pp. 304-313, March 1994, doi:10.1109/34.276129
Usage of this product signifies your acceptance of the Terms of Use.