Abstract:   We apply a level set formulation to the problem of surface advancement in three-dimensional topography simulation of deposition, etching, and lithography processes in integrated circuit fabrication. The level set formulation is based on solving a Hamilton-Jacobi-type equation for a propagating level set function, using techniques borrowed from hyperbolic conservation laws. Topological changes, corner and cusp development, and accurate determination of geometric properties such as curvature and normal direction are naturally obtained in this setting. The equations of motion of a unified model, including the effects of isotropic and unidirectional deposition and etching, visibility, surface diffusion, reflection, and material dependent etch/deposition rates are presented and adapted to a level set formulation. In Part I of this paper, the basic equations and algorithms for two-dimensional simulations were developed. In this paper, the extension to three dimensions is presen!

Abstract:   We present a controlled image smoothing and enhancement method based on a curvature flow interpretation of the geometric heat equation. Compared to existing techniques, the model has several distinct advantages. (i) It contains just one enhancement parameter. (ii) The scheme naturally inherits a stopping criterion from the image; continued application of the scheme produces no further change. (iii) The method is one of the fastest possible schemes based on a curvature-controlled approach.

Abstract:   A novel interactive segmentation method has been developed which uses estimated boundaries, generated from cores, to initialize a scale-space boundary evolution process in greyscale medical images. Presented is an important addition to core extraction methodology that improves core generation for objects that are in the presence of interfering objects. The boundary at the scale of the core (BASOC) and its associated width information, both derived from the core, are used to initialize the second stage of the segmentation process. In this automatic refinement stage, the BASOC is allowed to evolve in a spline-snake-like manner that makes use of object-relevant width information to make robust measurements of local edge positions.

Abstract:   Object size inspection is an important task and has various applications in computer vision. For example, the automatic control of stone-breaking machines, which perform better if the sizes of the stones to be broken can be predicted. An algorithm is proposed for image segmentation in size inspection for almost round stones with high or low texture. Although our experiments are focused on stones, the algorithm can be applied to other 3-D objects. We use one fixed camera and four light sources at four different positions one at a time, to take four images. Then we compute the image differences and binarize them to extract edges. We explain, step by step, the photographing, the edge extraction, the noise removal, and the edge gap filling. Experimental results are presented.

Abstract:   We present a class of PDE-based algorithms suitable for image denoising and enhancement. The techniques are applicable to both salt-and-pepper gray-scale noise and full-image continuous noise present in black and white images, gray-scale images, texture images, and color images. At the core, the techniques rely on two fundamental ideas. First, a level set formulation is used for evolving curves; use of this technique to flow isointensity contours under curvature is known to remove noise and enhance images. Second, the particular form of the curvature how is governed by a minimax switch which selects a range of denoising dependent on the size of switching window. Our approach has several virtues. First, it contains only one enhancement parameter, which in most cases is automatically chosen. Second, the scheme automatically stops smoothing at a point which depends on the switching window size; continued application of the scheme produces no further change. Third, the method!

Abstract:   We present a shape-recovery technique in two dimensions and three dimensions with specific applications in modeling anatomical shapes from medical images. This algorithm models extremely corrugated structures like the brain, is topologically adaptable, and runs in O(N log N) time, where N is the total number of points in the domain. Our technique is based on a level set shape-recovery scheme recently introduced by the authors and the fast marching method for computing solutions to static Hamilton-Jacobi equations.

Abstract:   This paper describes a new global shape parameterization for smoothly deformable three-dimensional (3-D) objects, such as those found in biomedical images, whose diversity and irregularity make them difficult to represent in terms of fixed features or parts. This representation is used for geometric surface matching to 3-D medical image data, such as from magnetic resonance imaging (MRI). The parameterization decomposes the surface into sinusoidal basis functions. Four types of surfaces are modeled: tori, open surfaces, closed surfaces and tubes. This parameterization allows a wide variety of smooth surfaces to be described with a small number of parameters. Extrinsic model-based information is incorporated by introducing prior probabilities on the parameters. Surface finding is formulated as an optimization problem, Results of the method applied to synthetic images and 3-D medical images of the heart and brain are presented.

Abstract:   In this paper, we analyze geometric active contour models from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new feature-based Riemannian metrics. This leads to a novel edge-detection paradigm in which the feature of interest may be considered to lie at the bottom of a potential well. Thus an edge-seeking curve is attracted very naturally and efficiently to the desired feature. Comparison with the Allen-Cahn model clarifies some of the choices made in these models, and suggests inhomogeneous models which may in return be useful in phase transitions. We also consider some 3-dimensional active surface models based on these ideas. The justification of this model rests on the careful study of the viscosity solutions of evolution equations derived from a level-set approach.

Abstract:   We present a unified approach to noise removal, image enhancement, and shape recovery in images. The underlying approach relies on the level set formulation of curve and surface motion, which leads to a class of PDE-based algorithms. Beginning with an image, the first stage of this approach removes noise and enhances the image by evolving the image under flow controlled by min/max curvature and by the mean curvature. This stage is applicable to both salt-and-pepper grey-scale noise and full-image continuous noise present in black and white images, grey-scale images, texture images, and color images. The noise removal/enhancement schemes applied in this stage contain only one enhancement parameter, which in most cases is automatically chosen. The other key advantage of our approach is that a stopping criteria is automatically picked from the image; continued application of the scheme produces no further change. The second stage of our approach is the shape recovery of a de!

Abstract:   Accurately segmenting and quantifying structures is a key issue in biomedical image analysis. The two conventional methods of image segmentation, region-based segmentation, and boundary finding, often suffer from a variety of limitations. Here we propose a method which endeavors to integrate the two approaches in an effort to form a unified approach that is robust to noise and poor initialization. Our approach uses Green's theorem to derive the boundary of a homogeneous region-classified area in the image and integrates this with a gray level gradient-based boundary finder. This combines the perceptual notions of edge/shape information with gray level homogeneity. A number of experiments were performed both on synthetic and real medical images of the brain and heart to evaluate the new approach, and it is shown that the integrated method typically performs better when compared to conventional gradient-based deformable boundary finding. Further, this method yields these im!

Abstract:   This paper examines the problem of obtaining a mathematical representation of the outer cortex of the human brain, which is a key problem in several applications, including morphological analysis of the brain, and spatial normalization and registration of brain images. A parameterization 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 parameterization, a hierarchical representation of the outer cortical structure is proposed through its depth map and its curvature maps at various scales. Various experiments on magnetic resonance data are presented.

Abstract:   In this paper, we propose a geometric partial differential equation (PDE) for tracking one or several moving objects from a sequence of images, which is based on a geometric model for active contours. The active contour approach permits us to simultaneously handle both aspects: finding the boundaries and tracking them. We also describe a numerical scheme to solve the geometric equation and we present some numerical experiments.

Abstract:   Finding the shortest path between points on a surface is a challenging global optimization problem. It is difficult to devise an algorithm that is computationally efficient, locally accurate and guarantees to converge to the globally shortest path. In this paper a two stage coarse-to-fine approach for finding the shortest paths is suggested. In the first stage the algorithm of Ref. 10 that combines a 3D length estimator with graph search is used to rapidly obtain an approximation to the globally shortest path. In the second stage the approximation is refined to become a shorter geodesic curve, i.e., a locally optimal path. This is achieved by using an algorithm that deforms an arbitrary initial curve ending at two given surface points via geodesic curvature shortening flow. The 3D curve shortening how is transformed into an equivalent 2D one that is implemented using an efficient numerical algorithm for curve evolution with fixed end points, introduced in Ref. 9.

Abstract:   In this paper. we introduce an unsupervised contour estimation strategy based on parametrically deformable models. The problem is formulated in a (statistical) parameter estimation framework with the parameters of both the contour the and observation model (the likelihood function) being considered unknown. Although other choices could fit in our formulation, we focus on Fourier and B-spline contour descriptors. To estimate the optimal parametrization order (e.g,, the number of Fourier coefficients) we adopt the minimum description length (MDL) principle. The result is a parametrically deformable contour with an adaptive degree of smoothness and which also autonomously estimates the observation model parameters.

Abstract:   The range of surface evolution problems in etching, deposition, and lithography development offers significant challenge for numerical methods in front tracking. Level set methods for evolving interfaces are specifically designed for profiles which can develop sharp corners, change topology, and undergo orders of magnitude changes in speed, They are based on solving a Hamilton-Jacobi type equation for a level set function, using techniques borrowed from hyperbolic conservation laws. Over the past few years, a body of level set methods have been developed with application to microfabrication problems, In this paper, we give an overview of these techniques, describe the implementation in etching, deposition, and lithography simulations, and present a collection of fast level set methods, each aimed at a particular application, In the case of photoresist development and isotropic etching/deposition, the fast marching level set method, introduced by Sethian in [39], [40], can!

Abstract:   This paper presents a general framework to generate multi-scale representations of image data. The process is considered as an initial value problem with an acquired image as initial condition and a geometrical invariant as ''driving force'' of an evolutionary process. The geometrical invariants are extracted using the family of Gaussian derivative operators. These operators naturally deal with scale as a free parameter and solve the ill-posedness problem of differentiation. Stability requirements for numerical approximation of evolution schemes using Gaussian derivative operators are derived and establish an intuitive connection between the allowed time-step and scale. This approach has been used to generalize and implement a variety of nonlinear diffusion schemes. Results on test images and medical images are shown.

Abstract:   In this note, we employ the new geometric active contour models formulated in [25] and [26] for edge detection and segmentation of magnetic resonance imaging (MRI), computed tomography (CT), and ultrasound medical imagery, Our method is based on defining feature-based metrics on a given image which in turn leads to a novel snake paradigm in which the feature of interest mag be considered to lie at the bottom of a potential well, Thus, the snake is attracted very quickly and efficiently to the desired feature.

Abstract:   A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time according to intrinsic geometric measures of the image. The evolving contours naturally split and merge, allowing the simultaneous detection of several objects and both interior and exterior boundaries. The proposed approach is based on the relation between active contours and the computation of geodesics or minimal distance curves. The minimal distance curve lays in a Riemannian space whose metric is defined by the image content. This geodesic approach for object segmentation allows to connect classical ''snakes'' based on energy minimization and geometric active contours based on the theory of curve evolution. Previous models of geometric active contours are improved, allowing stable boundary detection when their gradients suffer from large variations, including gaps. Formal results concerning existence, uniqueness, stability, and correctness of!

Abstract:   The explicit use of partial differential equations (PDEs) in image processing became a major research topic in the past years. In this work we present a framework for histogram (pixel-value distribution) modification via ordinary and partial differential equations. In this way, the image contrast is improved. We show that the histogram can be modified to achieve any given distribution as the steady state solution of an image now. The contrast modification can be performed while simultaneously reducing noise in a unique PDE, avoiding noise sharpening effects of classical algorithms. The approach is extended to local contrast enhancement as well. A variational interpretation of the flow is presented and theoretical results on the existence of solutions are given. (C) 1997 Academic Press.

Abstract:   The explicit use of partial differential equations (PDEs) in image processing became a major research topic in the past years. In this work we present a framework for histogram (pixel-value distribution) modification via ordinary and partial differential equations. In this way, the image contrast is improved. We show that the histogram can be modified to achieve any given distribution as the steady state solution of an image now. The contrast modification can be performed while simultaneously reducing noise in a unique PDE, avoiding noise sharpening effects of classical algorithms. The approach is extended to local contrast enhancement as well. A variational interpretation of the flow is presented and theoretical results on the existence of solutions are given. (C) 1997 Academic Press.

Abstract:   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.

Abstract:   In order to segment an image the use of information at multiple scales is invaluable. The hyperstack, a linking-model-based segmentation technique, uses intensity to link points in adjacent levels of a scale space stack. This approach has been successfully applied to linear multiscale representations. Multiscale representions which satisfy two scale space properties, viz. a causality criterion and a semigroup property in differential form, are valid inputs as well. In this paper we consider linear scale space, gradient-dependent diffusion, and the Euclidean shortening flow. Since no global scale parameter is available in the latter two approaches we compare scale levels based on evolution time, information theoretic measures, and by counting the number of objects. The multiscale representations are compared with respect to their performance in image segmentation tasks on test and MR images. The hyperstack proves to be rather insensitive to the underlying multiscale repres!

Abstract:   Flexible polyurethane foam is based on a 3-dimensional cellular network. The mechanical properties of foam material depend upon cell structure and cell size distribution. In this work, we use laser confocal microscopy to image the foam cells and recover its 3-dimensional cellular network. Based on this technique we provide a statistical analysis and compare several foam samples. Confocal microscopic images are also used to visualize foam compression. Images for foam network structure under different mechanical compressions are also obtained. Limitations of confocal microscope are discussed and a new method - nuclear magnetic resonance imaging is proposed.

Abstract:   Variational methods for image segmentation try to recover a piecewise smooth function together with a discontinuity set which represents the boundaries of the segmentation. This paper deals with a variational method that constrains the formation of discontinuities along smooth contours. The functional to be minimized, which involves the computation of the geometrical properties of the boundaries, is approximated by a sequence of functionals which can be discretized in a straightforward way. Computer examples of real images are presented to illustrate the feasibility of the method. (C) 1997 Elsevier Science B.V.

Abstract:   Numerical analysis of conservation laws plays an important role in the implementation of curve evolution equations. This paper reviews the relevant concepts in numerical analysis and the relation between curve evolution, Hamilton-Jacobi partial differential equations, and differential conservation laws. This close relation enables us to introduce finite difference approximations, based on the theory of conservation laws, into curve evolution. It is shown how curve evolution serves as a powerful tool for image analysis, and how these mathematical relations enable us to construct efficient and accurate numerical schemes. Some examples demonstrate the importance of the CFL condition as a necessary condition for the stability of the numerical schemes.

Abstract:   Efficient and powerful topologically adaptable deformable surfaces can be created by embedding and defining discrete deformable surface models in terms of an Affine Cell Decomposition (ACD) framework. The ACD framework, combined with a novel and original reparameterization algorithm, creates a simple but elegant mechanism for multiresolution deformable curve, surface, and solid models to ''flow'' or ''grow'' into objects with complex geometries and topologies, and adapt their shape to recover the object boundaries. ACD-based models maintain the traditional parametric physics-based formulation of deformable models, allowing them to incorporate a priori knowledge in the form of energy and force-based constraints, and provide intuitive interactive capabilities. This paper describes ACD-based deformable surfaces and demonstrates their potential for extracting and reconstructing some of the most complex biological structures from medical image volumes.

Abstract:   The Perona-Malik equation is a formally ill-posed parabolic equation for which simple discretizations are nevertheless numerically found to be stable. After discussing the background of this paradox in computer vision, this paper shows the nonexistence of weak solutions even in those cases where computations are successful, and introduces a notion of generalized solutions for this equation, which do evolve smoothly and possess many of the features of numerical calculations.

Abstract:   A novel geometric approach for three dimensional object segmentation is presented. The scheme is based on geometric deformable surfaces moving towards the objects to be detected, We show that this model is related to the computation of surfaces of minimal area (local minimal surfaces). The space where these surfaces are computed is induced from the three dimensional image in which the objects are to be detected. The general approach also shows the relation between classical deformable surfaces obtained via energy minimization and geometric ones derived from curvature flows in the surface evolution framework. The scheme is stable, robust, and automatically handles changes in the surface topology during the deformation. Results related to existence, uniqueness, stability, and correctness of the solution to this geometric deformable model are presented as well. Based on an efficient numerical algorithm for surface evolution, we present a number of examples of object detectio!

