Portal de Periódicos da CAPES

Artigo Produção Nacional Revisado por pares

BIBTEX RIS

A note on Park and Chin's algorithm [structuring element decomposition]

2002; IEEE Computer Society; Volume: 24; Issue: 1 Linguagem: Inglês

10.1109/34.982891

2160-9292

Ronaldo F. Hashimoto, Júnior Barrera,

graph theory and CDMA systems

A finite subset of Z/sup 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/spl times/3 square centered at the origin) such that the Minkowski addition of them is equal to A. H. Park and R.T. Chin (see ibid., vol.17, no.1, p.2-15, 1995) 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. The authors 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.