Analytical Solutions for the Minkowski Addition Equation
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.
KeywordsMinkowski Addition Minkowski Subtraction Estructuring Element Decomposition Dilation Erosion
Unable to display preview. Download preview PDF.
- 4.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)Google Scholar
- 10.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)Google Scholar
- 12.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)Google Scholar