Full domain-decomposition scheme for diffuse optical tomography of large-sized tissues with a combined CPU and GPU parallelization

A simple algorithm for diffuse optical tomography without Jacobian inversion

A computationally simpler algorithm to reconstruct the optical property distribution of turbid media using diffuse optical tomographic principles is presented. The proposed algorithm eliminates the requirement of large Jacobian matrix inversion which otherwise is essential for tomographic imaging. The most significant Jacobians are identified based on proper thresholding of the measurement and the intersection of these Jacobians gives the approximate spatial location of the inhomogeneity. The algorithm is tested and optimized using simulations and further validated using tissue-mimicking phantom-based experiments andin-vivosmall-animal experiments.

Toward real-time diffuse optical tomography: accelerating light propagation modeling employing parallel computing on GPU and CPU

Parameter recovery in diffuse optical tomography is a computationally expensive algorithm, especially when used for large and complex volumes, as in the case of human brain functional imaging. The modeling of light propagation, also known as the forward problem, is the computational bottleneck of the recovery algorithm, whereby the lack of a real-time solution is impeding practical and clinical applications. The objective of this work is the acceleration of the forward model, within a diffusion approximation-based finite-element modeling framework, employing parallelization to expedite the calculation of light propagation in realistic adult head models. The proposed methodology is applicable for modeling both continuous wave and frequency-domain systems with the results demonstrating a 10-fold speed increase when GPU architectures are available, while maintaining high accuracy. It is shown that, for a very high-resolution finite-element model of the adult human head with ∼600,000 nodes, consisting of heterogeneous layers, light propagation can be calculated at ∼0.25  s/excitation source.

Accelerating nonlinear reconstruction in laminar optical tomography by use of recursive SVD inversion

Image reconstruction in the most model-based biophotonic imaging modalities essentially poses an ill-posed nonlinear inverse problem, which has been effectively tackled in the diffusion-approximation-satisfied scenarios such as diffuse optical tomography. Nevertheless, a nonlinear implementation in high-resolution laminar optical tomography (LOT) is normally computationally-costly due to its strong dependency on a dense source-detector configuration and a physically-rigorous photon-transport model. To circumvent the adversity, we herein propose a practical nonlinear LOT approach to the absorption reconstruction. The scheme takes advantage of the numerical stability of the singular value decomposition (SVD) for the ill-posed linear inversion, and is accelerated by adopting an explicitly recursive strategy for the time-consuming repeated SVD inversion, which is based on a scaled expression of the sensitivity matrix. Experiments demonstrate that the proposed methodology can perform as well as the traditional nonlinear one, while the computation time of the former is merely 26.27% of the later on average.

Fast and efficient image reconstruction for high density diffuse optical imaging of the human brain

Real-time imaging of human brain has become an important technique within neuroimaging. In this study, a fast and efficient sensitivity map generation based on Finite Element Models (FEM) is developed which utilises a reduced sensitivitys matrix taking advantage of sparsity and parallelisation processes. Time and memory efficiency of these processes are evaluated and compared with conventional method showing that for a range of mesh densities from 50000 to 320000 nodes, the required memory is reduced over tenfold and computational time fourfold allowing for near real-time image recovery.

Full time-resolved diffuse fluorescence tomography accelerated with parallelized Fourier-series truncated diffusion approximation

Of the three measurement schemes established for diffuse fluorescence tomography (DFT), the time-domain scheme is well known to provide the richest information about the distribution of the targeting fluorophore in living tissues. However, the explicit use of the full time-resolved data usually leads to a considerably lengthy time for image reconstruction, limiting its applications to three-dimensional or small-volume imaging. To cope with the adversity, we propose herein a computationally efficient scheme for DFT image reconstruction where the time-dependent photon density is expanded to a Fourier-series and calculated by solving the independent frequency-domain diffusion equations at multiple sampling frequencies with the support of a combined multicore CPU-based coarse-grain and multithread GPU-based fine-grain parallelization strategy. With such a parallelized Fourier-series truncated diffusion approximation, both the time- and frequency-domain inversion procedures are developed and validated for their effectiveness and accuracy using simulative and phantom experiments. The results show that the proposed method can generate reconstructions comparable to the explicit time-domain scheme, with significantly reduced computational time.