The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce a three-dimensional signed parallel [...]

Fast computation of distance transforms find direct application in various computer vision problems. Currently there exists two image filters in the ITK library which can be used to generate distance maps. Unfortunately, these filters produce only [...]

We have implemented an Order K Distance Transform filter. The Order K distance transform computes the distances to the k nearest foreground pixels. Additionally the Order K Voronoi diagram can be computed. This work was supported in part by R21 MH67054, NSF [...]

This document describes the implementation of an algorithm that computes a generalization of the distance transform with the squared euclidean metric. The generalization allows for interesting image operators, e.g. a morphologic dilation with euclidean ball [...]

It is often useful to be able to compute the component of image gradient in a direction defined by a shape of some form, rather than relative to the image axis. This article introduces a simple method for doing this based on distance transforms that is [...]

This work describes the implementation of computational geometry algorithms developed within the Insight Toolkit (ITK): Distance Transform (DT), Voronoi diagrams, k Nearest Neighbor (kNN) transform, and finally a K Nearest Neighbor classifier for multichannel [...]

Morphological erosion and dilation filters employ a structuring function, with flat structuring functions being the most common example. This article will use the term ``parabolic'', but much of the literature uses ``quadratic'' structuring functions are less [...]