- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Computational and Mathematical Methods in Medicine

Volume 2012 (2012), Article ID 918510, 11 pages

http://dx.doi.org/10.1155/2012/918510

## Iterative Methods for Obtaining Energy-Minimizing Parametric Snakes with Applications to Medical Imaging

^{1}Department of Mathematics, Technical University of Cluj-Napoca, George Baritiu Street, no. 25, 400020 Cluj-Napoca, Romania^{2}Department of Ultrasonography, University of Medicine and Pharmacy “Iuliu Haţieganu” Cluj-Napoca, Victor Babeş Street, no. 8, 400079 Cluj-Napoca, Romania^{3}Department of Computer Science, Technical University of Cluj-Napoca, George Baritiu Street, no. 26-28, 400027 Cluj-Napoca, Romania

Received 30 September 2011; Accepted 8 November 2011

Academic Editor: Maria Crisan

Copyright © 2012 Alexandru Ioan Mitrea et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

After a brief survey on the parametric deformable models, we develop an iterative method based on the finite difference schemes in order to obtain energy-minimizing snakes. We estimate the approximation error, the residue, and the truncature error related to the corresponding algorithm, then we discuss its convergence, consistency, and stability. Some aspects regarding the prosthetic sugical methods that implement the above numerical methods are also pointed out.

#### 1. Introduction

The deformable models represent a powerful researched model-based approach to computer-assisted medical image analysis, their applications in this framework including image segmentation, shape representation and motion tracking. The theory of deformable models is an interdisciplinary scientific domain, which has appeared and developed in the last two decades, in strong connection with practical problems of medicine, image processing, and physics. This theory joins methods, results, and techniques of various mathematical fields, physics and mechanics. The mathematical foundation of this theory represents the confluence of Functional Analysis, Approximation Theory, Differential Equations, Differential Geometry, Calculus of Variations, Numerical Analysis, Linear Algebra, and Probability Theory. The ancestors of the deformable models, in classical sense, are considered Fischler and Elschlager, with their spring-loaded templates, [1], together with Widrow [2], with its rubber mask technique [2, 3].

The theory of deformable models, in its modern form, originates from the general theory of continuous multidimensional deformable models in a Lagrangian dynamic of Terzopoulos (1987) [4]. In fact, the deformable curves (2D models) and the deformable surfaces (3D models) gained popularity after their use in computer vision by Kaas et al. [5] and in computer graphics, by Terzopoulos and Fleischer [6] in the mid-1980s. Since then, the deformable models, known also as active contour models or snakes, have been extensively used for many applications both in 2D and 3D.

Two general types of deformable models have been developed: firstly, the parametric or variational models, which originate from the papers of Kaas et al. [5] and are based on the minimization of the energy-functional associated to the model, and secondly, the geometric models, which were introduced independently by Caselles et al. [7] and Malladi et al. [8], and are based on the front propagation theory [9].

A good survey on deformable models and their applications can be found in [10, 11]. Recent contributions on parametric deformable models have appeared in the papers [12, 13]. On the general topic of numerical methods applied in medical imaging, the recent papers [14, 15] must be mentioned.

In this paper, we deal with the deformable parametric models. The basic goal of the theory of parametric deformable models is to determine the energy-minimizing 2D or 3D models, namely, the curves or surfaces which minimize the corresponding energy functional. Two approaches will point out in order to obtain the optimal model. The first approach is based on the Euler-Lagrange-Poisson (ELP) and Euler-Gauss-Ostrogradski (EGO) equations of Calculus of Variations in order to minimize the energy-functional. The second one (the classical approach) consists of using reconstruction methods, such as the interpolation of the sparse data extracted from the image, in order to obtain a representation of the original data. In what follows we develop methods and techniques related to the first approach. Generally, the energy-functional is not convex, so it may have many local minimum. On the other hand, the analytic solution of (ELP) equation has a complicated form or it is inaccessible explicitly. Therefore, a practical and strong approach for finding local minimum of the energy functional is to construct a dynamic system that is governed by the energy functional and allow the system to evolve to the equilibrium state. Dynamic models are valuable for medical image analysis, because most anatomical structures are deformable and continually undergo nonrigid motion “in vivo.” In fact, the user is interested to find a good 2D or 3D contour in a given area. Consequently, a rough prior estimation of the 2D or 3D model is provided, then this initial model undergoes a deformation until reaching a local minimum of the energy functional. This deformation process can be achieved in one of the following ways:(1)in a Hamiltonian-type approach, by performing a strictly decreasing energy path, for example, via dynamic programming methods [16, 17];(2)in a Lagrange-type approach, by applying the mechanical principles of Lagrange [3, 18];(3)by using a friction force, in order to constrain the displacement of the snake [5];(4)by using the (ELP) evolution equation, associated to the initial (ELP) equation [19].

