Topic
Distance transform
About: Distance transform is a research topic. Over the lifetime, 2886 publications have been published within this topic receiving 59481 citations.
Papers published on a yearly basis
Papers
More filters
27 Oct 2002
TL;DR: This work presents a fast and reliable space-leaping scheme to accelerate ray casting during interactive navigation in a complex volumetric scene, where it employs a novel fast cell-based reprojection scheme that is more reliable than the traditional intersection-point based reprojection.
Abstract: We present a fast and reliable space-leaping scheme to accelerate ray casting during interactive navigation in a complex volumetric scene, where we combine innovative space-leaping techniques in a number of ways. First, we derive most of the pixel depths at the current frame by exploiting the temporal coherence during navigation, where we employ a novel fast cell-based reprojection scheme that is more reliable than the traditional intersection-point based reprojection. Next, we exploit the object space coherence to quickly detect the remaining pixel depths, by using a precomputed accurate distance field that stores the Euclidean distance from each empty (background) voxel toward its nearest object boundary. In addition, we propose an effective solution to the challenging new-incoming-objects problem during navigation. Our algorithm has been implemented on a 16-processor SGI Power Challenge and reached interactive rendering rates at more than 10 Hz during the navigation inside 512/sup 3/ volume data sets acquired from both a simulation phantom and actual patients.
34 citations
15 Oct 2001
TL;DR: The erosion algorithm is based on a propagation scheme which resulted in an overall Euclidean distance transform algorithm very simple to code and understand, yet with speed performance compared to the Chamfer 3-5-7 sequential raster and anti-raster algorithm.
Abstract: The paper presents a novel Euclidean distance transform algorithm formulated under the mathematical morphology approach. The distance transform is an erosion by a structuring function dependent on the distance metric used. To achieve high speed performance, the squared Euclidean distance structuring function is decomposed into a family of four one-dimensional two-point structuring functions. The erosion algorithm is based on a propagation scheme which resulted in an overall Euclidean distance transform algorithm very simple to code and understand, yet with speed performance compared to the Chamfer 3-5-7 sequential raster and anti-raster algorithm.
34 citations
TL;DR: Wang et al. as mentioned in this paper developed an improved watershed analysis, which defines a dimensionless parameter α to discriminate contacts and necks, which can effectively segment 3D particle contacts while preserving the continuity of necks for different granular soils.
34 citations
TL;DR: This work proposes a fast implementation, based on Chamfer distance, which preserves the interface location and shows reasonable accuracy and considerable speed-up when segmenting three-dimensional medical data using level sets.
34 citations
TL;DR: It is shown that in the presence of a simple geometrical constraint city block distance between n -dimensional lattice point is characterized by a condition used by Rosenfeld in an investigation of continuous functions on digital images.
34 citations