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...

Burrows–Wheeler transform (data compression) Chirplet transform Distance transform Fractal transform Gelfand transform Hadamard transform Hough transform (digital...

Abel transform is the integrated absorbance along a ray with closest distance y from the center of the flame, while the inverse Abel transform gives...

"locally maximum" in the distance transform. This is simply not the case, as even cursory comparison of a distance transform and the resulting skeleton...

binary image is the distance transform. This gives the distance of every set pixel from the nearest unset pixel. The distance transform can be efficiently...

In mathematics, the Fourier transform (FT) is an integral transform that takes a function as input then outputs another function that describes the extent...

A transform fault or transform boundary, is a fault along a plate boundary where the motion is predominantly horizontal. It ends abruptly where it connects...

flooding algorithm used in the construction of Voronoi diagrams and distance transforms. The JFA was introduced by Rong Guodong at an ACM symposium in 2006...

The Hough transform (/hʌf/) is a feature extraction technique used in image analysis, computer vision, pattern recognition, and digital image processing...

(2006). "Jump flooding in GPU with applications to Voronoi diagram and distance transform" (PDF). In Olano, Marc; Séquin, Carlo H. (eds.). Proceedings of the...

In mathematics, the Laplace transform, named after Pierre-Simon Laplace (/ləˈplɑːs/), is an integral transform that converts a function of a real variable...

science, the Levenshtein distance is a string metric for measuring the difference between two sequences. The Levenshtein distance between two words is the...

In mathematics, the Radon transform is the integral transform which takes a function f defined on the plane to a function Rf defined on the (two-dimensional)...

In mathematics and signal processing, the Hilbert transform is a specific singular integral that takes a function, u(t) of a real variable and produces...

not change, or (ii) medial axis, by calculating local maxima in a distance transform of the given digitized object representation, or (B) into modified...

In image processing, the grassfire transform is the computation of the distance from a pixel to the border of a region. It can be described as "setting...

Hadamard transform (also known as the Walsh–Hadamard transform, Hadamard–Rademacher–Walsh transform, Walsh transform, or Walsh–Fourier transform) is an...

operation are applied to the binary image to close gaps. Then, the distance transform operation is applied to the binary image to clear the pixels far from...

counting the minimum number of operations required to transform one string into the other. Edit distances find applications in natural language processing...

In mathematics, the Hankel transform expresses any given function f(r) as the weighted sum of an infinite number of Bessel functions of the first kind...

Chan's algorithm Kirkpatrick–Seidel algorithm Euclidean distance transform: computes the distance between every point in a grid and a discrete collection...

variance, then the Mahalanobis distance corresponds to standard Euclidean distance in the transformed space. The Mahalanobis distance is thus unitless, scale-invariant...

geometry, the Funk transform (also known as Minkowski–Funk transform, Funk–Radon transform or spherical Radon transform) is an integral transform defined by integrating...

to the average viewer at the specified viewing distance, edge effects introduced by block-based transform processing still affect the performance advantage...

close the small gaps. To clear the blob-like shapes, it utilizes the distance transform. After all, the connected pixel groups are individual edges (or contours)...

based on EDT (Digital) Sequential Euclidean distance transform, a distance transform using Euclidean distance, computed sequentially Single-ended double...

operations. Otherwise, the distance is the minimum of the three possible ways to do the transformation: If we can transform s[1..i] to t[1..j-1] in k operations...

asymptotic variance of r is 1 for bivariate normal data. The behavior of this transform has been extensively studied since Fisher introduced it in 1915. Fisher...

number of errors that could have transformed one string into the other. In a more general context, the Hamming distance is one of several string metrics...

Ground robots and includes: standard path planning algorithms (bug, distance transform, D*, and PRM), lattice planning, kinodynamic planning (RRT), localization...