By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. F. Hashimoto ; Departamento de Ciencia da Computacaao, Sao Paulo Univ., Brazil ; J. Barrera

A finite subset of Z2 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×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

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:24 ,  Issue: 1 )