Fast Algorithms for Hyperspectral Diffuse Optical Tomography
From MaRDI portal
Publication:3447464
Abstract: The image reconstruction of chromophore concentrations using Diffuse Optical Tomography (DOT) data can be described mathematically as an ill-posed inverse problem. Recent work has shown that the use of hyperspectral DOT data, as opposed to data sets comprising of a single or, at most, a dozen wavelengths, has the potential for improving the quality of the reconstructions. The use of hyperspectral diffuse optical data in the formulation and solution of the inverse problem poses a significant computational burden. The forward operator is, in actuality, nonlinear. However, under certain assumptions, a linear approximation, called the Born approximation, provides a suitable surrogate for the forward operator, and we assume this to be true in the present work. Computation of the Born matrix requires the solution of thousands of large scale discrete PDEs and the reconstruction problem, requires matrix-vector products with the (dense) Born matrix. In this paper, we address both of these difficulties, thus making the Born approach a computational viable approach for hyDOT reconstruction. In this paper, we assume that the images we wish to reconstruct are anomalies of unknown shape and constant value, described using a parametric level set approach, (PaLS) on a constant background. Specifically, to address the issue of the PDE solves, we develop a novel recycling-based Krylov subspace approach that leverages certain system similarities across wavelengths. To address expense of using the Born operator in the inversion, we present a fast algorithm for compressing the Born operator that locally compresses across wavelengths for a given source-detector set and then recursively combines the low-rank factors to provide a global low-rank approximation. This low-rank approximation can be used implicitly to speed up the recovery of the shape parameters and the chromophore concentrations.
Recommendations
- A fast and accurate imaging algorithm in optical/diffusion tomography
- Efficient reliable image reconstruction schemes for diffuse optical tomography
- Computational spectral and ultrafast imaging via convex optimization
- Acceleration of the EM-like reconstruction method for diffuse optical tomography with ordered-subsets method
- Domain decomposition method for diffuse optical tomography problems
- Numerical implementation of the convexification algorithm for an optical diffusion tomograph
- Linearized reconstruction for diffuse optical spectroscopic imaging
- Fast Approximation of Algebraic Reconstruction Methods for Tomography
Cites work
- A Newton-CG method for large-scale three-dimensional elastic full-waveform seismic inversion
- A one-step reconstruction algorithm for quantitative photoacoustic imaging
- A randomized algorithm for the decomposition of matrices
- A regularized Gauss-Newton trust region approach to imaging in diffuse optical tomography
- A supernodal approach to incomplete LU factorization with partial pivoting
- A survey of projection-based model reduction methods for parametric dynamical systems
- A theory of pseudoskeleton approximations
- Accelerating optimization of parametric linear systems by model order reduction
- Adaptive low-rank approximation of collocation matrices
- Analysis and Exploitation of Matrix Structure Arising in Linearized Optical Tomographic Imaging
- Approximation of boundary element matrices
- DOLFIN: automated finite element computing
- Electrical Impedance Tomography
- FaIMS: a fast algorithm for the inverse medium problem with multiple frequencies and multiple sources for the scalar Helmholtz equation
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Finite element mass matrix lumping by numerical integration with no convergence rate loss
- Galerkin Projection Methods for Solving Multiple Linear Systems
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- Large-scale topology optimization using preconditioned Krylov subspace methods with recycling
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- New estimates for the recursive low-rank truncation of block-structured matrices
- Numerical methods for large eigenvalue problems
- Optical tomography in medical imaging
- Optical tomography: forward and inverse problems
- Parametric level set methods for inverse problems
- Randomized algorithms for the low-rank approximation of matrices
- Rank-deficient nonlinear least squares problems and subset selection
- Recent computational developments in Krylov subspace methods for linear systems
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Recycling Krylov subspaces for efficient large-scale electrical impedance tomography
- Recycling Subspace Information for Diffuse Optical Tomography
- Spectral Methods for Parameterized Matrix Equations
Cited in
(7)- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- Dynamic systems and intelligent algorithms for computing hemoglobin fractions concentrations
- Optical property inversion of biological materials using Fourier series expansion and LS-SVM for hyperspectral imaging
- A survey of subspace recycling iterative methods
- Analysis and Exploitation of Matrix Structure Arising in Linearized Optical Tomographic Imaging
- jInv -- a flexible Julia package for PDE parameter estimation
- Computing reduced order models via inner-outer Krylov recycling in diffuse optical tomography
This page was built for publication: Fast Algorithms for Hyperspectral Diffuse Optical Tomography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447464)
