- •Biological and Medical Physics, Biomedical Engineering
- •Medical Image Processing
- •Preface
- •Contents
- •Contributors
- •1.1 Medical Image Processing
- •1.2 Techniques
- •1.3 Applications
- •1.4 The Contribution of This Book
- •References
- •2.1 Introduction
- •2.2 MATLAB and DIPimage
- •2.2.1 The Basics
- •2.2.2 Interactive Examination of an Image
- •2.2.3 Filtering and Measuring
- •2.2.4 Scripting
- •2.3 Cervical Cancer and the Pap Smear
- •2.4 An Interactive, Partial History of Automated Cervical Cytology
- •2.5 The Future of Automated Cytology
- •2.6 Conclusions
- •References
- •3.1 The Need for Seed-Driven Segmentation
- •3.1.1 Image Analysis and Computer Vision
- •3.1.2 Objects Are Semantically Consistent
- •3.1.3 A Separation of Powers
- •3.1.4 Desirable Properties of Seeded Segmentation Methods
- •3.2 A Review of Segmentation Techniques
- •3.2.1 Pixel Selection
- •3.2.2 Contour Tracking
- •3.2.3 Statistical Methods
- •3.2.4 Continuous Optimization Methods
- •3.2.4.1 Active Contours
- •3.2.4.2 Level Sets
- •3.2.4.3 Geodesic Active Contours
- •3.2.5 Graph-Based Methods
- •3.2.5.1 Graph Cuts
- •3.2.5.2 Random Walkers
- •3.2.5.3 Watershed
- •3.2.6 Generic Models for Segmentation
- •3.2.6.1 Continuous Models
- •3.2.6.2 Hierarchical Models
- •3.2.6.3 Combinations
- •3.3 A Unifying Framework for Discrete Seeded Segmentation
- •3.3.1 Discrete Optimization
- •3.3.2 A Unifying Framework
- •3.3.3 Power Watershed
- •3.4 Globally Optimum Continuous Segmentation Methods
- •3.4.1 Dealing with Noise and Artifacts
- •3.4.2 Globally Optimal Geodesic Active Contour
- •3.4.3 Maximal Continuous Flows and Total Variation
- •3.5 Comparison and Discussion
- •3.6 Conclusion and Future Work
- •References
- •4.1 Introduction
- •4.2 Deformable Models
- •4.2.1 Point-Based Snake
- •4.2.1.1 User Constraint Energy
- •4.2.1.2 Snake Optimization Method
- •4.2.2 Parametric Deformable Models
- •4.2.3 Geometric Deformable Models (Active Contours)
- •4.2.3.1 Curve Evolution
- •4.2.3.2 Level Set Concept
- •4.2.3.3 Geodesic Active Contour
- •4.2.3.4 Chan–Vese Deformable Model
- •4.3 Comparison of Deformable Models
- •4.4 Applications
- •4.4.1 Bone Surface Extraction from Ultrasound
- •4.4.2 Spinal Cord Segmentation
- •4.4.2.1 Spinal Cord Measurements
- •4.4.2.2 Segmentation Using Geodesic Active Contour
- •4.5 Conclusion
- •References
- •5.1 Introduction
- •5.2 Imaging Body Fat
- •5.3 Image Artifacts and Their Impact on Segmentation
- •5.3.1 Partial Volume Effect
- •5.3.2 Intensity Inhomogeneities
- •5.4 Overview of Segmentation Techniques Used to Isolate Fat
- •5.4.1 Thresholding
- •5.4.2 Selecting the Optimum Threshold
- •5.4.3 Gaussian Mixture Model
- •5.4.4 Region Growing
- •5.4.5 Adaptive Thresholding
- •5.4.6 Segmentation Using Overlapping Mosaics
- •5.6 Conclusions
- •References
- •6.1 Introduction
- •6.2 Clinical Context
- •6.3 Vessel Segmentation
- •6.3.1 Survey of Vessel Segmentation Methods
- •6.3.1.1 General Overview
- •6.3.1.2 Region-Growing Methods
- •6.3.1.3 Differential Analysis
- •6.3.1.4 Model-Based Filtering
- •6.3.1.5 Deformable Models
- •6.3.1.6 Statistical Approaches
- •6.3.1.7 Path Finding
- •6.3.1.8 Tracking Methods
- •6.3.1.9 Mathematical Morphology Methods
- •6.3.1.10 Hybrid Methods
- •6.4 Vessel Modeling
- •6.4.1 Motivation
- •6.4.1.1 Context
- •6.4.1.2 Usefulness
- •6.4.2 Deterministic Atlases
- •6.4.2.1 Pioneering Works
- •6.4.2.2 Graph-Based and Geometric Atlases
- •6.4.3 Statistical Atlases
- •6.4.3.1 Anatomical Variability Handling
- •6.4.3.2 Recent Works
- •References
- •7.1 Introduction
- •7.2 Linear Structure Detection Methods
- •7.3.1 CCM for Imaging Diabetic Peripheral Neuropathy
- •7.3.2 CCM Image Characteristics and Noise Artifacts
- •7.4.1 Foreground and Background Adaptive Models
- •7.4.2 Local Orientation and Parameter Estimation
- •7.4.3 Separation of Nerve Fiber and Background Responses
- •7.4.4 Postprocessing the Enhanced-Contrast Image
- •7.5 Quantitative Analysis and Evaluation of Linear Structure Detection Methods
- •7.5.1 Methodology of Evaluation
- •7.5.2 Database and Experiment Setup
- •7.5.3 Nerve Fiber Detection Comparison Results
- •7.5.4 Evaluation of Clinical Utility
- •7.6 Conclusion
- •References
- •8.1 Introduction
- •8.2 Methods
- •8.2.1 Linear Feature Detection by MDNMS
- •8.2.2 Check Intensities Within 1D Window
- •8.2.3 Finding Features Next to Each Other
- •8.2.4 Gap Linking for Linear Features
- •8.2.5 Quantifying Branching Structures
- •8.3 Linear Feature Detection on GPUs
- •8.3.1 Overview of GPUs and Execution Models
- •8.3.2 Linear Feature Detection Performance Analysis
- •8.3.3 Parallel MDNMS on GPUs
- •8.3.5 Results for GPU Linear Feature Detection
- •8.4.1 Architecture and Implementation
- •8.4.2 HCA-Vision Features
- •8.4.3 Linear Feature Detection and Analysis Results
- •8.5 Selected Applications
- •8.5.1 Neurite Tracing for Drug Discovery and Functional Genomics
- •8.5.2 Using Linear Features to Quantify Astrocyte Morphology
- •8.5.3 Separating Adjacent Bacteria Under Phase Contrast Microscopy
- •8.6 Perspectives and Conclusions
- •References
- •9.1 Introduction
- •9.2 Bone Imaging Modalities
- •9.2.1 X-Ray Projection Imaging
- •9.2.2 Computed Tomography
- •9.2.3 Magnetic Resonance Imaging
- •9.2.4 Ultrasound Imaging
- •9.3 Quantifying the Microarchitecture of Trabecular Bone
- •9.3.1 Bone Morphometric Quantities
- •9.3.2 Texture Analysis
- •9.3.3 Frequency-Domain Methods
- •9.3.4 Use of Fractal Dimension Estimators for Texture Analysis
- •9.3.4.1 Frequency-Domain Estimation of the Fractal Dimension
- •9.3.4.2 Lacunarity
- •9.3.4.3 Lacunarity Parameters
- •9.3.5 Computer Modeling of Biomechanical Properties
- •9.4 Trends in Imaging of Bone
- •References
- •10.1 Introduction
- •10.1.1 Adolescent Idiopathic Scoliosis
- •10.2 Imaging Modalities Used for Spinal Deformity Assessment
- •10.2.1 Current Clinical Practice: The Cobb Angle
- •10.2.2 An Alternative: The Ferguson Angle
- •10.3 Image Processing Methods
- •10.3.1 Previous Studies
- •10.3.2 Discrete and Continuum Functions for Spinal Curvature
- •10.3.3 Tortuosity
- •10.4 Assessment of Image Processing Methods
- •10.4.1 Patient Dataset and Image Processing
- •10.4.2 Results and Discussion
- •10.5 Summary
- •References
- •11.1 Introduction
- •11.2 Retinal Imaging
- •11.2.1 Features of a Retinal Image
- •11.2.2 The Reason for Automated Retinal Analysis
- •11.2.3 Acquisition of Retinal Images
- •11.3 Preprocessing of Retinal Images
- •11.4 Lesion Based Detection
- •11.4.1 Matched Filtering for Blood Vessel Segmentation
- •11.4.2 Morphological Operators in Retinal Imaging
- •11.5 Global Analysis of Retinal Vessel Patterns
- •11.6 Conclusion
- •References
- •12.1 Introduction
- •12.1.1 The Progression of Diabetic Retinopathy
- •12.2 Automated Detection of Diabetic Retinopathy
- •12.2.1 Automated Detection of Microaneurysms
- •12.3 Image Databases
- •12.4 Tortuosity
- •12.4.1 Tortuosity Metrics
- •12.5 Tracing Retinal Vessels
- •12.5.1 NeuronJ
- •12.5.2 Other Software Packages
- •12.6 Experimental Results and Discussion
- •12.7 Summary and Future Work
- •References
- •13.1 Introduction
- •13.2 Volumetric Image Visualization Methods
- •13.2.1 Multiplanar Reformation (2D slicing)
- •13.2.2 Surface-Based Rendering
- •13.2.3 Volumetric Rendering
- •13.3 Volume Rendering Principles
- •13.3.1 Optical Models
- •13.3.2 Color and Opacity Mapping
- •13.3.2.2 Transfer Function
- •13.3.3 Composition
- •13.3.4 Volume Illumination and Illustration
- •13.4 Software-Based Raycasting
- •13.4.1 Applications and Improvements
- •13.5 Splatting Algorithms
- •13.5.1 Performance Analysis
- •13.5.2 Applications and Improvements
- •13.6 Shell Rendering
- •13.6.1 Application and Improvements
- •13.7 Texture Mapping
- •13.7.1 Performance Analysis
- •13.7.2 Applications
- •13.7.3 Improvements
- •13.7.3.1 Shading Inclusion
- •13.7.3.2 Empty Space Skipping
- •13.8 Discussion and Outlook
- •References
- •14.1 Introduction
- •14.1.1 Magnetic Resonance Imaging
- •14.1.2 Compressed Sensing
- •14.1.3 The Role of Prior Knowledge
- •14.2 Sparsity in MRI Images
- •14.2.1 Characteristics of MR Images (Prior Knowledge)
- •14.2.2 Choice of Transform
- •14.2.3 Use of Data Ordering
- •14.3 Theory of Compressed Sensing
- •14.3.1 Data Acquisition
- •14.3.2 Signal Recovery
- •14.4 Progress in Sparse Sampling for MRI
- •14.4.1 Review of Results from the Literature
- •14.4.2 Results from Our Work
- •14.4.2.1 PECS
- •14.4.2.2 SENSECS
- •14.4.2.3 PECS Applied to CE-MRA
- •14.5 Prospects for Future Developments
- •References
- •15.1 Introduction
- •15.2 Acquisition of DT Images
- •15.2.1 Fundamentals of DTI
- •15.2.2 The Pulsed Field Gradient Spin Echo (PFGSE) Method
- •15.2.3 Diffusion Imaging Sequences
- •15.2.4 Example: Anisotropic Diffusion of Water in the Eye Lens
- •15.2.5 Data Acquisition
- •15.3 Digital Processing of DT Images
- •15.3.2 Diagonalization of the DT
- •15.3.3 Gradient Calibration Factors
- •15.3.4 Sorting Bias
- •15.3.5 Fractional Anisotropy
- •15.3.6 Other Anisotropy Metrics
- •15.4 Applications of DTI to Articular Cartilage
- •15.4.1 Bovine AC
- •15.4.2 Human AC
- •References
- •Index
60 |
A. Alfiansyah |
methods, Markov random fields, active contours, model-based, and deformable model methods. As this domain has been studied extensively, there exist many published reviews of medical image segmentation [7, 39, 40], with specialized surveys on deformable models [7,8], vessel extraction [9,10], or brain segmentation [10, 11].
This chapter is organized as follows. In Sect. 4.2, we review the main concepts of the deformable model and its role in image segmentation. We present several types of deformable models according to how they are represented, followed by a description of their energy definition and possible optimization methods. In Sect. 4.3, we compare the performance of these deformable models according to properties such as initialization, topological change handling, stability, etc. In Sect. 4.4, we discuss several cases of developed applications of medical image segmentation and conclude in Sect. 4.5.
4.2 Deformable Models
The basic idea of active contours for image segmentation is to embed an initial contour (or surface in the three-dimensional case) into the image, and to subsequently let it evolve while being subjected to various constraints. In order to detect objects in the image, the contour has to stop its evolution on the boundary of the object of interest. Although the term deformable models first appeared in the work by Kass et al. [12] in the late eighties, the idea of deforming a template for extracting image features dates back much further, with work on spring-loaded templates [13] and on the rubber mask technique [14]. In image processing literature, deformable models are also variously known as snakes, active contours or surfaces, balloons, and deformable contours or surfaces. An extensive review of the current research in this area can be found in [1, 38].
In the following subsection, we present the different types of deformable models classified according to contour representation, and some energy optimization strategies.
4.2.1 Point-Based Snake
This classical snake was firstly proposed by Kass et al. [12] and represents the contour using discrete points. The behavior of this classical snake is usually modeled by a weighted linear combination of: internal energy calculated from the contour that determines the regularity of the curve; external energy which attracts the contour towards the significant features in the image; and often an additional user energy allowing the operator to better interact with the model.
In the first snake-type, one applies the simplest way to represent the model: a set of discrete points as snake elements (C(s)). Using this representation, closed
4 Deformable Models and Level Sets in Image Segmentation |
61 |
contours can be formed by connecting the last “snaxel” (snake element) to the first one. For segmentation, the snake has to minimize the energy as follows:
E(C(s)) = |
Econtour(C(s)) + Eimage(C(s)) + Euser(C(s)) ds. |
(4.1) |
||||||||
|
Ω |
|
|
|
|
|
|
|
|
|
|
internal energy |
|
external energy |
|
||||||
|
|
|
|
Applying discrete-point representation, the internal energy can be approximated by accommodating the elasticity and rigidity terms:
Econtour(C(s)) = w1 |
(s)Eelasticity (C(s)) + w2(s)Erigidity(C(s)) |
|
= w1 |
(s)Cs(s)2 + w2(s)Css(s)2, |
(4.2) |
where the subscripts s and ss denote the first and second derivatives with respect to the curve parameter. The model behavior is controlled by constants w1 and w2, respectively, weighting the curve elasticity and rigidity.
Internal Energy Definition: In the first term in equation (4.2), Cs(s) represents the elastic energy and makes the snake behave like a membrane. The second term Css(s) represents the contour’s bending energy that makes the model act like a thin plate. Decreasing elasticity allows the contour to increase in length, while increasing elasticity increases the tension of the model by reducing its length. Decreasing rigidity allows the active contour model to develop corners, while increasing rigidity makes the model smoother and less flexible. Setting either of the weighting coefficients to zero permits firstand second-order discontinuities, respectively.
This energy equation can then be discretized using the finite difference method as:
Eelasticity ≈ (xs − xs−1)2 + (ys − ys−1)2 . |
(4.3) |
This term will minimize the distance between the points on the snake, causing shrinking during optimization of the energy process in the absence of external energy. In a similar way, the rigidity term is discretized as:
Erigidity ≈ (xs+1 − xs − xs−1)2 + (ys+1 − ys − ys−1)2 . |
(4.4) |
The elasticity definition using finite differences discretization scheme is valid for the condition that the model’s snaxels are evenly spaced [15]. In other cases, a continuity term can be defined that subtracts the average distance of the snaxels, otherwise the energy value will be larger for points which are further apart. This constraint forces the points to be more evenly spaced, and avoids possible contraction of the snake.
62 |
A. Alfiansyah |
External Energy Definition: The external energy term in equation (4.1) represents the image potential derived from image data and guides the contour in finding the desired object. Ideally, this energy has a minimum value at the feature subject to detection. However, due to the presence of noise, there is often a convergence problem at object concavities. The snake can also integrate the constraint energy to interactively guide itself towards or away from particular features. This energy helps the contour to overcome the initialization problem or the sensitivity to noise.
Kass [12] proposed a weighted sum of the following energy terms in order to detect image features:
Eext(C(s)) = αline · I(s) + αedge · − I2 + αterm · Eterm. |
(4.5) |
The most common image functional in this model is the image intensity function I. The first term will simply attract the contour to lower or higher intensity values depending on the αline value. Large positive values of αline tend to make the snake align itself with dark regions in the image I(s), whereas large negative values of αline tend to make the snake align itself with bright regions in the image.
The edge energy that attracts the contour towards high gradient values is squared to narrow the edge-gradient response. Similarly, large positive values of αedge tend to make the snake align itself with sharp edges in the image whereas large negative values of αedge make the snake avoid the edges. Eterm is defined to find termination of line segments and corners. Kass proposed to use the curvature of iso-contours in a Gaussian smoothed image to attract the contours towards line termination.
4.2.1.1 User Constraint Energy
Constraint energy is applied to interactively guide the snake towards or away from particular features. This energy helps the contour to overcome the initialization problem or the sensitivity to noise.
Constraint energy was first proposed for the classical snake by allowing the user to attach springs between points of the contour and fix their position in the image plane. Kass define an energy in terms of spring (to attract the snake towards specified points) and volcano (to repulse the snake from specified points) within the image (Fig. 4.1).
The spring term attracts a contour point towards a spring point in the image plane, with a given constant, spring constant. The active contour model is attracted or repelled by the spring depending on this spring constant sign and value. The volcano term acts as a repulsive force between a point on the image at a inverse value of the distance from a point on the snake.
Balloon Force: Cohen [16,17] proposed an additional force that pushes the contour in the direction normal to the contour. Since it can either inflate or deflate the contour, this force is known as a balloon force, defined as:
|
(4.6) |
Fballoon(s) = kN(s), |
4 Deformable Models and Level Sets in Image Segmentation |
63 |
Fig. 4.1 Classical Snake [after [12]]
( )
where N s is the normal unit vector, k is the weighting parameter representing the strength of the balloon force, and the sign of k determines whether the model inflates or deflates.
Incorporating an additional balloon force helps the user with the classical problem of contour initialization when it is not close enough to the desired solution, as shown in Fig. 4.2b. This force also reduces the model sensitivity to noise, and can also push the model into object concavities. It should be noted that this force only has a single direction for all of the evolved deformable models. Hence, to capture the desired object perfectly the initial contour should be totally inside (or outside) the contour. A snake without any additional force and in the absence of image energy tends to shrink into a point to minimize the internal energy. Figure 4.2c shows this condition.
Gradient Vector Flow: The basic idea of this method [18, 19, 41] is to replace the external force term Eext(I) = P(I) with a gradient vector field (ν ), which can be derived from the equilibrium state of the following partial differential equation:
νt = g(| f |) 2ν − h(| f |)(ν − f ). |
(4.7) |
The first term in (4.7) is referred to as the smoothing term since it produces a smoothly varying vector field. The second term involving (ν − f ) is referred to as the data term, since it encourages the vector field ν to be close to f . The weight functions g(.) and h(.) are applied to the smoothing and data terms.
64 |
A. Alfiansyah |
Fig. 4.2 Deformable model with additional balloon force |
|
The authors in [5] proposed the following weight functions: |
|
g( f ) = e− | Kf | |
|
h( f ) = 1 − e− | Kf | . |
(4.8) |
Using these weight functions, the gradient vector flow field will conform to the distance map gradient near the relevant features, but will vary smoothly away from them. The constant K determines the extent of the field smoothness and the conformity gradient.
Figure 4.3 Illustrates the Gradient Vector Flow performance when a thin concavity or sharp corner is present in the segmented object. The Gradient Vector Flow force is able to attract the snake towards the desired contour and towards concave areas. This would not be the case with conventional external energy, since no external force attracts the snake towards that part of the image.