Searcharxiv⌕ Search

arXiv subjects

Bangti Jin

Publications and source records attributed to Bangti Jin.

At least 73 records · Page 4Linked to original sources
arXiv2023

Conductivity Imaging from Internal Measurements with Mixed Least-Squares Deep Neural Networks

In this work we develop a novel approach using deep neural networks to reconstruct the conductivity distribution in elliptic problems from one measurement of the solution over the whole domain. The approach is based on a mixed reformulation of the governing equation and utilizes the standard least-squares objective, with deep neural networks as ansatz functions to approximate the conductivity and flux simultaneously. We provide a thorough analysis of the deep neural network approximations of the conductivity for both continuous and empirical losses, including rigorous error estimates that are explicit in terms of the noise level, various penalty parameters and neural network architectural parameters (depth, width and parameter bound). We also provide multiple numerical experiments in two- and multi-dimensions to illustrate distinct features of the approach, e.g., excellent stability with respect to data noise and capability of solving high-dimensional problems.

math.NA↗
arXiv2023

Numerical Recovery of a Time-Dependent Potential in Subdiffusion

In this work we investigate an inverse problem of recovering a time-dependent potential in a semilinear subdiffusion model from an integral measurement of the solution over the domain. The model involves the Djrbashian--Caputo fractional derivative in time. Theoretically, we prove a novel conditional Lipschitz stability result, and numerically, we develop an easy-to-implement fixed point iteration for recovering the unknown coefficient. In addition, we establish rigorous error bounds on the discrete approximation. These results are obtained by crucially using smoothing properties of the solution operators and suitable choice of a weighted $L^p(0,T)$ norm. The efficiency and accuracy of the scheme are showcased on several numerical experiments in one- and two-dimensions.

math.NA↗
arXiv2023

Electrical Impedance Tomography with Deep Calderón Method