Abstract:   This paper describes an image segmentation technique in which an arbitrarily shaped contour was deformed stochastically until it fitted around an object of interest. The evolution of the contour was controlled by a simulated annealing process which caused the contour to settle into the global minimum of an image-derived ''energy'' function. The nonparametric energy function was derived from the statistical properties of previously segmented images, thereby incorporating prior experience. Since the method was based on a state space search for the contour with the best global properties, it was stable in the presence of image errors which confound segmentation techniques based on local criteria, such as connectivity. Unlike ''snakes'' and other active contour approaches, the new method could handle arbitrarily irregular contours in which each interpixel crack represented an independent degree of freedom. Furthermore, since the contour evolved toward the global minimum of th!

Abstract:   A framework for object segmentation in vector-valued images is presented in this paper. The first scheme proposed is based on geometric active contours moving toward the objects to be detected in the vector-valued image. Object boundaries are obtained as geodesics or minimal weighted-distance curves, where the metric is given by a definition of edges in vector-valued data. The curve flow corresponding to the proposed active contours holds formal existence, uniqueness, stability, and correctness results. The scheme automatically handles changes in the deforming curve topology. The technique is applicable, for example, to color and texture images as well as multiscale representations. We then present an extension of these vector active contours, proposing a possible image flow for vector-valued image segmentation. The algorithm is based on moving each one of the image level sets according to the proposed vector active contours. This extension also shows the relation between!

Abstract:   Subpixel methods that locate curves and their singularities, and that accurately measure geometric quantities, such as orientation and curvature, are of significant importance in computer vision and graphics. Such methods often use local surface fits or structural models for a local neighborhood of the curve to obtain the interpolated curve. Whereas their performance is good in smooth regions of the curve, it is typically poor in the vicinity of singularities. Similarly, the computation of geometric quantities is often regularized to deal with noise present in discrete data. However, in the process, discontinuities are blurred over, leading to poor estimates at them and in their vicinity. In this paper we propose a geometric interpolation technique to overcome these limitations by locating curves and obtaining geometric estimates while (1) not blurring across discontinuities and (2) explicitly and accurately placing them, The essential idea is to avoid the propagation of !

Abstract:   We describe a system that is being used to segment gray matter from magnetic resonance imaging (MRI) and to create connected cortical representations for functional MRI visualization (fMRI). The method exploits knowledge of the anatomy of the cortex and incorporates structural constraints into the segmentation, First, the white matter and cerebral spinal fluid (CSF) regions in the MR volume are segmented using a novel techniques of posterior anisotropic diffusion, Then, the user selects the cortical white matter component of interest, and its structure is verified by checking for cavities and handles. After this, a connected representation of the gray matter is created by a constrained growing-out from the white matter boundary, Because the connectivity is computed, the segmentation can be used as input to several methods of visualizing the spatial pattern of cortical activity within gray matter, In our case, the connected representation of gray matter is used to create a!

Abstract:   A framework for contrast enhancement via image evolution hows and variational formulations is introduced in this paper. First, an algorithm for histogram modification via image evolution equations is presented. We show that the image histogram can be modified to achieve any given distribution as the steady state solution of this differential equation. We then prove that the proposed evolution equation solves an energy minimization problem. This gives a new interpretation to histogram modification and contrast enhancement in general. This interpretation is completely formulated in the image domain, in contrast with classical techniques for histogram modification which are formulated in a probabilistic domain. From this, new algorithms for contrast enhancement, including, for example, image and perception models, can be derived, Based on the energy formulation and its corresponding differential form, we show that the proposed histogram modification algorithm can be combined!

Abstract:   We describe a system that is being used to segment gray matter from magnetic resonance imaging (MRI) and to create connected cortical representations for functional MRI visualization (fMRI). The method exploits knowledge of the anatomy of the cortex and incorporates structural constraints into the segmentation, First, the white matter and cerebral spinal fluid (CSF) regions in the MR volume are segmented using a novel techniques of posterior anisotropic diffusion, Then, the user selects the cortical white matter component of interest, and its structure is verified by checking for cavities and handles. After this, a connected representation of the gray matter is created by a constrained growing-out from the white matter boundary, Because the connectivity is computed, the segmentation can be used as input to several methods of visualizing the spatial pattern of cortical activity within gray matter, In our case, the connected representation of gray matter is used to create a!

Abstract:   A number of active contour models have been proposed that unify the curve evolution framework with classical energy minimization techniques for segmentation, such as snakes, The essential idea is to evolve a curve (in two dimensions) or a surface (in three dimensions) under constraints from image forces so that it clings to features of interest in an intensity image, Recently, the evolution equation has been derived from first principles as the gradient dow that minimizes a modified length functional, tailored to features such as edges, However, because the how may be slow to converge in practice, a constant (hyperbolic) term is added to keep the curve/surface moving in the desired direction, In this paper, we derive a modification of this term based on the gradient how derived from a weighted area functional, with image dependent weighting factor, When combined with the earlier modified Length gradient dow, we obtain a partial differential equation (PDE) that offers a nu!

Abstract:   In many applications of dynamic scene analysis, the objects or structures to be analyzed undergo deformations that have to be modeled. In this paper, we develop a hierarchical statistical modeling framework for the representation, segmentation, and tracking of 2D deformable structures in image sequences. The model relies on the specification of a template, on which global as well as local deformations are defined. Global deformations are modeled using a statistical modal analysis of the deformations observed on a representative population. Local deformations are represented by a (first-order) Markov random process. A model-based segmentation of the scene is obtained by a joint bayesian estimation of global deformation parameters and local deformation variables. Spatial or spatio-temporal observations are considered in this estimation procedure, yielding an edge-based or a motion-based segmentation of the scene. The segmentation procedure is combined with a temporal tracki!

Abstract:   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 forte, 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.

Abstract:   We are concerned with the retrieval of the unknown cross section of a homogeneous cylindrical obstacle embedded in a homogeneous medium and illuminated by time-harmonic electromagnetic line sources. The dielectric parameters of the obstacle and embedding materials are known and piecewise constant. That is, the shape (here, the contour) of the obstacle is sufficient for its full characterization. The inverse scattering problem is then to determine the contour from the knowledge of the scattered field measured for several locations of the sources and/or frequencies. An iterative process is implemented: given an initial contour, this contour is progressively evolved such as to minimize the residual in the data fit. This algorithm presents two main important points. The first concerns the choice of the transformation enforced on the contour. We will show that this involves the design of a velocity field whose expression only requires the resolution of an adjoint problem at ea!

Abstract:   This paper presents a method for segmentation and tracking of cardiac structures in ultrasound image sequences. The developed algorithm is based on the active contour framework. This approach requires initial placement of the contour close to the desired position in the image, usually an object outline. Best contour shape and position are then calculated, assuming that at this configuration a global energy function, associated with a contour, attains its minimum. Active contours can be used for tracking by selecting a solution from a previous frame as an initial position in a present frame. Such an approach, however, fails for large displacements of the object of interest. This paper presents a technique that incorporates the information on pixel velocities (optical flow) into the estimate of initial contour to enable tracking of fast-moving objects. The algorithm was tested on several ultrasound image sequences, each covering one complete cardiac cycle. The contour succe!

Abstract:   Characterization of pulmonary nodules plays a significant role in the differential diagnosis of lung cancer. This paper presents a method to quantify surface characteristics of small pulmonary nodules with well-defined surface based on thin-section CT images. The segmentation of the three-dimensional (3-D) nodule images are obtained by a 3-D deformable surfaces approach. The feature extraction algorithms are designed to quantify the surface characteristic parameters from 3-D nodule images by using surface curvatures and ridge lines. Experimental results of our method, applied to patients 3-D nodule images, demonstrate it performance.

Abstract:   The application of a discrete dynamic contour model for segmentation of the hippocampus from brain MRT has been investigated. Solutions to several common problems of dynamic contours in this case and similar cases have been developed. A new method for extracting the discontinuous boundary of a structure with multiple edges near the structure has been developed. The method is based on detecting and following edges by external forces. The reliability of the final contour and the model stability have been improved by using a continuous mapping of the external energy and limiting movements of the contour. The problem of optimizing the internal force weight has been overcome by making it dependent on the amount of the external force. Finally, the results of applying the proposed algorithm, which implements the above modifications, to multiple applications have been evaluated. (C) 1998 Elsevier Science Ltd. All rights reserved.

Abstract:   This paper describes a framework for the estimation of shape from sparse or incomplete range data. It uses a shape representation called blending, which allows for the geometric combination of shapes into a unified model-selected regions of the component shapes are cut-out and glued together. Estimation of shape using this representation is realized using a physics-based framework, and also includes a process for deciding how to adapt the structure and topology of the model to improve the fit. The blending representation helps avoid abrupt changes in model geometry during fitting by allowing the smooth evolution of the shape, which improves the robustness of the technique. We demonstrate this framework with a series of experiments showing its ability to automatically extract structured representations from range data given both structurally and topologically complex objects.

Abstract:   This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a statistical problem: find that surface which is mostly likely, given the data and some prior knowledge about the application domain. The resulting optimization problem is solved by an incremental process of deformation. We represent a deformable surface as the level set of a discretely sampled scalar function of three dimensions, i.e., a volume. Such level-set models have been shown to mimic conventional deformable surface models by encoding surface movements as changes in the greyscale values of the volume. The result is a voxel-based modeling technology that offers several advantages over conventional parametric models, including flexible topology, no need for reparameterization, concise descriptions of differential structure, and a natural scale space for hierarchical representations. This paper bu!

Abstract:   In this paper implicit representations of deformable models for medical image enhancement and segmentation are considered. The advantage of implicit models over classical explicit models is that their topology can he naturally adapted to objects in the scene, A geodesic formulation of implicit deformable models is especially attractive since it has the energy minimizing properties of classical models, The aim of this pager is twofold, First, a modification to the customary geodesic deformable model approach is introduced by considering all the level sets in the image as energy minimizing contours. This approach is used to segment multiple objects simultaneously and for enhancing and segmenting cardiac computed tomography (CT) and magnetic resonance images. Second, the approach is used to effectively compare implicit and explicit models for specific tasks. This shows the complementary character of implicit models since in case of poor contrast boundaries or gaps in boundar!

Abstract:   An image segmentation method is proposed, which combines mathematical morphology tools and active contours in two stages. First, contours are coarsely approximated by means of morphological operators. Second, these initial contours evolve under the influence of geometric and grey-level information, owing to the model of active contours. The performance of the method is evaluated according to the noise and is compared to the watershed algorithm. Then an application is finally presented for biomedical images of tumour tissue. (C) 1998 Elsevier Science B.V. All rights reserved.

Abstract:   In this paper, we review the recently published work on deformable models. We have chosen to concentrate on 2D deformable models and relate the energy minimization approaches to the Bayesian formulations. We categorize the various active contour systems according to the definition of the deformable model. We also present in detail one particular formulation for deformable templates which combines edge, texture, color and region information for the external energy and model deformations using wavelets, splines or Fourier descriptors. We explain how these models can be used for segmentation, image retrieval in a large database and object tracking in a video sequence. (C) 1998 Elsevier Science B.V. All rights reserved.

Abstract:   The cortex is the outermost thin layer of gray matter in the brain; geometric measurement of the cortex helps in understanding brain anatomy and function. In the quantitative analysis of the cortex from MR images, extracting the structure and obtaining a representation for various measurements are key steps. While manual segmentation is tedious and labor intensive, automatic, reliable and efficient segmentation and measurement of the cortex remain challenging problems due to its convoluted nature. A new approach of coupled surfaces propagation using level set methods is presented here for the problem of the segmentation and measurement of the cortex. Our method is motivated by the nearly constant thickness of the cortical mantle and takes this tight coupling as an important constraint. By evolving two embedded surfaces simultaneously, each driven by its own image-derived information while maintaining the coupling, a final representation of the cortical bounding surfaces a!

Abstract:   A general active contour formulation is considered and a convexity analysis of its energy function is presented. Conditions under which this formulation has a unique solution are derived; these conditions involve both the active contour energy potential and the regularization parameters. This analysis is then applied to four particular active contour formulations, revealing important characteristics about their convexity, and suggesting that external potentials involving center-of-mass computations may be better behaved than the usual potentials based on image gradients. Our analysis also provides an explanation for the poor convergence behavior at concave boundaries and suggests an alternate algorithm for approaching these types of boundaries. (C) 1999 Elsevier Science B.V. All rights reserved.

Abstract:   Robust segmentation of structures from an image is essential for a variety of image analysis problems. However, the conventional methods of region-based segmentation and gradient-based boundary finding are often frustrated by poor image quality. Here we propose a method to integrate the two approaches using game theory in an effort to form a unified approach that is robust to noise and poor initialization. This combines the perceptual notions of complete boundary information using edge data and shape priors with gray-level homogeneity using two computational modules. The novelty of the method is that this is a bidirectional framework, whereby both computational modules improve their results through mutual information sharing. A number of experiments were performed both on synthetic datasets and datasets of real images to evaluate the new approach and it is shown that the integrated method typically performs better than conventional gradient-based boundary finding.

Abstract:   We use an unconditionally stable numerical scheme to implement a fast version of the geodesic active contour model. The proposed scheme is useful for object segmentation in images, like tracking moving objects in a sequence of images. The method is based on the Weickert-Romeney-Viergever [33] AOS scheme. It is applied at small regions, motivated by Adalsteinsson-Sethian [1] level set narrow band approach, and uses Sethian's fast marching method [26] for re-initialization. Experimental results demonstrate the power of the new method for tracking in color movies.

Abstract:   A method for deforming curves in a given image to a desired position in a second image is introduced in this paper. The algorithm is based on deforming the first image toward the second one via a partial differential equation, while tracking the deformation of the curves of interest in the first image with an additional, coupled, partial differential equation. The tracking is performed by projecting the velocities of the first equation into the second one. In contrast with previous PDE based approaches, both the images and the curves on the frames/slices of interest axe used for tracking. The technique can be applied to object tracking and sequential segmentation. The topology of the deforming curve can change, without any special topology handling procedures added to the scheme. This permits for example the automatic tracking of scenes where, due to occlusions, the topology of the objects of interest changes from frame to frame. In addition, this work introduces the conc!

Abstract:   Level set methods provide a robust way to implement geometric flows, but they suffer from two problems which are relevant when using smoothing flows to unfold the cortex: the lack of point-correspondence between scales and the inability to implement tangential velocities. In this paper, we suggest to solve these problems by driving the nodes of a mesh with an ordinary differential equation. We state that this approach does not suffer from the known problems of Lagrangian methods since all geometrical properties axe computed on the fixed (Eulerian) grid. Additionally, tangential velocities can be given to the nodes, allowing the mesh to follow general evolution equations, which could be crucial to achieving the final goal of minimizing local metric distortions. To experiment with this approach, we derive area and volume preserving mean curvature flows and use them to unfold surfaces extracted from MRI data of the human brain.

Abstract:   This paper is concerned with the simulation of the Partial Differential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian propose to evolve the distance function with a Hamilton-Jacobi equation. Unfortunately the solution to this equation is not a distance function. As a consequence, the practical application of the level set method is plagued with such questions as when do we have to "reinitialize" the distance function? How do we "reinitialize" the distance function? Etc... which reveal a disagreement between the theory and its implementation. This paper proposes an alternative to the use of Hamilton-Jacobi equations which eliminates this contradiction: in our method the implicit representation always remains a distance function by construction, and the implementation does not differ f!

Abstract:   In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gradient. The model is a combination between more classical active contour models using mean curvature motion techniques, and the Mumford-Shah model for segmentation. We minimize an energy which can be seen as a particular case of the so-called minimal partition problem. In the level set formulation, the problem becomes a "mean-curvature 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. Finally, we will present various experimental results and in particular some examples for which the classical snak!

