This book presents a comprehensive review of the recent developments in fast L1-norm regularization-based compressed sensing (CS) magnetic resonance image reconstruction algorithms. Compressed sensing magnetic resonance imaging (CS-MRI) is able to reduce the scan time of MRI considerably as it is possible to reconstruct MR images from only a few measurements in the k-space; far below the requirements of the Nyquist sampling rate. L1-norm-based regularization problems can be solved efficiently using the state-of-the-art convex optimization techniques, which in general outperform the greedy techniques in terms of quality of reconstructions. Recently, fast convex optimization based reconstruction algorithms have been developed which are also able to achieve the benchmarks for the use of CS-MRI in clinical practice. This book enables graduate students, researchers, and medical practitioners working in the field of medical image processing, particularly in MRI to understand the need for the CS in MRI, and thereby how it could revolutionize the soft tissue imaging to benefit healthcare technology without making major changes in the existing scanner hardware. It would be particularly useful for researchers who have just entered into the exciting field of CS-MRI and would like to quickly go through the developments to date without diving into the detailed mathematical analysis. Finally, it also discusses recent trends and future research directions for implementation of CS-MRI in clinical practice, particularly in Bio- and Neuro-informatics applications.

This book presents a comprehensive review of the recent developments in fast L1-norm regularization-based compressed sensing (CS) magnetic resonance image reconstruction algorithms. Compressed sensing magnetic resonance imaging (CS-MRI) is able to reduce the scan time of MRI considerably as it is possible to reconstruct MR images from only a few measurements in the k-space; far below the requirements of the Nyquist sampling rate. L1-norm-based regularization problems can be solved efficiently using the state-of-the-art convex optimization techniques, which in general outperform the greedy techniques in terms of quality of reconstructions. Recently, fast convex optimization based reconstruction algorithms have been developed which are also able to achieve the benchmarks for the use of CS-MRI in clinical practice. This book enables graduate students, researchers, and medical practitioners working in the field of medical image processing, particularly in MRI to understand the need for the CS in MRI, and thereby how it could revolutionize the soft tissue imaging to benefit healthcare technology without making major changes in the existing scanner hardware. It would be particularly useful for researchers who have just entered into the exciting field of CS-MRI and would like to quickly go through the developments to date without diving into the detailed mathematical analysis. Finally, it also discusses recent trends and future research directions for implementation of CS-MRI in clinical practice, particularly in Bio- and Neuro-informatics applications.

"Discusses different ways to use existing mathematical techniques to solve compressed sensing problems"--Provided by publisher.

Compressed Sensing (CS) theory is a novel signal processing paradigm, which states that sparse signals of interest can be accurately recovered from a small set of linear measurements using efficient L1-norm minimization techniques. CS theory has been successfully applied to many sensing applications; such has optical imaging, X-ray CT, and Magnetic Resonance Imaging (MRI). However, there are two critical deficiencies in how CS theory is applied to these practical sensing applications. First, the most common reconstruction algorithms ignore the constraints placed on the recovered variable by the laws of physics. Second, the measurement system must be constructed deterministically, and so it is not possible to utilize random matrix theory to assess the CS reconstruction capabilities of the sensing matrix. In this thesis, we propose solutions to these two deficiencies in the context of electromagnetic imaging applications, in which the unknown variables are related to the dielectric constant and conductivity of the scatterers. First, we introduce a set of novel Physicality Constrained Compressed Sensing (PCCS) optimization programs, which augment the standard CS optimization programs to force the resulting variables to obey the laws of physics. The PCCS problems are investigated from both theoretical and practical stand-points, as well as in the context of a hybrid Digital Breast Tomosynthesis (DBT) / Nearfield Radar Imaging (NRI) system for breast cancer detection. Our analysis shows how the PCCS problems provide enhanced recovery capabilities over the standard CS problems. We also describe three efficient algorithms for solving the PCCS optimization programs. Second, we present a novel numerical optimization method for designing so-called "compressive antennas" with enhanced CS recovery capabilities. In this method, the constitutive parameters of scatterers placed along a traditional antenna are designed in order to maximize the capacity of the sensing matrix. Through a theoretical analysis and a series of numerical examples, we demonstrate the ability of the optimization method to design antenna configurations with enhanced CS recovery capabilities. Finally, we briefly discuss an extension of the design method to Multiple Input Multiple Output (MIMO) communication systems.

