1992
DOI: 10.1016/0167-8655(92)90055-5
|View full text |Cite
|
Sign up to set email alerts
|

Fast erosion and dilation by contour processing and thresholding of distance maps

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

1999
1999
2014
2014

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 56 publications
(24 citation statements)
references
References 5 publications
0
24
0
Order By: Relevance
“…Some example applications are: skeleton computation [Montanari 1968;Danielsson 1980], mathematical morphology operation [Ragnemalm 1992a], and displacement mapping [Wang et al 2003;Donnelly 2005]. Though there are already many approaches to compute distance transform [Cuisenaire 1999], there are still unresolved issues: many approaches compute only an approximation to the distance transform in order to be efficient in applications, and they are sequential in nature that have no good avenue for speedup with parallel computation.…”
Section: Introductionmentioning
confidence: 99%
“…Some example applications are: skeleton computation [Montanari 1968;Danielsson 1980], mathematical morphology operation [Ragnemalm 1992a], and displacement mapping [Wang et al 2003;Donnelly 2005]. Though there are already many approaches to compute distance transform [Cuisenaire 1999], there are still unresolved issues: many approaches compute only an approximation to the distance transform in order to be efficient in applications, and they are sequential in nature that have no good avenue for speedup with parallel computation.…”
Section: Introductionmentioning
confidence: 99%
“…First, the white phase (ellipsoid phase) of the image is eroded [15] by a suitably chosen erosion depth such the ellipsoids are separated (that is, each ellipsoid is represented by a unique cluster of white voxels), see below for the choice of the erosion depth. A very effective method to calculate the eroded image, is by thresholding the Euclidean distance map (EDM) of the ellipsoid phase [16]. The EDM of the white phase of a binary image labels each voxel with the distance to the nearest black voxel.…”
Section: Tomography and Image Processingmentioning
confidence: 99%
“…The use of boundarybased mathematical morphology is a classic way of decreasing the computational costy of the morphological operations. For instance, (Ragnemalm, 1992) and (Meijster et al, 2000) present techniques that apply morphological operations based on analytical calculations of distance between objects' boundary points. Van Vliet and Verwer present algorithms for the calculation of erosion, dilation, skeletonization and propagation of images based on the contour of figures (Van Vliet and Verwer, 1988) and (Wilkinson and Meijer, 1995) show a technique to classify microbiological organisms' images from applying morphological operations to the boundary pixels of organisms.…”
Section: Contributionsmentioning
confidence: 99%