Abstract:   Since the work by Osher and Sethian on level-sets algorithms for numerical shape evolutions, this technique has been used for a large number of applications in numerous fields. In medical imaging, this numerical technique has been successfully used for example in segmentation and cortex unfolding algorithms. The migration from a Lagrangian implementation to an Eulerian one via implicit representations or level-sets brought some of the main advantages of the technique, mainly, topology independence and stability. This migration means also that the evolution is parametrization free, and therefore we do not know exactly how each part of the shape is deforming, and the point-wise correspondence is lost. In this note we present a technique to numerically track regions on surfaces that are being deformed using the level-sets method. The basic idea is to represent the region of interest as the intersection of two implicit surfaces, and then track its deformation from the deforma!

Abstract:   In this paper, we propose extensions to a powerful geometric shape modeling scheme introduced in [14]. The extension allows the model to automatically cope with topological changes and for the first time, introduces the concept of a global shape into geometric/geodesic snake models. The ability to characterize global shape of an object using very few parameters facilitates shape learning and recognition. In this new modeling scheme, object shapes are represented using a parameterized function - called the generator - which accounts for the global shape of an object and the pedal curve/surface of this global shape with respect to a geometric snake to represent any local detail. Traditionally, pedal curves/surfaces are defined as the loci of the feet of perpendiculars to the tangents of the generator from a fixed point called the pedal point. We introduce physics-based control for shaping these geometric models by using distinct pedal points - lying on a snake - for each po!

Abstract:   In this paper we present and briefly describe a Windows user-friendly system designed to assist with the analysis of images in general, and biomedical images in particular. The system, which is being made publicly available to the research community, implements basic 2D image analysis operations based on partial differential equations (PDE's). The system is under continuous development, and already includes a large number of image enhancement and segmentation routines that have been tested for several applications.

Abstract:   In this paper we undertake a systematic investigation of affine invariant object detection and image denoising. Edge detection is first presented from the point of view of the affine invariant scale-space obtained by curvature based motion of the image level-sets. In this case, affine invariant maps are derived as a weighted difference of images at different scales. We then introduce the affine gradient as an affine invariant differential function of lowest possible order with qualitative behavior similar to the Euclidean gradient magnitude. These edge detectors are the basis for the extension of the affine invariant scale-space to a complete affine flow for image denoising and simplification, and to define affine invariant active contours for object detection and edge integration. The active contours are obtained as a gradient flow in a conformally Euclidean space defined by the image on which the object is to be detected. That is, we show that objects can be segmented i!

Abstract:   Deformable models, which include deformable contours (the popular snakes) and deformable Surfaces, are a powerful model-based medical image analysis technique. We develop a new class of deformable models by formulating deformable surfaces in terms of an affine cell image decomposition (ACID). Our approach significantly extends standard deformable surfaces, while retaining their interactivity and other desirable properties. In particular, the ACID induces an efficient reparameterization mechanism that enables parametric deformable surfaces to evolve into complex geometries, even modifying their topology as necessary. We demonstrate that our new ACID-based deformable surfaces, dubbed T-surfaces, can effectively segment complex anatomic structures from medical volume images.

Abstract:   The cortex is the outermost thin layer of gray matter in the brain; geometric measurement of the cortex helps in understanding brain anatomy and function. In the quantitative analysis of the cortex from MR images, extracting the structure and obtaining a representation for various measurements are key steps. While manual segmentation is tedious and labor intensive, automatic reliable efficient segmentation and measurement of the cortex remain challenging problems, due to its convoluted nature. Here we present a new approach of coupled-surfaces propagation, using level set methods to address such problems, Our method is motivated by the nearly constant thickness of the cortical mantle and takes this tight coupling as an important constraint. By evolving two embedded surfaces simultaneously, each driven by its own image-derived information while maintaining the coupling, a final representation of the cortical bounding surfaces and an automatic segmentation of the cortex are!

Abstract:   We have been developing a theory for the generic representation of 2-D shape, where structural descriptions are derived from the shocks (singularities) of a curve evolution process, acting on bounding contours. We now apply the theory to the problem of shape matching. The shocks are organized into a directed, acyclic shock graph, and complexity is managed by attending to the most significant (central) shape components first. The space of all such graphs is highly structured and can be characterized by the rules of a shock graph grammar. The grammar permits a reduction of a shock graph to a unique rooted shock tree. We introduce a novel tree matching algorithm which finds the best set of corresponding nodes between two shock trees in polynomial time. Using a diverse database of shapes, we demonstrate our system's performance under articulation, occlusion, and moderate changes in viewpoint.

Abstract:   Algorithms for object segmentation are crucial in many image processing applications. During past years, active contour models (snakes) have been widely used for finding the contours of objects. This segmentation strategy is classically edge-based in the sense that the snake is driven to fit the maximum of an edge map of the scene. In this paper, we propose a region snake approach and we determine fast algorithms for the segmentation of an object in an image. The algorithms developed in a Maximum Likelihood approach are based on the calculation of the statistics of the inner and the outer regions (defined by the snake). It has thus been possible to develop optimal algorithms adapted to the random fields which describe the gray levels in the input image if we assume that their probability density function family are known. We demonstrate that this approach is still efficient when no boundary's edge exists in the image. We also show that one can obtain fast algorithms by tr!

Abstract:   External energies of active contours are often formulated as Euclidean are length integrals. In this paper, we show that such formulations are biased. By this we mean that the minimum of the external energy does not occur at an image edge. In addition, we also show that for certain forms of external energy the active contour is unstable-when initialized at the true edge, the contour drifts away and becomes jagged. Both of these phenomena are due to the use of Euclidean are length integrals.We propose a non-Euclidean are length which eliminates these problems. This requires a reformulation of active contours where a single external energy function is replaced by a sequence of energy functions and the contour evolves as an integral curve of the gradient of these energies. The resulting active contour not only has unbiased external energy, but is also more controllable,Experimental evidence is provided in support of the theoretical claims.

Abstract:   We discuss a procedure for synthesizing controllers for safety specifications for hybrid systems. The procedure depends on the construction of the set of states of a continuous dynamical system that can be driven to a subset of the state space, avoiding another subset of the state space (the Reach-Avoid set). We present a new characterization of the Reach-Avoid set in terms of the solution of a pair of coupled Hamilton-Jacobi partial differential equations. We also discuss a computational algorithm for solving such partial differential equations and demonstrate its effectiveness on numerical examples.

Abstract:   In this paper, we propose a general tridimensional reconstruction algorithm of range and volumetric images, based on deformable simplex meshes. Simplex meshes are topologically dual of triangulations and have the advantage of permitting smooth deformations in a simple and efficient manner. Our reconstruction algorithm can handle surfaces without any restriction on their shape or topology. The different tasks performed during the reconstruction include the segmentation of given objects in the scene, the extrapolation of missing data, and the control of smoothness, density, and geometric quality of the reconstructed meshes. The reconstruction takes place in two stages. First, the initialization stage creates a simplex mesh in the vicinity of the data model either manually or using an automatic procedure. Then, after a few iterations, the mesh topology can be modified by creating holes or by increasing its genus. Finally, an iterative refinement algorithm decreases the dista!

Abstract:   We call "natural" image any photograph of an outdoor or indoor scene taken by a standard camera. We discuss the physical generation process of natural images as a combination of occlusions, transparencies and contrast changes. This description fits to the phenomenological description of Gaetano Kanizsa according to which visual perception tends to remain stable with respect to these basic operations. We define a contrast invariant presentation of the digital image, the topographic map, where the subjacent occlusion-transparency structure is put into evidence by the interplay of level lines. We prove that each topographic map represents a class of images invariant with respect to local contrast changes. Several visualization strategies of the topographic map are proposed and implemented and mathematical arguments are developed to establish stability properties of the topographic map under digitization.

Abstract:   Since the work by Osher and Sethian on level-sets algorithms for numerical shape evolutions, this technique has been used for a large number of applications in numerous fields. In medical imaging, this numerical technique has been successfully used for example, in segmentation and cortex unfolding algorithms. The migration from a Lagrangian implementation to a Eulerian one via implicit representations or level-sets brought some of the main advantages of the technique, i.e., topology independence and stability. This migration means also: that the evolution is parametrization free. Therefore, we do not know exactly how each part of the shape is deforming and the point-wise correspondence is lost. In this note we present a technique to numerically track regions on surfaces that are being deformed. using the level-sets method. The basic idea is to represent the region of interest as the intersection of two implicit surfaces and then track its deformation from the deformation !

Abstract:   Spatio-temporal life cycle of meteorological structures is an important part of study of routine numerical weather analysis. In this paper we present an algorithm to track tracer clouds in INSAT image sequence. Given a pair of sequence images taken at a 30 min interval, the objective of cloud tracking is to derive the path of movement of a cloud contour in the source image to the corresponding contour of the destination image. This has direct relevance to cloud motion vector (CMV) analysis by which wind speed and direction are estimated. We have utilized an improved algorithm to generate a set of initial estimates of possible cloud motion vectors which are then filtered through a shape-based approach. The contour of cloud mass is modelled as a perfectly flexible string, and depending on initial estimates of CMV, the source cloud contours are deformed. The CMV direction for which the deformed contour best matches the destination contour, gives the optimum path of cloud mov!

Abstract:   In this paper, the authors present general views of computer vision and image processing based on optimization. Relaxation and regularization in both broad and narrow senses are used in various fields and problems of computer vision and image processing, and they are currently being combined with general-purpose optimization algorithms. The principle and case examples of relaxation and regularization are discussed; the application of optimization to shape description that is a particularly important problem in the field is described; and the use of a genetic algorithm (GA) as a method of optimization is introduced.

Abstract:   We present a new active contour model for boundary tracking and position prediction of nonrigid objects, which results from applying a velocity control to the class of elastodynamical contour models, known as snakes, The proposed control term minimizes an energy dissipation function which measures the difference between the contour velocity and the apparent velocity of the image. Treating the image video-sequence as continuous measurements along time, it is shown that the proposed control results in robust tracking. This is in contrast to the original snake model which is proven to have tracking errors relative to image (object) velocity, thus resulting in high sensitivity to image clutter. The motion estimation further allows for position prediction of nonrigid boundaries. Based on the proposed central approach, we propose a new class of real time tracking contours, varying from models with batch-mode control estimation to models with real time adaptive controllers. (C) !

Abstract:   Image segmentation plays a crucial role in many medical-imaging applications, by automating or facilitating the delineation of anatomical structures and other regions of interest. We present a critical appraisal of the current status of semi-automated and automated methods for the segmentation of anatomical medical images. Terminology and important issues in image segmentation are first presented. Current segmentation approaches are then reviewed with an emphasis on the advantages and disadvantages of these methods for medical imaging applications. We conclude with a discussion on the future of image segmentation methods in biomedical research.

Abstract:   Three-dimensional ultrasound is emerging as a viable resource for the imaging of internal organs. Quantitative studies correlating ultrasonic volume measurements with MRI data continue to validate this modality as a more efficient alternative for 3D imaging studies. However, the processing required to form 3D images from a set of 2D images may result in a loss of spatial resolution and may give rise to artifacts. This paper examines a method of automatic feature extraction and data quantification in 3D data sets as compared with original 2D data. This work will implement an active contour algorithm to automatically extract the endocardial borders of septal defects in echocardiographic images, and compare the size of the defects in the original 2D images and the 3D data sets. (C) 2000 Elsevier Science Ltd. AU rights reserved.

Abstract:   Eye tracking is one of the key problems in controlled active vision. Because of modelling uncertainty and noise in the signals, it becomes a challenging problem for robust control. In this paper, we outline some of the key issues involved as well as some possible solutions. We will need to make contact with techniques from machine vision and multi-scale image processing in carrying out this task. In particular, we will sketch some of the necessary methods from computer vision and image processing including optical flow, active contours ('snakes'), and geometric driven flows. The paper will thus have a tutorial flavor as well. Copyright (C) 2000 John Wiley & Sons, Ltd.

Abstract:   A method for deforming curves in a given image to a desired position in the second image is introduced in this paper. The algorithm is based on deforming the first image toward the second one via a Partial Differential Equation (PDE), while tracking the deformation of the curves of interest in the first image with an additional, coupled, PDE. The tracking is performed by projecting the velocities of the first equation into the second one. In contrast with previous PDE-based approaches, both the images and the curves on the frames/slices of interest are used for tracking. The technique can be applied to object tracking and sequential segmentation. The topology of the deforming curve can change without any special topology handling procedures added to the scheme. This permits, for example, the automatic tracking of scenes where, due to occlusions, the topology of the objects of interest changes from frame to frame. In addition, this work introduces the concept of projecting!

Abstract:   We present a novel formulation for B-spline snakes that can be used as a tool for fast and intuitive contour outlining. We start with a theoretical argument in favor of splines in the traditional formulation by showing that the optimal, curvature-constrained snake is a cubic spline, irrespective of the form of the external energy held, Unfortunately, such regularized snakes suffer from slow convergence speed because of a large number of control points, as well as from difficulties in determining the weight factors associated to the internal energies of the curve. We therefore propose an alternative formulation in which the intrinsic scale of the spline model is adjusted a priori; this Leads to a reduction of the number of parameters to be optimized and eliminates the need for internal energies (i.e., the regularization term), In other words, we are now controlling the elasticity of the spline implicitly and rather intuitively by varying the spacing between the spline knot!

Abstract:   In this paper, we introduce a novel geometric shape modeling scheme which allows for representation of global and local shape characteristics of an object. Geometric models are traditionally well-suited for representing global shapes without local detail. However, we propose a powerful geometric shape modeling scheme which allows for the representation of global shapes with local detail and permits model shaping as well as topological changes via physics-based control. The proposed modeling scheme consists of representing shapes by pedal curves and surfaces-pedal curves/surfaces are the loci of the foot of perpendiculars to the tangents of a fixed curve/surface from a fixed point called the pedal point. By varying the location of the pedal point, one can synthesize a large class of shapes which exhibit both local and global deformations. We introduce physics-based control for shaping these geometric models by letting the pedal point vary and use a snake to represent the p!

Abstract:   We propose a novel method for object tracking using prototype-based deformable template models. To track an object in an image sequence, we use a criterion which combines two terms: the frame-to-frame deviations of the object shape and the fidelity of the modeled shape to the Input image. The deformable template model utilizes the prior shape information which is extracted from the previous frames along with a systematic shape deformation scheme to model the object shape in a new frame. The following image information Is used in the tracking process: 1) edge and gradient information: the object boundary consists of pixels with large image gradient, 2) region consistency: the same object region possesses consistent color and texture throughout the sequence, and 3) interframe motion: the boundary of a moving object is characterized by large interframe motion. The tracking proceeds by optimizing an objective function which combines both the shape deformation and the fidelity!

Abstract:   We present a model and algorithm for segmentation of images with missing boundaries. In many situations. the human visual system fills in missing gaps in edges and boundaries, building and completing information that is not present This presents a considerable challenge in computer vision, since most algorithms attempt to exploit existing data. Completion models, which postulate how to construct missing data, are popular but are often trained and specific to particular images. In this paper, we take the following perspective: We consider a reference point within an image as given and then develop an algorithm that tries to build missing information on the basis of the given point of view and the available information as boundary data to the algorithm. We test the algorithm on some standard images, including the classical triangle of Kanizsa and low signal:noise ratio medical images.

