Parametric Active Contour Research Articles

Boundary vector field for parametric active contours

Snakes are widely used in the fields of computer vision and image processing. There are a number of shortcomings of the traditional snakes, including the capture range problem and the concave object extraction problem. Gradient vector flow snake enhances the concave object extraction capability. However, it suffers from high computational requirement. In this paper, we present a new external force which is generated by a novel interpolation scheme which reduces the computational requirement significantly, and at the same time, improves the capture range and concave object extraction capability.

A Parametric Active Contour Model for Medical Image Segmentation Using Priori Shape Force Field

A Parametric Active Contour Model for Medical Image Segmentation Using Priori Shape Force Field

3-D shape estimation of DNA molecules from stereo cryo-electron micro-graphs using a projection-steerable snake

We introduce a three-dimensional (3-D) parametric active contour algorithm for the shape estimation of DNA molecules from stereo cryo-electron micrographs. We estimate the shape by matching the projections of a 3-D global shape model with the micrographs; we choose the global model as a 3-D filament with a B-spline skeleton and a specified radial profile. The active contour algorithm iteratively updates the B-spline coefficients, which requires us to evaluate the projections and match them with the micrographs at every iteration. Since the evaluation of the projections of the global model is computationally expensive, we propose a fast algorithm based on locally approximating it by elongated blob-like templates. We introduce the concept of projection-steerability and derive a projection-steerable elongated template. Since the two-dimensional projections of such a blob at any 3-D orientation can be expressed as a linear combination of a few basis functions, matching the projections of such a 3-D template involves evaluating a weighted sum of inner products between the basis functions and the micrographs. The weights are simple functions of the 3-D orientation and the inner-products are evaluated efficiently by separable filtering. We choose an internal energy term that penalizes the average curvature magnitude. Since the exact length of the DNA molecule is known a priori, we introduce a constraint energy term that forces the curve to have this specified length. The sum of these energies along with the image energy derived from the matching process is minimized using the conjugate gradients algorithm. We validate the algorithm using real, as well as simulated, data and show that it performs well.

Coupled parametric active contours

We propose an extension of parametric active contours designed to track nonoccluding objects transiently touching each other, a task where both parametric and single level set-based methods usually fail. Our technique minimizes a cost functional that depends on all contours simultaneously and includes a penalty for contour overlaps. This scheme allows us to take advantage of known constraints on object topology, namely, that objects cannot merge. The coupled contours preserve the identity of previously isolated objects during and after a contact event, thus allowing segmentation and tracking to proceed as desired.

Robust real-time segmentation of images and videos using a smooth-spline snake-based algorithm

This paper deals with fast image and video segmentation using active contours. Region-based active contours using level sets are powerful techniques for video segmentation, but they suffer from large computational cost. A parametric active contour method based on B-Spline interpolation has been proposed in to highly reduce the computational cost, but this method is sensitive to noise. Here, we choose to relax the rigid interpolation constraint in order to robustify our method in the presence of noise: by using smoothing splines, we trade a tunable amount of interpolation error for a smoother spline curve. We show by experiments on natural sequences that this new flexibility yields segmentation results of higher quality at no additional computational cost. Hence, real-time processing for moving objects segmentation is preserved.

Universality in the merging dynamics of parametric active contours: a study in MRI based lung segmentation

Measurement of lung ventilation is one of the most reliable techniques in diagnosing pulmonary diseases. The time-consuming and bias-prone traditional methods using hyperpolarized H3He and 1H magnetic resonance imageries have recently been improved by an automated technique based on ‘multiple active contour evolution’. This method involves a simultaneous evolution of multiple initial conditions, called ‘snakes’, eventually leading to their ‘merging’ and is entirely independent of the shapes and sizes of snakes or other parametric details. The objective of this paper is to show, through a theoretical analysis, that the functional dynamics of merging as depicted in the active contour method has a direct analogue in statistical physics and this explains its ‘universality’. We show that the multiple active contour method has an universal scaling behaviour akin to that of classical nucleation in two spatial dimensions. We prove our point by comparing the numerically evaluated exponents with an equivalent thermodynamic model.

