Approaches to Decompose Flat Structuring Element for Fast Overlapping Search Morphological Algorithm

Authors:
Affiliations:
Venue:
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Year:
1998

Citing 2
Cited 1

Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology
Decomposition of Polygons into Convex Sets

IEEE Transactions on Computers

On the decomposition of cell clusters

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

The fast morphological algorithm, Overlapping Search (OS) algorithm, recently proposed by Lam and Li can only be applied to Flat Structuring Element (FSE) whose 1D Euler-Poincar茅 constants, N(1)(x) and N(1)(y), at any x or y coordinate are equal to 1. Thus, an arbitrarily shaped structuring element must be decomposed to a set of constrained components before employing the fast algorithm. In the paper, a decomposition algorithm based on line-scanning process and an improved algorithm based on Conditionally Maximal Convex Polygon (CMCP) [4] are proposed to generalize the use of the overlapping search morphological algorithm for any arbitrary fiat structuring element.