Abstract
This paper presents the formulation of a discrete equation whose solutions have a strong combinatory nature. More formally, given two subsets Y and C, we are interested in finding all subsets X that satisfy the equation (called Minkowski Addition Equation) X ⊕ C = Y. One direct application of the solutions of this equation is that they can be used to find best representations for fast computation of erosions and dilations. The main (and original) result presented in this paper (which is a theoretical result) is an analytical solution formula for this equation. One important characteristic of this analytical formula is that all solutions (which can be in worst case exponential) are expressed in a compact representation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rådström, H.: An embedding theorem for spaces of convex sets. Proc. Amer. Math. Soc. 3, 165–169 (1952)
Hörmander, L.: Sur la fonction d’appui des ensembles convexes dans un espace localement convexe. Arkiv för Matematik 3(2), 181–186 (1955)
Serra, J.: Image Analysis and Mathematical Morphology. Academic Press, New York (1982)
Maragos, P.A.: A Unified Theory of Translation-invariant Systems with Applications to Morphological Analysis and Coding of Images. PhD thesis, School of Elect. Eng. - Georgia Inst. Tech. (1985)
Hashimoto, R.F., Barrera, J., Ferreira, C.E.: A Combinatorial Optimization Technique for the Sequential Decomposition of Erosions and Dilations. Journal of Mathematical Imaging and Vision 13(1), 17–33 (2000)
Hashimoto, R.F., Barrera, J.: A Note on Park and Chin’s Algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(1), 139–144 (2002)
Hashimoto, R.F., Barrera, J.: A Greedy Algorithm for Decomposing Convex Structuring Elements. Journal of Mathematical Imaging and Vision 18(3), 269–289 (2003)
Park, H., Chin, R.T.: Decomposition of Arbitrarily Shaped Morphological Structuring Elements. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(1), 2–15 (1995)
Shih, F.Y., Wu, Y.T.: Decomposition of binary morphological structuring elements based on genetic algorithms. Computer Vision and Image Understanding 99(2), 291–302 (2005)
Zhang, C.B., Wang, K.F., Shen, X.L.: Algorithm for decomposition of binary morphological convex structuring elements based on periodic lines. Imaging Science Journal (May 2012)
Zhuang, X., Haralick, R.: Morphological Structuring Element Decomposition. Computer Vision, Graphics, and Image Processing 35, 370–382 (1986)
Babu, G., Srikrishna, A., Challa, K., Babu, B.: An error free compression algorithm using morphological decomposition. In: 2012 International Conference on Recent Advances in Computing and Software Systems (RACSS), pp. 33–36 (April 2012)
Heijmans, H.J.A.M.: Morphological Image Operators. Academic Press, Boston (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castro, J.E.S., Hashimoto, R.F., Barrera, J. (2013). Analytical Solutions for the Minkowski Addition Equation. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2013. Lecture Notes in Computer Science, vol 7883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38294-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-38294-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38293-2
Online ISBN: 978-3-642-38294-9
eBook Packages: Computer ScienceComputer Science (R0)