title: Gray-scale structuring element decomposition.
abstract: Efficient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick (1986) presented a search algorithm to find optimal decompositions of structuring elements in binary morphology. We use the concepts of Top of a set and Umbra of a surface to extend this algorithm to find an optimal decomposition of any arbitrary gray-scale structuring element.
authors.affiliation: Dept. of Electr. Eng., Pennsylvania State Univ., University Park, PA.
authors.forename: O I
authors.initials: OI
authors.lastname: Camps
authors.forename: T
authors.initials: T
authors.lastname: Kanungo
authors.forename: R M
authors.initials: RM
authors.lastname: Haralick