Electrical impedance tomography (EIT) is a noninvasive medical imaging modality utilizing the current-density/voltage data measured on the surface of the subject. Calderón's method is a relatively recent EIT imaging algorithm that is non-iterative, fast, and capable of reconstructing complex-valued electric impedances. However, due to the regularization via low-pass filtering and linearization, the reconstructed images suffer from severe blurring and under-estimation of the exact conductivity values. In this work, we develop an enhanced version of Calderón's method, using {deep} convolution neural networks (i.e., U-net) {as an effective targeted post-processing step, and term the resulting method by deep Calderón's method.} Specifically, we learn a U-net to postprocess the EIT images generated by Calderón's method so as to have better resolutions and more accurate estimates of conductivity values. We simulate chest configurations with which we generate the current-density/voltage boundary measurements and the corresponding reconstructed images by Calderón's method. With the paired training data, we learn the deep neural network and evaluate its performance on real tank measurement data. The experimental results indicate that the proposed approach indeed provides a fast and direct (complex-valued) impedance tomography imaging technique, and substantially improves the capability of the standard Calderón's method.

math.NA↗
arXiv2023

Electrical Impedance Tomography: A Fair Comparative Study on Deep Learning and Analytic-based Approaches

Electrical Impedance Tomography (EIT) is a powerful imaging technique with diverse applications, e.g., medical diagnosis, industrial monitoring, and environmental studies. The EIT inverse problem is about inferring the internal conductivity distribution of an object from measurements taken on its boundary. It is severely ill-posed, necessitating advanced computational methods for accurate image reconstructions. Recent years have witnessed significant progress, driven by innovations in analytic-based approaches and deep learning. This review explores techniques for solving the EIT inverse problem, focusing on the interplay between contemporary deep learning-based strategies and classical analytic-based methods. Four state-of-the-art deep learning algorithms are rigorously examined, harnessing the representational capabilities of deep neural networks to reconstruct intricate conductivity distributions. In parallel, two analytic-based methods, rooted in mathematical formulations and regularisation techniques, are dissected for their strengths and limitations. These methodologies are evaluated through various numerical experiments, encompassing diverse scenarios that reflect real-world complexities. A suite of performance metrics is employed to assess the efficacy of these methods. These metrics collectively provide a nuanced understanding of the methods' ability to capture essential features and delineate complex conductivity patterns. One novel feature of the study is the incorporation of variable conductivity scenarios, introducing a level of heterogeneity that mimics textured inclusions. This departure from uniform conductivity assumptions mimics realistic scenarios where tissues or materials exhibit spatially varying electrical properties. Exploring how each method responds to such variable conductivity scenarios opens avenues for understanding their robustness and adaptability.

cs.LG↗
arXiv2023

On the Approximation of Bi-Lipschitz Maps by Invertible Neural Networks

Invertible neural networks (INNs) represent an important class of deep neural network architectures that have been widely used in several applications. The universal approximation properties of INNs have also been established recently. However, the approximation rate of INNs is largely missing. In this work, we provide an analysis of the capacity of a class of coupling-based INNs to approximate bi-Lipschitz continuous mappings on a compact domain, and the result shows that it can well approximate both forward and inverse maps simultaneously. Furthermore, we develop an approach for approximating bi-Lipschitz maps on infinite-dimensional spaces that simultaneously approximate the forward and inverse maps, by combining model reduction with principal component analysis and INNs for approximating the reduced map, and we analyze the overall approximation error of the approach. Preliminary numerical results show the feasibility of the approach for approximating the solution operator for parameterized second-order elliptic problems.

math.NA↗
arXiv2023

Recovery of Multiple Parameters in Subdiffusion from One Lateral Boundary Measurement

This work is concerned with numerically recovering multiple parameters simultaneously in the subdiffusion model from one single lateral measurement on a part of the boundary, while in an incompletely known medium. We prove that the boundary measurement corresponding to a fairly general boundary excitation uniquely determines the order of the fractional derivative and the polygonal support of the diffusion coefficient, without knowing either the initial condition or the source. The uniqueness analysis further inspires the development of a robust numerical algorithm for recovering the fractional order and diffusion coefficient. The proposed algorithm combines small-time asymptotic expansion, analytic continuation of the solution and the level set method. We present extensive numerical experiments to illustrate the feasibility of the simultaneous recovery. In addition, we discuss the uniqueness of recovering general diffusion and potential coefficients from one single partial boundary measurement, when the boundary excitation is more specialized.

math.NA↗
arXiv2023

Image Reconstruction via Deep Image Prior Subspaces

Deep learning has been widely used for solving image reconstruction tasks but its deployability has been held back due to the shortage of high-quality training data. Unsupervised learning methods, such as the deep image prior (DIP), naturally fill this gap, but bring a host of new issues: the susceptibility to overfitting due to a lack of robust early stopping strategies and unstable convergence. We present a novel approach to tackle these issues by restricting DIP optimisation to a sparse linear subspace of its parameters, employing a synergy of dimensionality reduction techniques and second order optimisation methods. The low-dimensionality of the subspace reduces DIP's tendency to fit noise and allows the use of stable second order optimisation methods, e.g., natural gradient descent or L-BFGS. Experiments across both image restoration and tomographic tasks of different geometry and ill-posedness show that second order optimisation within a low-dimensional subspace is favourable in terms of optimisation stability to reconstruction fidelity trade-off.

cs.CV↗
arXiv2023

SVD-DIP: Overcoming the Overfitting Problem in DIP-based CT Reconstruction

The deep image prior (DIP) is a well-established unsupervised deep learning method for image reconstruction; yet it is far from being flawless. The DIP overfits to noise if not early stopped, or optimized via a regularized objective. We build on the regularized fine-tuning of a pretrained DIP, by adopting a novel strategy that restricts the learning to the adaptation of singular values. The proposed SVD-DIP uses ad hoc convolutional layers whose pretrained parameters are decomposed via the singular value decomposition. Optimizing the DIP then solely consists in the fine-tuning of the singular values, while keeping the left and right singular vectors fixed. We thoroughly validate the proposed method on real-measured $μ$CT data of a lotus root as well as two medical datasets (LoDoPaB and Mayo). We report significantly improved stability of the DIP optimization, by overcoming the overfitting to noise.

eess.IV↗
arXiv2023

Solving Elliptic Problems with Singular Sources using Singularity Splitting Deep Ritz Method

In this work, we develop an efficient solver based on neural networks for second-order elliptic equations with variable coefficients and singular sources. This class of problems covers general point sources, line sources and the combination of point-line sources, and has a broad range of practical applications. The proposed approach is based on decomposing the true solution into a singular part that is known analytically using the fundamental solution of the Laplace equation and a regular part that satisfies a suitable modified elliptic PDE with a smoother source, and then solving for the regular part using the deep Ritz method. A path-following strategy is suggested to select the penalty parameter for enforcing the Dirichlet boundary condition. Extensive numerical experiments in two- and multi-dimensional spaces with point sources, line sources or their combinations are presented to illustrate the efficiency of the proposed approach, and a comparative study with several existing approaches based on neural networks is also given, which shows clearly its competitiveness for the specific class of problems. In addition, we briefly discuss the error analysis of the approach.

math.NA↗
arXiv2023

Hybrid Neural-Network FEM Approximation of Diffusion Coefficient in Elliptic and Parabolic Problems

In this work we investigate the numerical identification of the diffusion coefficient in elliptic and parabolic problems using neural networks. The numerical scheme is based on the standard output least-squares formulation where the Galerkin finite element method (FEM) is employed to approximate the state and neural networks (NNs) act as a smoothness prior to approximate the unknown diffusion coefficient. A projection operation is applied to the NN approximation in order to preserve the physical box constraint on the unknown coefficient. The hybrid approach enjoys both rigorous mathematical foundation of the FEM and inductive bias / approximation properties of NNs. We derive \textsl{a priori} error estimates in the standard $L^2(Ω)$ norm for the numerical reconstruction, under a positivity condition which can be verified for a large class of problem data. The error bounds depend explicitly on the noise level, regularization parameter and discretization parameters (e.g., spatial mesh size, time step size, and depth, upper bound and number of nonzero parameters of NNs). We also provide extensive numerical experiments, indicating that the hybrid method is very robust for large noise when compared with the pure FEM approximation.

math.NA↗
arXiv2023

An Educated Warm Start For Deep Image Prior-Based Micro CT Reconstruction

Deep image prior (DIP) was recently introduced as an effective unsupervised approach for image restoration tasks. DIP represents the image to be recovered as the output of a deep convolutional neural network, and learns the network's parameters such that the output matches the corrupted observation. Despite its impressive reconstructive properties, the approach is slow when compared to supervisedly learned, or traditional reconstruction techniques. To address the computational challenge, we bestow DIP with a two-stage learning paradigm: (i) perform a supervised pretraining of the network on a simulated dataset; (ii) fine-tune the network's parameters to adapt to the target reconstruction task. We provide a thorough empirical analysis to shed insights into the impacts of pretraining in the context of image reconstruction. We showcase that pretraining considerably speeds up and stabilizes the subsequent reconstruction task from real-measured 2D and 3D micro computed tomography data of biological specimens. The code and additional experimental materials are available at https://educateddip.github.io/docs.educated_deep_image_prior/.

eess.IV↗
arXiv2023

Recovery of a Distributed Order Fractional Derivative in an Unknown Medium

In this work, we study an inverse problem of recovering information about the weight in distributed-order time-fractional diffusion from the observation at one single point on the domain boundary. In the absence of an explicit knowledge of the medium, we prove that the one-point observation can uniquely determine the support bound of the weight. The proof is based on asymptotics of the data, analytic continuation and Titchmarch convolution theorem. When the medium is known, we give an alternative proof of an existing result, i.e., the one-point boundary observation uniquely determines the weight. Several numerical experiments are also presented to complement the analysis.

math.NA↗
arXiv2022

Convergence Rate Analysis of Galerkin Approximation of Inverse Potential Problem

In this work we analyze the inverse problem of recovering the space-dependent potential coefficient in an elliptic / parabolic problem from distributed observation. We establish novel (weighted) conditional stability estimates under very mild conditions on the problem data. Then we provide an error analysis of a standard reconstruction scheme based on the standard output least-squares formulation with Tikhonov regularization (by an $H^1$-seminorm penalty), which is then discretized by the Galerkin finite element method with continuous piecewise linear finite elements in space (and also backward Euler method in time for parabolic problems). We present a detailed analysis of the discrete scheme, and provide convergence rates in a weighted $L^2(Ω)$ for discrete approximations with respect to the exact potential. The error bounds are explicitly dependent on the noise level, regularization parameter and discretization parameter(s). Under suitable conditions, we also derive error estimates in the standard $L^2(Ω)$ and interior $L^2$ norms. The analysis employs sharp a priori error estimates and nonstandard test functions. Several numerical experiments are given to complement the theoretical analysis.

math.NA↗
arXiv2022

Uncertainty Estimation for Computed Tomography with a Linearised Deep Image Prior

Existing deep-learning based tomographic image reconstruction methods do not provide accurate estimates of reconstruction uncertainty, hindering their real-world deployment. This paper develops a method, termed as the linearised deep image prior (DIP), to estimate the uncertainty associated with reconstructions produced by the DIP with total variation regularisation (TV). Specifically, we endow the DIP with conjugate Gaussian-linear model type error-bars computed from a local linearisation of the neural network around its optimised parameters. To preserve conjugacy, we approximate the TV regulariser with a Gaussian surrogate. This approach provides pixel-wise uncertainty estimates and a marginal likelihood objective for hyperparameter optimisation. We demonstrate the method on synthetic data and real-measured high-resolution 2D $μ$CT data, and show that it provides superior calibration of uncertainty estimates relative to previous probabilistic formulations of the DIP. Our code is available at https://github.com/educating-dip/bayes_dip.

eess.IV↗
arXiv2022

Inverse Problems for Subdiffusion from Observation at an Unknown Terminal Time

Inverse problems of recovering space-dependent parameters, e.g., initial condition, space-dependent source or potential coefficient, in a subdiffusion model from the terminal observation have been extensively studied in recent years. However, all existing studies have assumed that the terminal time at which one takes the observation is exactly known. In this work, we present uniqueness and stability results for three canonical inverse problems, e.g., backward problem, inverse source and inverse potential problems, from the terminal observation at an unknown time. The subdiffusive nature of the problem indicates that one can simultaneously determine the terminal time and space-dependent parameter. The analysis is based on explicit solution representations, asymptotic behavior of the Mittag-Leffler function, and mild regularity conditions on the problem data. Further, we present several one- and two-dimensional numerical experiments to illustrate the feasibility of the approach.

math.NA↗
arXiv2022

Recovery of a Space-Time Dependent Diffusion Coefficient in Subdiffusion: Stability, Approximation and Error Analysis

In this work, we study an inverse problem of recovering a space-time dependent diffusion coefficient in the subdiffusion model from the distributed observation, where the mathematical model involves a Djrbashian-Caputo fractional derivative of order $α\in(0,1)$ in time. The main technical challenges of both theoretical and numerical analysis lie in the limited smoothing properties due to the fractional differential operator and high degree of nonlinearity of the forward map from the unknown diffusion coefficient to the distributed observation. We establish two conditional stability results using a novel test function, which leads to a stability bound in $L^2(0,T;L^2(Ω))$ under a suitable positivity condition. The positivity condition is verified for a large class of problem data. Numerically, we develop a rigorous procedure for recovering the diffusion coefficient based on a regularized least-squares formulation, which is then discretized by the standard Galerkin method with continuous piecewise linear elements in space and backward Euler convolution quadrature in time. We provide a complete error analysis of the fully discrete formulation, by combining several new error estimates for the direct problem (optimal in terms of data regularity), a discrete version of fractional maximal $L^p$ regularity, and a nonstandard energy argument. Under the positivity condition, we obtain a standard $\ell^2(L^2(Ω))$ error estimate consistent with the conditional stability. Further, we illustrate the analysis with some numerical examples.

math.NA↗
arXiv2022

Unsupervised Knowledge-Transfer for Learned Image Reconstruction

Deep learning-based image reconstruction approaches have demonstrated impressive empirical performance in many imaging modalities. These approaches usually require a large amount of high-quality paired training data, which is often not available in medical imaging. To circumvent this issue we develop a novel unsupervised knowledge-transfer paradigm for learned reconstruction within a Bayesian framework. The proposed approach learns a reconstruction network in two phases. The first phase trains a reconstruction network with a set of ordered pairs comprising of ground truth images of ellipses and the corresponding simulated measurement data. The second phase fine-tunes the pretrained network to more realistic measurement data without supervision. By construction, the framework is capable of delivering predictive uncertainty information over the reconstructed image. We present extensive experimental results on low-dose and sparse-view computed tomography showing that the approach is competitive with several state-of-the-art supervised and unsupervised reconstruction techniques. Moreover, for test data distributed differently from the training data, the proposed framework can significantly improve reconstruction quality not only visually, but also quantitatively in terms of PSNR and SSIM, when compared with learned methods trained on the synthetic dataset only.

eess.IV↗
arXiv2022

Bayesian Experimental Design for Computed Tomography with the Linearised Deep Image Prior

We investigate adaptive design based on a single sparse pilot scan for generating effective scanning strategies for computed tomography reconstruction. We propose a novel approach using the linearised deep image prior. It allows incorporating information from the pilot measurements into the angle selection criteria, while maintaining the tractability of a conjugate Gaussian-linear model. On a synthetically generated dataset with preferential directions, linearised DIP design allows reducing the number of scans by up to 30% relative to an equidistant angle baseline.

cs.CV↗