Fast Microwave Tomography Algorithm for Breast Cancer Imaging

Microwave tomography has shown promise for breast cancer imaging. The microwaves are harmless to body tissues, which makes microwave tomography a safe adjuvant screening to mammography. Although many clinical studies have shown the effectiveness of regular screening for the detection of breast cancer, the anatomy of the breast and its critical tissues challenge the identification and diagnosis of tumors in this region. Detection of tumors in the breast is more challenging in heterogeneously dense and extremely dense breasts, and microwave tomography has the potential to be effective in such cases. The sensitivity of microwaves to various breast tissues and the comfort and safety of the screening method have made microwave tomography an attractive imaging technique. Despite the need for an alternative screening technique, microwave tomography has not yet been introduced as a screening modality in regular health care, and is still subject to research. The main obstacles are imperfect hardware systems and inefficient imaging algorithms. The immense computational costs for the image reconstruction algorithm present a crucial challenge. 2D imaging algorithms are proposed to reduce the amount of hardware resources required and the imaging time. Although 2D microwave tomography algorithms are computationally less expensive, few imaging groups have been successful in integrating the acquired 3D data into the 2D tomography algorithms for clinical applications. The microwave tomography algorithms include two main computation problems: the forward problem and the inverse problem. The first part of this thesis focuses on a new fast forward solver, the 2D discrete dipole approximation (DDA), which is formulated and modeled. The effect of frequency, sampling number, target size, and contrast on the accuracy of the solver are studied. Additionally, the 2D DDA time efficiency and computation time as a single forward solver are investigated.\ua0 The second part of this thesis focuses on the inverse problem. This portion of the algorithm is based on a log-magnitude and phase transformation optimization problem and is formulated as the Gauss-Newton iterative algorithm. The synthetic data from a finite-element-based solver (COMSOL Multiphysics) and the experimental data acquired from the breast imaging system at Chalmers University of Technology are used to evaluate the DDA-based image reconstruction algorithm. The investigations of modeling and computational complexity show that the 2D DDA is a fast and accurate forward solver that can be embedded in tomography algorithms to produce images in seconds. The successful development and implementation in this thesis of 2D tomographic breast imaging with acceptable accuracy and high computational cost efficiency has provided significant savings in time and in-use memory and is a dramatic improvement over previous implementations

Embedding approach to modeling electromagnetic fields in a complex two-dimensional environment

An approach is presented to combine the response of a two-dimensionally inhomogeneous dielectric object in a homogeneous environment with that of an empty inhomogeneous environment. This allows an efficient computation of the scattering behavior of the dielectric cylinder with the aid of the CGFFT method and a dedicated extrapolation procedure. Since a circular observation contour is adopted, an angular spectral representation can be employed for the embedding. Implementation details are discussed for the case of a closed 434 MHz microwave scanner, and the accuracy and efficiency of all steps in the numerical procedure are investigated. Guidelines are proposed for choosing computational parameters such as truncation limits and tolerances. We show that the embedding approach does not increase the CPU time with respect to the forward problem solution in a homogeneous environment, if only the fields on the observation contour are computed, and that it leads to a relatively small increase when the fields on the mesh are computed as well

Modeling-Backed Microwave Imaging in Closed Systems: Reconstruction of a Spherical Inhomogeneity

This project contributes to the field of computational techniques for processing data in microwave imaging inside closed cavities. A computational procedure for imaging of a spherical inhomogeneity in a dielectric sample is outlined. It uses an artificial neural network capable of reconstructing geometrical and material parameters. The network uses data from an FDTD model. Computational experiments are reported for the 4-port waveguide element containing a Teflon sample with a hidden inclusion. The error in reconstruction of four geometrical parameters of a dielectric sphere is 3.3%; the error in finding complex permittivity of the inclusion is 9.8%. The project makes a solid theoretical background for the experimental program dedicated to multiport systems for practical applications