Abstract:   In this paper, we propose an active contour algorithm for object detection in vector-valued images (such as RGB or multispectral). The model is an extension of the scalar Chan-Vese algorithm to the vector-valued case [1]. The model minimizes a Mumford-Shah functional over the length of the contour, plus the sum of the fitting error over each component of the vector-valued image. Like the Chan-Vese model, our vector-valued model can detect edges both with or without gradient. We show examples where our model detects vector-valued objects which are undetectable in any scalar representation. For instance, objects with different missing parts in different channels are completely detected (such as occlusion). Also, in color images, objects which are invisible in each channel or in intensity can be detected by our algorithm. Finally, the model is robust with respect to noise, requiring no a priori denoising step. (C) 2000 Academic Press.

Abstract:   The method of curve evolution is a popular method for recovering shape boundaries. However, isotropic metrics have always been used to induce the how of the curve and potential steady states tend to be difficult to determine numerically, especially in noisy or tow-contrast situations. Initial curves shrink past the steady slate and soon vanish. In this paper, anisotropic metrics are considered to remedy the situation by taking the orientation of the feature gradient into account. The problem of shape recovery or segmentation is formulated as the problem of finding minimum cuts of a Riemannian manifold. Approximate methods, namely anisotropic geodesic flows and the solution of an eigenvalue problem, are discussed. (C) 2000 Academic Press.

Abstract:   This paper is concerned with the simulation of the partial differential equation driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian have proposed to evolve the distance function with a Hamilton-Jacobi equation. Unfortunately the solution to this equation is not a distance function. As a consequence, the practical application of the level set method is plagued with such questions as When do we have to reinitialize the distance function? How do we reinitialize the distance function?, which reveal a disagreement between the theory and its implementation. This paper proposes an alternative to the use of Hamilton-Jacobi equations which eliminates this contradiction: in our method the implicit representation always remains a distance function by construction, and the implementation does not differ from the th!

Abstract:   The problem considered in this paper is how to localize and extract object boundaries (salient contours) in an image. To this end, we present a new active contour model, which is a neural network, based on self-organization. The novelty of the model consists in exploiting the principles of spatial isomorphism and self-organization in order to create flexible contours that characterize shapes in images. The flexibility of the model is effectuated by a locally co-operative and globally competitive self-organizing scheme, which enables the model to cling to the nearest salient contour in the test image. To start with this deformation process, the model requires a rough boundary as the initial contour. As reported here, the implemented model is semi-automatic, in the sense that a user-interface is needed for initializing the process. The model's utility and versatility are illustrated by applying it to the problems of boundary extraction, stereo vision, bio-medical image anal!

Abstract:   We propose a new active contour model for shape extraction of objects in grey-valued two-dimensional images based on an energy-minimization formulation. The energy functional that we consider takes into account the two requirements of object isolation and smoothness of the contour. After deriving the Euler-Lagrange equations corresponding to the energy functional, we bring out some important geometric properties of a solution to these equations. The discussion on our solution method-with the help of which we try to minimize the energy functional by evolving an initial curve-also focuses on how to prescribe the initial curve fully automatically. The effectiveness of our algorithms is demonstrated with the help of experimental results. Copyright (C) 2000 John Wiley & Sons, Ltd.

Abstract:   This paper presents a new variational framework for detecting and tracking multiple moving objects in image sequences. Motion detection is performed using a statistical framework for which the observed interframe difference density function is approximated using a mixture model. This model is composed of two components, namely, the static (background) and the mobile (moving objects) one. Both components are zero-mean and obey Laplacian or Gaussian law. This statistical framework is used to provide the motion detection boundaries. Additionally, the original frame is used to provide the moving object boundaries. Then, the detection and the tracking problem are addressed in a common framework that employs a geodesic active contour objective function. This function is minimized using a gradient descent method, where a flow deforms the initial curve towards the minimum of the objective function, under the influence of internal and external image dependent forces. Using the lev!

Abstract:   An algebraic curve is defined as the zero set of a polynomial in two variables. Algebraic curves are practical for modeling shapes much more complicated than conics or superquadrics. The main drawback in representing shapes by algebraic curves has been the lack of repeatability in fitting algebraic curves to data. Usually, arguments against using algebraic curves involve references to mathematicians Wilkinson (see [1, ch. 7] and Runge (see [3, ch. 4]). The first goal of this article is to understand the stability issue of algebraic curve fitting. Then a fitting method based on ridge regression and restricting the representation to well behaved subsets of polynomials is proposed, and its properties are investigated. The fitting algorithm is of sufficient stability for very fast position-invariant shape recognition, position estimation, and shape tracking, based on invariants and new representations. Among appropriate applications are shape-based indexing into image databas!

Abstract:   The analysis of medical images has been woven into the fabric of the Pattern Analysis and Machine Intelligence (PAMI) community since the earliest days of these Transactions. Initially, the efforts in this area were seen as applying pattern analysis and computer vision techniques to another interesting dataset. However, over the last two to three decades, the unique nature of the problems presented within this area of study have led to the development of a new discipline in its own right. Examples of these include: the types of image information that are acquired, the fully three-dimensional image data, the nonrigid nature of object motion and deformation, and the statistical variation of both the underlying normal and abnormal ground truth. In this paper, we look at progress in the field over the last 20 years and suggest some of the challenges that remain for the years to come.

Abstract:   This paper analyzes the problem of shape modeling using the principle of active geometric deformable models. While the basic modeling technique already exists in the literature, we highlight many of its drawbacks and discuss their source and steps to overcome them. We propose a new stopping criterion to address the stopping problem. We also propose to apply level set algorithm to implement the active geometric deformable models, thereby handling topology changes automatically. To alleviate the numerical problems associated with the implementation of the level set algorithm, we propose a new adaptive multigrid narrow band algorithm. All the proposed new changes have been illustrated with experiments with synthetic images and medical images.

Abstract:   Image denoising and segmentation are fundamental problems in the field of image processing and computer vision with numerous applications. In this paper, we present a nonlinear PDE-based model for image denoising and segmentation which unifies the popular model of Alvarez, Lions and Morel (ALM) for image denoising and the Caselles, Kimmel and Sapiro model of geodesic "snakes". Our model includes nonlinear diffusive as well as reactive terms and leads to quality denoising and segmentation results as depicted in the experiments presented here. We present a proof for the existence, uniqueness, and stability of the viscosity solution of this PDE-based model. The proof is in spirit similar to the proof of the ALM model; how ever, there are several differences which arise due to the presence of the reactive terms that require careful treatment/consideration. A fast implementation of our model is realized by embedding the model in a scale space and then achieving the solution vi!

Abstract:   We present a new class of deformable contours (snakes) and apply them to the segmentation of medical images. Our snakes are defined in terms of an affine cell image decomposition (ACID). The 'snakes in ACID' framework significantly extends conventional snakes, enabling topological flexibility among other features. The resulting topology adaptive snakes, or 'T-snakes', can be used to segment some of the most complex-shaped biological structures from medical images in an efficient and highly automated manner. (C) 2000 Elsevier Science BN. All rights reserved.

Abstract:   This paper presents a literature survey of automatic 3D surface registration techniques emphasizing the mathematical and algorithmic underpinnings of the subject. The relevance of surface registration to medical imaging is that there is much useful anatomical information in the form of collected surface points which originate from complimentary modalities and which must be reconciled. Surface registration can be roughly partitioned into three issues: choice of transformation, elaboration of surface representation and similarity criterion, and matching and global optimization. The first issue concerns the assumptions made about the nature of relationships between the two modalities, e.g. whether a rigid-body assumption applies, and if nor, what type and how general a relation optimally maps one modality onto the other. The second issue determines what type of information we extract from the 3D surfaces, which typically characterizes their local or global shape, and how we !

Abstract:   This paper is concerned with the simulation of the Partial Differential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian propose to evolve the distance function with a Hamilton-Jacobi equation. Unfortunately the solution to this equation is not a distance function. As a consequence, the practical application of the level set method is plagued with such questions as when do we have to "reinitialize" the distance function? How do we "reinitialize" the distance function? Etc... which reveal a disagreement between the theory and its implementation. This paper proposes an alternative to the use of Hamilton-Jacobi equations which eliminates this contradiction: in our method the implicit representation always remains a distance function by construction, and the implementation does not differ f!

Abstract:   Segmentation of the skull in medical imagery is an important stage in applications that require the construction of realistic models of the head. Such models are used, for example, to simulate the behavior of electro-magnetic fields in the head and to model the electrical activity of the cortex in EEG and MEG data. in this paper, we present a new approach for segmenting regions of bone in MRI volumes using deformable models. Our method takes into account the partial volume effects that occur with MRI data, thus permitting a precise segmentation of these bone regions. At each iteration of the propagation of the model, partial volume is estimated in a narrow band around the deformable model, Our segmentation method begins with a pre-segmentation stage, in which a preliminary segmentation of the skull is constructed using a region-growing method. The surface that bounds the pre-segmented skull region offers an automatic 3D initialization of the deformable model. This surface!

Abstract:   This paper is concerned with the use of the level set formalism to segment anatomical structures in 3D medical images (ultrasound or magnetic resonance images.). A closed 3D surface propagates towards the desired boundaries through the iterative evolution of a 4D implicit function. The major contribution of this work is the design of a robust evolution model based on adaptive parameters depending on the data. First the iteration step and the external propagation force, both usually constant, are automatically computed at each iteration. Additionally, region-based information rather than the gradient is used, via an estimation of intensity probability density functions over the image. As a result, the method can be applied to various kinds of data. Quantitative and qualitative results on brain MR images and 3D echographies of carotid arteries are discussed.

Abstract:   A common challenge for automated segmentation techniques is differentiation between images of close objects that have similar intensities, whose boundaries are often blurred due to partial-volume effects. We propose a novel approach to segmentation of two-dimensional images, which addresses this challenge. Our method, which we call intrinsic shape for segmentation (ISeg), analyzes isolabel-contour maps to identify coherent regions that correspond to major objects. ISeg generates an isolabel-contour map for an image by multilevel thresholding with a fine partition of the intensity range, ISeg detects object boundaries by comparing the shape of neighboring isolabel contours from the map. ISeg requires only little effort from users; it does not require construction of shape models of target objects. In a formal validation with computed-tomography angiography data, we showed that ISeg was more robust than conventional thresholding, and that ISeg's results were comparable to r!

Abstract:   In this paper, we use partial-differential-equation-based filtering as a preprocessing add post processing strategy for computer-aided cytology, We wish to accurately extract and classify. the shapes of nuclei from confocal microscopy images, which is a prerequisite to an accurate quantitative intranuclear (genotypic and phenotypic) and internuclear (tissue structure) analysis of tissue and cultured specimens. First, we study the use of a geometry-driven edge-preserving image smoothing mechanism before nuclear segmentation. We show how this biter outperforms other widely-used filters in that it provides higher edge fidelity. Then we apply the same filter,,vith a different initial condition, to smooth nuclear surfaces and obtain sub-pixel accuracy. Finally we use another instance of the geometrical filter to correct for misinterpretations of the nuclear surface by the segmentation algorithm. Our prefiltering and post filtering nicely complements our initial segmentation st!

Abstract:   This paper presents a novel method for blending images, Image blending refers to the process of creating a set of discrete samples of a continuous, one-parameter family of images that connects a pair of input images. Image blending has uses in a variety of computer graphics and image processing applications. In particular, it can be used for image morphing, which is a method for creating video streams that depict transformations of objects in scenes based solely on pairs of images and sets of user-defined fiducial points. Image blending also has applications for video compression and image-based rendering.The proposed method for image blending relies on the progressive minimization of a difference metric which compares the level sets between two images. This strategy results in an image blend which is the solution of a pair of coupled, nonlinear, first-order, partial differential equations that model multidimensional level-set propagations. When compared to interpolation !

Abstract:   In this paper, a partial-differential equations (PDE)-based system for detecting the boundary of skin lesions in digital clinical skin images is presented. The image is first preprocessed via contrast-enhancement and anisotropic diffusion. If the lesion is covered by hairs, a PDE-based continuous morphological filter that removes them is used as an additional preprocessing step. Following these steps, the skin lesion is segmented either by the geodesic active contours model or the geodesic edge tracing approach. These techniques are based on computing, again via PDEs, a geodesic curve in a space defined by the image content. Examples showing the performance of the algorithm are given.

Abstract:   This paper. describes a fast process of parametric snake evolution with a multiresolution strategy. Conventional parametric evolution method relies on matrix inversion throughout the iteration intermittently, in contrast the proposed method relaxes the matrix inversion which is: costly and time consuming in cases where the resulting snake is flexible. The proposed method also eliminates the input of snake rigidity parameters when the snake is flexible. Also, a robust and definite termination criterion for both conventional and proposed methods is demonstrated ill this paper. (C) 2001 pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

Abstract:   We have developed an automated segmentation method for three-dimensional vascular ultrasound images. The method consists of two steps: an automated initial contour identification, followed by application of a geometrically deformable model (GDM). The formation of the initial contours requires the input of a single seed point by the user, and was shown to be insensitive to the placement of the seed within a structure. The GDM minimizes contour energy, providing a smoothed final result. It requires only three simple parameters, all with easily selectable values. The algorithm is fast, performing segmentation on a 336 x 352 x 200 volume in 25 s when running on a 100 MHz 9500 Power Macintosh prototype. The segmentation algorithm was tested on stenosed vessel phantoms with known geometry, and the segmentation of the cross-sectional areas was found to be within 3% of the true area. The algorithm was also applied to two sets of patient carotid images, one acquired with a mechani!

Abstract:   In recent years, the field of active contour-based image segmentation has seen the emergence of two competing approaches. The first and oldest approach represents active contours in an explicit (or parametric) manner corresponding to the Lagrangian formulation. The second approach represents active contours in an implicit manner corresponding to the Eulerian framework. After comparing these two approaches, we describe several new topological and physical constraints applied to parametric active contours in order to combine the advantages of these two contour representations. More precisely, we introduce three algorithms related to the control of the contour topology, geometry, and deformation. The first algorithm controls both vertex spacing and contour smoothness in an independent and intrinsic manner. The second algorithm controls the contour resolution (number of vertices) while the third algorithm automatically creates or fuses connected components on closed or opened!

Abstract:   In this paper we study evolution of plane curves satisfying a geometric equation v = beta (k,v), where v is the normal velocity and k and are the curvature and tangential angle of a plane curve. We follow the direct approach and we analyze the so-called intrinsic heat equation governing the motion of plane curves obeying such a geometric equation. The intrinsic heat equation is modi ed to include an appropriate nontrivial tangential velocity functional. We show how the presence of a nontrivial tangential velocity can prevent numerical solutions from forming various instabilities. From an analytical point of view we present some new results on short time existence of a regular family of evolving curves in the degenerate case when beta (k,v) = gamma (v)k(m), 0 < m 2, and the governing system of equations includes a nontrivial tangential velocity functional.

Abstract:   This paper presents an approach for the extraction of vasculature from angiography images by using a wave propagation and traceback mechanism. We discuss both the theory and the implementation of the approach. Using a dual-sigmoidal filter, we label each pixel in an angiogram with the likelihood that it is within a vessel. Representing the reciprocal of this likelihood image as an array of refractive indexes, we propagate a digital wave through the image from the base of the vascular tree. This wave "washes" over the vasculature, ignoring local noise perturbations. The extraction of the vasculature becomes that of tracing the wave along the local normals to the waveform, While the approach is inherently single instruction stream multiple data stream (SIMD), we present an efficient sequential algorithm for the wave propagation and discuss the traceback algorithm, We demonstrate the effectiveness of our integer image neighborhood-based algorithm and its robustness to image !

Abstract:   Segmenting individual cell nuclei from microscope images normally involves volume labelling of the nuclei with a DNA stain. However, this method often fails when the nuclei are tightly clustered in the tissue, because there is little evidence from the images on where the borders of the nuclei are. In this paper we present a method which solves this limitation and furthermore enables segmentation of whole cells. Instead of using volume stains, we used stains that specifically label the surface of nuclei or cells: lamins for the nuclear envelope and alpha-6 or beta-1 integrins for the cellular surface. The segmentation is performed by identifying unique seeds for each nucleus/cell and expanding the boundaries of the seeds until they reach the limits of the nucleus/cell, as delimited by the lamin or integrin staining, using gradient-curvature flow techniques. We tested the algorithm using computer-generated objects to evaluate its robustness against noise and applied it to c!

Abstract:   Three-dimensional (3-D) imaging of the heart is a rapidly del eloping area of research in medical imaging, Advances in hardware and methods for fast spatio-temporal cardiac imaging are extending the frontiers of clinical diagnosis and research on cardiovascular diseases.In the last few Sears, many approaches hare been proposed to analyze images and extract parameters of cardiac shape and function from a variety of cardiac imaging modalities. In particular, techniques based on spatio-temporal geometric models have received considerable attention. This paper surveys the literature of tno decades of research on cardiac modeling. The contribution of the paper is three-fold: 1) to serve as a tutorial of the field for both clinicians and technologists, 2) to provide an extensive account of modeling techniques in a comprehensive and systematic manner, and 3) to critically review these approaches in terms of their performance and degree of clinical evaluation with respect to the !