In this paper, we shall adopt the method of the evolution equation. So, a prior estimation of the deformable surface is provided, then it is refined step by step, based on the (EGO) equation and using discretization methods.

The paper outline is as follows. The next section is devoted to present 2D and 3D energy-minimizing models, both in their static and dynamic forms. The method for reducing the 3D problem to a 2D modeling is also pointed out, in order to minimize the computational costs of the numerical methods. The third section contains the main theoretical result of the paper. Based on finite difference schemes of explicit type, we derive an (ELP) algorithm for obtaining an energy-minimizing snake in its approximated form, then we estimate its approximation error and we discuss its consistency, convergence, and stability. The last section deals with the behaviour of prosthetic surgical methods and prosthetic medical materials, based on Software tools, which implement the iterative methods developed in the previous sections.

#### 2. Energy-Minimizing Models

##### 2.1. Energy-Minimizing Snakes (2D Models)

From mathematical point of view, a 2D parametric deformable model (usually known as *snake*) is provided by a family of parametrized smooth curves satisfying given boundary conditions and an associated energy-functional. More exactly, denote by the space of all vectorial functions so that the scalar functions and , are continuous together with their derivatives up to the second-order on the standard interval , that is, ; obviously, we can consider an arbitrary compact interval of the real axis instead of . The family of *admissible deformations* consists of all parametrized curves (snakes):
such that the values , and are given; we adopt the notation .

In order to find the optimal position of the snake, it is necessary to characterize its state, by means of an *energy-functional, *that is associated to the class . Let us consider the following data:(i)the *weight-functions * and , which control the elasticity and the rigidity of , respectively; generally, these are nonnegative scalar functions of class ,(ii)the *image intensity* function , which is a real function of class ,(iii)the *potential* associated to the external forces, represented by a real function , of class . The simplest useful choice for the potential is , where is a weight-scalar. The most used choice is , where is a given scalar and is the Hamilton (nabla) operator; this choice will be used in this paper, too. Note that can be defined also by , that is, the Gaussian (variance ) filtered image of the input image [10], and(iv)the vectorial function of class which control the local dilatation or local contraction of along its normal; usually, we take , with .

The shape of the snake subject to the image is dictated by the *energy functional: *
where the terms of the right hand of (2) are defined as follows.

The *internal energy *
is obtained by adding the *elastic energy *
and the *rigid (bending) energy *

The internal energy characterizes the deformation of a stretchy, flexible snake (contour). The values of and show the extent to which the snake can stretch or bend at an arbitrary point of the snake.

The *external energy, *derived from the image, is given by
and it allows to find the edges in an image so that the snake is attracted to contour with large image gradients.

The *balloon energy *is an energy of constrained-type, defined as
This energy can be added, optionally, by users, in order to expand (or contract) the snake.

Denoting by the following expression of energy-functional is obtained from (2)–(8):

By definition, the triple is said to be a *deformable 2D model (snake). *

The basic goal of a deformable parametric model is to minimize its energy-functional , which leads to the energy-minimizing snake. The minimization of the snake energy gives rise to the following vectorial Euler-Lagrange-Poisson (ELP) Equation of Calculus of Variations: Now, taking into account the relations (8) and (10), we obtain the vectorial (ELP) equation: where , , and is the trace of a square matrix .

The scalar (ELP) equations, derived from (11), have the form: On the other hand, we infer from(8) which leads to According to the Legendre conditions and the hypothesis , the relation (14) proves that any solution of the (ELP) equations (11) or (12) provides a minimum for the energy-functional , namely, an energy-minimizing snake.

*Example 1. *If we choose in (12) , , and the boundary conditions , we obtain the general solution of the (ELP) equation:
Using boundary conditions, we obtain the graph of the curve in Figure 1.