On the 3D electromagnetic quantitative inverse scattering problem: algorithms and regularization

In this thesis, 3D quantitative microwave imaging algorithms are developed with emphasis on efficiency of the algorithms and quality of the reconstruction. First, a fast simulation tool has been implemented which makes use of a volume integral equation (VIE) to solve the forward scattering problem. The solution of the resulting linear system is done iteratively. To do this efficiently, two strategies are combined. First, the matrix-vector multiplications needed in every step of the iterative solution are accelerated using a combination of the Fast Fourier Transform (FFT) method and the Multilevel Fast Multipole Algorithm (MLFMA). It is shown that this hybridMLFMA-FFT method is most suited for large, sparse scattering problems. Secondly, the number of iterations is reduced by using an extrapolation technique to determine suitable initial guesses, which are already close to the solution. This technique combines a marching-on-in-source-position scheme with a linear extrapolation over the permittivity under the form of a Born approximation. It is shown that this forward simulator indeed exhibits a better efficiency. The fast forward simulator is incorporated in an optimization technique which minimizes the discrepancy between measured data and simulated data by adjusting the permittivity profile. A Gauss-Newton optimization method with line search is employed in this dissertation to minimize a least squares data fit cost function with additional regularization. Two different regularization methods were developed in this research. The first regularization method penalizes strong fluctuations in the permittivity by imposing a smoothing constraint, which is a widely used approach in inverse scattering. However, in this thesis, this constraint is incorporated in a multiplicative way instead of in the usual additive way, i.e. its weight in the cost function is reduced with an improving data fit. The second regularization method is Value Picking regularization, which is a new method proposed in this dissertation. This regularization is designed to reconstruct piecewise homogeneous permittivity profiles. Such profiles are hard to reconstruct since sharp interfaces between different permittivity regions have to be preserved, while other strong fluctuations need to be suppressed. Instead of operating on the spatial distribution of the permittivity, as certain existing methods for edge preservation do, it imposes the restriction that only a few different permittivity values should appear in the reconstruction. The permittivity values just mentioned do not have to be known in advance, however, and their number is also updated in a stepwise relaxed VP (SRVP) regularization scheme. Both regularization techniques have been incorporated in the Gauss-Newton optimization framework and yield significantly improved reconstruction quality. The efficiency of the minimization algorithm can also be improved. In every step of the iterative optimization, a linear Gauss-Newton update system has to be solved. This typically is a large system and therefore is solved iteratively. However, these systems are ill-conditioned as a result of the ill-posedness of the inverse scattering problem. Fortunately, the aforementioned regularization techniques allow for the use of a subspace preconditioned LSQR method to solve these systems efficiently, as is shown in this thesis. Finally, the incorporation of constraints on the permittivity through a modified line search path, helps to keep the forward problem well-posed and thus the number of forward iterations low. Another contribution of this thesis is the proposal of a new Consistency Inversion (CI) algorithm. It is based on the same principles as another well known reconstruction algorithm, the Contrast Source Inversion (CSI) method, which considers the contrast currents – equivalent currents that generate a field identical to the scattered field – as fundamental unknowns together with the permittivity. In the CI method, however, the permittivity variables are eliminated from the optimization and are only reconstructed in a final step. This avoids alternating updates of permittivity and contrast currents, which may result in a faster convergence. The CI method has also been supplemented with VP regularization, yielding the VPCI method. The quantitative electromagnetic imaging methods developed in this work have been validated on both synthetic and measured data, for both homogeneous and inhomogeneous objects and yield a high reconstruction quality in all these cases. The successful, completely blind reconstruction of an unknown target from measured data, provided by the Institut Fresnel in Marseille, France, demonstrates at once the validity of the forward scattering code, the performance of the reconstruction algorithm and the quality of the measurements. The reconstruction of a numerical MRI based breast phantom is encouraging for the further development of biomedical microwave imaging and of microwave breast cancer screening in particular