Abstract:   Topography simulations are widely used in the microelectronics industry to study the evolution of surface profiles during such processes as deposition or etching. Comparisons between simulations and experiments are used to test proposed transport and chemistry models. The method used to move the surface (the moving algorithm) should not interfere with this testing process; i.e., it should not introduce artifacts. The reference method, shown to be accurate by several groups in many studies, is conservation law based "front tracking." Level set approaches are being increasingly used, largely for their robustness to topological changes. They have not been tested against front tracking to determine their accuracy. In this article, we present guidelines on the use of level set methods for two-dimensional surface evolutions as commonly used. Specifically, we deal with two major issues with level set algorithms: the need for "extension velocities" and the rounding of sharp corne!

Abstract:   Topography simulations are widely used in the microelectronics industry to study the evolution of surface profiles during such processes as deposition or etching. Comparisons between simulations and experiments are used to test proposed transport and chemistry models. The method used to move the surface (the moving algorithm) should not interfere with this testing process; i.e., it should not introduce artifacts. The reference method, shown to be accurate by several groups in many studies, is conservation law based "front tracking." Level set approaches are being increasingly used, largely for their robustness to topological changes. They have not been tested against front tracking to determine their accuracy. In this article, we present guidelines on the use of level set methods for two-dimensional surface evolutions as commonly used. Specifically, we deal with two major issues with level set algorithms: the need for "extension velocities" and the rounding of sharp corne!

Abstract:   This paper presents a strategy for the segmentation of brain from volumetric MR images which integrates 3D segmentation and 3D registration processes. The segmentation process is based on the level set formalism. A closed 3D surface propagates towards the desired boundaries through the iterative evolution of a 4D implicit function. In this work, the propagation relies on a robust evolution model including adaptive parameters. These depend on the input data and on statistical distribution models. The main contribution of this paper is the use of an automatic registration method to initialize the surface, as an alternative solution to manual initialization, The registration is achieved through a robust multiresolution and multigrid minimization scheme. This coupling significantly improves the quality of the method, since the segmentation is faster, more reliable and fully automatic. Quantitative and qualitative results on both synthetic and real volumetric brain MR images a!

Abstract:   We present a powerful morphing technique based on level set methods, that can be combined with a variety of scan conversion/model processing techniques. Bringing these techniques together creates a general morphing approach that allows a user to morph a number of geometric model types in a single animation. We have developed techniques for converting several types of geometric models (polygonal meshes, CSG models and MRI scans) into distance volumes, the volumetric representation required by our level set morphing approach. The combination of these two capabilities allows a user to create a morphing sequence regardless of the model type of the source and target objects, freeing him/her to use whatever model type is appropriate for a particular animation.

Abstract:   We use an unconditionally stable numerical scheme to implement a fast version of the geodesic active contour model. The proposed scheme is useful for object segmentation in images, like tracking moving objects in a sequence of images. The method is based on the Weickert-Romeney-Viergever (additive operator splitting) AOS scheme. It is applied at small regions, motivated by Adalsteinsson-Sethian level set narrow band approach, and uses Sethian's fast marching method for re-initialization. Experimental results demonstrate the power of the new method for tracking in color movies.

Abstract:   We present a system for detecting retinal boundaries in optical coherence tomography (OCT) B-scans. OCT is a relatively new imaging modality giving cross-sectional images that are qualitatively similar to ultrasound. However, the axial resolution with OCT is much higher. on the order of 10 mum. Objective, quantitative measures of retinal thickness may be made from OCT images. Knowledge of retinal thickness is important in the evaluation and treatment of many ocular diseases. The boundary-detection system presented here uses a one-dimensional edge-detection kernel to yield edge primitives. These edge primitives are rated, selected, and organized to form a coherent boundary structure by use of a Markov model of retinal boundaries as detected by OCT. Qualitatively, the boundaries detected by the automated system generally agreed extremely well with the true retinal structure for the vast majority of OCT images. Only one of the 1450 evaluation images caused the algorithm to f!

Abstract:   In this work, we first address the problem of simultaneous image segmentation and smoothing by approaching the Mumford-Shah paradigm from a curve evolution perspective. In particular, we let a set of deformable contours define the boundaries between regions in an image where we model the data via piecewise smooth functions and employ a gradient flow to evolve these contours. Each gradient step involves solving an optimal estimation problem for the data within each region, connecting curve evolution and the Mumford-Shah functional with the theory of boundary-value stochastic processes. The resulting active contour model offers a tractable implementation of the original Mumford-Shah model (i.e., without resorting to elliptic approximations which have traditionally been favored for greater ease in implementation) to simultaneously segment and smoothly reconstruct the data within a given image in a coupled manner. Various implementations of this algorithm are introduced to in!

Abstract:   This paper presents a new variational method for the segmentation of a moving object against a still background, over a sequence of [two-dimensional or three-dimensional (3-D)] image frames. The method is illustrated in application to myocardial gated single photon emission computed tomography (SPECT) data, and incorporates a level set framework to handle topological changes while providing closed boundaries.The key innovation is the introduction of a geometrical constraint into the derivation of the Euler-Lagrange equations, such that the segmentation of each individual frame can be interpreted as a closed boundary of an object (an isolevel of a set of hyper-surfaces) while integrating information over the entire sequence. This results in the definition of an evolution velocity normal to the object boundary. Applying this method to 3-D myocardial gated SPECT sequences, the left ventricle endocardial and epicardial limits can be computed in each frame.This space-time segm!

Abstract:   In this paper, we propose significant extensions to the "snake pedal" model, a powerful geometric shape modeling scheme introduced in (Vemuri and Guo, 1998). The extension allows the model to automatically cope with topological changes and for the first time, introduces the concept of a compact global shape into geometric active models. The ability to characterize global shape of an object using very few parameters facilitates shape learning and recognition. In this new modeling scheme, object shapes are represented using a parameterized function-called the generator-which accounts for the global shape of an object and the pedal curve (surface) of this global shape with respect to a geometric snake to represent any local detail. Traditionally, pedal curves (surfaces) are defined as the loci of the feet of perpendiculars to the tangents of the generator from a fixed point called the pedal point. Local shape control is achieved by introducing a set of pedal points-lying on !

Abstract:   In this paper, we present a fast and simple discrete approach for active contours. It is based on discrete contour evolution, which operates on the boundary of digital shape, by iterative growth processes on the boundary of the shape. We consider a curve to be the boundary of a discrete shape, We attach at each point of the boundary a cost function and deform this shape according to that cost function. The method presents some advantages. It is a discrete method, which takes an implicit representation and uses discrete algorithm with a simple data structure.

Abstract:   The aim of this article is to build trajectories for virtual endoscopy inside 3D medical images, using the most automatic way. Usually the construction of this trajectory is left to the clinician who must define some points on the path manually using three orthogonal views. But for a complex structure such as the colon, those views give little information on the shape of the object of interest. The path construction in 3D images becomes a very tedious task and precise a priori knowledge of the structure is needed to determine a suitable trajectory. We propose a more automatic path tracking method to overcome those drawbacks: we are able to build a path, given only one or two end points and the 3D image as inputs. This work is based on previous work by Cohen and Kimmel [Int. J. Comp. Vis. 24 (1) (1997) 57] for extracting paths in 2D images using Fast Marching algorithm.Our original contribution is twofold. On the first hand, we present a general technical contribution whic!

