Distance transform
Template:Short description Template:More footnotes A distance transform, also known as distance map or distance field, is a derived representation of a digital image. The choice of the term depends on the point of view on the object in question: whether the initial image is transformed into another representation, or it is simply endowed with an additional map or field.
Distance fields can also be signed, in the case where it is important to distinguish whether the point is inside or outside of the shape.[1]
The map labels each pixel of the image with the distance to the nearest obstacle pixel. A most common type of obstacle pixel is a boundary pixel in a binary image. See the image for an example of a Chebyshev distance transform on a binary image.
Usually the transform/map is qualified with the chosen metric. For example, one may speak of Manhattan distance transform, if the underlying metric is Manhattan distance. Common metrics are:
- Euclidean distance
- Taxicab geometry, also known as City block distance or Manhattan distance.
- Chebyshev distance
There are several algorithms to compute the distance transform for these different distance metrics, however the computation of the exact Euclidean distance transform (EEDT) needs special treatment if it is computed on the image grid.[2]
Applications are digital image processing (e.g., blurring effects, skeletonizing), motion planning in robotics, medical-image analysis for prenatal genetic testing, and even pathfinding. [3] Uniformly-sampled signed distance fields have been used for GPU-accelerated font smoothing, for example by Valve researchers.[4]
Signed distance fields can also be used for (3D) solid modelling. Rendering on typical GPU hardware requires conversion to polygon meshes, e.g. by the marching cubes algorithm.[5]
See also
- Signed distance function
- Function representation
- Parallel curve
- Level sets methods for distance computation.[6]
References
Page Template:Reflist/styles.css has no content.
- ^ Page Module:Citation/CS1/styles.css has no content.Gibson, Sarah F. Frisken; Perry, Ronald N.; Rockwood, Alyn P.; Jones, Thouis R. (2000). "Adaptively sampled distance fields: a general representation of shape for computer graphics" (PDF). In Brown, Judith R.; Akeley, Kurt (eds.). Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2000, New Orleans, LA, USA, July 23-28, 2000. Association for Computing Machinery. pp. 249–254. doi:10.1145/344779.344899.
- ^ Strutz, Tilo: The Distance Transform and its Computation. June, 2021, TECH/2021/06, arXiv:2106.03503v1, https://arxiv.org/abs/2106.03503
- ^ Page Module:Citation/CS1/styles.css has no content.Felzenszwalb, Pedro F.; Huttenlocher, Daniel P. (2012). "Distance transforms of sampled functions". Theory of Computing. 8: 415–428. doi:10.4086/toc.2012.v008a019. MR 2967180.
- ^ Chris Green. 2007. Improved alpha-tested magnification for vector textures and special effects. In ACM SIGGRAPH 2007 courses (SIGGRAPH '07). Association for Computing Machinery, New York, NY, USA, 9–18. Script error: No such module "CS1 identifiers".
- ^ Archived at Ghostarchive and the Wayback Machine: Page Module:Citation/CS1/styles.css has no content.Advanced visual effects with DirectX 11. YouTube.
- ^ Kimmel, R.; Kiryati, N. and Bruckstein, A. M.: Distance maps and weighted distance transforms. Journal of Mathematical Imaging and Vision, Special Issue on Topology and Geometry in Computer Vision, 6:223-233,1996.
External links
- Fast distance transform in C++ by Felzenszwalb and Huttenlocher
- Distance Transform tutorials in CVonline
- Survey of fast exact Euclidean distance transform algorithms
- Using distance mapping for AI
- Distance Transforms by Henry Kwong and Dynamic Step Distance Transforms by Richard Scott, The Wolfram Demonstrations Project.
- Morphological DistanceTransform function in Mathematica
- Morphological Inverse Distance Transform function in Mathematica
- A general algorithm for computing distance transforms in linear time [1]
