CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2002 vol.24 Issue No.01 - January
Issue No.01 - January (2002 vol.24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.982891
<p>A finite subset of ZZ^2 is called a structuring element. A decomposition of a structuring element A is a sequence of subsets of the elementary square (i.e., the 3 x 3 square centered at the origin) such that the Minkowski addition of them is equal to A. Park and Chin developed an algorithm for finding the optimal decomposition of simply connected structuring elements (i.e., 8-connected structuring elements that contain no holes), imposing the restriction that all subsets in this decomposition are also simply connected. In this paper, we show that there exist infinite families of simply connected structuring elements that have decompositions but are not decomposable according to Park and Chin's definition.</p>
Simply connected set, structuring element, decomposition, Minkowski addition.
Ronaldo Fumio Hashimoto, Junior Barrera, "A Note on Park and Chin's Algorithm", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.24, no. 1, pp. 139-144, January 2002, doi:10.1109/34.982891