Abstract:   Deformable models have raised much interest and found various applications in the fields of computer vision and medical imaging. They provide an extensible framework to reconstruct shapes. Deformable surfaces, in particular, are used to represent 3D objects. They have been used for pattern recognition [Computer Vision and Image Understanding 69(2) (1998) 201; IEEE Transactions on Pattern Analysis and Machine Intelligence 19(10) (1997) 1115], computer animation [ACM Computer Graphics (SIGGRAPH'87) 21(4) (1987) 205], geometric modelling [Computer Aided Design (CAD) 24(4) (1992) 178], simulation [Visual Computer 16(8) (2000) 437], boundary tracking [ACM Computer Graphics (SIGGRAPH'94) (1994) 185], image segmentation [Computer Integrated Surgery, Technology and Clinical Applications (1996) 59; IEEE Transactions on Medical Imaging 14 (1995) 442; Joint Conference on Computer Vision, Virtual Reality and Robotics in Medicine (CVRMed-MRCAS'97) 1205 (1997) 13; Medical Image Computi!

Abstract:   We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in the image. A new method to find complete curves from a set of contours or edge points is presented. Our approach is an extension of previous work on finding a set of contours as minimal paths between end points using the fast marching algorithm. Given a set of key points, we find the pairs of points that have to be linked and the paths that join them. We use the saddle points of the minimal action map. The paths are obtained by backpropagation from the saddle points to both points of each pair.We also propose an extension of this method for contour completion where the data is a set of connected components. We find the minimal paths between each of these components, until the complete set of these "regions" is connected. The paths are obtained using the same backpropagation from the saddle points!

Abstract:   A number of geometric active contour and surface models have been proposed for shape segmentation in the literature. The essential idea is to evolve a curve (in 2D) or a surface (in 3D) so that it clings to the features of interest in an intensity image. Several of these models have been derived, using a variational formulation, as gradient flows which minimize or maximize a particular energy functional. However, in practice these models often fail on images of low contrast or narrow structures. To address this problem we have recently proposed the idea of maximizing the rate of increase of flux of an auxiliary vector field through a curve. This has lead to an interpretation as a 2D gradient flow, which is essentially parameter free. In this paper we extend the analysis to 3D and prove that the form of the gradient flow does not change. We illustrate its potential with level-set based segmentations of blood vessels in a large 3D computed rotational angiography (CRA) data !

Abstract:   Segmentation of bright blobs in an image is an important problem in computer vision and particularly in biomedical imaging. In retinal angiography, segmentation of drusen, a yellowish deposit located on the retina, is a serious challenge in proper diagnosis and prevention of further complications.Drusen extraction using classic segmentation methods does not lead to good results. We present a new segmentation method based on new transformations we introduced in mathematical morphology. It is based on the search for a new class of regional maxima components of the image. These maxima correspond to the regions inside the drusen.We present experimental results for drusen extraction using images containing examples having different types and shapes of drusen. We also apply our segmentation technique to two important cases of dynamic sequences of drusen images. The first case is for tracking the average gray level of a particular drusen in a sequence of angiographic images duri!

Abstract:   In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah 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 he seen as a particular case of the minimal partition problem, In the level set formulation, the problem becomes a "mean-curvature 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, hut 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,!

Abstract:   A variety of numerical techniques are available for tracking moving interfaces. In this review, we concentrate on techniques that result from the link between the partial differential equations that describe moving interfaces and numerical schemes designed for approximating the solutions: to hyperbolic conservation laws. This link gives rise to computational techniques for tracking moving interfaces in two and three space dimensions under complex speed laws. We discuss the evolution of these techniques, the fundamental numerical approximations, involved. implementation details, and applications. Tn particular, we review some work on three aspects of materials sciences: semiconductor process simulations. seismic processing, and optimal structural topology design. (C) 2001 Academic Press.

Abstract:   This paper presents a new approach to 3D shape metamorphosis. We express the interpolation of two shapes as a process where one shape deforms to maximize its similarity with another shape. The process incrementally optimizes an objective function while deforming an implicit surface model. We represent the deformable surface as a level set (iso-surface) of a densely sampled scalar function of three dimensions. Such level-set models have been shown to mimic conventional parametric deformable surface models by encoding surface movements as changes in the grayscale values of a volume data set. Thus, a well-founded mathematical structure leads to a set of procedures that describes how voxel values can be manipulated to create deformations that are represented as a sequence of volumes. The result is a 3D morphing method that offers several advantages over previous methods, including minimal need for user input, no model parameterization, flexible topology, and subvoxel accuracy.

Abstract:   We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in the image. A new method to find complete curves from a set of contours or edge points is presented. Our approach is based on a previous work on finding contours as minimal paths between two end points using the fast marching algorithm (L. D Cohen and R. Kimmel, International Journal of Computer Vision, Vol. 24, No. 1, pp. 57-78, 1997). Given a set of key points, we find the pairs of points that have to be linked and the paths that join them. We use the saddle points of the minimal action map. The paths are obtained by backpropagation from the saddle points to both points of each pair.In a second part, we propose a scheme that does not need key points for initialization. A set of key points is automatically selected from a larger set of admissible points. At the same time, saddle points between pa!

Abstract:   The application of level set techniques to echocardiographic data is presented. This method allows semiautomatic segmentation of heart chambers, which regularizes the shapes and improves edge fidelity, especially in the presence of gaps, as is common in ultrasound data. The task of the study was to reconstruct left ventricular shape and to evaluate left ventricular volume. Data were acquired with a real-time three-dimensional (3-D) echocardiographic system. The method was applied directly in the three-dimensional domain and was based on a geometric-driven scheme. The numerical scheme for solving the proposed partial differential equation is borrowed from numerical methods for conservation law. Results refer to in vitro and human in vivo acquired 3-D+time echocardiographic data. Quantitative validation was performed on in vitro balloon phantoms. Clinical application of this segmentation technique is reported for 20 patient cases providing measures of left ventricular volum!

Abstract:   While most improved snakes were built under the original variational scheme, this paper presents an attractable snake based on the greedy snake (Williams and Shah, CVGIP: Image Understanding 55(1) (1992) 14-26). By use of a direct feedback mechanism that is seamlessly consistent with the search strategy of the greedy algorithm, the proposed approach is capable of inheriting the simplicity and efficiency of that algorithm and performing competitively with related snakes. To avoid undesirable local minima, an overall optimal edge detector is designed. A suitable synthetic convergent criterion is proposed which enables snakes to converge normally or oscillatingly on target objects. An adaptive interpolation scheme that encourages snakes to accurately sense the details of object shapes is also described. This model is applied to extract contours from various images with encouraging results. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights re!

Abstract:   'Snakes'-based segmentation techniques have a variety of applications in computer vision. Traditional snakes however are well known to be topologically inflexible. They are incapable of dealing with more complicated object shapes as well as multiple-object scenes since the snakes require that the topology of object structures of interest must be known in advance, This paper introduces a robust topology-adaptive snake, based on the attractable snake model [6], to extend the snakes' topological adaptability. Three embedded schemes: the robust self-looping process, the efficient contour-merging and the improved adaptive interpolation scheme, are involved. Experiment results show that the new snake model is able to; consistently evolve towards its target objects, handle topological changes (i.e. splitting or merging) automatically as necessary and conform to more complicated geometries and topologies, without restrictive requirements on the initial conditions of the snake or !

Abstract:   The general problem of matching structures is very pervasive in computer vision and image processing. The research presented here tackles the problem of object matching in a very general perspective. It is formulated for the matching of surfaces, It applies to objects having small or large deformation and arbitrary topological changes. The process described hinges on a geodesic distance equation for a family of curves or surfaces embedded in the graph of a cost function. This geometrical approach to object matching has the advantage that the similarity criterion can be used to define the shape of the cost function. Matching paths are computed on the cost manifolds using distance maps. These distance maps are generated by solving a general partial differential equation which is a generalization of the geodesic distance evolution scheme introduced by R. Kimmel, A. Amir, and A. F. Bruckstein (1995, IEEE Trans. Pattern Anal. Mach. Intell. 17, 635-640). An Eulerian level-set f!

Abstract:   This paper presents a novel variational framework for dealing with frame partition problems in computer vision by the propagation of curves. This framework integrates boundary- and region-based frame partition modules under a curve-based objective function, which aims at finding a set of minimal length curves that preserve three main properties: (i) they are regular and smooth, (ii) they are attracted by the boundary points (boundary-based information), (iii) and they create a partition that is optimal according to the expected region properties of the different hypotheses (region-based information). The defined objective function is minimized using a gradient descent method. According to the obtained motion equations, the set of initial curves is propagated toward the best partition under the influence of boundary- and region-based forces, and is constrained by a regularity force. The changes of topology are naturally handled thanks to the level set implementation. Furth!

Abstract:   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).

Abstract:   Diffusion generated motion has been used to generate a variety of interface motions. In this paper, we present a new shape recovery model with diffusion generated motion. The approach is based on alternately diffusing and sharpening the initial region to move the sharp interface toward the boundaries of the desired objects. The shapes are recovered by an anisotropic inter-face motion with a local image property dependent speed. Our algorithm is simple and easy to implement. It automatically captures topological changes and works for both 2D and 3D image data. Experimental results for synthetic and real images are presented. (C) 2002 Elsevier Science (USA).

Abstract:   This paper presents a new general framework for image segmentation. A level set formulation is used to model the boundaries of the image regions and a new Multilabel Fast Marching is introduced for the evolution of the region contours toward the se-mentation result. Statistical tests are performed to yield an initial estimate of high-confidence subsets of the image regions. Furthermore, the velocities for the propagation of the region contours are defined in accordance with the a posteriori probability of the respective regions, leading to the Bayesian Level Set methodology described in this paper. Typical segmentation problems are considered and experimental results are given to illustrate the robustness of the method against noise and its performance in precise region boundary localization. (C) 2002 Elsevier Science (USA).

Abstract:   We propose the coarsening strategy for the finite volume computational method given by K. Mikula and N. Ramarosy (Numer. Math. 89, 2001, 561-590) for the numerical solution of the (modified in the sense of F Catte et al. (SIAM J. Numer. Anal. 29, 1992, 182-193)) Perona-Malik nonlinear image selective smoothing equation (called anisotropic diffusion in image processing). The adaptive aproach is directly at hand because a solution tends to be flat in large subregions of the image, and thus it is not necessary to consider the same fine resolution of computations in the whole spatial domain. This access reduces computational effort, because the coarsening of the computational grid rapidly reduces the number of unknowns in the linear systems to be solved at discrete scale steps of the method. (C) 2002 Elsevier Science (USA).

Abstract:   'Snakes' are an effective approach to image segmentation. However, self-looping is a common problem that can cause segmentation failure of snakes in the recovery of highly irregular object shapes, such as in long tube-like shapes, sharp corners or deep concave/convex shapes. This paper introduces the notion of loop-free snakes that can quickly and effectively remove all self-loops during their evolution, consistently deforming and conforming to complicated shapes of target objects. The proposed snakes are less sensitive to their initial contour condition, are resilient to their inconsistent parameter settings in a certain degree and require low computing cost in terms of both computation time and storage. Experiments are conducted to segment real images with encouraging results. (C) 2002 Elsevier Science B.V. All rights reserved.

Abstract:   Tomographic image reconstruction using statistical methods can provide more accurate system modeling, statistical models, and physical constraints than the conventional filtered backprojection (FBP) method. Because of the ill posedness of the reconstruction problem, a roughness penalty is often imposed on the solution to control noise. To avoid smoothing of edges, which are important image attributes, various edge-preserving regularization methods have been proposed. Most of these schemes rely on information from local neighborhoods to determine the presence of edges. In this paper, we propose a cost function that incorporates nonlocal boundary information into the regularization method. We use an alternating minimization algorithm with deterministic annealing to minimize the proposed cost function, jointly estimating region boundaries and object pixel values. We apply variational techniques implemented using level-sets methods to update the boundary estimates, then, usin!

Abstract:   The class of geometric deformable models, also known as level sets, has brought tremendous impact to medical imagery due to its capability of topology preservation and fast shape recovery. In an effort to facilitate a clear and full understanding of these powerful state-of-the-art applied mathematical tools, this paper is an attempt to explore these geometric methods, their implementations and integration of regularizers to improve the robustness of these topologically independent propagating curves/surfaces. This paper first presents the origination of level sets, followed by the taxonomy of level sets. We then derive the fundamental equation of curve/surface evolution and zero-level curves/surfaces. The paper then focuses on the first core class of level sets, known as "level sets without regularizers." This class presents five prototypes: gradient, edge, area-minimization, curvature-dependent and application driven. The next section is devoted to second core class of l!

Abstract:   This paper presents a novel variational framework to deal with frame partition problems in Computer Vision. This framework exploits boundary and region-based segmentation modules under a curve-based optimization objective function. The task of supervised texture segmentation is considered to demonstrate the potentials of the proposed framework. The textured feature space is generated by filtering the given textured images using isotropic and anisotropic filters, and analyzing their responses as multi-component conditional probability density functions. The texture segmentation is obtained by unifying region and boundary-based information as an improved Geodesic Active Contour Model. The defined objective function is minimized using a gradient-descent method where a level set approach is used to implement the obtained PDE. According to this PDE, the curve propagation towards the final solution is guided by boundary and region-based segmentation forces, and is constrained b!

Abstract:   We present a geometric model and a computational method for segmentation of images with missing boundaries. In many situations, the human visual system fills in missing gaps in edges and boundaries, building and completing information that is not present, Boundary completion presents a considerable challenge in computer vision, since most algorithms attempt to exploit existing data. A large body of work concerns, completion models, which postulate how to construct missing data; these models are often trained and specific to particular images. In this paper, we take the following, alternative perspective: we consider a given reference point within the image, and then develop an algorithm which tries to build missing information on the basis of the given point of view and the available information as boundary data to the algorithm. Starting from this point of view, a surface is constructed. It is then evolved with the mean curvature flow in the metric induced by the image u!

Abstract:   Collision-free motion among moving objects is an on-going research topic. Based on the concept of a modified path-velocity decomposition and application of the interface propagation method, a strategy for trajectory planning is proposed in this paper. In the proposed method, the global navigation paths for robots are assumed to have already been planned without any static obstacle crossing their paths. Each subtask along the global path of each controlled object contains a desired goal position and desired arrival time for reaching the position. Based on the information about each subtask, Space/Time Graphs (STGs) for the robots are created. By shifting the speed path from corresponding forbidden regions on the STG, potential collisions can be avoided. Optimal speed paths with least velocity alterations for controllable objects are derived automatically by applying the interface propagation method in the STGs. The applicability of the proposed approach is demonstrated and!

Abstract:   This paper reviews model-based methods for non-rigid shape recognition. These methods model, match and classify non-rigid shapes. which are generally problematic for conventational algorithms using rigid models. Issues including model representation, optimization criteria formulation, model matching, and classification are examined in detail with the objective to provide interested researchers a roadmap for exploring the field. This paper emphasizes on 2D deformable models. Their potential applications and future research directions, particularly on deformable pattern classification, are discussed. (C) 2002 Published by Elsevier Science Ltd on behalf of Pattern Recognition Society.

Abstract:   Extensive growth in functional brain imaging, perfusion-weighted imaging, diffusion-weighted imaging, brain mapping and brain scanning techniques has led tremendously to the importance of the cerebral cortical segmentation, both in 2-D and 3-D, from volumetric brain magnetic resonance imaging data sets. Besides that, recent growth in deformable brain segmentation techniques in 2-D and 3-D has brought the engineering community, such as the areas of computer vision, image processing, pattern recognition and graphics, closer to the medical community, such as to neuro-surgeons, psychiatrists, oncologists, neuro-radiologists and internists. This paper is an attempt to review the state-of-the-art 2-D and 3-D cerebral cortical segmentation techniques from brain magnetic resonance imaging based on three main classes: region-based, boundary/surface-based and fusion of boundary/surface-based with region-based techniques. In the first class, region-based techniques, we demonstrated !

Abstract:   A new constraint on geometric active contour has been proposed, that is capable of propagating adaptively (bidirectional) and extracting the shape of the object more accurately. The constraint used is an image based steering function derived from histogram features in a non-overlapped distribution function, as against the conventional method that uses gradient-based edge stopping function. (C) 2002 Elsevier Science B.V. All rights reserved.

Abstract:   A segmentation model that combines the Mumford-Shah( M-S) model and narrow band scheme of level set was presented. The disadvantage of Mumford-Shah model is computationally time-consuming. In each step of its iteration, the data of whole image have to be renewed, which is unbearable for segmentation of large image or 3D image. Therefore, a fast segmentation model was introduce, which combines the M-S model and narrow band scheme by a new initialization method. The new initialization method is based on fast marching method, and the computing time decreases to O(N). In each step of iteration, the new segmentation model only deals with the data in a narrow band instead of the whole image. The experiments show that the two models can obtain almost the same segmentation result, but the computing time of new narrow band M-S model is much less than that of M-S model.

Abstract:   We present a level set framework for implementing editing operators for surfaces. Level set models are deformable implicit surfaces where the deformation of the Surface is controlled by a speed function in the level set partial differential equation. In this paper we define a collection of speed functions that produce a set of surface editing operators. The speed functions describe the velocity at each point on the evolving surface in the direction of the surface normal. All of the information needed to deform a surface is encapsulated in the speed function, providing a simple, unified computational framework. The user combines pre-defined building blocks to create the desired speed function. The surface editing operators are quickly computed and may be applied both regionally and globally. The level set framework offers several advantages. 1) By construction, self-intersection cannot occur, which guarantees the generation of physically-realizable, simple, closed surfaces!

Abstract:   Features extraction from medical images represents a fundamental step for shape recognition and diagnostic support. The present work faces the problem of the detection of large features, such as massive lesions and organ contours, from mammographic images. The regions of interest are often characterized by an average grayness intensity that is different from the surrounding. In most cases, however, the desired features cannot be extracted by simple gray level thresholding, because of image noise and non-uniform density of the surrounding tissue. In this work, edge detection is achieved through the fast marching method (Level Set Methods and Fast Marching Methods, Cambridge University Press, Cambridge, 1999), which is based on the theory of interface evolution. Starting from a seed point in the shape of interest, a front is generated which evolves according to an appropriate speed function. Such function is expressed in terms of geometric properties of the evolving interfa!

Abstract:   Feature detection is important in various mesh processing techniques, such as mesh editing, mesh morphing, mesh compression, and mesh signal processing. In spite of much research in computer vision, automatic feature detection even for images still remains a difficult problem. To avoid this dfficulty, semi-automatic or interactive techniques for image feature detection have been investigated. In this paper, we propose a geometric snake as an interactive tool for feature detection on a 3D triangular mesh. A geometric snake is an extension of an image snake, which is an active contour model that slithers from its initial position specified by the user to a nearby feature while minimizing an energy functional. To constrain the movement of a geometric snake onto the surface of a mesh, we use the parameterization of the surrounding region of a geometric snake. Although the definition of a feature may vary among applications, we use the normal changes of faces to detect feature!

Abstract:   The quantitative estimation of regional cardiac deformation from three-dimensional (3-D) image sequences has important clinical implications for the assessment of viability in the heart wall. We present here a generic methodology for estimating soft tissue deformation which integrates image-derived information with biomechanical models, and apply it to the problem of cardiac deformation estimation. The method is image modality independent. The images are segmented interactively and then initial correspondence is established using a shape-tracking approach. A dense motion field is then estimated using a transversely isotropic, linear-elastic model, which accounts for the muscle fiber directions in the left ventricle. The dense motion field is in turn used to calculate the deformation of the heart wall in terms of strain in cardiac specific directions. The strains obtained using this approach in open-chest dogs before and after coronary occlusion, exhibit a high correlation!

Abstract:   We have developed a nonparametric and nonrigid registration method. It requires a segmentation contour of the organ of interest in both the image to register and the image template. We use the fact that the contour template can be deduced from the contour in the image to register by a series of locally normal elementary deformations. We extend these contour deformations to the whole image domain using level sets (sets of embedded parallel contours, the organ contour being the contour of reference). This series of elementary deformations provides a way to perform an iterative (totally unrestricted, unlike parametric methods) registration by indicating the successive motions from a point in the image to register to its final position in the registered image. The use of the organ contour has two consequences: 1) Our method is consistent with the image features and 2) our method is based on image geometry (as opposed to intensity) and, therefore, it is less sensitive to noise!

Abstract:   Some known models in phase separation theory (Hele-Shaw, nonlocal mean curvature motion) and their approximations by means of Cahn-Hilliard and nonlocal Allen-Cahn equations are proposed as a tool to generate planar curve-shortening flows without shrinking. This procedure can be seen as a level set approach to area-preserving geometric flows in the spirit of Sapiro and Tannenbaum [38], with application to shape recovery. We discuss the theoretical validation of this method and its implementation to problems of shape recovery in Computer Vision. The results of some numerical experiments on image processing are presented.

Abstract:   In this paper we propose a level set method to segment MR cardiac images. Our approach is based on a coupled propagation of two cardiac contours and integrates visual information with anatomical constraints. The visual information is expressed through a gradient vector flow-based boundary component and a region term that aims at best separating the cardiac contours/regions according to their global intensity properties. In order to deal with misleading visual support, an anatomical constraint is considered that couples the propagation of the cardiac contours according to their relative distance. The resulting motion equations are implemented using a level set approach and a fast and stable numerical approximation scheme, the Additive Operator Splitting. Encouraging experimental results are provided using real data.

Abstract:   In this paper, we report an active contour algorithm that is capable of using prior shapes. The energy functional of the contour is modified so that the energy depends on the image gradient as well as the prior shape. The model provides the segmentation and the transformation that maps the segmented contour to the prior shape. The active contour is able to find boundaries that are similar in shape to the prior, even when the entire boundary is not visible in the image (i.e., when the boundary has gaps). A level set formulation of the active contour is presented. The existence of the solution to the energy minimization is also established.We also report experimental results of the use of this contour on 2d synthetic images, ultrasound images and fMRI images. Classical active contours cannot be used in many of these images.

Abstract:   We address an ill-posed inverse problem of image estimation from sparse samples of its Fourier transform. The problem is formulated as joint estimation of the supports of unknown sparse objects in the image, and pixel values on these supports. The domain and the pixel values are alternately estimated using the level-set method and the conjugate gradient method, respectively. Our level-set evolution shows a unique switching behavior, which stabilizes the level-set evolution. Furthermore, the trade-off between the stability and the speed of evolution can be easily controlled by the number of the conjugate gradient steps, thus avoiding the re-initialization steps in conventional level set approaches.

