Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Local distances for distance transformations in two and three dimensions
Pattern Recognition Letters
The Euclidean distance transform in arbitrary dimensions
Pattern Recognition Letters
Discrete distance operator on rectangular grids
Pattern Recognition Letters
A unified linear-time algorithm for computing distance maps
Information Processing Letters
On digital distance transforms in three dimensions
Computer Vision and Image Understanding
A New Metric for Grey-Scale Image Comparison
International Journal of Computer Vision
Distance-ordered homotopic thinning: a skeletonization algorithm for 3D digital images
Computer Vision and Image Understanding
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance
Journal of the ACM (JACM)
Fast Euclidean distance transformation by propagation using multiple neighborhoods
Computer Vision and Image Understanding
Application of Baddeley's distance to dissimilarity measurement between gray scale images
Pattern Recognition Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital distance transforms in 3D images using information from neighbourhoods up to 5 × 5 × 5
Computer Vision and Image Understanding
On Skeletonization in 4D Images
SSPR '96 Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition
Weighted Distance Transforms for Images Using Elongated Voxel Grids
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Weighted digital distance transforms in four dimensions
Discrete Applied Mathematics
Weighted Distance Transforms in Rectangular Grids
ICIAP '01 Proceedings of the 11th International Conference on Image Analysis and Processing
Weighted distances based on neighbourhood sequences
Pattern Recognition Letters
Weighted distances based on neighborhood sequences for point-lattices
Discrete Applied Mathematics
Medial axis lookup table and test neighborhood computation for 3D chamfer norms
Pattern Recognition
Distance transforms for three-dimensional grids with non-cubic voxels
Computer Vision and Image Understanding
Visible Vectors and Discrete Euclidean Medial Axis
Discrete & Computational Geometry
3-D chamfer distances and norms in anisotropic grids
Image and Vision Computing
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Chordal axis on weighted distance transforms
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Hi-index | 0.10 |
For discrete data represented by three variable scalar functions, the sampling step may be different according to the axes, leading to parallelepipedic sampling grids. This is the case for instance with medical or industrial computed tomography and confocal microscopy, as well as in grey level image analysis if images are modelized by means of their set representation (mathematical morphology). In this paper, 3D non-cubic chamfer masks are introduced. The problem of coefficient optimization is addressed for arbitrary mask size. Thank to this, first, the maximal normalized error with respect to Euclidean distance can be derived analytically, in any 3D anisotropic lattice, and second, optimal chamfer mask coefficients can be computed. We propose a method to calculate lower and upper bounds for integer scaling factors in order to obtain integer approximations for the coefficients. This approach helps the algorithm perform in scenarios where memory is limited.