![](/user_photo/2706_HbeT2.jpg)
- •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
324 |
P.J. Bones and B. Wu |
14.2 Sparsity in MRI Images
In this section, we explore the properties of MR images, which make them amenable to compressed sensing, show examples of how some common transforms can be used to exploit the sparsity, and introduce a novel nonlinear approach to promoting sparsity.
14.2.1 Characteristics of MR Images (Prior Knowledge)
As mentioned in the introduction, MRI measurements are made in the k-space domain. In some cases, the measurements may be at positions constrained by a regular Cartesian grid. Since an inverse Fourier transform is required to generate an image from the sampled k-space data, the regular Cartesian sample positions allow the straightforward use of the efficient FFT algorithm. However to achieve faster scanning or some signal processing advantages non-Cartesian sampling is frequently employed. Radial and spiral sampling [2] are quite common, for example. Some sampling strategies involve a higher density of samples near the center of k-space (i.e., concentrated in the area of lower spatial frequencies). In any case, there is a direct relationship between the extent of the k-space domain within which measurements are distributed and the resolution of the image obtained. Likewise, there is a direct relationship between the field-of-view (FOV) in the spatial domain and the effective spacing of samples in k-space [1].
The main source of noise in MR imaging is due to thermal fluctuations of electrolytes in the region being imaged which are detected by the receiver coil or coils. Electronic noise is inevitably present as well but may usually be of lesser order. Generally, the SNR increases as the square root of the acquisition time and linearly with the voxel size. Thus any moves to increase imaging speed and/or imaging resolution inevitably lead to a loss of SNR. Importantly, the noise statistics of each k-space sample is essentially equal [1]. Since the amplitude of samples near the origin of k-space is much greater than near the periphery, the SNR of these center samples is much better. This consideration often influences the design of a sampling scheme.
In many significant imaging situations, the object is known not to extend throughout the FOV. For example, in making a 2D axial plane image of the brain, the FOV is usually chosen to be a square or rectangular region that entirely contains the outline of the head. There is therefore part of the FOV which lies outside the head and which is therefore known not to contribute a significant signal to the measurements made. This support constraint is explicit. A support constraint may also be implicit: for example if it is known that a transformed version of the image is known to be nonzero only within an unspecified region which spans some known proportion of the transformed space.
![](/html/2706/349/html_ejyKCrTMq8.x03g/htmlconvd-mJEgn8342x1.jpg)
14 Sparse Sampling in MRI |
325 |
Fig. 14.2 Compressibility of an MR brain slice. The wavelet and DCT approximations of the original MR brain slice shown in (a), using only the 10% highest amplitude and the 5% highest amplitude coefficients of the transforms, are shown in (b) to (e). There appears to be little loss of information under such high levels of image compression
Constraints may also be temporal. While the relatively slow acquisition of MR data restricts its use in dynamic imaging tasks, the facts that measurements are made at precise timing instants and that objects under observation move relatively smoothly allows temporal constraints to be formulated and exploited.
Biological tissues comprise a large number of types. While at a microscopic level these tissues are generally inhomogeneous, at the resolution observed by MR techniques, each tissue type is relatively homogeneous. It is the difference in MR signal between tissue types which allows such useful anatomical information to be gleaned. The image as a whole therefore exhibits an approximately piecewise homogeneity, which can be exploited.
The forms of prior knowledge about the MR images discussed above can all be seen as evidence for expecting the images to be sparse.
14.2.2 Choice of Transform
The term implicit support was introduced in Sect. 14.2.1. This represents the property that under some transformation an image can be shown to be nonzero only within some unspecified part of the domain. The success of lossy image compression schemes based on the DCT and wavelet transforms indicate that these are useful sparsifying transforms. In Fig. 14.2, we illustrate the degree to which a typical MR image can be compressed by the two transforms. The image in Fig. 14.2a is formed for an axial slice of the brain with the full resolution afforded by the MRI sequence employed (256 ×256). The other parts of the figure show reconstructions with only a fraction of the transform coefficients retained. It is clear that under either of the two transforms a substantial reduction of data volume is possible before
326 |
P.J. Bones and B. Wu |
serious degradation of the image occurs. Note that the compression here is “lossy,” in that there is always some degradation generated by setting small coefficients to zero, but not so much degradation that the image usefulness is seriously impaired.
The discrete cosine transform (DCT) was the transform of choice for many years for image compression [7]. It was the basis of the original JPEG standard. The properties of the DCT which make it a useful choice for image compression include:
1.It lends itself to representing small rectangular blocks of pixels
2.It can be shown to have a faster fall off in coefficient amplitude as frequency increases in comparison with the DFT
3.It is relatively efficient to compute via the FFT
The DWT has taken over from the DCT in certain regards [8]. The properties of the DWT which make it a useful choice for image compression include:
1.It naturally distributes information over a number of scales and localizes that information in space
2.It offers a wide range of basis function (wavelet families) from which to choose
3.It is inherently efficient to compute
The decision between the transforms is unlikely to be critical. The nature of the DWT, however, does render it better at representing boundaries in the image between two tissue types where the image function exhibits a step change. With the DCT, such a boundary necessarily injects some energy in high frequency components and adversely affects the sparsity in the transformed representation. The DWT with an appropriate choice of wavelet may perform better in this regard.
14.2.3 Use of Data Ordering
A quite distinctly different approach for increasing sparsity has recently been proposed. In 2008, Adluru and DiBella [9] and Wu et al. [10] independently proposed performing a sorting operation on the signal or image as part of the reconstruction process. The principle is presented in Fig. 14.3 for a 2D axial brain image. In Fig. 14.3a, the situation is shown whereby the image is transformed by the 2D DCT and then a compression occurs by setting all coefficients less than a given threshold to zero. The resulting reconstruction is similar to the original, but noticeably smoother due to the loss of some small amplitude high frequency components. In Fig. 14.3b, the image pixels are sorted from largest amplitude in the lower right to highest amplitude in the upper left to make the resulting function monotonic and the mapping required to do this is retained (denoted “R”). The same transformation and recovery operation after thresholding as in (a) is performed and a re-sorting (denoted “R−1”) is performed. Because the compression retains much of the shape of the image after sorting, the result has much higher fidelity than in
![](/html/2706/349/html_ejyKCrTMq8.x03g/htmlconvd-mJEgn8344x1.jpg)
14 Sparse Sampling in MRI |
327 |
Fig. 14.3 Illustration of how a data ordering can achieve a higher sparsity for a 2D image. In (a), the signal is compressed by retaining only those DCT coefficients with amplitudes higher than a threshold. In (b), the image pixels are sorted to generate a monotonic function and then the same recovery operation is performed before a final resorting. Because the sorted data in (b) is more sparse, the recovery is of higher quality
Fig. 14.3a. We argue that many fewer coefficients need to be retained in the DCT of the sorted image than in the original, hence the more successful reconstruction.
Clearly, the process depicted in Fig. 14.3 requires knowledge of the original signal to derive R. The practical utility of what has been demonstrated is likely therefore to be questioned. However, we show in Sect. 14.4.2 that several methods to derive an approximate R are possible and that they lead to useful and practical algorithms for MR image recovery.
The advantage claimed for data ordering depends on the sorted data function being more sparse than the original. It is difficult if not impossible to prove this,
![](/html/2706/349/html_ejyKCrTMq8.x03g/htmlconvd-mJEgn8345x1.jpg)
328 |
P.J. Bones and B. Wu |
Fig. 14.4 Examples which show the higher sparsity that data ordering can achieve for 2D images: (a) a set of 5 original images; (b) the number of DCT coefficients needed to achieve a reconstruction of each image with a relative mean square error (RMSE) ≤ 1%; (c) the image after a data ordering operation; and (d) the number of DCT coefficients needed to achieve a reconstruction of the ordered image with RMSE≤ 1%
but experiments indicate that in virtually all cases it is true. In Fig. 14.4, we show a set of 2D example images; three are typical brain axial slices (128 × 128 pixels) while the others are popular test images (200 ×200 pixels). A data sorting operation was performed on each image such that the highest intensity pixel was positioned in the top left corner and the lowest intensity pixel in the bottom right corner. A simple algorithm arranged the others in a type of raster which achieved the “wedge” images shown in column (c). Clearly, other algorithms for arranging the sorted pixels are possible. To the right of each image in columns (b) and (d) is the number of DCT