Abstract:   Under ideal circumstances, the inverse of the radon transform is computable, and sequences of measured projections are sufficient to obtain accurate estimates of volume densities. In situations where the sinogram data is incomplete, the radon transform is noninvertable, and attempts to reconstruct greyscale density values result in reconstruction artifacts that can undermine the effectiveness of subsequent processing. This paper presents a direct approach to the segmentation of incomplete tomographic data. The strategy is to impose a fairly simple model on the data, and treat segmentation as a problem of estimating the interface between two substances of somewhat homogeneous density. The segmentation is achieved by simultaneously deforming a surface model and updating density parameters in order to achieve a best fit between the projected model and the measured sinograms. The deformation is implemented with level-set surface models, calculated at the resolution of the inp!

Abstract:   We discuss two image-based 3D modeling methods based on a multiresolution evolution of a volumetric function's level set. in the former method, the role of the level set implosion is to fuse ("sew" and "stitch") together several partial reconstructions (depth maps) into a closed model. In the later, the level set's implosion is steered directly by the texture mismatch between views. Both solutions share the characteristic of operating in an adaptive multiresolution fashion, in order to boost up computational efficiency and robustness.

Abstract:   We are presenting here a model for processing space-time image sequences and applying them to 3D echo-cardiography. The non-linear evolutionary equations filter the sequence with keeping space-time coherent structures. They have been developed using ideas of regularized Perona-Malik an-isotropic diffusion and geometrical diffusion of mean curvature flow type (Malladi-Sethian), combined with Galilean invariant movie multi-scale analysis of Alvarez et al. A discretization of space-time filtering equations by means of finite volume method is discussed in detail. Computational results in processing of 3D echo-cardiographic sequences obtained by rotational acquisition technique and by real-time 3D echo volumetrics acquisition technique are presented. Quantitative error estimation is also provided. (C) 2002 Elsevier Science (USA). All rights reserved.

Abstract:   We developed a new triangulated deformable surface model, which is used to detect the boundary of the bones in three-dimensional magnetic resonance (MR) and computed tomography (CT) images of the wrist. This surface model is robust to initialization and provides wide geometrical coverage and quantitative power.The surface is deformed by applying one-dimensional (I-D) radial Lagrangian dynamics. For initialization a tetrahedron is placed within the bone to be segmented. This initial surface is inflated to a binary approximation of the boundary. During inflation, the surface is refined by the addition of vertices. After the surface is fully inflated, a detailed, accurate boundary detection is obtained by the application of radial scale-space relaxation. In this optimization stage, the image intensity is filtered with a series of I-D second-order Gaussian filters. The resolution of the triangulated mesh is adapted to the width of the Gaussian filter.To maintain the coherence!

Abstract:   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 e!

Abstract:   What does it mean for a deforming object to be "moving" (see Fig. 1)? How can we separate the overall motion (a finite-dimensional group action) from the more general deformation (a diffeomorphism)? In this paper we propose a definition of motion for a deforming object and introduce a notion of "shape average" as the entity that separates the motion from the deformation. Our definition allows us to derive novel and efficient algorithms to register non-equivalent shapes using region-based methods, and to simultaneously approximate and register structures in grey-scale images. We also extend the notion of shape average to that of a "moving average" in order to track moving and deforming objects through time.

Abstract:   We present a variational approach to the problem of registering planar shapes despite missing parts. Registration is achieved through the evolution of a partial differential equation that simultaneously estimates the shape of the missing region, the underlying "complete shape" and the collection of group elements (Euclidean or affine) corresponding to the registration. Our technique applies both to shapes, for instance represented as characteristic functions (binary images), and to grayscale images, where all intensity levels evolve simultaneously in a partial differential equation. It can therefore be used to perform "region inpainting" and to register collections of images despite occlusions. The novelty of the approach lies on the fact that, rather than estimating the missing region in each image independently, we pose the problem as a joint registration with respect to an underlying "complete shape" from which the complete version of the original data is obtained via !

Abstract:   Deformable models like snakes are a classical tool for image segmentation. Highly deformable models extend them with the ability to handle dynamic topological changes, and therefore to extract arbitrary complex shapes. However, the resolution of these models largely depends on the resolution of the image. As a consequence, their time and memory complexity increases at least as fast as the size of input data. In this paper we extend an existing highly deformable model, so that it is able to locally adapt its resolution with respect to its position. With this property, a significant precision is achieved in the interesting parts of the image, while a coarse resolution is maintained elsewhere. The general idea is to replace the Euclidean metric of the image space by a deformed non-Euclidean metric, which geometrically expands areas of interest. With this approach, we obtain a new model that follows the robust framework of classical deformable models, while offering a signifi!

Abstract:   In this paper, we present an approach for image segmentation, based on the existing Active Snake Model and Watershed-based Region Merging. Our algorithm includes initial segmentation using Normalized Gradient Vector Diffusion (NGVD) and region merging based on Region Adjacency Graph (RAG). We use a set of heat diffusion equations to generate a vector field over the image domain, which provides us with a natural way to define seeds as well as an external force to attract the active snakes. Then an initial segmentation of the original image can be obtained by a similar idea as seen in active snake model. Finally an RAG-based region merging technique is used to find the true segmentation as desired. The experimental results show that our NGVD-based region merging algorithm overcomes some problems as seen in classic active snake model. We will also see that our NGVD has several advantages over the traditional gradient vector diffusion.

Abstract:   Active contour models, otherwise known as snakes, are extensively used in image processing and computer vision applications. However, although the approach is popular for detecting the contours of smooth convex objects, it is much more problematic in handling images containing an object with concave parts or sharp corners, or multiple objects. We further develop our segmented snake approach to contour detection and illustrate its flexibility by showing how it can be adapted to yield a dividing snake algorithm for use in multiple object segmentation. We also introduce a snake relaxation technique that can improve the convergence of the snake contour onto the object boundary. (C) 2002 Society of Photo-Optical Instrumentation Engineers.

Abstract:   This paper describes a new method to segment vascular structures in 3D MRA data, based on the Wavefront Propagation algorithm. The center lumen line and the vessel boundary are detected automatically. Our 3D visualization and interaction platform will be prestended, which is used to aid the phycisian in the analysis of the MRA data. The results are compared to conventional X-ray DSA which is considered the current gold-standard. Provided that the diameter of the vessel is larger than 3 voxels, our method has similar result as X-ray DSA.

Abstract:   [1] Novel developments of the so-called controlled evolution of level sets [Ramananjaona et al., 2001b], which is devoted to shape identification of homogeneous scattering obstacles buried in a known space from time-harmonic wave field data, are considered herein. The emphasis is twofold: regularization of the geometry of the sought shape-enforced via a speed of motion of the level set in ( pseudo) time and space resulting from the minimization of a properly penalized objective functional; and improvement of the convergence of the scheme itself by a choice of a time step adapted to the evolution of the level set and to the sought decrease of the objective functional. Key elements of the theoretical analysis are given, and several numerical examples illustrate pros and cons.

Abstract:   In many scientific and technical applications, a three-dimensional (3D) object must he reconstructed, either to assist in understanding the object's structure or to ease its automatic handling and analysis. Volume reconstruction has been used in health care to diagnose, simulate, facilitate surgical planning, develop image-guided surgery, facilitate telemedicine, and to assist in many other applications. This paper presents a survey of computational methods used to achieve volume reconstruction. First, we review 3D imaging techniques. Second, since we consider image segmentation the most important and difficult phase of 3D reconstruction, we focus on this topic. Subsequently, we concentrate on some of the most successful techniques of segmentation used for 3D reconstruction, such as active contours. We also review computer graphics and visualization methods used with volume reconstruction. Finally, we indicate future lines for research in volume reconstruction and 3D imag!

Abstract:   An automatic cortical gray matter segmentation from a three-dimensional (3-D) brain images [magnetic resonance (MR) or computed tomography] is a well known problem in medical image processing. In this paper, we first formulate it as a geometric variational problem for propagation of two coupled bounding surfaces. An efficient numerical scheme is then used to implement the geodesic active surface model. Experimental results of cortex segmentation on real 3-D MR data are provided.

Abstract:   Magnetic resonance (MR) tagging is a technique for measuring heart deformations through creation of a stripe grid pattern on cardiac images. In this paper, we present a maximum a posteriori (MAP) framework for detecting tag lines using a Markov random field (MRF) defined on the lattice generated by three-dimensional (3-D) and four-dimensional (4-D) (3-D+t) uniform sampling of B-spline models. In the 3-D case, MAP estimation is cast for detecting present tag features in the current image given an initial solid from the previous frame (the initial undeformed solid is manually positioned by clicking on corner points of a cube). The method also allows the parameters of the solid model, including the number of knots and the spline order, to be adjusted within the same framework. Fitting can start with a solid with less knots and lower spline order and proceed to one with more knots and/or higher order so as to achieve more accuracy and/or higher order of smoothness. In the 4-D!

Abstract:   Two-dimensional intensity-based methods for the segmentation of blood vessels from computed-tomography-angiography data often result in spurious segments that originate from other objects whose intensity distributions overlap with those of the vessels. When segmented images include spurious segments, additional methods are required to select segments that belong to the target vessels. We describe a method that allows experts to select vessel segments from sequences of segmented images with little effort. Our method uses ellipse-overlap criteria to differentiate between segments that belong to different objects and are separated in plane but are connected in the through-plane direction. To validate our method, we used it to extract vessel regions from volumes that were segmented via analysis of isolabel-contour maps, and showed that the difference between the results of our method and manually-edited results was within inter-expert variability. Although the total editing d!

Abstract:   We propose a new deformable shape model Active Shape Structural Model (ASSM) for recognition and reconstruction. The main features of ASSM are: (1) It describes variations of shape not only statistically as Active shape/Appearance model but also by structural variations. (2) Statistical and structural prior knowledge is integrated resulting in a multi-resolution shape description such that the statistical variation becomes more constrained as structural information is added. Experiments on hand drawn sketches of mechanical systems using electronic ink demonstrate the ability of the deformable model to recognize objects structurally and reconstruct them statistically.

Abstract:   Blood pool agents (BPAs) for contrast-enhanced (CE) magnetic-resonance angiography (MRA) allow prolonged imaging times for higher contrast and resolution. Imaging is performed during the steady state when the contrast agent is distributed through the complete vascular system. However, simultaneous venous and arterial enhancement in this steady state hampers interpretation. In order to improve visualization of the arteries and veins from steady-state BPA data, a semiautomated method for artery-vein separation is presented. In this method, the central arterial axis and central venous axis are used as initializations for two surfaces that simultaneously evolve in order to capture the arterial and venous parts of the vasculature using the level-set framework. Since arteries and veins can be in close proximity of each other, leakage from the evolving arterial (venous) surface into the venous (arterial) part of the vasculature is inevitable. In these situations, voxels are labe!

Abstract:   We propose that the generalization of signal and image processing to surfaces entails filtering the normals of the surface, rather than filtering the positions of points on a mesh. Using a variational strategy, penalty functions on the surface geometry can be formulated as penalty functions on the surface normals, which are computed using geometry-based shape metrics and minimized using fourth-order gradient descent partial differential equations (PDEs). In this paper, we introduce a two-step approach to implementing geometric processing tools for surfaces: (i) operating on the normal map of a surface, and (ii) manipulating the surface to fit the processed normals. Iterating this two-step process, we efficiently can implement geometric fourth-order flows by solving a set of coupled second-order PDEs. The computational approach uses level set surface models; therefore, the processing does not depend on any underlying parameterization. This paper will demonstrate that the p!

Abstract:   A divide and conquer deformable contour method is presented with an initial inside closed contour being divided into arbitrary segments, and these segments are allowed to deform separately preserving the segments' connectivity. A maximum area threshold, A a., is used to stop these outward contour segments' marching. Clear and blur contour points are then identified to partition the whole contour into clear and blur segments. A bi-directional searching method is then recursively applied to each blur segment including a search for contour-within-contour segment to reach a final close contour. Further improvements are provided by a model based searching algorithm. It is a two-step process with step 1 being a linked contour model matching operation where landmarks are extracted, and step 2 being a posteriori probability model matching and correction operation where large error segments are fine tuned to obtain the final results. The experiments include ultrasound images of pi!

Abstract:   An active contour model to surface approximation is presented. It adapts to the model shape to be approximated with help of local quadratic approximants of the squared distance function. The approach completely avoids the parametrization problem. The concept is open for inclusion of smoothing operators and shape constraints. (C) 2003 Elsevier B.V. All rights reserved.

Abstract:   Accurately segmenting and quantifying pulmonary nodule structure is a key issue in three-dimensional (3-D) computer-aided diagnosis (CAD) schemes. This paper presents a nodule segmentation method from 3-D thoracic CT images based on a deformable surface model. In this method, first, a statistical analysis of the observed intensity is performed to measure differences between the nodule and other regions. Based on this analysis, the boundary and region information are represented by boundary and region likelihood, respectively. Second, an initial surface in the nodule is manually set. Finally, the deformable surface model moves the initial surface so that the surface provides high boundary likelihood and high posterior segmentation probability with respect to the nodule. For the purpose, the deformable surface model integrates the boundary and region information. This integration makes it possible to cope with inappropriate position or size of an initial surface in the nodu!

Abstract:   Active contour models are an efficient, accurate, and robust tool for the segmentation of 2D and 3D image data. In particular, geometric deformable models (GDM) that represent an active contour as the level set of an implicit function have proven to be very effective. GDMs, however, do not provide any topology control, i.e. contours may merge or split arbitrarily and hence change the genus of the reconstructed surface. This behavior is inadequate in settings like the segmentation of organic tissue or other objects whose genus is known beforehand. In this paper we describe a novel method to overcome this limitation while still preserving the favorable properties of the GDM setup. We achieve this by adding (sparse) topological information to the volume representation at locations where it is necessary to locally resolve topological ambiguities. Since the sparse topology information is attached to the edges of the voxel grid, we can reconstruct the interfaces where the defor!

Abstract:   In this paper we present a new variational framework in level set form for image segmentation, which incorporates both a prior shape and prior fixed locations of a small number of points. The idea underlying the model is the creation of two energy terms in the energy function for the geodesic active contours. The first energy term is for the shape, the second for the locations of the points In this model, segmentation is achieved through a registration technique, which combines a rigid transformation and a local deformation. The rigid transformation is determined explicitly by using shape information, while the local deformation is determined implicitly by using image gradients and prior locations. We report experimental results on both synthetic and ultrasound images. These results compared with the results obtained by using a previously reported model, which only incorporates a shape prior into the active contours.

Abstract:   This paper presents a novel method for surface recovery from discrete 3D point data sets. In order to produce improved reconstruction results, the algorithm presented in this paper combines the advantages of a parametric approach to model local surface structure, with the generality and the topological adaptability of a geometric flow approach. This hybrid method is specifically designed to preserve discontinuities in 3D, to be robust to noise, and to reconstruct objects with arbitrary topologies. The key ideas are to tailor a curvature consistency algorithm to the case of a set of points in 3D and to then incorporate a flux maximizing geometric flow for surface reconstruction. The approach is illustrated with experimental results on a variety of data sets.

Abstract:   An improved fast marching approach for endocardial boundary detection and tracking in echocardiographic images is presented. Firstly, the traditional fast marching algorithm is applied to the echocardiographic images. And the existing problems are discussed. Then, the algorithm is improved by introducing the average energy of the whole advancing front into the speed term instead of determining the speed term only with the local image features. The experimental results show that the improved algorithm is very effective and stable. (C) 2003 Elsevier B.V. All rights reserved.

Abstract:   In this paper we address a moving object segmentation technique for a video monitoring system. This is approached by means of active contours which appear to be an efficient tool for the spatio-temporal data analysis from 2D image sequences. Particularly we make use of a new active contour concept: the pixel-level snakes whose characteristics allow a high control on the contour evolution and approach topological transformations with a low computational cost. The proposal is focused in the traffic monitoring and the incident detection systems.

