Although the quality of reconstructed results can be improved with the increment of the number of measurements, the scale of the matrices involved in the reconstruction of fluorescence molecular tomography (FMT) will become larger, which leads to the poor efficiency of the process of tomographic image reconstruction. In this paper, we proposed a new method for image reconstruction of FMT based on compressed sensing, in which a scheme of grouped sources is incorporated. The forward equations are implemented using the finite element method (FEM). The reconstruction model is formulated under the framework of compressed sensing theory. The regularization term and the total variation penalty are incorporated in the objective function. During the reconstruction of FMT, the sources are divided into two groups for iteration in turn. One group of sources is employed in the first iteration of inverse problem, and the other group is employed in the next iteration. Simulation results demonstrate that the computation time and mean square error (MSE) of the reconstruction with our algorithm are less than those with the traditional method. The proposed algorithm can reconstruct the target with enhanced contrast and more accurate shape. The proposed algorithm can significantly improve the speed and accuracy of the reconstruction of FMT. Furthermore, our compressed-sensing-based method can reduce the number of measurements.
Background: The inverse problem of fluorescent molecular tomography (FMT) often involves complex large-scale matrix operations, which may lead to unacceptable computational errors and complexity. In this research, a tree structured Schur complement decomposition strategy is proposed to accelerate the reconstruction process and reduce the computational complexity. Additionally, an adaptive regularization scheme is developed to improve the ill-posedness of the inverse problem.Methods: The global system is decomposed level by level with the Schur complement system along two paths in the tree structure. The resultant subsystems are solved in combination with the biconjugate gradient method. The mesh for the inverse problem is generated incorporating the prior information. During the reconstruction, the regularization parameters are adaptive not only to the spatial variations but also to the variations of the objective function to tackle the ill-posed nature of the inverse problem.Results: Simulation results demonstrate that the strategy of the tree structured Schur complement decomposition obviously outperforms the previous methods, such as the conventional Conjugate-Gradient (CG) and the Schur CG methods, in both reconstruction accuracy and speed. As compared with the Tikhonov regularization method, the adaptive regularization scheme can significantly improve ill-posedness of the inverse problem.Conclusions: The methods proposed in this paper can significantly improve the reconstructed image quality of FMT and accelerate the reconstruction process.
1 January 2013 in International Journal of Bioscience, Biochemistry and Bioinformatics
Fluorescent molecular tomography (FMT) aims at reconstructing the spatial map of optical and fluorescence parameters from fluence measurements. Basically, solving large-scale matrix equations is computationally expensive for image reconstruction of FMT. Despite the reconstruction quality can be improved with more sources, it may result in higher computational costs for reconstruction. This article presents a novel method in the wavelet domain with rotated sources illumination. We use the finite element method for the computation of the forward model. The global inverse problem is solved based on wavelet in conjunction with principal component analysis. The iterative reconstruction is implemented with sources rotated in a certain angle. The original excitation light sources are used to reconstruct the image in the first iteration. Then, upon the sources are rotated by a certain angle, they are employed for the next iteration of reconstruction. Simulation results demonstrate that our method can considerably reduce the time taken for the computation of inverse problem in FMT. Furthermore, the approach proposed is also shown to largely outperform the traditional method in terms of the precision of inverse solutions. Our method has the capability to locate the inclusions. The proposed method can significantly speed up the reconstruction process with the high reconstruction quality.