This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Lower Bound for Structuring Element Decompositions
April 1991 (vol. 13 no. 4)
pp. 365-369

A theoretical lower bound on the number of points required in the decomposition of morphological structuring elements is described. It is shown that the decomposition of an arbitrary N-point structuring element will require at least (3 ln N/ln 3)points. Using this lower bound it is possible to find the optimal decompositions (in terms of the minimum number of unions or the minimum number of points) for all one-dimensional connected line segments. L-dimensional rectangles may be decomposed by optimally decomposing the L one-dimensional line segments that describe the rectangle.

[1] J. Serra,Image Analysis and Mathematical Morphology. London: Academic, 1982.
[2] X. Zhuang and R. M. Haralick, "Morphological structuring element decomposition,"Comput. Vision, Graphics, Image Processing, vol. 35, pp. 370-382, 1986.
[3] L. Abbott, R. M. Haralick, and X. Zhuang, "Pipeline architectures for morphologic image analysis,"Machine Vision Applicat., vol. 1, pp. 23-40, 1988.
[4] V. Chvál,Linear Programming. San Francisco, CA: Freeman, 1983.
[5] H. A. Taha,Integer Programming: Theory, Applications, and Computations. New York: Academic, 1975.
[6] C.H. Richardson and R. W. Schafer, "Application of mathematical morphology to FLIR images,"Proc. SPIE, Visual Commun. Image Processing, vol. 845, pp. 249-252, Oct. 1987.
[7] R. C. Vogt, "Automatic generation of morphological set recognition algorithms," Ph.D. dissertation, Univ. Michigan, 1988; also asAutomatic Generation of Morphological Set Recognition Algorithms. New York: Springer-Verlag, 1989.
[8] C. H. Richardson and R. W. Schafer, "An environment for the automatic manipulation and analysis of morphological expressions,"Proc SPIE, Image Algebra Morphological Image Processing, vol. 1350, July 1990.
[9] G. L. Nemhouser and L. A. Wolsey,Integer and Combinatorial Optimization. New York: Wiley, 1988.
[10] A. H. Land and A. G. Doig, "An automatic method of solving discrete programming problems,"Econometrica, vol. 28, pp. 497-520, July 1960.

Index Terms:
picture processing; lower bound; decomposition; morphological structuring elements; optimisation; picture processing
Citation:
C.H. Richardson, R.W. Schafer, "A Lower Bound for Structuring Element Decompositions," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 4, pp. 365-369, April 1991, doi:10.1109/34.88571
Usage of this product signifies your acceptance of the Terms of Use.