Issue No. 03 - March (1994 vol. 16)

ISSN: 0162-8828

pp: 304-313

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.276129

ABSTRACT

<p>A morphological operation using a large structuring element can be decomposed equivalently into a sequence of recursive operations, each using a smaller structuring element. However, an optimal decomposition of arbitrarily shaped structuring elements is yet to be found. In this paper, we have derived an optimal decomposition of a specific class of structuring elements/spl mdash/convex sets/spl mdash/for a specific type of machine/spl mdash/4-connected parallel array processors. The cost of morphological operation on 4-connected parallel array processors is the total number of 4-connected shifts required by the set of structuring elements. First, the original structuring element is decomposed into a set of prime factors, and then their locations are determined while minimizing the cost function. Proofs are presented to show the optimality of the decomposition. Examples of optimal decomposition are given and compared to an existing decomposition reported by Xu (1991).</p>

INDEX TERMS

image reconstruction; mathematical morphology; optimisation; parallel processing; array signal processing; optimal decomposition; convex morphological structuring elements; 4-connected parallel array processors; recursive operation sequence; cost function minimization

CITATION

R.T. Chin, H. Park, "Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 16, no. , pp. 304-313, March 1994, doi:10.1109/34.276129