Active contour model - Alchetron, The Free Social Encyclopedia

Active contour model, also called snakes, is a framework in computer vision for delineating an object outline from a possibly noisy 2D image. The snakes model is popular in computer vision, and snakes are greatly used in applications like object tracking, shape recognition, segmentation, edge detection and stereo matching.

A snake is an energy minimizing, deformable spline influenced by constraint and image forces that pull it towards object contours and internal forces that resist deformation. Snakes may be understood as a special case of the general technique of matching a deformable model to an image by means of energy minimization. In two dimensions, the active shape model represents a discrete version of this approach, taking advantage of the point distribution model to restrict the shape range to an explicit domain learned from a training set.

Snakes do not solve the entire problem of finding contours in images, since the method requires knowledge of the desired contour shape beforehand. Rather, they depend on other mechanisms such as interaction with a user, interaction with some higher level image understanding process, or information from image data adjacent in time or space.

Motivation

In computer vision, contour models describe the boundaries of shapes in an image. Snakes in particular are designed to solve problems where the approximate shape of the boundary is known. By being a deformable model, snakes can adapt to differences and noise in stereo matching and motion tracking. Additionally, the method can find Illusory contours in the image by ignoring missing boundary information.

Compared to classical feature extraction techniques, snakes have multiple advantages:

They autonomously and adaptively search for the minimum state.

External image forces act upon the snake in an intuitive manner.

Incorporating Gaussian smoothing in the image energy function introduces scale sensitivity.

They can be used to track dynamic objects.

The key drawbacks of the traditional snakes are

They are sensitive to local minima states, which can be counteracted by simulated annealing techniques.

Minute features are often ignored during energy minimization over the entire contour.

Their accuracy depends on the convergence policy.

Energy formulation

A simple elastic snake is defined by a set of n points v i where i = 0 … n − 1 , the internal elastic energy term E i n t e r n a l , and the external edge-based energy term E e x t e r n a l . The purpose of the internal energy term is to control the deformations made to the snake, and the purpose of the external energy term is to control the fitting of the contour onto the image. The external energy is usually a combination of the forces due to the image itself E i m a g e and the constraint forces introduced by the user E c o n

The energy function of the snake is the sum of its external energy and internal energy, or

E s n a k e ∗ = ∫ 0 1 E s n a k e ( v ( s ) ) d s = ∫ 0 1 ( E i n t e r n a l ( v ( s ) ) + E i m a g e ( v ( s ) ) + E c o n ( v ( s ) ) ) d s

Internal energy

The internal energy of the snake is composed of the continuity of the contour E c o n t and the smoothness of the contour E c u r v .

E i n t e r n a l = E c o n t + E c u r v

This can be expanded as

E i n t e r n a l = 1 2 ( α ( s ) | v s ( s ) | 2 ) + 1 2 ( β ( s ) | v s s ( s ) | 2 ) = 1 2 ( α ( s ) ∥ d v ¯ d s ( s ) ∥ 2 + β ( s ) ∥ d 2 v ¯ d s 2 ( s ) ∥ 2 )

Where α ( s ) and β ( s ) are user-defined weights; these control the internal energy function's sensitivity to the amount of stretch in the snake and the amount of curvature in the snake, respectively, and thereby control the number of constraints on the shape of the snake.

In practice, a large weight α ( s ) for the continuity term penalizes changes in distances between points in the contour. A large weight β ( s ) for the smoothness term penalizes oscillations in the contour and will cause the contour to act as a thin plate.

Image energy

Energy in the image is some function of the features of the image. This is one of the most common points of modification in derivative methods. Features in images and images themselves can be processed in many and various ways.

For an image I ( x , y ) , lines, edges, and terminations present in the image, the general formulation of energy due to the image is

E i m a g e = w l i n e E l i n e + w e d g e E e d g e + w t e r m E t e r m ,

where w l i n e , w e d g e , w t e r m are weights of these salient features. Higher weights indicate that the salient feature will have a larger contribution to the image force.

Line functional

The line functional is the intensity of the image, which can be represented as

E l i n e = I ( x , y )

The sign of w l i n e will determine whether the line will be attracted to either dark lines or light lines.

Some smoothing or noise reduction may be used on the image, which then the line functional appears as

E l i n e = f i l t e r ( I ( x , y ) )

Edge functional

The edge functional is based on the image gradient. One implementation of this is

E e d g e = − | ∇ I ( x , y ) | 2

A snake originating far from the desired object contour may erroneously converge to some local minimum. Scale space continuation can be used in order to avoid these local minima. This is achieved by using a blur filter on the image and reducing the amount of blur as the calculation progresses to refine the fit of the snake. The energy functional using scale space continuation is

E e d g e = − | G σ ∗ ∇ 2 I | 2

where G σ is a Gaussian with standard deviation σ . Minima of this function fall on the zero-crossings of G σ ∇ 2 I which define edges as per Marr–Hildreth theory.

Termination functional

