2005
DOI: 10.1016/j.imavis.2004.06.009
|View full text |Cite
|
Sign up to set email alerts
|

3-D chamfer distances and norms in anisotropic grids

Abstract: Chamfer distances are widely used in image analysis and many authors have investigated the computation of optimal chamfer mask coefficients. Unfortunately, these methods are not systematized: calculations have to be conducted manually for every mask size or image anisotropy. Since image acquisition (e.g. medical imaging) can lead to discrete anisotropic grids with unpredictable anisotropy value, automated calculation of chamfer mask coefficients becomes mandatory for efficient distance map computations. This a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(36 citation statements)
references
References 23 publications
0
36
0
Order By: Relevance
“…Using Farey sets, Fouard and Malandain (2005) computed optimal integer approximations for anisotropic voxels. These estimators were found by minimizing the maximum error, without taking the RMS error and mean error into account.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Using Farey sets, Fouard and Malandain (2005) computed optimal integer approximations for anisotropic voxels. These estimators were found by minimizing the maximum error, without taking the RMS error and mean error into account.…”
Section: Discussionmentioning
confidence: 99%
“…The 2D and 3D algorithms are mostly designed to handle data sets with isotropic, cubic, voxels. Handling of nonisotropic datasets is described by Coquin and Bolon (1995) for pixels and Sintorn and Borgefors (2004) and Fouard and Malandain (2005) for voxels.…”
Section: Introductionmentioning
confidence: 99%
“…This Euclidean Distance Transformation converts a binary image to another image of the same size, such that each pixel has a value equal to the exact Euclidean distance to the nearest object pixel, where most other algorithms approximate the true Euclidean distance 6,7 . The new image is called the exact Euclidean Distance Map (E 2 DM) of the old image.…”
Section: The Calculation Of Distances Is Based On the Fast Exact Euclmentioning
confidence: 99%
“…A few methods have been developed to find and correct the wrong pixels, obtaining the exact ED 8 . Such semi-exact ED transforms have also been developed for 3D images 9,10 . Several other (parallel) implementations of ED transforms have been proposed 2,11 .…”
Section: Borgeforsmentioning
confidence: 99%