Elsevier

Medical Image Analysis

Volume 7, Issue 2, June 2003, Pages 171-185
Medical Image Analysis

A variational framework for integrating segmentation and registration through active contours

https://doi.org/10.1016/S1361-8415(03)00004-5Get rights and content

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.

Introduction

Segmentation and registration have been established as important problems in the field of medical image analysis Ayache, 1995, Cline et al., 1990, Grimson et al., 1994, Vannier et al., 1985. Traditionally, solutions have been developed for each of these two problems in relative isolation from the other, but with increasing dependence on the existence of a solution for the other. In the rest of this section, we discuss the interdependence of segmentation and registration solutions and introduce our motivation for a method that simultaneously estimates the two.

A large class of registration solutions, referred to as ‘feature-based’ methods, require that some features be identified or segmented in the images prior to their registration. These features may be identified using low-level methods such as edge-detection, or segmented using higher level methods that are customized for specific anatomical structures. Contour- and point-based techniques Tang et al., 2000, Weese et al., 1997a, Weese et al., 1997b, Yaniv, 1998 are examples of this strategy, as well as registration methods that compare medialness properties of segmented anatomies (Yushkevich et al., 1999). In contrast to feature-based registration methods, a second class of methods, referred to as ‘intensity-based’ segmentation methods, require no a priori segmentation, which makes them an attractive proposition. Some of the most frequently used objective functions in such registration frameworks are: normalized cross-correlation (Lemieux et al., 1994), entropy of the difference image (Buzug et al., 1997), pattern intensity (Weese et al., 1997b), gradient correlation (Brown, 1996) and gradient difference (Penney et al., 1998). Mutual-Information was introduced as a particularly effective intensity-based metric for registration of medical imagery Collignon et al., 1995, Wells et al., 1995, and its applicability has been repeatedly demonstrated for solving rigid-body (6 degrees of freedom) registration problems. No such consensus, feature-based or intensity-based, seems to have been reached for the domain of non-rigid registration.

The dependence of segmentation on registration is somewhat more subtle. A large class of segmentation methods do not depend on explicit registration between multiple data sets. We will refer to these as ‘low-level’ segmentation methods. In these low-level segmentation methods, the algorithm designers typically use information synthesized from their knowledge of several example data sets to set the parameters of their segmentation algorithms, but no explicit process of registering those data sets to a common reference frame is carried out prior to segmentation. These methods may process a single channel input image using image-processing techniques such as thresholding, connectivity analysis, region-growing, morphology, snakes, and Bayesian MAP estimation. Or, they may process multi-channel data in which the channels are naturally registered because they are acquired simultaneously.

While it is easier to get started in segmentation using these methods because there is no need to solve the cumbersome registration problem a priori, efforts in low-level segmentation of medical imagery often conclude that ‘model-based’, higher level information such as the shape, appearance, and relative geometry of anatomy needs to be incorporated into the solution in order to complete the segmentation task Baillard et al., 2000, Cootes et al., 1994, Kapur et al., 1998, Staib and Duncan, 1992, Szekely et al., 1996. And it is in the building of these models of anatomy that registration plays a key role. Individual data sets need to be registered to a common frame of reference, so that statistics about their shape, appearance, or relative geometry can be gathered.

The work presented in this paper is motivated by the desire to interleave the process of segmentation and registration so that both solutions may be built simultaneously and hence to eliminate the need to completely deliver one solution before being able to start on the other. This challenge has been approached with a min–max entropy-based framework to segment and register portal images to CT (Bansal et al., 1999), and with the ATM SVC algorithm which applies an iterative sequence of elastic warping of the input to an already segmented model in order to automate the classification of normal and abnormal anatomy from medical images (Warfield et al., 2000). A novel extension to level set representations and active contour models by incorporating shape priors Chen et al., 2001, Paragios and Rousson, 2002, Paragios et al., 2002 have also been recently introduced, which frameworks could potentially be used to address our proposed task.

The focus of this paper is to introduce a geometric, variational, active contour framework that allows us to interleave powerful level-set-based formulations of segmentation with a feature-based registration method.

Section snippets

Background on active contours

Active contours have been utilized extensively for problems including image segmentation, visual tracking, and shape analysis (see Blake and Isard, 1998 and references therein). A variety of active contour models have been proposed since the introduction of the ‘snake’ methodology in the mid-1980s (Kass et al., 1987). These original models utilized parametric representations of the evolving contour. Shortly thereafter, using the level set methodology of Osher and Sethian (1988), more geometric

General framework

In this section we outline the general framework for joint registration and segmentation via active contours. In Section 4, we will address rigid registration with scaling as a special case. Our model will be derived first for the two-dimensional case, and then the corresponding three-dimensional active surface model will be presented. We begin by establishing some basic notation.