Curvature of level lines in a slightly smoothed image can be used to detect corners and terminations in an image. Using this method, let C ( x , y ) be the image smoothed by

C ( x , y ) = G σ ∗ I ( x , y )

with gradient angle

θ = arctan ⁡ ( C y C x ) ,

unit vectors along the gradient direction

n = ( cos ⁡ θ , sin ⁡ θ ) ,

and unit vectors perpendicular to the gradient direction

n ⊥ = ( − sin ⁡ θ , cos ⁡ θ ) .

The termination functional of energy can be represented as

E t e r m = ∂ θ ∂ n ⊥ = ∂ 2 C / ∂ 2 n ⊥ ∂ C / ∂ n = C y y C x 2 − 2 C x y C x C y + C x x C y 2 ( 1 + C x 2 + C y 2 ) 3 / 2

Constraint energy

Some systems, including the original snakes implementation, allowed for user interaction to guide the snakes, not only in initial placement but also in their energy terms. Such constraint energy E c o n can be used to interactively guide the snakes towards or away from particular features.

Optimization through gradient descent

Given an initial guess for a snake, the energy function of the snake is iteratively minimized. Gradient descent minimization is one of the simplest optimizations which can be used to minimize snake energy. Each iteration takes one step in the negative gradient of the point with controlled step size γ to find local minima. This gradient-descent minimization can be implemented as

v ¯ i ← v ¯ i + F s n a k e ( v ¯ i )

Where F s n a k e ( v ¯ i ) is the force on the snake, which is defined by the negative of the gradient of the energy field.

F s n a k e ( v ¯ i ) = − ∇ E s n a k e ( v ¯ i ) = − ( w i n t e r n a l ∇ E i n t e r n a l ( v ¯ i ) + w e x t e r n a l ∇ E e x t e r n a l ( v ¯ i ) )

Assuming the weights α ( s ) and β ( s ) are constant with respect to s , this iterative method can be simplified to

v ¯ i =← v ¯ i − γ { w i n t e r n a l [ α ∂ 2 v ¯ ∂ s 2 ( v ¯ i ) + β ∂ 4 v ¯ ∂ s 4 ( v ¯ i ) ] + ∇ E e x t ( v ¯ i ) }

Discrete approximation

In practice, images have finite resolution and can only be integrated over finite time steps τ . As such, discrete approximations must be made for practical implementation of snakes.

The energy function of the snake can be approximated by using the discrete points on the snake.

E s n a k e ∗ ≈ ∑ 1 n E s n a k e ( v ¯ i )

Consequentially, the forces of the snake can be approximated as

F s n a k e ∗ ≈ − ∑ 1 n ∇ E s n a k e ( v ¯ i )

Gradient approximation can be done through any finite approximation method with respect to s, such as Finite difference.

Numerical instability due to discrete time

The introduction of discrete time into the algorithm can introduce updates which the snake is moved past the minima it is attracted to; this further can cause oscillations around the minima or lead to a different minima being found.

This can be avoided through tuning the time step such that the step size is never greater than a pixel due to the image forces. However, in regions of low energy, the internal energies will dominate the update.

Alternatively, the image forces can be normalized for each step such that the image forces only update the snake by one pixel. This can be formulated as

F i m a g e = − k ∇ E i m a g e ∥ ∇ E i m a g e ∥

where τ k is near the value of the pixel size. This avoids the problem of dominating internal energies that arise from tuning the time step.

Numerical instability due to discrete space

The energies in a continuous image may have zero-crossing that do not exist as a pixel in the image. In this case, a point in the snake would oscillate between the two pixels that neighbor this zero-crossing. This oscillation can be avoided by using interpolation between pixels instead of nearest neighbor.

Implementation

The following pseudocode implements the snakes method in a general form

Where generateImageEnergy (I) can be written as

Some variants of snakes

The default method of snakes has various limitation and corner cases where the convergence performs poorly. Several alternatives exist which addresses issues of the default method, though with their own trade-offs. A few are listed here.

GVF snake model

The gradient vector flow (GVF) snake model addresses two issues with snakes:

poor convergence performance for concave boundaries

poor convergence performance when snake is initialized far from minimum

In 2D, the GVF vector field F G V F minimizes the energy functional

E G V F = ∫ ∫ μ ( u x 2 + u y 2 + v x 2 + v y 2 ) + | ∇ f | 2 | v − ∇ f | 2 d x d y

where μ is a controllable smoothing term. This can be solved by solving the Euler equations

μ ∇ 2 u − ( u − ∂ ∂ x F e x t ) ( ∂ ∂ x F e x t ( x , y ) 2 + ∂ ∂ y F e x t ( x , y ) 2 ) = 0 μ ∇ 2 v − ( v − ∂ ∂ y F e x t ) ( ∂ ∂ x F e x t ( x , y ) 2 + ∂ ∂ y F e x t ( x , y ) 2 ) = 0

This can be solved through iteration towards a steady-state value.

