Results 1  10
of
2,696
Applications of the Region Growing Euclidean Distance Transform: Anisotropy and Skeletons
 97, Lecture Notes in Computer Science
, 1997
"... A new region growing algorithm has recently been proposed for computing Euclidean Distance Maps in a time comparable to widely used chamfer DT. In this paper we show how this algorithm can be extended to more complex tasks such as the computation of distance maps on anisotropic grids and the genera ..."
Abstract
 Add to MetaCart
A new region growing algorithm has recently been proposed for computing Euclidean Distance Maps in a time comparable to widely used chamfer DT. In this paper we show how this algorithm can be extended to more complex tasks such as the computation of distance maps on anisotropic grids
ThreeYear Wilkinson Microwave Anisotropy Probe (WMAP) Observations: Temperature Analysis. On arXiv.org: astroph/0603451
, 2006
"... A simple cosmological model with only six parameters (matter density, Ωmh 2, baryon density, Ωbh 2, Hubble Constant, H0, amplitude of fluctuations, σ8, optical ..."
Abstract

Cited by 362 (7 self)
 Add to MetaCart
A simple cosmological model with only six parameters (matter density, Ωmh 2, baryon density, Ωbh 2, Hubble Constant, H0, amplitude of fluctuations, σ8, optical
Rigidity of quasiisometries for symmetric spaces and Euclidean buildings
 Inst. Hautes Études Sci. Publ. Math
, 1997
"... 1.1 Background and statement of results An (L, C) quasiisometry is a map Φ: X − → X ′ between metric spaces such that for all x1, x2 ∈ X ..."
Abstract

Cited by 193 (28 self)
 Add to MetaCart
1.1 Background and statement of results An (L, C) quasiisometry is a map Φ: X − → X ′ between metric spaces such that for all x1, x2 ∈ X
Euclidean Distance Maps on Non Convex Domains
"... . In this paper we present an algorithm of construction of Euclidean distance maps on non convex domain. A distance map is the image of a distance transform which is a function associating each point of a set of point S with the distance from the nearest point of a subset of points of S. Several eff ..."
Abstract
 Add to MetaCart
. In this paper we present an algorithm of construction of Euclidean distance maps on non convex domain. A distance map is the image of a distance transform which is a function associating each point of a set of point S with the distance from the nearest point of a subset of points of S. Several
Mean Curvature Skeletons
"... Figure 1: Given a watertight surface (a), the wellknown medial axis transform (b) often produces too complex of a structure to be of practical use. Our skeletonization algorithm can produce intermediate mesoskeletons (c), which contain medial sheets where needed and curves where appropriate, while ..."
Abstract
 Add to MetaCart
Figure 1: Given a watertight surface (a), the wellknown medial axis transform (b) often produces too complex of a structure to be of practical use. Our skeletonization algorithm can produce intermediate mesoskeletons (c), which contain medial sheets where needed and curves where appropriate
A Review of Vessel Extraction Techniques and Algorithms
 ACM Computing Surveys
, 2000
"... Vessel segmentation algorithms are the critical components of circulatory blood vessel analysis systems. We present a survey of vessel extraction techniques and algorithms. We put the various vessel extraction approaches and techniques in perspective by means of a classification of the existing r ..."
Abstract

Cited by 183 (0 self)
 Add to MetaCart
Vessel segmentation algorithms are the critical components of circulatory blood vessel analysis systems. We present a survey of vessel extraction techniques and algorithms. We put the various vessel extraction approaches and techniques in perspective by means of a classification of the existing research. While we have mainly targeted the extraction of blood vessels, neurosvascular structure in particular, we have also reviewed some of the segmentation methods for the tubular objects that show similar characteristics to vessels. We have divided vessel segmentation algorithms and techniques into six main categories: (1) pattern recognition techniques, (2) modelbased approaches, (3) trackingbased approaches, (4) artificial intelligencebased approaches, (5) neural networkbased approaches, and (6) miscellaneous tubelike object detection approaches. Some of these categories are further divided into sub categories. We have also created tables to compare the papers in each category against such criteria as dimensionality, input type, preprocessing, user interaction, and result type.
Hexadecagonal region growing
 Pattern Recognition Letters
, 1998
"... Abstract In spite of their nonisotropic nature, local growths based on 4connected or 8connected neighborhoods are frequently used for binary image dilation, mostly because they are very easy to implement. Altough better dilation techniques exist, they usually require bigger masks, more complex r ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract In spite of their nonisotropic nature, local growths based on 4connected or 8connected neighborhoods are frequently used for binary image dilation, mostly because they are very easy to implement. Altough better dilation techniques exist, they usually require bigger masks, more complex routines, exotical grid definitions or globally processing the image. In this article we propose a new 3x3 implementation of the hexadecagonal model for a better aproximation of isotropic growth on a square grid that doesn’t have the problems of its traditional incarnations.
Chordal Axis on Weighted Distance Transforms
"... Abstract. Chordal Axis (CA) is a new representation of planar shapes introduced by Prasad in [7], useful for skeleton computation, shape analysis, characterization and recognition. The CA is a subset of chord and center of disks tangent to the contour of a shape, derivated from Medial Axis (MA). Ori ..."
Abstract
 Add to MetaCart
). Originally presented in a computational geometry approach, the CA was extracted on a constrained Delaunay triangulation of a discretely sampled contour of a shape. Since discrete distance transformations allow to efficiently compute the center of distance balls and detect discrete MA, we propose
Results 1  10
of
2,696