Results 1  10
of
736
Active Contours without Edges
, 2001
"... In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, MumfordShah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gradient. We minimize an energy ..."
Abstract

Cited by 1188 (37 self)
 Add to MetaCart
In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, MumfordShah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gradient. We minimize an energy which can be seen as a particular case of the minimal partition problem. In the level set formulation, the problem becomes a "meancurvature flow"like evolving the active contour, which will stop on the desired boundary. However, the stopping term does not depend on the gradient of the image, as in the classical active contour models, but is instead related to a particular segmentation of the image. We will give a numerical algorithm using finite differences. Finally, we will present various experimental results and in particular some examples for which the classical snakes methods based on the gradient are not applicable. Also, the initial curve can be anywhere in the image, and interior contours are automatically detected.
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 199 (5 self)
 Add to MetaCart
(Show Context)
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 graylevel 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
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
(Show Context)
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.
Level set evolution without reinitialization: A new variational formulation
 in Proc. of IEEE Conference on Computer Vision and Pattern Recognition
, 2005
"... In this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and therefore completely eliminates the need of the costly reinitialization procedure. Our variational formulation consists of an inter ..."
Abstract

Cited by 151 (4 self)
 Add to MetaCart
(Show Context)
In this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and therefore completely eliminates the need of the costly reinitialization procedure. Our variational formulation consists of an internal energy term that penalizes the deviation of the level set function from a signed distance function, and an external energy term that drives the motion of the zero level set toward the desired image features, such as object boundaries. The resulting evolution of the level set function is the gradient flow that minimizes the overall energy functional. The proposed variational level set formulation has three main advantages over the traditional level set formulations. First, a significantly larger time step can be used for numerically solving the evolution partial differential equation, and therefore speeds up the curve evolution. Second, the level set function can be initialized with general functions that are more efficient to construct and easier to use in practice than the widely used signed distance function. Third, the level set evolution in our formulation can be easily implemented by simple finite difference scheme and is computationally more efficient. The proposed algorithm has been applied to both simulated and real images with promising results. 1.
Generalized Gradient Vector Flow External Forces for Active Contours
 Signal Processing
, 1998
"... Active contours, or snakes, are used extensively in computer vision and image processing applications, particularly to locate object boundaries. A new type of external force for active contours, called gradient vector flow (GVF) was introduced recently to address problems associated with initializat ..."
Abstract

Cited by 144 (6 self)
 Add to MetaCart
(Show Context)
Active contours, or snakes, are used extensively in computer vision and image processing applications, particularly to locate object boundaries. A new type of external force for active contours, called gradient vector flow (GVF) was introduced recently to address problems associated with initialization and poor convergence to boundary concavities. GVF is computed as a di#usion of the gradient vectors of a graylevel or binary edge map derived from the image. In this paper, we generalize the GVF formulation to include two spatially varying weighting functions. This improves active contour convergence to long, thin boundary indentations, while maintaining other desirable properties of GVF, such as an extended capture range. The original GVF is a special case of this new generalized GVF (GGVF) model. An error analysis for active contour results on simulated test images is also presented. # 1998 Elsevier Science B.V. All rights reserved. Zusammenfassung Aktive Umrisse, oder Schlangen, we...
Flux Maximizing Geometric Flows
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... Several geometric active contour models have been proposed for segmentation in computer vision and image analysis. The essential idea is to evolve a curve (in 2D) or a surface (in 3D) under constraints from image forces so that it clings to features of interest in an intensity image. Recent variatio ..."
Abstract

Cited by 126 (8 self)
 Add to MetaCart
Several geometric active contour models have been proposed for segmentation in computer vision and image analysis. The essential idea is to evolve a curve (in 2D) or a surface (in 3D) under constraints from image forces so that it clings to features of interest in an intensity image. Recent variations on this theme take into account properties of enclosed regions and allow for multiple curves or surfaces to be simultaneously represented. However, it is still unclear how to apply these techniques to images of narrow elongated structures, such as blood vessels, where intensity contrast may be low and reliable region statistics cannot be computed. To address this problem we derive the gradient flows which maximize the rate of increase of flux of an appropriate vector field through a curve (in 2D) or a surface (in 3D). The key idea is to exploit the direction of the vector field along with its magnitude. The calculations lead to a simple and elegant interpretation which is essentially parameter free and has the same form in both dimensions. We illustrate its advantages with several levelset based segmentations of 2D and 3D angiography images of blood vessels.
An Active Contour Model without Edges
 Int. Conf. ScaleSpace Theories in Computer Vision
, 1999
"... In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, MumfordShah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gradient. ..."
Abstract

Cited by 103 (11 self)
 Add to MetaCart
(Show Context)
In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, MumfordShah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gradient.
Image segmentation using deformable models
 Handbook of Medical Imaging. Vol.2 Medical Image Processing and Analysis
"... ..."
Distance Regularized Level Set Evolution and Its Application to Image Segmentation
 IEEE TRANSACTIONS ON IMAGE PROCESSING
, 2010
"... Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities during its evolution, which may cause numerical errors and eventually destroy the stability of the evolution. Therefore, ..."
Abstract

Cited by 72 (1 self)
 Add to MetaCart
Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities during its evolution, which may cause numerical errors and eventually destroy the stability of the evolution. Therefore, a numerical remedy, called reinitialization, is typically applied to periodically replace the degraded level set function with a signed distance function. However, the practice of reinitialization not only raises serious problems as when and how it should be performed, but also affects numerical accuracy in an undesirable way. This paper proposes a new variational level set formulation in which the regularity of the level set function is intrinsically maintained during the level set evolution. The level set evolution is derived as the gradient flow that minimizes an energy functional with a distance regularization term and an external energy that drives the motion of the zero
Reconstruction of the human cerebral cortex from magnetic resonance images
 IEEE Trans. Med. Imag
, 1999
"... Abstract—Reconstructing the geometry of the human cerebral cortex from MR images is an important step in both brain mapping and surgical path planning applications. Difficulties with imaging noise, partial volume averaging, image intensity inhomogeneities, convoluted cortical structures, and the req ..."
Abstract

Cited by 68 (11 self)
 Add to MetaCart
(Show Context)
Abstract—Reconstructing the geometry of the human cerebral cortex from MR images is an important step in both brain mapping and surgical path planning applications. Difficulties with imaging noise, partial volume averaging, image intensity inhomogeneities, convoluted cortical structures, and the requirement to preserve anatomical topology make the development of accurate automated algorithms particularly challenging. In this paper we address each of these problems and describe a systematic method for obtaining a surface representation of the geometric central layer of the human cerebral cortex. Using fuzzy segmentation, an isosurface algorithm, and a deformable surface model, the method reconstructs the entire cortex with the correct topology, including deep convoluted sulci and gyri. The method is largely automated and its results are robust to imaging noise, partial volume averaging, and image intensity inhomogeneities. The performance of this method is demonstrated, both qualitatively and quantitatively, and the results of its application to six subjects and one simulated MR brain volume are presented. Index Terms—Cortical surface reconstruction, deformable surface models, fuzzy segmentation, isosurface, magnetic resonance imaging. I.