- •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
6 Angiographic Image Analysis |
121 |
The bifurcation issue has also been considered, for instance in [3] where a bifurcation models is proposed and optimized based on vessel centerline information.
Geometry models are powerful tools for describing vessels and aiding their further extraction within tracking schemes or by deformation. However, these methods assume image regularities that are present in high-quality images, but not necessarily in noisier ones, nor in pathological cases. Furthermore, they often require careful parameter tuning, which may change from one data set to the next. They can be used together with the intensity models, often combined in probabilistic and/or statistical approaches contributing to decision-making whether pixel belong to a vascular structure or not.
6.3.1.5 Deformable Models
Deformable models aim at fitting a geometric hypersurface (e.g., a 2D surface in a 3D image), by moving it and modifying its shape from an initial model, under the guidance of several (generally antagonist) forces: external (“data-driven”) ones, related to the image content, and internal (“model-driven”) ones, devoted to preserve correct geometric properties (e.g., regularity). Such models have been intensively used in the field of image analysis due to the following advantages: arbitrary shape representation, topological adaptivity, sub-pixel precision, etc.
Among the most classical methods, snakes (often used in 2D in order to segment vessel cross-sections), have been considered, e.g., in [64], or in [46], where two (1D and 2D) snakes are used for both segmentation and stenosis quantification.
Level-sets constitute another classical type of deformable model, and rely on an Eulerian version of contour evolution with partial derivative equations. The contour is integrated as the zero-level of a higher dimension function (level-set). In [59], an original level-set based scheme deformed an initial boundary estimate toward the vascular structures in the image using a codimension-two regularization force, based on the vessel centerlines instead of the vessel surface (see Fig. 6.1a). Another levelset based method [62] estimated the background and vessel intensity distributions based on the intensity histogram, to more efficiently steer the level-set onto the vessel boundaries.
Several efforts have been conducted to improve deformable models in the quite specific case of elongated structures. In this context, [104] used flux maximization as an alternative curvature-based regularization to make surface normals evolve according to the gradient vector field. The key idea was to evolve a curve or a surface under constraints by incorporating not only the magnitude but also the direction of an appropriate vector field.
In [54], local variances are measured with first-order derivatives and are propagated according to their strengths and directions, with an optimally oriented flux reporting more accurate and stable responses and higher robustness to disturbances from adjacent structures in comparison with Hessian-based measures.
The major advantage of deformable model methods is that they are sensitive to weak edges and robust to noisy structures. However, the intensity variation inside
122 |
O. Tankyevych et al. |
Fig. 6.1 Vessel segmentation examples. (a) Brain vessels segmentation based on deformable models. (b) Brain arteries segmentation based on path-finding and statistical approaches. (c) Brain arteries segmentation based on vessel tracking. (d) Brain vessels segmentation based on gray-level hit-or-miss transform. Illustrations from (a) [59], (b) [110], (c) [31], (d) [68]
vascular structures can generate significant intensity gradient with this undesired discontinuity stopping the contour evolution at these regions. Due to this local minima, the initial forces should be described with such precision that the final object borders are not far from the initial ones. Nonetheless, the evolution of the deformation can be a costly process. However, integrating vessel features and forces in powerful optimization schemes helps overcome these problems.
6 Angiographic Image Analysis |
123 |
6.3.1.6 Statistical Approaches
Vessel segmentation based on statistical approaches generally relies on specific assumptions related to the intensity distribution of the vascular/non-vascular signals in MRA data (only very few statistical methods have been devoted to CTA, see, e.g., [32], which proposes a particle-filtering strategy for the segmentation of coronary arteries), and especially physical models of blood flow. If the number and the nature of these distributions is known correctly, it is possible to determine their respective parameters (and in particular the mean intensity characterizing the associated structures), via a standard Expectation-Maximization (EM) technique [23].
In MRA, two or three distributions are generally considered, for the blood, and the other anatomical structures and the background, respectively. They led, in particular to the definition of Gaussian-Gaussian-uniform [107] and normal- Rayleigh–2×normal [80] mixtures for time-of-flight (TOF) MRA, and MaxwellGaussian [19], Maxwell-Gaussian-uniform [17] mixtures for phase-contrast (PC) MRA. In [18], a hybrid model, enables one to choose between these two kinds of mixtures. Alternatively to these “constrained” mixture choices, [29] has proposed a linear combination of discrete Gaussians with alternate signs, involved in a modified EM, which adaptively deals with both laminar and turbulent (pathological) blood flow [28].
In the primarily considered strategies, the determination of the vascular intensity led to a straightforward segmentation by thresholding of the image (sometimes enriched by a hierarchical analysis of the image by octree decomposition [107]). From an algorithmic point of view, segmentation improvements were also performed by considering spatial information (i.e., statistical dependence) between neighbor voxels, by integrating Markov random fields (MRF) [38] in a post-classification correction step [80]. In other works, speed and phase information provided by PCMRA were fused and involved in a maximum a posteriori-MRF framework to enhance vessel segmentation [17, 18].
Statistical methods globally inherit the strengths and weaknesses of the EM algorithm. First, they generally require one to establish hypotheses on the signal distribution. Moreover, they involve several parameters, for instance, weight, mean and standard deviation, of the distributions. The initialization of the segmentation process then requires special attention. Indeed, the convergence may depend on the quality of the initial distribution settings (sometimes automatically determined based on heuristic rules [17, 107]). As for any optimization strategy, the termination also requires one to decide whether the process has correctly converged or not (which is sometimes empirically determined, for instance by a maximal number of iterations [107]). Finally, since the segmentation process is strongly based on photometric properties (the results often consist of global or local thresholdings), higher-level knowledge such as geometric assumptions are hardly considered, and require post-processing steps based on a statistical framework [80], or, more efficiently the collaboration of alternative image processing techniques (see examples in Sect. 6.3.1).
124 |
O. Tankyevych et al. |
6.3.1.7 Path Finding
Based on extremal intensity and connectedness criteria, the detection of a vessel segment (or more precisely its medial axis) can be expressed as the determination of a minimal cost path in a weighted graph modeling voxels, their neighborhood relations and their intensity.
Vessel segmentation based on such strategies can rely on standard minimal path finding techniques [25] (i.e., on “global” minimization strategies, while methods categorized in the next Vessel tracking section will rely on “local” (step-by-step) minimization strategies). This is, for instance, the case in [75].
Alternatively to classic path-finding methods, fast-marching strategies [101] have been considered. They are both related to the level-sets (see Sect. 6.3.1.5) and minimal path-finding methodologies (they remain, in particular, consistent with the continuous formulation of the minimal-path research). In contrast to fully discrete path-finding, they enable the determination of paths with a sub-voxel accuracy [4].
The methods based on path-finding are globally well-suited to the detection of vessel medial axes, especially in the case of small vessels which justifies their frequent use in coronary detection. (For larger vessels, the optimal path may diverge from the medial axis, leading to eccentric results [57].) However, efforts have also been conducted in developing segmentation methods that extract both vessel axes and vessel walls [7, 57], expressing the whole vascular volume segmentation as the minimization of a path in a space enriched with a supplementary “scale” dimension corresponding to the vessel radius.
Despite attempts to segment whole vascular trees [114], such methods generally remain devoted to the segmentation of vessel segments, thus requiring one to interactively provide at least an initial and final point [75, 108]. In this case, they may be robust to noise, and signal decrease (or short signal loss) along the vessel, especially in the case of stenoses. Since these methods are based on monotonic and/or finite algorithmic processes, their termination is guaranteed and their theoretical algorithmic cost is generally low. However, in practice, the computational cost may be high, and the provision of initial and final points can potentially enable its reduction by computing paths from both points simultaneously [75].
6.3.1.8 Tracking Methods
By opposition to path-finding methods, tracking methods consist of finding a vessel locally, by progressively determining successive segments composing it. Such an approach requires one to interactively propose a seed, namely the starting point of the tracking process, located in the vessel, and (in most cases) the direction in which the vessel has to be tracked.