IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature Recognition in Solar Images
Artificial Intelligence Review
Generalized sweep templates for implicit modeling
GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Locally adaptable mathematical morphology using distance transformations
Pattern Recognition
ACM Transactions on Graphics (TOG)
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
New sequential exact Euclidean distance transform algorithms based on convex analysis
Image and Vision Computing
Optimized point cloud triangulation for 3D scanning systems
Machine Graphics & Vision International Journal
A video-based indoor occupant detection and localization algorithm for smart buildings
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Euclidean distance transform of digital images in arbitrary dimensions
PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
Relief: a modeling by drawing tool
SBM'04 Proceedings of the First Eurographics conference on Sketch-Based Interfaces and Modeling
| Hi-index | 0.01 |
We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson (1980). Those corrections are only applied to a small neighborhood of a small subset of pixels from the image, which keeps the cost of the operation low. In contrast with all fast algorithms previously published, our algorithm produces perfect Euclidean distance maps in a time linearly proportional to the number of pixels in the image. The computational cost is close to the cost of the 4SSED approximation.