‘Affine’ registration

Notice that the gradient curve evolution (6) for C and the gradient direction (7) for the vector of registration parameters g1,…,gn both depend upon the Jacobian, g′ of the registration map g. In the special case where G is the group of rigid-body motions following a (possibly nonuniform) scaling operation, then we may represent g by a rotation matrix R, a scaling matrix M and a displacement vector D:g(x)=RMx+D.Note, the fully affine case could be obtained by incorporating an additional

Results

In this section, we report segmentation/registration results from three experiments on MRI/CT and one on MR/MR images of the head and the spine. The first experiment was performed in 2D, while the second, third and the fourth ones were performed in 3D. In the 2D experiment, corresponding slices between the MR and the CT were chosen manually, and used as input for our algorithm. In the 3D experiments, a pair of 3D MR and CT or a pair of MR scans was used as input, without any attempt to manually

Images used for validation

In the following validation experiments, we use a set of synthetic images, which are displayed in Fig. 6. Besides the original binary image (‘Original Image’), we created two other images by adding different amounts of Gaussian noise to the former. In both cases the distorting noise is zero-mean, and one has 0.05 variance while the other has 0.5. In the case of Image A, we also applied a rigid transformation to one of the objects present.

How registration is aided by segmentation

In order to demonstrate in what manner segmentation

Summary and future work

We have presented a variational framework for joint segmentation and registration using active contours. We employ a single contour (or surface in 3D) to segment multiple images. The contour and the registration are both computed to minimize a set of energy functionals, one for each image. The experiments in this paper utilize an intensity-based energy functional, but the framework allows for richer choices that may encode shape priors, textures, or other image statistics, which we are

Acknowledgements

This work was supported by the Whiteman Fellowship and the NSF grant #CCR-0133736.

References (43)

  • T.M. Buzug et al.

    Image registration: convex weighting functions for histogram-based similarity measures

  • V. Caselles et al.

    A geometric model for active contours in image processing

    Numerische Mathematik

    (1993)
  • V. Caselles et al.

    Geodesic active contours

    Int. J. Computer Vision

    (1997)
  • A. Chakraborty et al.

    Deformable boundary finding in medical images by integrating gradient and region information

    IEEE Trans. Medical Imaging

    (1996)
  • T. Chan et al.

    An Active Contour Model Without Edges

  • Y. Chen et al.

    On the Incorporation of Shape Priors into Geometric Active Contours

  • H. Cline et al.

    Three-dimensional segmentation of MR images of the head using probability and connectivity

    Journal of Computer-Aided Tomography

    (1990)
  • A. Collignon et al.

    Automated multi-modality image registration based on information theory

  • W.E.L. Grimson et al.

    An automatic registration method for frameless stereotaxy, image, guided surgery and enhanced reality visualization

  • T. Kapur et al.

    Enhanced spatial priors for segmentation of magnetic resonance imagery

  • M. Kass et al.

    Snakes: active contour models

    Int. J. Computer Vision

    (1987)
  • Cited by (114)

    • Multi-atlas image registration of clinical data with automated quality assessment using ventricle segmentation

      2020, Medical Image Analysis
      Citation Excerpt :

      The proposed MAR framework using ventricle overlap could be categorized as a feature-based registration method. Segmentations in feature-based registration methods have already been used as initialization (Vemuri et al., 2003), or have been optimized jointly with an intensity similarity metric for registration (Yezzi et al., 2003; Pohl et al., 2006; Chen et al., 2010). More recently, Balakrishnan et al. (2019) proposed to use a deep learning registration approach where segmentations of anatomical structures can be used as auxiliary data during the optimization.

    • Estimation and tracking of AP-diameter of the inferior vena cava in ultrasound images using a novel active circle algorithm

      2018, Computers in Biology and Medicine
      Citation Excerpt :

      The proposed active circle algorithm is presented in Section III while experimental results are in Section IV and concluding remarks in Section V. Two conventional functionals, widely employed in variational ACs, are based on the mean and the variance of the intensities [24]. The experimental data was collected from eight healthy male subjects with ages from 21 to 35.

    • Surface-driven registration method for the structure-informed segmentation of diffusion MR images

      2016, NeuroImage
      Citation Excerpt :

      Previously, joint segmentation and registration has been applied successfully to other problems such as longitudinal object tracking (Paragios, 2003) and atlas-based segmentation (Gorthi et al., 2011). The most common approach involves optimizing a deformation model (registration) that supports the evolution of the active contours (segmentation), like Paragios (2003); Yezzi et al. (2003). Regseg can be seen as a particular case of atlas-based segmentation-registration methods, replacing the atlas by the structural image of the subject (structure-informed segmentation).

    View all citing articles on Scopus
    View full text