u i + 1 = u i + μ ∇ 2 u i − ( u i − ∂ ∂ x F e x t ) ( ∂ ∂ x F e x t ( x , y ) 2 + ∂ ∂ y F e x t ( x , y ) 2 ) v i + 1 = v i + μ ∇ 2 v i − ( v i − ∂ ∂ y F e x t ) ( ∂ ∂ x F e x t ( x , y ) 2 + ∂ ∂ y F e x t ( x , y ) 2 )

This result replaces the default external force.

F e x t ∗ = F G V F

The primary issue with using GVF is the smoothing term μ causes rounding of the edges of the contour. Reducing the value of μ reduces the rounding but weakens the amount of smoothing.

The balloon model

The balloon model addresses these problems with the default active contour model:

The snake is not attracted to distant edges.

The snake will shrink inwards if no substantial images forces are acting upon it.

a snake larger than the minima contour will eventually shrink into it, but a snake smaller than the minima contour will not find the minima and instead continue to shrink.

The balloon model introduces an inflation term into the forces acting on the snake

F i n f l a t i o n = k 1 n → ( s )

where n → ( s ) is the normal unitary vector of the curve at v ( s ) and k 1 is the magnitude of the force. k 1 should have the same magnitude as the image normalization factor k and be smaller in value than k to allow forces at image edges to overcome the inflation force.

Three issues arise from using the balloon model:

Instead of shrinking, the snake expands into the minima and will not find minima contours smaller than it.

The outward force causes the contour to be slightly larger than the actual minima. This can be solved by decreasing the balloon force after a stable solution has been found.

The inflation force can overpower forces from weak edges, amplifying the issue with snakes ignoring weaker features in an image.

Diffusion snakes model

The diffusion snake model addresses the sensitivity of snakes to noise, clutter, and occlusion. It implements a modification of the Mumford–Shah functional and its cartoon limit and incorporates statistical shape knowledge. The default image energy functional E i m a g e is replaced with

E i m a g e ∗ = E i + α E c

where E i is based on a modified Mumford–Shah functional

E [ J , B ] = 1 2 ∫ D ( I ( x → ) − J ( x → ) ) 2 d x → + λ 1 2 ∫ D / B ∇ → J ( x → ) ⋅ ∇ → J ( x → ) d x → + ν ∫ 0 1 ( d d s B ( s ) ) 2 d s

where J ( x → ) is the piecewise smooth model of the image I ( x → ) of domain D . Boundaries B ( s ) are defined as

B ( s ) = ∑ n = 1 N p → n B n ( s )

where B n ( s ) are quadratic B-spline basis functions and p → n are the control points of the splines. The modified cartoon limit is obtained as λ → ∞ and is a valid configuration of E i .

The functional E c is based on training from binary images of various contours and is controlled in strength by the parameter α . For a Gaussian distribution of control point vectors z → with mean control point vector z → 0 and covariance matrix Σ , the quadratic energy that corresponds to the Gaussian probability is

E c ( z → ) = 1 2 ( z → − z → 0 ) t Σ ∗ ( z → − z → 0 )

The strength of this method relies on the strength of the training data as well as the tuning of the modified Mumford–Shah functional. Different snakes will require different training data sets and tunings.

Geometric active contours

Geometric active contour, or geodesic active contour (GAC) or conformal active contours employs ideas from Euclidean curve shortening evolution. Contours split and merge depending on the detection of objects in the image. These models are largely inspired by level sets, and have been extensively employed in medical image computing.

For example, the gradient descent curve evolution equation of GAC is

∂ C ∂ t = g ( I ) ( c + κ ) N → − ⟨ ∇ g , N → ⟩ N →

where g ( I ) is a halting function, c is a Lagrange multiplier, κ is the curvature, and N → is the unit inward normal. This particular form of curve evolution equation is only dependent on the velocity in the normal direction. It therefore can be rewritten equivalently in an Eulerian form by inserting the level set function Φ into it as follows

∂ Φ ∂ t = | ∇ Φ | d i v ( g ( I ) ∇ Φ | ∇ Φ | ) + c g ( I ) | ∇ Φ |

This simple yet powerful level-set reformation enables active contours to handle topology changes during the gradient descent curve evolution. It has inspired tremendous progress in the related fields, and using numerical methods to solve the level-set reformulation is now commonly known as the level set method. Although the level set method has become quite a popular tool for implementing active contours, Wang and Chan argued that not all curve evolution equations should be directly solved by it.

More recent developments in active contours address modeling of regional properties, incorporation of flexible shape priors and fully automatic segmentation, etc.

Statistical models combining local and global features have been formulated by Lankton and Allen Tannenbaum.

Relations to graph cuts

Graph cuts, or max-flow/min-cut, is a generic method for minimizing a particular form of energy called Markov random field (MRF) energy. The Graph cuts method has been applied to image segmentation as well, and it sometimes outperforms the level set method when the model is MRF or can be approximated by MRF.

References

Active contour model Wikipedia

(Text) CC BY-SA

Contents