Results 1 - 10
of
33
Snakes, Shapes, and Gradient Vector Flow
- IEEE TRANSACTIONS ON IMAGE PROCESSING
, 1998
"... Snakes, or active contours, are used extensively in computer vision and image processing applications, particularly to locate object boundaries. Problems associated with initialization and poor convergence to boundary concavities, however, have limited their utility. This paper presents a new extern ..."
Abstract
-
Cited by 338 (12 self)
- Add to MetaCart
Snakes, or active contours, are used extensively in computer vision and image processing applications, particularly to locate object boundaries. Problems associated with initialization and poor convergence to boundary concavities, however, have limited their utility. This paper presents a new external force for active contours, largely solving both problems. This external force, which we call gradient vector flow (GVF), is computed as a diffusion of the gradient vectors of a gray-level or binary edge map derived from the image. It differs fundamentally from traditional snake external forces in that it cannot be written as the negative gradient of a potential function, and the corresponding snake is formulated directly from a force balance condition rather than a variational formulation. Using several two-dimensional (2-D) examples and one three-dimensional (3-D) example, we show that GVF has a large capture range and is able to move snakes into boundary concavities.
Global Minimum for Active Contour Models: A Minimal Path Approach
, 1997
"... A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model’s energy between two end points. Initialization is made easier and the curve is not trapped at a local minimum by spurious edges. We modify the “snake” energy by including the ..."
Abstract
-
Cited by 139 (43 self)
- Add to MetaCart
A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model’s energy between two end points. Initialization is made easier and the curve is not trapped at a local minimum by spurious edges. We modify the “snake” energy by including the internal regularization term in the external potential term. Our method is based on finding a path of minimal length in a Riemannian metric. We then make use of a new efficient numerical method to find this shortest path. It is shown that the proposed energy, though based only on a potential integrated along the curve, imposes a regularization effect like snakes. We explore the relation between the maximum curvature along the resulting contour and the potential generated from the image. The method is capable to close contours, given only one point on the objects’ boundary by using a topology-based saddle search routine. We show examples of our method applied to real aerial and medical images.
Gradient vector flow: A new external force for snakes
- In Proceedings of the Conference on Computer Vision and Pattern Recognition
, 1997
"... Snakes, or active contours, are used extensively in computer vision and image processing applications, particularly to locate object boundaries. Problems associated with initialization and poor convergence to concave boundaries, howevel; have limited their utility. This paper develops a new external ..."
Abstract
-
Cited by 114 (5 self)
- Add to MetaCart
Snakes, or active contours, are used extensively in computer vision and image processing applications, particularly to locate object boundaries. Problems associated with initialization and poor convergence to concave boundaries, howevel; have limited their utility. This paper develops a new external force for active contours, largely solving both problems. This external force, which we call gradient vector flow (GVF), is computed as a dijhsion of the gradient vectors of a gray-level or binary edge map derived from the image. The resultant field has a large capture range and forces active contours into concave regions. Examples on simulated images and one real image are presented. 1
Using a Deformable Surface Model to Obtain a Shape Representation of the Cortex
- IEEE Trans. Med. Imag
, 1996
"... The problem of obtaining a mathematical representation of the cortex of the human brain is examined. A parametrization of the outer cortex is first obtained using a deformable surface algorithm which, motivated by the structure of the cortex, is constructed to find the central layer of thick surface ..."
Abstract
-
Cited by 74 (6 self)
- Add to MetaCart
The problem of obtaining a mathematical representation of the cortex of the human brain is examined. A parametrization of the outer cortex is first obtained using a deformable surface algorithm which, motivated by the structure of the cortex, is constructed to find the central layer of thick surfaces. Based on this parametrization, a hierarchical representation of the cortical structure is proposed through its depth map and its curvature maps at various scales. Various experiments on magnetic resonance data are presented. I. Introduction The problem of finding and parametrizing boundaries in two- and three-dimensional images is often an important step toward shape visualization and analysis, and has been extensively studied in the image analysis and computer vision literature. Several methods have been proposed, basedboth on bottom-up and top-bottom procedures. One very promising model which combines robustness to noise and the flexibility to represent a broad class of shapes is base...
A topology preserving level set method for geometric deformable models
- IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2003
"... Active contour and surface models, also known as deformable models, are powerful image segmentation techniques. Geometric deformable models implemented using level set methods have advantages over parametric models due to their intrinsic behavior, parameterization independence, and ease of implement ..."
Abstract
-
Cited by 59 (2 self)
- Add to MetaCart
Active contour and surface models, also known as deformable models, are powerful image segmentation techniques. Geometric deformable models implemented using level set methods have advantages over parametric models due to their intrinsic behavior, parameterization independence, and ease of implementation. However, a long claimed advantage of geometric deformable models—the ability to automatically handle topology changes—turns out to be a liability in applications where the object to be segmented has a known topology that must be preserved. In this paper, we present a new class of geometric deformable models designed using a novel topology-preserving level set method, which achieves topology preservation by applying the simple point concept from digital topology. These new models maintain the other advantages of standard geometric deformable models including subpixel accuracy and production of nonintersecting curves or surfaces. Moreover, since the topology-preserving constraint is enforced efficiently through local computations, the resulting algorithm incurs only nominal computational overhead over standard geometric deformable models. Several experiments on simulated and real data are provided to demonstrate the performance of this new deformable model algorithm.
Minimal Surfaces Based Object Segmentation
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1997
"... A geometric approach for 3D object segmentation and representation is presented. The segmentation is obtained by deformable surfaces moving towards the objects to be detected in the 3D image. The model is based on curvature motion and the computation of surfaces with minimal areas, better known as m ..."
Abstract
-
Cited by 57 (12 self)
- Add to MetaCart
A geometric approach for 3D object segmentation and representation is presented. The segmentation is obtained by deformable surfaces moving towards the objects to be detected in the 3D image. The model is based on curvature motion and the computation of surfaces with minimal areas, better known as minimal surfaces. The space where the surfaces are computed is induced from the 3D image (volumetric data) in which the objects are to be detected. The model links between classical deformable surfaces obtained via energy minimization, and intrinsic ones derived from curvature based flows. The new approach is stable, robust, and automatically handles changes in the surface topology during the deformation. Index Terms---3D segmentation, minimal surfaces, deformable models, mean curvature motion, medical images. ------------------------ F ------------------------ 1I NTRODUCTION ONE of the basic problems in image analysis is object detection. It can be associated with the problem of boundary detection, when boundaries are defined as curves or surfaces separating homogeneous regions. "Snakes," or active contours, were proposed by Kass et al. in [16] to solve this problem, and were later extended to 3D surfaces. The classical snakes and 3D deformable surfaces approach are based on deforming an initial contour or surface towards the boundary of the object to be detected. The deformation is obtained by minimizing a functional designed so that its (local) minima is at the boundary of the object [3], [33]. The energy usually involves two terms, one that controls the smoothness of the surface and the other that attracts it to the object's boundary. The topology of the final surface is, in general, as that of the initial one, unless special procedures are used to detect possible spli...
Fast extraction of minimal paths in 3D images and applications to virtual endoscopy
, 2001
"... ..."
A Fully Global Approach to Image Segmentation via Coupled Curve Evolution Equations
- Journal of Visual Communication and Image Representation
, 2002
"... In this paper, we develop a novel region-based approach to snakes designed to optimally separate the values of certain image statistics over a known number of region types. Multiple sets of contours deform according to a coupled set of curve evolution equations derived from a single global cost func ..."
Abstract
-
Cited by 43 (7 self)
- Add to MetaCart
In this paper, we develop a novel region-based approach to snakes designed to optimally separate the values of certain image statistics over a known number of region types. Multiple sets of contours deform according to a coupled set of curve evolution equations derived from a single global cost functional. The resulting active contour model, in contrast to many other edge and region based models, is fully global in that the evolution of each curve depends at all times upon every pixel in the image and is directly coupled to the evolution of every other curve regardless of their mutual proximity. As such evolving contours enjoy a very wide “field of view, ” endowing the algorithm with a robustness to initial contour placement above and beyond the significant improvement exhibited by other region based snakes over earlier edge based snakes. C ○ 2002 Elsevier Science (USA) Key Words: active contours; curve evolution; snakes; segmentation; gradient flows.
Zoom-Invariant Vision of Figural Shape: The Mathematics of Cores
"... Believing that figural zoom invariance and the cross-figural boundary linking implied by medial loci are important aspects of object shape, we present the mathematics of and algorithms for the extraction of medial loci directly from image intensities. The medial loci called cores are defined as gene ..."
Abstract
-
Cited by 38 (10 self)
- Add to MetaCart
Believing that figural zoom invariance and the cross-figural boundary linking implied by medial loci are important aspects of object shape, we present the mathematics of and algorithms for the extraction of medial loci directly from image intensities. The medial loci called cores are defined as generalized maxima in scale space of a form of medial information that is invariant to translation, rotation, and in particular, zoom. These loci are very insensitive to image disturbances, in strong contrast to previously available medial loci, as demonstrated in a companion paper. Core-related geometric properties and image object representations are laid out which, together with the aforementioned insensitivities, allow the core to be used effectively for a variety of image analysis objectives.
Level Set Based Segmentation with Intensity and Curvature Priors
, 2000
"... A method is presented for segmentation of anatomical structures that incorporates prior information about the intensity and curvature pro le of the structure from a training set of images and boundaries. Specifically, we model the intensity distribution as a function of signed distance from the obje ..."
Abstract
-
Cited by 38 (0 self)
- Add to MetaCart
A method is presented for segmentation of anatomical structures that incorporates prior information about the intensity and curvature pro le of the structure from a training set of images and boundaries. Specifically, we model the intensity distribution as a function of signed distance from the object boundary, instead of modeling only the intensity of the object as a whole. A curvature pro le acts as a boundary regularization term specific to the shape being extracted, as opposed to simply penalizing high curvature. Using the prior model, the segmentation process estimates a maximum a posteriori higher dimensional surface whose zero level set converges on the boundary of the object to be segmented. Segmentation results are demonstrated on synthetic data and magnetic resonance imagery.