"Magnetic Resonance Imaging (MRI) is a widely used non-invasive clinical imaging modality. Unlike other medical imaging tools, such as X-rays or computed tomography (CT), the advantage of MRI is that it uses non-ionizing radiation. In addition, MRI can provide images with multiple contrast by using different pulse sequences and protocols. However, acquisition speed, which remains the main challenge for MRI, limits its clinical application. Clinicians have to compromise between spatial resolution, SNR, and scan time, which leads to sub-optimal performance. The acquisition speed of MRI can be improved by collecting fewer data samples. However, according to the Nyquist sampling theory, undersampling in k-space will lead to aliasing artifacts in the recovered image. The recent mathematical theory of compressed sensing has been developed to exploit the property of sparsity for signals/images. It states that if an image is sparse, it can be accurately reconstructed using a subset of the k-space data under certain conditions. Generally, the reconstruction is formulated as an optimization problem. The sparsity of the image is enforced by using a sparsifying transform. Total variation (TV) is one of the commonly used methods, which enforces the sparsity of the image gradients and provides good image quality. However, TV introduces patchy or painting-like artifacts in the reconstructed images. We introduce novel regularization penalties involving higher degree image derivatives to overcome the practical problems associated with the classical TV scheme. Motivated by novel reinterpretations of the classical TV regularizer, we derive two families of functionals, which we term as isotropic and anisotropic higher degree total variation (HDTV) penalties, respectively. The numerical comparisons of the proposed scheme with classical TV penalty, current second order methods, and wavelet algorithms demonstrate the performance improvement. Specifically, the proposed algorithms minimize the staircase and ringing artifacts that are common with TV schemes and wavelet algorithms, while better preserving the singularities. Higher dimensional MRI is also challenging due to the above mentioned trade-offs. We propose a three-dimensional (3D) version of HDTV (3D-HDTV) to recover 3D datasets. One of the challenges associated with the HDTV framework is the high computational complexity of the algorithm. We introduce a novel computationally efficient algorithm for HDTV regularized image recovery problems. We find that this new algorithm improves the convergence rate by a factor of ten compared to the previously used method. We demonstrate the utility of 3D-HDTV regularization in the context of compressed sensing, denoising, and deblurring of 3D MR dataset and fluorescence microscope images. We show that 3D-HDTV outperforms 3D-TV schemes in terms of the signal to noise ratio (SNR) of the reconstructed images and its ability to preserve ridge-like details in the 3D datasets. To address speed limitations in dynamic MR imaging, which is an important scheme in multi-dimensional MRI, we combine the properties of low rank and sparsity of the dataset to introduce a novel algorithm to recover dynamic MR datasets from undersampled k-t space data. We pose the reconstruction as an optimization problem, where we minimize a linear combination of data consistency error, non-convex spectral penalty, and non-convex sparsity penalty. The problem is solved using an iterative, three step, alternating minimization scheme. Our results on brain perfusion data show a signicant improvement in SNR and image quality compared to classical dynamic imaging algorithms"--Page vii-ix.

Compressed Sensing (CS) in theory deals with the problem of recovering a sparse signal from an under-determined system of linear equations. The topic is of immense practical significance since all naturally occurring signals can be sparsely represented in some domain. In recent years, CS has helped reduce scan time in Magnetic Resonance Imaging (making scans more feasible for pediatric and geriatric subjects) and has also helped reduce the health hazard in X-Ray Computed CT. This book is a valuable resource suitable for an engineering student in signal processing and requires a basic understanding of signal processing and linear algebra. Covers fundamental concepts of compressed sensing Makes subject matter accessible for engineers of various levels Focuses on algorithms including group-sparsity and row-sparsity, as well as applications to computational imaging, medical imaging, biomedical signal processing, and machine learning Includes MATLAB examples for further development