Fast Euclidean morphological operators using local distance transformation by propagation

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.


Published in:
7th Intl Conference on Image Processings and its Applications (IPA99), 856-860
Year:
1999
Publisher:
Berlin, IEEE
Keywords:
Laboratories:




 Record created 2006-06-14, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)