*Example 2. *If we choose in (12) , , , , , and the boundary conditions , , , , then the (ELP) equations have the form:
with the analytical solutions:
The graph of the curve is given in Figure 2.

##### 2.2. Deformable Dynamic 2D Models

Roughly speaking, the differential fourth-order vectorial equation (11) or the differential eight-order system (12) may have many solutions, which leads to many possible energy-minimizing snakes. As we have seen in the preceding examples (Section 2.1), these solutions have a complicated form; moreover, they are often inaccessible explicitly. In order to eliminate these drawbacks, we point out in this section, two approaches which lead to a practical and more simple solution of the (ELP) equation.

###### 2.2.1. The Method of Evolution Equation [19]

Denote by
an initial estimate of the optimal snake and let consider a family of curves (contours)
where the parameter describes the evolution in time of the snake and is the standard parameter of the curve. The *evolution equation* associated to the dynamic model is
together with the initial condition:
and the boundary conditions
A solution of the *static* problem described by (ELP) equation (11) is achieved when the solution becomes stable with respect to the time parameter, that is, , uniformly with respect to the parameter ; in this case, the evolution equation (20) provides a solution of the *static* problem (11). According to [20], we note that this approach of making the time derivative term vanish is equivalent to applying a gradient descent algorithm to find the local minimum of the energy functional .

###### 2.2.2. The Method of the Lagrange Dynamics [3, 18]

A dynamic snake is represented by introducing a time-varying contour see (19), with a mass density and a damping density . The Lagrange equation for a snake defined in Section 2.1 is

The first two terms in the left hand side of (24) represent the inertial and damping forces, while the remaining terms, see also (11), represent the internal stretching force (the term containing ), the bending (rigidity) force (the term containing ), the external force and the *balloon*-type force (the last two terms). Equilibrium is achieved when these forces balance and the contour comes to rest, that is,
which leads to the equilibrium condition (11).

##### 2.3. Deformable Surfaces (3D Models)

In this section we define briefly the notion of deformable 3D model (deformable surface), both in the static and dynamic forms, and we describe a method for reducing the problem of its optimization to a 2D modelling problem.

###### 2.3.1. Energy-Minimizing Surfaces

From mathematical point of view, a 3D variational deformable model is emphasized by a family of parameterized smooth surfaces with given boundary conditions, named *admissible surfaces*, and an associated *energy functional*.

Denoting by the unit square of , let us consider a surface of vectorial equation:
where , ; in this subsection we set , , , , . Given the functions and , where is the boundary of , let be the set of *admissible deformations*, which consists of all functions satisfying the boundary conditions and on , where is the normal vector with respect to the surface defined by (26). Further, let us consider the following functions: *the image intensity function *; *the potential function associated* to the external forces , ; *the control functions* corresponding to the internal forces acting on the shape of the surface, namely, the elasticity functions and ; the *rigidity functions * and , and *the twist resistance function *. The energy functional , associated to these data, is defined as follows:
where
We notice that represents the sum of *the internal energy* (the terms of (27) excepting ), *the external energy* (defined by the term containing ) and *the balloon energy*, which is added, optionally, by the users (the term including ).

The triple is said to be a *3D deformable model*, sometimes a *deformable surface*. The basic problem of the deformable model is to minimize its energy functional, namely, to obtain the optimal deformable surface. To this purpose, the Euler-Gauss-Ostrogradski (EGO) equation of Calculus of Variations, that is,
is used.

By simple calculation, we obtain from (28) and (29):

###### 2.3.2. Deformable Dynamic 3D Models

Similarly to the 2D model, we can suppose that a rough prior estimate of surface is accessible, namely,
Further, this surface is refined step by step, according to (EGO) equation; so, a sequence of surfaces, which leads to the energy-minimizing surface, is provided. More exactly, let
be a family of surfaces, where the parameter describes the evolution in time of the model. We associate to the previous static model the *evolution equation *
where is the left hand member of (30), together with the* initial estimate (condition) *
and the boundary dynamic conditions
A solution of the “static” problem described by (30) is achieved, when the solution becomes stable with respect to the time parameter, that is, , uniformly, with respect to ; in this case, the evolution equation (33) provides a solution of the static problem (30).

###### 2.3.3. The Simplified 2D Model

