Distances defined by neighborhood sequences
Pattern Recognition
Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Computing distance transformations in convex and non-convex domains
Pattern Recognition
Intelligent Autonomous Systems, An International Conference
Pattern Recognition Letters
Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Lipschitz method for accelerated volume rendering
VVS '94 Proceedings of the 1994 symposium on Volume visualization
A List-Processing Approach to Compute Voronoi Diagrams and the Euclidean Distance Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel distance transforms on a linear array architecture
Information Processing Letters
Fast visualization of plane-like structures in voxel data
Proceedings of the conference on Visualization '02
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
Gyral Parcellation of the Cortical Surface Using Geodesic Voronoï Diagrams
MICCAI '02 Proceedings of the 5th International Conference on Medical Image Computing and Computer-Assisted Intervention-Part I
Advances in the Analysis of Topographic Features on Discrete Images
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Visibility in Discrete Geometry: An Application to Discrete Geodesic Paths
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Volume-Based Reasoning and Visualization of Diecastability
VIS '95 Proceedings of the 6th conference on Visualization '95
The Image Foresting Transform: Theory, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition Letters - Special issue: Discrete geometry for computer imagery (DGCI'2002)
2D and 3D visibility in discrete geometry: an application to discrete geodesic paths
Pattern Recognition Letters - Special issue: Discrete geometry for computer imagery (DGCI'2002)
The "Dead reckoning" signed distance transform
Computer Vision and Image Understanding
Distance and nearest neighbor transforms on gray-level surfaces
Pattern Recognition Letters
Priority pixel queue algorithm for geodesic distance transforms
Image and Vision Computing
Weighted distances based on neighbourhood sequences
Pattern Recognition Letters
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
Discrete Applied Mathematics
Fast and accurate geodesic distance transform by ordered propagation
Image and Vision Computing
ISBI'09 Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro
Visual reply to map-related queries
Journal of Visual Languages and Computing
Weighted distances based on neighbourhood sequences in non-standard three-dimensional grids
SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Weighted neighbourhood sequences in non-standard three dimensional grids: metricity and algorithms
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Geometric feature estimators for noisy discrete surfaces
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Adaptive morphological filtering using similarities based on geodesic time
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Weighted neighborhood sequences in non-standard three-dimensional grids: parameter optimization
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Digital distance functions on three-dimensional grids
Theoretical Computer Science
Voronoi tessellation and Delauney triangulation using Euclidean disk growing in Z2
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: image and multidimensional signal processing - Volume V
Distance and nearest neighbor transforms of gray-level surfaces using priority pixel queue algorithm
ACIVS'05 Proceedings of the 7th international conference on Advanced Concepts for Intelligent Vision Systems
Skeleton extraction of 2d objects using shock wavefront detection
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Pixel queue algorithm for geodesic distance transforms
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Fuzzy distance based hierarchical clustering calculated using the a∗ algorithm
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Digital distances and integer sequences
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Efficient grid-based spatial representations for robot navigation in dynamic environments
Robotics and Autonomous Systems
| Hi-index | 0.15 |
The uniform-cost algorithm is a special case of the A*-algorithm for finding the shortest paths in graphs. In the uniform-cost algorithm, nodes are expanded in order of increasing cost. An efficient version of this algorithm is developed for integer cost values. Nodes are sorted by storing them at predefined places (bucket sort), keeping the overhead low. The algorithm is applied to general distance transformation. A constrained distance transform is an operation which calculates at each pixel of an image the distance to the nearest pixel of a reference set, distance being defined as minimum path length. The uniform-cost algorithm, in the constrained case, proves to be the best solution for distance transformation. It is fast, the processing time is independent of the complexity of the image, and memory requirements are moderate.