Abstract:   Levelset methods were introduced in medical images segmentation by Malladi et al. in 1995. In this paper, we propose several improvements of the original method to speed up the algorithm convergence and to improve the quality of the segmentation in the case of cardiac gated SPECT images.We studied several evolution criterions, taking into account the dynamic property of heart image sequences. For each step of the segmentation algorithm, we have compared different solutions in order to both reduce time and improve. quality.We have developed a modular segmentation tool with 3D+T visualization capabilities to experiment the proposed solutions and tune the algorithm parameters. We show segmentation results on both simulated and real SPECT images.

Abstract:   We present a new minimum description length (MDL) approach based on a deformable partition-a polygonal grid-for automatic segmentation of speckled image composed of several homogeneous regions. The image segmentation thus consists in the estimation of the polygonal grid, or, more precisely, its number of regions, its number of nodes and the location of its nodes. These estimations are performed by minimizing a unique MDL criterion which takes into account the probabilistic properties of speckle fluctuations and a measure of the stochastic complexity of the polygonal grid. This approach then leads to a global MDL criterion without undetermined parameter since no other regularization term than the stochastic complexity of the polygonal grid is necessary and noise parameters can be estimated with maximum likelihood-like approaches. The performance of this technique is illustrated on synthetic and real Synthetic Aperture Radar images of agricultural regions and the influence !

Abstract:   Vascular disease produces changes in lumenal shape evident in magnetic resonance angiography (MRA). However, quantification of vascular shape from MRA is problematic due to image artifacts. Prior deformable models for vascular surface reconstruction primarily resolve problems of initialization of the surface mesh. However, initialization can be obtained in a trivial manner for MRA using isosurfaces. We propose a methodology for deforming the isusurface to conform to the boundaries of objects in the image with minimal a priori assumptions of object shape. As in conventional methods, external forces attract the surface toward edges in the image. However, smoothing is produced by a moment that aligns the normals of adjacent surface triangles. Notably, the moment produces no translational motion of surface triangles. The deformable isosurface was applied to a digital phantom of a stenotic artery, to MRA of three renal arteries with atherosclerotic disease and MRA of one carot!

Abstract:   Knowledge-based segmentation has been explored significantly in medical imaging. Prior anatomical knowledge can be used to define constraints that can improve performance of segmentation algorithms to physically corrupted and incomplete data. In this paper, the objective is to introduce such knowledge-based constraints while preserving the ability of dealing with local deformations. Toward this end, we propose a variational level set framework that can account for global shape consistency as well as for local deformations. In order to improve performance, the problems of segmentation and tracking of the structure of interest are dealt with simultaneously by introducing the notion of time in the process and looking for a solution that satisfies that prior constraints while being consistent along consecutive frames. Promising experimental results in magnetic resonance and ultrasonic cardiac images demonstrate the potentials of our approach.

Abstract:   Objective. Prostate diseases are very common in adult and elderly men, and prostate boundary detection from ultrasonographic images plays a key role in prostate disease diagnosis and treatment. However, because of the poor quality of ultrasonographic images, prostate boundary detection still remains a challenging task. Currently, this task is performed manually, which is arduous and heavily user dependent. To improve the efficiency by automating the boundary detection process, numerous methods have been proposed. We present a review of these methods, aiming to find a good solution that could efficiently detect the prostate boundary on ultrasonographic images. Methods. A full description of various methods is beyond the scope of this article; instead, we focus on providing an introduction to the different methods with a discussion of their advantages and disadvantages. Moreover, verification methods for estimating the accuracies of the algorithms reported in the literature!

Abstract:   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 con!

Abstract:   Traditionally, segmentation and registration have been solved as two independent problems, even though it is often the case that the solution to one impacts the solution to the other. In this paper, we introduce a geometric, variational framework that uses active contours to simultaneously segment and register features from multiple images. The key observation is that multiple images may be segmented by evolving a single contour as well as the mappings of that contour into each image. (C) 2003 Elsevier Science B.V. All rights reserved.

Abstract:   We view the fundamental edge integration problem for object segmentation in a geometric variational framework. First we show that the classical zero-crossings of the image Laplacian edge detector as suggested by Marr and Hildreth, inherently provides optimal edge-integration with regard to a very natural geometric functional. This functional accumulates the inner product between the normal to the edge and the gray level image-gradient along the edge. We use this observation to derive new and highly accurate active contours based on this functional and regularized by previously proposed geodesic active contour geometric variational models. We also incorporate a 2D geometric variational explanation to the Haralick edge detector into the geometric active contour framework.

Abstract:   A region-based approach to nonrigid motion tracking is described. Shape is defined in terms of a deformable triangular mesh that captures object shape plus a color texture map that captures object appearance. Photometric variations are also modeled. Nonrigid shape registration and motion tracking are achieved by posing the problem as an energy-based, robust minimization procedure. The approach provides robustness to occlusions, wrinkles, shadows, and specular highlights. The formulation is tailored to take advantage of texture mapping hardware available in many workstations, PCs, and game consoles. This enables nonrigid tracking at speeds approaching video rate. (C) 2003 Elsevier Science (USA). All rights reserved.

Abstract:   What does it mean for a deforming object to be "moving"? How can we separate the overall motion ( a finite-dimensional group action) from the more general deformation ( a diffeomorphism)? In this paper we propose a definition of motion for a deforming object and introduce a notion of "shape average" as the entity that separates the motion from the deformation. Our definition allows us to derive novel and efficient algorithms to register nonidentical shapes using region-based methods, and to simultaneously approximate and align structures in greyscale images. We also extend the notion of shape average to that of a "moving average" in order to track moving and deforming objects through time. The algorithms we propose extend prior work on landmark-based matching to smooth curves, and involve the numerical integration of partial differential equations, which we address within the framework of level set methods.

Abstract:   We cast the problem of multiframe stereo reconstruction of a smooth surface as the global region segmentation of a collection of images of the scene. Dually, the problem of segmenting multiple calibrated images of an object becomes that of estimating the solid shape that gives rise to such images. We assume that the radiance of the scene results in piecewise homogeneous image statistics. This simplifying assumption covers Lambertian scenes with constant albedo as well as fine homogeneous textures, which are known challenges to stereo algorithms based on local correspondence. We pose the segmentation problem within a variational framework, and use fast level set methods to find the optimal solution numerically. Our algorithm does not work in the presence of strong photometric features, where traditional reconstruction algorithms do. It enjoys significant robustness to noise under the assumptions it is designed for.

Abstract:   This paper deals with image and video segmentation using active contours. We propose a general form for the energy functional related to region-based active contours. We compute the associated evolution equation using shape derivation tools and accounting for the evolving region-based terms. Then we apply this general framework to compute the evolution equation from functionals that include various statistical measures of homogeneity for the region to be segmented. Experimental results show that the determinant of the covariance matrix appears to be a very relevant tool for segmentation of homogeneous color regions. As an example, it has been successfully applied to face segmentation in real video sequences.

Abstract:   We present a discrete contour model for the segmentation of image data with any dimension of image domain and value range. The model consists of a representation using simplex meshes and a mechanical formulation of influences that drive an iterative segmentation. The object's representation as well as the influences are valid for any dimension of the image domain. The image influences introduced here, can combine information from independent channels of higher-dimensional value ranges. Additionally, the topology of the model automatically adapts to objects contained in images. Noncontextual tests have validated the ability of the model to reproducibly delineate synthetic objects. In particular, images with a signal to noise ratio of SNR < 0.5 are delineated within two pixels of their ground truth contour. Contextual validations have shown the applicability of the model for medical image analysis in image domains of two, three, and four dimensions in single as well as mult!

Abstract:   We propose a shape-based approach to curve evolution for the segmentation of medical images containing known object types. In particular, motivated by the work of Leventon, Grimson, and Faugeras [15], we derive a parametric model for an implicit representation of the segmenting curve by applying principal component analysis to a collection of signed distance representations of the training data. The parameters of this representation are then manipulated to minimize an objective function for segmentation. The resulting algorithm is able to handle multidimensional data, can deal with topological changes of the curve, is robust to noise and initial contour placements, and is computationally efficient. At the same time, it avoids the need for point correspondences during the training phase of the algorithm. We demonstrate this technique by applying it to two medical applications; two-dimensional segmentation of cardiac magnetic resonance imaging (MRI) and three-dimensional se!

Abstract:   The reconstructing optimal microstructures of given homogenized coefficients of steady diffusion equation is studied. In the reconstruction, the governing equation of level set function is approximated by adding viscosity term and the numerical procedure for the evolution of the level set function for the solution is examined. The numerical experiments of reconstruction are obtained by applying a finite element method with locally fitted mesh.

Abstract:   A new algorithm, called the Unsupervised Tag ExTraction and Heart strain(E) Reconstruction (UNTETHER) algorithm, is presented for quantifying three-dimensional (3D) myocardial strain in tagged cardiac MR images. Five human volunteers and five postinfarct patients were imaged. 3D strains measured by UNTETHER and a user-supervised technique were compared. Each study was analyzed in 49 +/- 8 min with UNTETHER, compared to similar to4 hr with the user-supervised technique. For pooled human data, the correlation coefficient between the two methods for circumferential shortening (E-cc) was r = 0.91 at the mid-wall (P < 0.0005). UNTETHER is capable of measuring wall motion abnormalities resulting from coronary artery disease, and has the potential to overcome the main limitations (time and user-supervision requirements) to routine clinical use of tagged cardiac MRI. (C) 2003 Wiley-Liss, Inc.

Abstract:   Objectives: To provide a comprehensive bottom-up categorization of model-based segmentation techniques that allows to select, implement, and apply well-suited active contour models for segmentation of medical images, where major challenges are the high variability in shape and appearance of objects, noise, artifacts, partial occlusions of objects, and the required reliability and correctness of results.Methods: We consider the general purpose of segmentation, the dimension of images, the object representation within the model image and contour influences, as well as the solution and the parameter selection of the model. Potentials and limits are characterized for all instances in each category providing essential information for the application of active contours to various purposes in medical image processing. Based on prolaps surgery planning, we exemplify the use of the scheme to successfully design robust 3D-segmentation.Results: The construction scheme allows to desi!

Abstract:   Segmentation of anatomical regions of the brain is one of the fundamental problems in medical image analysis. It is traditionally solved by iso-surfacing or through the use of active contours/ deformable models on a gray-scale magnetic resonance imaging (MRI) data. We develop a technique that uses anisotropic diffusion properties of brain tissue available from diffusion tensor (DT)-MRI to segment brain structures. We develop a computational pipeline starting from raw diffusion tensor data through computation of invariant anisotropy measures to construction of geometric models of the brain structures. This provides an environment for user-controlled 3-D segmentation of DT-MRI datasets. We use a level set approach to remove noise from the data and to produce smooth, geometric models. We apply our technique to DT-MRI data of a human subject and build models of the isotropic and strongly anisotropic regions of the brain. Once geometric models have been constructed they can be!

Abstract:   We present a new method, based on curve evolution, for the reconstruction of a 3D curve from two different projections. It is based on the minimization of an energy functional. Following the work on geodesic active contours by Caselles et al. (in Int. Conf. on Pattern Recognition, 1996, Vol. 43, pp. 693-737), we then transform the problem of minimizing the functional into a problem of geodesic computation in a Riemann space. The Euler-Lagrange equation of this new functional is derived and its associated PDE is solved using the level set formulation, giving the existence and uniqueness results. We apply the model to the reconstruction of a vessel from a biplane angiography.

Abstract:   In this paper we review the algorithm development and applications in high resolution shock capturing methods, level set methods, and PDE based methods in computer vision and image processing. The emphasis is on Stanley Osher's contribution in these areas and the impact of his work. We will start with shock capturing methods and will review the Engquist-Osher scheme, TVD schemes, entropy conditions, ENO and WENO schemes, and numerical schemes for Hamilton-Jacobi type equations. Among level set methods we will review level set calculus, numerical techniques, fluids and materials, variational approach, high codimension motion, geometric optics, and the computation of discontinuous solutions to Hamilton-Jacobi equations. Among computer vision and image processing we will review the total variation model for image denoising, images on implicit surfaces, and the level set method in image processing and computer vision. (C) 2003 Elsevier Science B.V. All rights reserved.

Abstract:   In this paper Cellular Neural Networks (CNN) are applied to image segmentation based on active contour techniques. The approach is based on deformable contours which evolve pixel by pixel from their initial shapes and locations until delimiting the objects of interest. The contour shift is guided by external information from the image under consideration which attracts them towards the target characteristics (intensity extremes, edges, etc.) and by internal forces which try to maintain the smoothness of the contour curve. This CNN-based proposal combines the characteristics from implicit and parametric models. As a consequence a high flexibility and control for the evolution dynamics of the snakes are provided, allowing the solution of complex tasks as is the case of the topologic transformations. In addition the proposal is suitable for its implementation as an integrated circuit allowing to take advantages of the massively parallel processing in CNN to reduce processing!

Abstract:   Active contour modeling is a powerful technique for modeling object boundaries. Various methods introduced for this purpose, however, have certain difficulties such as getting stuck in local minima, poor modeling of long concavities, and producing inaccurate results when the initial contour is chosen simple or far from the object boundary. A modified form of time adaptive self-organizing map network with a variable number of neurons is proposed here for active contour modeling which does not show such difficulties and automatically determines the required number of control points. The initial contour for the object boundary can be defined inside, outside, or across the boundary. This contour can be open or closed, may be as simple as desired, and can be placed far from the object boundary. In addition, the boundary may contain long concavities. The proposed algorithm is tested for modeling different objects and shows very good performance. (C) 2002 Elsevier Science B.V. A!

Abstract:   Snakes are active contours that minimize an energy function. In this paper we introduce a new kind of snakes, called growing snakes. These snakes are modeled as a set of particles connected by thin rods. Unlike the traditional snakes, growing snakes are automatically initialized, They start at the position where the gradient magnitude of an image is largest, and start to grow, looking for zones of high gradient magnitude; simultaneously the associated energy function is minimized. Growing snakes can find contours with complex topology, describing holes, occlusions, separate objects and bifurcations. In a post-process the T-junctions are refined looking for the configuration with minimal energy. We also describe a technique that permits one to regularize the field of external forces that act on the Growing Snakes, which allow them to have good performance, even in the case of images with high levels of noise. Finally. we present results in synthetic and real images. (C) 20!

Abstract:   We provide an overview of level set methods, introduced by Osher and Sethian, for computing the solution to fluid-interface problems. These are computational techniques that rely on an implicit formulation of the interface, represented through a time-dependent initial-value partial-differential equation. We discuss the essential ideas behind the techniques, the coupling of these techniques to finite-difference methods for incompressible and compressible flow, and a collection of applications including two-phase flow, ship hydrodynamics, and ink-jet-printhead design.

Abstract:   Image registration is an often encountered problem in various fields including medical imaging, computer vision and image processing. Numerous algorithms for registering image data have been reported in these areas. In this paper, we present a novel curve evolution approach expressed in a level-set framework to achieve image intensity morphing and a simple non-linear PDE for the corresponding coordinate registration. The key features of the intensity morphing model are that (a) it is very fast and (b) existence and uniqueness of the solution for the evolution model are established in a Sobolev space as opposed to using viscosity methods. The salient features of the coordinate registration model are its simplicity and computational efficiency. The intensity morph is easily achieved via evolving level-sets of one image into the level-sets of the other. To explicitly estimate the coordinate transformation between the images, we derive a non-linear PDE-based motion model whic!