EIT Reconstruction Algorithms: Pitfalls, Challenges and Recent Developments

We review developments, issues and challenges in Electrical Impedance Tomography (EIT), for the 4th Workshop on Biomedical Applications of EIT, Manchester 2003. We focus on the necessity for three dimensional data collection and reconstruction, efficient solution of the forward problem and present and future reconstruction algorithms. We also suggest common pitfalls or ``inverse crimes'' to avoid.Comment: A review paper for the 4th Workshop on Biomedical Applications of EIT, Manchester, UK, 200

An Analysis of Finite Element Approximation in Electrical Impedance Tomography

We present a finite element analysis of electrical impedance tomography for reconstructing the conductivity distribution from electrode voltage measurements by means of Tikhonov regularization. Two popular choices of the penalty term, i.e., $H^1(\Omega)$-norm smoothness penalty and total variation seminorm penalty, are considered. A piecewise linear finite element method is employed for discretizing the forward model, i.e., the complete electrode model, the conductivity, and the penalty functional. The convergence of the finite element approximations for the Tikhonov model on both polyhedral and smooth curved domains is established. This provides rigorous justifications for the ad hoc discretization procedures in the literature.Comment: 20 page

Sparsity prior for electrical impedance tomography with partial data

This paper focuses on prior information for improved sparsity reconstruction in electrical impedance tomography with partial data, i.e. data measured only on subsets of the boundary. Sparsity is enforced using an $\ell_1$ norm of the basis coefficients as the penalty term in a Tikhonov functional, and prior information is incorporated by applying a spatially distributed regularization parameter. The resulting optimization problem allows great flexibility with respect to the choice of measurement boundaries and incorporation of prior knowledge. The problem is solved using a generalized conditional gradient method applying soft thresholding. Numerical examples show that the addition of prior information in the proposed algorithm gives vastly improved reconstructions even for the partial data problem. The method is in addition compared to a total variation approach.Comment: 17 pages, 12 figure

Comparing D-Bar and Common Regularization-Based Methods for Electrical Impedance Tomography

Objective: To compare D-bar difference reconstruction with regularized linear reconstruction in electrical impedance tomography. Approach: A standard regularized linear approach using a Laplacian penalty and the GREIT method for comparison to the D-bar difference images. Simulated data was generated using a circular phantom with small objects, as well as a \u27Pac-Man\u27 shaped conductivity target. An L-curve method was used for parameter selection in both D-bar and the regularized methods. Main results: We found that the D-bar method had a more position independent point spread function, was less sensitive to errors in electrode position and behaved differently with respect to additive noise than the regularized methods. Significance: The results allow a novel pathway between traditional and D-bar algorithm comparison

Adaptive Reconstruction for Electrical Impedance Tomography with a Piecewise Constant Conductivity

In this work we propose and analyze a numerical method for electrical impedance tomography of recovering a piecewise constant conductivity from boundary voltage measurements. It is based on standard Tikhonov regularization with a Modica-Mortola penalty functional and adaptive mesh refinement using suitable a posteriori error estimators of residual type that involve the state, adjoint and variational inequality in the necessary optimality condition and a separate marking strategy. We prove the convergence of the adaptive algorithm in the following sense: the sequence of discrete solutions contains a subsequence convergent to a solution of the continuous necessary optimality system. Several numerical examples are presented to illustrate the convergence behavior of the algorithm.Comment: 26 pages, 12 figure

Incorporating Physics-Based Patterns into Geophysical and Geostatistical Estimation Algorithms

Geophysical imaging systems are inherently non-linear and plagued with the challenge of limited data. These drawbacks make the solution non-unique and sensitive to small data perturbations; hence, regularization is performed to stabilize the solution. Regularization involves the application of a priori specification of the target to modify the solution space in order to make it tractable. However, the traditionally applied regularization model constraints are independent of the physical mechanisms driving the spatiotemporal evolution of the target parameters. To address this limitation, we introduce an innovative inversion scheme, basis-constrained inversion, which seeks to leverage advances in mechanistic modeling of physical phenomena to mimic the physics of the target process, to be incorporated into the regularization of hydrogeophysical and geostatistical estimation algorithms, for improved subsurface characterization. The fundamental protocol of the approach involves the construction of basis vectors from training images, which are then utilized to constrain the optimization problem. The training dataset is generated via Monte Carlo simulations to mimic the perceived physics of the processes prevailing within the system of interest. Two statistical techniques for constructing optimal basis functions, Proper Orthogonal Decomposition (POD) and Maximum Covariance Analysis (MCA), are employed leading to two inversion schemes. While POD is a static imaging technique, MCA is a dynamic inversion strategy. The efficacies of the proposed methodologies are demonstrated based on hypothetical and lab-scale flow and transport experiments