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
TL;DR: A new algorithm for segmenting general US images that is composed of two major techniques; namely, the early-vision model and the discrete-snake model that has been shown to be comparable to manual delineation and superior to that of the gradient vector flow (GVF) snake model.
Abstract: Due to the speckles and the ill-defined edges of the object of interest, the classic image-segmentation techniques are usually ineffective in segmenting ultrasound (US) images. In this paper, we present a new algorithm for segmenting general US images that is composed of two major techniques; namely, the early-vision model and the discrete-snake model. By simulating human early vision, the early-vision model can capture both grey-scale and textural edges while the speckle noise is suppressed. By performing deformation only on the peaks of the distance map, the discrete-snake model promises better noise immunity and more accurate convergence. Moreover, the constraint for most conventional snake models that the initial contour needs to be located very close to the actual boundary has been relaxed substantially. The performance of the proposed snake model has been shown to be comparable to manual delineation and superior to that of the gradient vector flow (GVF) snake model.
72 citations
TL;DR: A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented, based on the derivation of a rational distance map between the original curve or surface and its offset.
Abstract: A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented Our scheme is based on the derivation of a rational distance map between the original curve or surface and its offset By solving a bivariate polynomial equation for an offset curve or a system of three polynomial equations for an offset surface, all local and global self-intersection regions in offset curves or surfaces can be detected The zero-set of polynomial equation(s) corresponds to the self-intersection regions These regions are trimmed by projecting the zero-set into an appropriate parameter space The projection operation simplifies the analysis of the zero-set, which makes the proposed algorithm numerically stable and efficient Furthermore, in a post-processing step, a numerical marching method is employed, which provides a highly precise scheme for self-intersection elimination in both offset curves and surfaces The effectiveness of our approach is demonstrated using several experimental results
71 citations
TL;DR: An algorithm is proposed which computes the LUT and the neighbourhood to be tested in the case of chamfer distances and results have completely different properties.
70 citations
TL;DR: This paper presents a method for particle picking based on shape feature detection, which has been successfully applied to detect particles with approximately circular or rectangular shapes and the extension of this approach to other types of particles with certain geometric features.
70 citations
TL;DR: A multiscale distance transform is proposed to overcome the need to choose the appropriate scale and the addition of various saliency factors such as edge strength, length, and curvature to the basic distance transform to eliminate the need for thresholds and to improve its effectiveness.
69 citations