The problem of finding directly energy-minimizing surfaces, that is, solutions of the p.d.e. (30), is not practically possible because these solutions contain long and complicated expressions or their explicit form is inaccessible. On the other hand, by using discretized schemes for solving (33), we get a system of algebraic equations with a high computational level. These drawbacks are eliminated by passing to a 2D modeling problem, [19]. More exactly, the third component of is constrained to depend only on , by setting . So, the surface that we seek is given as a sequence of plane curves, named *slices*, and the parameter of (26) becomes the index of the corresponding slice. In this approach, the surface that we seek is viewed as a sequence of the planar curves (slices), indexed by the parameter , so that each fixed value of provides a closed curve, lying in a slice of the 3D-image. Consequently, let
be the 2D curve obtained by applying this reconstruction method, for a given .

Under the hypothesis that are positive constants, the (EGO) equation (29), which corresponds to , is where .

If we consider in (37) , , and with boundary conditions , , , , we obtain the graphs of the slices and a 3D reconstruction of the surface, as we can see in Figures 3(a) and 3(b).

In what follows we shall restrict to the study of 2D deformable models.

#### 3. An ELP-Algorithm for Obtaining Energy-Minimizing Snakes

In this section we suppose that the following hypotheses are satisfied: the control functions and are positive constants, the curves of the family given by (18) and (19) are closed for every and , . Thus, the (ELP) evolution equation (20) becomes In order to solve numerically the partial differential equation (38), we focus on the method of finite differences, which is widely used in image processing [21]. Let and be the time and the space discretization steps, respectively, and denote by the plane net of discretization, with , , , and . The following notations will be used, too: , , , with , ; obviously, , , because ,, is a closed curve. Also, we set

##### 3.1. Explicit Finite Difference Scheme

We approximate the partial derivatives involved in the (ELP) evolution equation (38) as follows:
By replacing the relations (40) in the partial differential equation (38), it result a system of algebraic equations; denoting by the solutions of this system (which approximate the exact values of (38) at the nodes of ), we get the vectorial formula:
where
and are given by (39). The scalar equations corresponding to (41) are the following:
Now, let be the *stiffness matrix* associated to the explicit finite difference scheme, defined as the circular matrix of order , whose first row is
where
Denote by the circular (square) matrix of order defined by the first row and let be the identity matrix of order . The relations (41) and (43) can be written in a matricial form as:
respectively.

In what follows, the formulas (41)–(47) will be referred as *(ELP) algorithm* for obtaining an energy minimizing snake (in its approximating form).

##### 3.2. The Residue of (ELP) algorithm

Taking into account the relation (41), the residue associated to the (ELP) algorithm is By using Taylor expansions at the point we obtain where the partial derivatives and , are computed at the point .

By replacing the expansions (49) in the residue’s formula (48) and using the relations (39), we derive If the partial derivatives of the vectorial function are uniformly bounded on , the relations (50) give the following estimate concerning the residue of (ELP) algorithm: Notice that the condition means that there are not existing constrains defined by the users.

##### 3.3. The Consistency of the ELP algorithm

Let be *the truncature error *of (ELP) algorithm at the th iteration. Under the assumption of uniform boundedness of the partial derivatives of the vectorial function , it follows from (51):
The relations (52) characterize the accuracy of the discretized scheme providing the (ELP)-Algorithm.

On the other hand, the equality which results from (52), shows that this discretized scheme is consistent.

##### 3.4. Approximation Error and the Convergence

Let us consider the approximation-error at the point , namely
By replacing from (54) into (41) and taking into account the expressions (49) and the definition (48) of , we get
Let
be the *approximation error* of (ELP) algorithm at th iteration.

The relations (55) and (56) yield: On the other hand, it follows from (50): where , are positive constants, which do not depend on and .

Now, the relations (57) and (58), combined with the classic inequality provide the estimate: with Denote by and let us assume that the inequality holds. It is a simple exercise to show that the relation (63) entails the inequality for sufficiently large. Now, the relations (60) and (64) lead to: where Writing (65) successively for , , we get Taking into account that (for sufficiently large), the relations (66) and (39) imply , so that the relations (67) and (63), combined with the inequality , , yield Finally, we derive from (61), (62), and (68): It follows from (69) that if ; it is easily seen that, according to the relations (62) and (63), the hypothesis implies ; consequently the following result holds.

