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
10 Sep 2007
TL;DR: The polardistance transform and the grey weighted polar distance transform are introduced for computation of minimum cost paths preferring circular shape, as well as give algorithms for implementations in a digital setting.
Abstract: We introduce the polar distance transform and the grey weighted polar distance transform for computation of minimum cost paths preferring circular shape, as well as give algorithms for implementations in a digital setting. An alternative to the polar distance transform is to transform the image to polar coordinates, and then apply a Cartesian distance transform. By using the polar distance transform, resampling of the image and interpolation of new pixel values are avoided. We also handle the case of grey weighted distance transform in a 5 times 5 neighbourhood, which, to our knowledge, is new. Initial results of using the grey weighted polar distance transform to outline annual rings in images of log end faces are presented.
11 citations
Journal Article•
TL;DR: A novel method was presented, the skeleton obtained by growing from the skeleton seed with 1 pixel width restricted by distance transform, and the connectivity was assured by the growing process.
Abstract: The traditional skeletonization algorithms based on distance transform can not guarantee the connectivity property, so saddle points should be added to solve the connectivity problem. However, these methods are complex and inaccurate, and saddle points can hardly be extended to 3D case. In this paper a novel method was presented, the skeleton obtained by growing from the skeleton seed with 1 pixel width restricted by distance transform, and the connectivity was assured by the growing process. Experiments show that the growing process is a skeleton evolvement from coarse to delicate, and the hierarchical skeleton can be easily achieved.
11 citations
Patent•
27 Apr 2016
TL;DR: In this article, a set of edge points is determined within the plurality of three-dimensional points based, at least in part, on the z coordinate component of a plurality of points and a distance map is generated comprising a matrix of cells.
Abstract: An image of a physical environment is acquired that comprises a plurality of pixels, each pixel including a two-dimensional pixel location in the image plane and a depth value corresponding to a distance between a region of the physical environment and the image plane. For each pixel, the two dimensional pixel location and the depth value is converted into a corresponding three-dimensional point in the physical environment defined by three coordinate components, each of which has a value in physical units of measurement. A set of edge points is determined within the plurality of three-dimensional points based, at least in part, on the z coordinate component of the plurality of points and a distance map is generated comprising a matrix of cells. For each cell of the distance map, a distance value is assigned representing a distance between the cell and the closest edge point to that cell.
11 citations
Patent•
19 May 2006TL;DR: In this paper, a method to extend the display range of 2D image recordings of an object region, particularly in medical applications, was proposed, where the first 2D or 3D image data are acquired from a larger object region and at least one additional set for 2D images of a smaller object region is acquired that lies within the larger region.
Abstract: In a method to extend the display range of 2D image recordings of an object region, particularly in medical applications, first 2D or 3D image data are acquired from a larger object region, and at least one additional set for 2D image data of a smaller object region is acquired that lies within the larger object region The first 2D or 3D image data are brought into registration with the additional 2D image data with a projection geometry. From the first 2D or 3D image data, an image data set is generated for an image display of the first object region, which is suitable for combination with the additional 2D image data. In the image display of the larger object region, at least temporarily, at least one display of the additional 2D image data is integrated, by image data in the first image data set, for the image display of the larger object region, being replaced with image data from the additional 2D image data representing the smaller image region. An overview of the larger object region is thus enabled, with the smaller object region of interest being displayed within the image in a more up-to-date fashion, as well as with higher resolution and/or higher contrast.
11 citations
29 Nov 2006
TL;DR: A new method for adaptive filtering of the distance transform is introduced to smooth and reduce the noise on the meshes that were reconstructed from scanned data acquired with a 3D scanner.
Abstract: In this paper we compute the distance transform of a 3D triangle mesh. A volumetric voxel representation is defined over the mesh to evaluate the distance transform. Optimizations are described to efficiently manipulate the volumetric data structure that represents the mesh. A new method for adaptive filtering of the distance transform is introduced to smooth and reduce the noise on the meshes that were reconstructed from scanned data acquired with a 3D scanner. A modified version of the Marching Cube algorithm is presented to correctly reconstruct the final mesh of the filtered distance transform defined with the voxel representation. The new filtering method is feature preserving and it is more versatile than previous algorithms described in the literature. Results show that this method outperforms previous ones in term of an error metric comparison. Future works are discussed to improve the new method and its computing performances.
11 citations