Fast Euclidean morphological operators using local distance transformation by propagation, and applications
Year: 1999
Type: conference-paper
Abstract: We propose a new method to compute the morphological dilation of a binary image with a circular structuring element of any given size, on a discrete lattice. The algorithm is equivalent to applying a threshold on an exact Euclidean distance map, but computations are restricted to a minimum number of pixels. The complexity of this dilation algorithm is compared to the complexity of the commonly used approximation of circular structuring elements and found to have a similar cost, while providing better results.
DOI: 10.1049/cp:19990446
Author: O. Cuisenaire
Institution: UCLouvain
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2159152240