*If the inequality (63) fulfills, then the (ELP) algorithm (46) is convergent and its approximation error at the **th iteration is given by the relation (69).*

##### 3.5. The Stability

The intuitive idea regarding the stability is that small errors in the initial conditions of a partial differential equation should cause small errors in its solution. In fact, the study of the stability is useful in connection with the theorem of Lax concerning the convergence of the discretized schemes, [21].

The aim of this subsection is to examine the stability of the (ELP) algorithm (46), with . By omitting the small terms of (55), we get the relation:
To apply the *stability criterion of von Neumann*, [22] we set
where and are complex numbers, and denotes the frequency.

Now, we obtain from (70), (71), and (72):
We choose and let . The trigonometric formulas , , and , together with (73) give:
On the other hand, according to the relation , it is easy to see that the error of (72) does not increase in time if , so that we infer from (74):
which represent precisely the *stability criterion of von Neumann* for the (ELP) algorithm (46).

A combination of the relations (39), (62), (71), and (75) provides the following equivalent form of the stability condition of von Neumann:

#### 4. Monitoring the Behavior of Prosthetic Surgical Methods and Prosthetic Medical Materials Based on Software Implementation

In order to apply the results of the theoretical researches detailed above in the medical imaging domain, a 3D visual software environment—named MoDef—was implemented, aiming to visualize and follow up the deformation behavior of the surgical (abdominal, maxilla-facial, and orthodontic) prosthetic materials. That is performed on three distinct, but convergent, levels, as follows:(a)3D reconstruction visual software component, aimed to tracks the evolution of the prosthetic materials, based on processing the US images of the anatomic context of a lot of surgical patients;(b)deformable prosthetic material’s behavior forecasting software component, based on software tools which implements the above described mathematical methods;(c)quad comparative parallel tracking software component, aimed to simultaneous supervise in time both (a) and (b) levels, in comparison with the results provided by the stochastic analysis component of the 3D visual software environment MoDef.

Concerning the 3D visualizing of the prosthetic meshes by means of the MoDef software environment components, two levels of reconstruction are performed, namely(1)on the first level, a polynomial interpolation method is applied on each slice of the US image of the prosthetic mesh, acquired based on succeeding positions of the transducer, obtained by rotating them with a constant angle in a same preestablished direction; more exactly, the curves representing the sections of the surgical mesh acquired by the transducer are extracted from the context of the US image, based on specific image processing methods, namely, contour detection methods, that are implemented at the level of the image processing operators of the MoDef environment’s image processing library. Starting with this set of basic mesh surface definition curves, extracted from the US images acquired at pre-established moments in time, a complete and consistent collection of 3D generator curve sets is obtained, by means of 3D polynomial interpolation methods, based on Lagrange, Hermite or Birkhoff operators;(2)on the second level, the complete collection of the 3D generator curves obtained at the first level is processed based on Blended Interpolating Methods (BIM), as well as with 3D continuous representation techniques, in order to obtain “solid-view,” respectively, “wired-view” representations of the prosthetic mesh.

In what follows, some preliminary experiments made in 3DS Max7, followed by some relevant results obtained with the 3D reconstruction component of MoDef 3D Visual environment are presented in Figures 4 and 5.

#### 5. Conclusions

In this paper we considered parametric (variational) deformable models and we developed an iterative method based on finite difference schemes in order to solve numerically the (ELP) equation of Calculus of Variations, which provides the energy minimizing snake. We derived estimates concerning the approximation error related to the corresponding (ELP) algorithm and we established conditions for its convergence and stability. Some considerations about the implementation of the above numerical methods where presented, too. As future targets, we intend to consider probabilistic models which offer an alternative approach by using the Bayes technique, as well as geometric deformable models which provide an efficient alternative to address some limitation of parametric deformable models.

#### References

