- •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
Chapter 14
Sparse Sampling in MRI
Philip J. Bones and Bing Wu
14.1 Introduction
The significant time necessary to record each resonance echo from the volume being imaged in magnetic resonance imaging (MRI) has led to much effort to develop methods which take fewer measurements. Faster methods mean less time for the patient in the scanner, increased efficiency in the use of expensive scanning facilities, improved temporal resolution in studies involving moving organs or flows, and they lessen the probability that patient motion adversely affects the quality of the images. Images like those of the human body possess the property of sparsity, that is the property that in some transform space they can be represented much more compactly than in image space. The technique of compressed sensing, which aims to exploit sparsity, has therefore been adapted for use in MRI. This, coupled with the use of multiple receiving coils (parallel MRI) and the use of various forms of prior knowledge (e.g., support constraints in space and time), has resulted in significantly faster image acquisitions with only a modest penalty in the computational effort required for reconstruction. We describe the background motivation for adopting sparse sampling and show evidence of the sparse nature of biological image data sets. We briefly present the theory behind parallel MRI reconstruction, compressed sensing and the application of various forms of prior knowledge to image reconstruction. We summarize the work of other groups in applying these concepts to MRI and our own contributions. We finish with a brief conjecture on the possibilities for future development in the area.
P.J. Bones ( )
University of Canterbury, Christchurch, New Zealand e-mail: phil.bones@canterbury.ac.nz
G. Dougherty (ed.), Medical Image Processing: Techniques and Applications, Biological |
319 |
and Medical Physics, Biomedical Engineering, DOI 10.1007/978-1-4419-9779-1 14, © Springer Science+Business Media, LLC 2011
320 |
P.J. Bones and B. Wu |
14.1.1 Magnetic Resonance Imaging
MRI is the term used to represent the entire set of methods which apply the principles first developed for chemistry as nuclear magnetic resonance in such a way that the spatial variation of a property within an object is observed. A strong and extremely uniform magnetic field is applied to the object. Under the influence of the field those atoms in the object which have a magnetic spin property align in the direction of the magnetic field in one of two orientations such that a small net magnetization occurs. The atoms exhibit a resonance at a frequency, which is linearly dependent on the magnetic field strength. The resonance can be excited by means of a radiofrequency (RF) pulse at the appropriate frequency and the atoms which have been excited precess about an axis aligned with the direction of the magnetic field. After excitation, the precessing atoms relax back to equilibrium and in the process generate a small, but measurable, RF field – an “echo.”
By imposing a gradient in magnetic field strength as a linear function of one of the Cartesian space coordinates, z say, it is possible to encode that spatial coordinate in the resonance frequencies of the spins. By considerable extension of this basic idea, signal processing of the signals recovered from echoes after a specific sequence of gradient impositions with respect to the x, y, and z directions, coupled with RF excitations, and echo signal acquisitions, allows the formation of an image of the interior of the object. Many excitation and acquisition sequences have been devised. Because of the relationship between resonance frequency and magnetic field strength, virtually all of them make measurements in spatial frequency space, or “k-space” as the MRI community generally refers to it. Moreover, tissues in the body can be characterized in terms of the time constants associated with the atomic resonances, known as “T1” and “T2”. The differences between tissue responses help to make MRI effective in distinguishing between them. For a good overview of the basis of MRI, see [1] and for a comprehensive review of MRI sequences and algorithms, see [2].
While MRI also has applications in biological science and in the study of materials, it is its role in medicine that has led to a whole industry. The size of the annual meeting of the International Society for Magnetic Resonance in Medicine (ISMRM, http://ismrm.org) is testament to the extraordinary interest in the imaging modality. The reason that MRI has had such a profound effect on the practice of modern medicine is because of the exquisite detail that it has achieved in images of soft tissues within the human body. In this, it is quite complementary to X-ray computed tomography, which is particularly good at imaging harder tissues, notably bone. The two imaging modalities thus coexist and many patients are imaged using both for some diagnoses. Note that there are no known detrimental effects on the human body caused by MRI scanners of the sort in regular use, while the use of X-ray computed tomography is strictly limited by the dose of ionizing radiation the patient receives in such a scanner.
The use of MRI is restricted in one specific way: the physical processes involved in the excitation and reception of MR signals are inherently quite slow. Thus, the time taken to invoke a specific sequence and to measure the signals that are
14 Sparse Sampling in MRI |
321 |
generated is measured in a matter of milliseconds per pulse. Note that this has nothing to do with the electronics associated with the scanner – faster hardware does not solve the problem. To take a complete set of measurements for, say, a 3D imaging study of the brain may take many minutes; some acquisition sequences require periods approaching 1 h [2]. As well as reducing the throughput of an expensive facility, the slowness of acquisition limits how useful MRI is in imaging organs where motion is intrinsic, most notably the heart and circulatory system; even when these organs are not specifically the target for a particular imaging study, their activity may affect the success of imaging nearby or associated organs. The efforts of the authors and of many others involved in MRI research are directed toward developing smarter algorithms to attempt to reconstruct useful images from fewer measurements and therefore in less time.
14.1.2 Compressed Sensing
The conventional wisdom in signal processing is that the sampling rate for any signal must be at twice the maximum frequency present in the signal. The Sampling Theorem is variously attributed to Whittaker, Nyquist, Kotelnikov, and Shannon and its conception represents a very significant landmark in the history of signal processing. However in the work performed in recent years related to signal compression, it has become obvious that the total amount of information which is needed to represent a signal or image to high accuracy is in many cases much less than that implied by the “Nyquist limit.” This is nowhere more apparent than in the modern digital camera where quite acceptable images can be stored and recreated from a small fraction of the data volume that was associated with the original image sampling. The total amount of information acquired, 4 megapixels at 24-bit per pixel for example, may often be compressed to several hundred thousand bytes by the JPEG compression method without appreciable loss of image quality. The image property that lies behind this compressibility is “sparsity”: the fact that under some transformation many of the data values in the space associated with the transform can be set to zero and the image reconstructed from the rest of the data values without appreciable effect. An image which is very sparse (under that transformation) is one for which the number of nonzero values is relatively low.
The technique of compressed sensing (also known as “compressive sensing”) was introduced to exploit image sparsity [3, 4]. Consider a 2D image with N pixels represented by the vector x and suppose that it can be accurately represented by K N data values under the linear transformation y = Φ x. Rather than measuring the N pixel values and then performing the transformation, we seek to make just M measurements m, where K ≤ M N. Thus, m = Ψy, where Ψ is a measurement matrix of dimension M × K. While this might be of little direct benefit in the case cited above of a modern digital camera, for which the design of the sensor is most straightforwardly implemented as a regular 2D array of individual pixel detectors, there are many other applications, notably including MRI, for which making fewer
322 |
P.J. Bones and B. Wu |
Fig. 14.1 Comparing (a) conventional image sensing and compression to (b) compressed sensing. In (a), the image is sampled at the Nyquist sampling rate and stored. Then all of the smallest coefficients in the image’s wavelet transform are discarded to reduce the storage volume. In (b), the significant coefficients of the wavelet transform are directly estimated from a lesser number of samples of the image
measurements does offer an advantage. In the remainder of this chapter, we show how the exploitation of sparsity by means of compressed sensing methods has considerable potential in speeding up MRI image acquisition.
An illustration of how compressed sensing might work for the general optical imaging case is shown in Fig. 14.1. Suppose that the well-known cameraman image is being acquired with a conventional digital camera in Fig. 14.1a and a full set