Force field analysis snake: an improved parametric active contour model

An improved parametric active contour model, FFA snake, is presented in this paper. Based on analyzing the force distribution in the distance potential force field, it is found that there are two types of contour points in the curve. The points in one type are called true contour points and can be classified into six sorts, and the points in the other type are called false contour points. When the energy of the contour is approaching the minimum, the contour is not considered as the final one, and the algorithm must be executed continuously until all points in the curve are judged to be one of the six sorts of the true contour points. Simulation results show that there are three advantages of this model, firstly, it has a large capture range, so it is insensitive to the initialization; secondly, it can move parts of the snake into boundary concavities; finally, it has a low computational cost.

Pixel‐level snakes on the CNNUM: algorithm design, on‐chip implementation and applications

AbstractIn this paper, a new algorithm for the cellular active contour technique called pixel‐level snakes is proposed. The motivation is twofold: on the one hand, a higher efficiency and flexibility in the contour evolution towards the boundaries of interest are pursued. On the other hand, a higher performance and suitability for its hardware implementation onto a cellular neural network (CNN) chip‐set architecture are also required. Based on the analysis of previous schemes the contour evolution is improved and a new approach to manage the topological transformations is incorporated. Furthermore, new capabilities in the contour guiding are introduced by the incorporation of inflating/deflating terms based on the balloon forces for the parametric active contours. The entire algorithm has been implemented on a CNN universal machine (CNNUM) chip set architecture for which the results of the time performance measurements are also given. To illustrate the validity and efficiency of the new scheme several examples are discussed including real applications from medical imaging. Copyright © 2005 John Wiley & Sons, Ltd.

Segmentation of the prostate from suprapubic ultrasound images

We present a technique for semiautomated segmentation of human prostates using suprapubic ultrasound (US) images. In this approach, a speckle reducing anisotropic diffusion (SRAD) is applied to enhance the images and the instantaneous coefficient of variation (ICOV) is utilized for edge detection. Segmentation is accomplished via a parametric active contour model in a polar coordinate system that is tailored to the application. The algorithm initially approximates the prostate boundary in two stages. First a primary contour is detected using an elliptical model, followed by a primary contour optimization using an area-weighted mean-difference binary flow geometric snake model. The algorithm was assessed by comparing the computer-derived contours with contours produced manually by three sonographers. The proposed method has application in radiation therapy planning and delivery, as well as in automated volume measurements for ultrasonic diagnosis. The average root mean square discrepancy between computed and manual outlines is less than the inter-observer variability. Furthermore, 76% of the computer-outlined contour is less than 1 sigma manual outline variance away from "true" boundary of prostate. We conclude that the methods developed herein possess acceptable agreement with manually contoured prostate boundaries and that they are potentially valuable tools for radiotherapy treatment planning and verification.

Generating discriminating cartoon faces using interacting snakes

As a computational bridge between the high-level a priori knowledge of object shape and the low-level image data, active contours (or snakes) are useful models for the extraction of deformable objects. We propose an approach for manipulating multiple snakes iteratively, called interacting snakes, that minimizes the attraction energy functionals on both contours and enclosed regions of individual snakes and the repulsion energy functionals among multiple snakes that interact with each other. We implement the interacting snakes through explicit curve (parametric active contours) representation in the domain of face recognition. We represent human faces semantically via facial components such as eyes, mouth, face outline, and the hair outline. Each facial component is encoded by a closed (or open) snake that is drawn from a 3D generic face model. A collection of semantic facial components form a hypergraph, called semantic face graph, which employs interacting snakes to align the general facial topology onto the sensed face images. Experimental results show that a successful interaction among multiple snakes associated with facial components makes the semantic face graph a useful model for face representation, including cartoon faces and caricatures, and recognition.

Shape and Topology Constraints on Parametric Active Contours

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 contours. The efficiency of these algorithms is demonstrated on several images including medical images and a comparison with the level-sets method is also provided.