- M. Fischler and R. A. Elschlager, “The representation and matching of pictorial structures,”
*IEEE Transactions on Computers*, vol. C-22, no. 1, pp. 67–92, 1973. View at Scopus - B. Widrow, “The rubber mask technique, part I,”
*Pattern Recognition*, vol. 5, no. 3, pp. 175–211, 1973. View at Scopus - T. McInerney and D. Terzopoulos, “Deformable models in medical image analysis: a survey,”
*Medical Image Analysis*, vol. 1, no. 2, pp. 91–108, 1996. View at Scopus - D. Terzopoulos, “On matching deformable models to images,” Tech. Rep. 60, Schlumberger Palo Alto Research, 1986, Reprinted in Topical Meeting on Machine Vision, Technical Digest Series, vol. 12, pp.160–167, Optical Society of America, Washington, DC, USA, 1987.
- M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: active contour models,”
*International Journal of Computer Vision*, vol. 1, no. 4, pp. 321–331, 1988. View at Publisher · View at Google Scholar · View at Scopus - D. Terzopoulos and K. Fleischer, “Deformable models,”
*The Visual Computer*, vol. 4, no. 6, pp. 306–331, 1988. View at Publisher · View at Google Scholar · View at Scopus - V. Caselles, F. Catté, T. Coll, and F. Dibos, “A geometric model for active contours in image processing,”
*Numerische Mathematik*, vol. 66, no. 1, pp. 1–31, 1993. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus - R. Malladi, J. A. Sethian, and B. C. Vemuri, “Shape modeling with front propagation: a level set approach,”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 17, no. 2, pp. 158–175, 1995. View at Publisher · View at Google Scholar · View at Scopus - S. Osher and J. A. Sethian, “Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations,”
*Journal of Computational Physics*, vol. 79, no. 1, pp. 12–49, 1988. View at Scopus - L. He, Z. Peng, B. Everding et al., “A comparative study of deformable contour methods on medical image segmentation,”
*Image and Vision Computing*, vol. 26, no. 2, pp. 141–163, 2008. View at Publisher · View at Google Scholar · View at Scopus - R. Hegadi, A. Kop, and A. Hangarge, “A survey on deformable model and its applications to medical imaging,” in
*IJCA Special Issue on Recent Trends in Image Processing and Pattern Recognition*, pp. 64–75, 2010. - S. Y. Chen and Q. Guan, “Parametric shape representation by a deformable NURBS model for cardiac functional measurements,”
*IEEE Transactions on Biomedical Engineering*, vol. 58, no. 3 PART 1, pp. 480–487, 2011. View at Publisher · View at Google Scholar · View at PubMed - S. Y. Chen, J. Zhang, Q. Guan, and S. Liu, “Detection and amendment of shape distortions based on moment invariants for active shape models,”
*IET Image Processing*, vol. 5, no. 3, pp. 273–285, 2011. View at Publisher · View at Google Scholar - S. Chen, Y. Zheng, C. Cattani, and W. Wang, “Modeling of biological intelligence for SCM system optimization,”
*Computational and Mathematical Methods in Medicine*, vol. 2012, Article ID 769702, 2012. View at Publisher · View at Google Scholar · View at PubMed - S. Y. Chen, M. Zhao, G. Wu, and C. Yao, “Recent advances in morphological cell image analysis,”
*Computational and Mathematical Methods in Medicine*, vol. 2012, Article ID 101536, 2012. View at Publisher · View at Google Scholar · View at PubMed - A. A. Amini, T. E. Weymouth, and R. C. Jain, “Using dynamic programming for solving variational problems in vision,”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 12, no. 9, pp. 855–867, 1990. View at Publisher · View at Google Scholar · View at Scopus - S. Nedevschi and D. Mitrea, “Contour detection based on active contour models,”
*Bulletin of Applied Mathematics and Computer Science*, vol. 2275, pp. 107–118, 2003. - N. Rougon and F. Prêteux, “Directional adaptive deformable models for segmentation,”
*Journal of Electronic Imaging*, vol. 7, no. 1, pp. 231–256, 1998. View at Scopus - L. D. Cohen and I. Cohen, “Finite-element methods for active contour models and balloons for 2-D and 3-D images,”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 15, no. 11, pp. 1131–1147, 1993. View at Publisher · View at Google Scholar · View at Scopus - I. Cohen, L. D. Cohen, and N. Ayache, “Using deformable surfaces to segment 3-D images and infer differential structures,”
*CVGIP: Image Understanding*, vol. 56, no. 2, pp. 242–263, 1992. View at Scopus - G. Aubert and P. Kornprobst,
*Mathematical Problems in Image Processing, Partial Differential Equations and Calculus of Variations*, Springer, 2002. - R. Richtmeyer and K. Morton,
*Difference Methods for Initial Value Problems*, Wiley, New York, NY, USA, 1971.