|
|
|
|
|
|
 |
|
|
Local Distances for Distance Transformations in Two and Three Dimensions
|
|
|
|
|
|
|
|
|
|
|
|
| Pattern Recognition Letters |
|
|
|
|
|
|
A unified treatment is presented for determining the distance between two points in a two- or three-dimensional digitized space. Instead of a global Euclidean distance, a distance transformation based upon a secquence of optimal local distances is used. The optimal distance is derived in the context of minimizing the maximum error and the unbiased mean suqare error. Integer approximations for the local distances are developed for neighborhood sizes of three and five. Minimization is performed over crcles and spheres to preserve the symmetries of the neighborhoods. In two dimensions the differences with previously published results are small. The results in three dimensions are new.
|
|
|
|
|
|
|
|
|
|
|
|
distance transform, local distances, chamfer distance, maximum error, mean square error, bias, isotropy
|
|
|
|
|
|
|
| | | | | |
|
For the newest resources, visit Wolfram Repositories and Archives »
