Translational Molecular Imaging Computing: Advances in Theories and ApplicationsView this Special Issue
Fast and Robust Reconstruction for Fluorescence Molecular Tomography via Regularization
Sparse reconstruction inspired by compressed sensing has attracted considerable attention in fluorescence molecular tomography (FMT). However, the columns of system matrix used for FMT reconstruction tend to be highly coherent, which means minimization may not produce the sparsest solution. In this paper, we propose a novel reconstruction method by minimization of the difference of and norms. To solve the nonconvex minimization problem, an iterative method based on the difference of convex algorithm (DCA) is presented. In each DCA iteration, the update of solution involves an minimization subproblem, which is solved by the alternating direction method of multipliers with an adaptive penalty. We investigated the performance of the proposed method with both simulated data and in vivo experimental data. The results demonstrate that the DCA for minimization outperforms the representative algorithms for , , , and when the system matrix is highly coherent.
Fluorescence molecular tomography (FMT) has become a promising molecular imaging modality since it has the ability to provide localization and quantitative analysis of the fluorescent probe for preclinical research [1, 2]. However, FMT reconstruction suffers from high ill-posedness due to the insufficiency of external measurements, which is caused by high absorption and scattering in photon propagation through biological tissues .
To alleviate the ill-posedness of FMT, some a priori information, such as anatomical information, optical properties, permissible region, and sparsity of target distribution, has been successfully incorporated in FMT reconstruction [4–7]. In addition, many regularization techniques have also been devoted to get an accurate and stable solution. Conventionally, norm regularizer is a common penalty term in spite of its over-smoothness and results with lower resolution . Another common regularizer is norm, which is nondeterministic polynomial (NP) hard and can be solved by a greedy approach such as the orthogonal matching pursuit (OMP) . Inspired by compressive sensing (CS) theory, the norm regularizer as the convex relaxation of has become a widely used sparsity-inducing norm for FMT reconstruction [10–13]. However, norm regularizer is not always providing the sparsest solution for the inverse problem of FMT . This gives way to nonconvex () norm regularizer, which has been applied to optical tomography and was found to have better results than does . Some comparative studies show that nonconvex () norm regularizer with near 1/2 performs the best result among regularizers of () norm .
Recently, a new nonconvex regularizer named has been proposed and produced better solution than () norm regularizer when the sensing matrix was large and highly coherent [17, 18]. The Magnetic Resonance Imaging (MRI) image recovery tests have also indicated that norm regularizer outperforms and for highly coherent matrix . Meanwhile, the columns of system matrix used for FMT reconstruction are also highly coherent with the finite element computing framework .
In this paper, new norm regularization was proposed to improve the FMT imaging. In our method, a difference of convex algorithm (DCA) was presented to solve the nonconvex minimization problem. And the alternating direction method of multipliers (ADMM) with an adaptive penalty was used to solve the subproblem with fast convergence for each DCA iteration. The performance of the proposed method was validated with simulated data and in vivo experimental data.
The outline of this paper is as follows. Section 2 elaborates the forward model and norm regularization algorithm. Section 3 demonstrates the feasibility and effectiveness of the method with both simulated data and in vivo experimental data. Finally, we conclude the paper and discuss relevant issues in Section 4.
2.1. Light Propagation Model
As an approximation to Radiative Transfer Equation (RTE), the Diffusion Approximation associated with Robin boundary conditions has been widely used for modeling the light transportation in biological tissues [20, 21]. For steady-state FMT with point excitation sources, the coupled diffusion equations can be presented as follows:where subscript and denote excitation light and emission light, respectively. is the domain under consideration. and are diffusion coefficients with , as absorption coefficients for excitation and emission wavelengths, is the anisotropy parameter, and , are the reduced scattering coefficients. and denote the photon density. is the unknown fluorescent yield to be reconstructed. Using the finite elements method (FEM), (1) can be linearly discretized as follows:where and denote the system matrix at excitation and emission wavelengths, respectively. The symmetric matrix is obtained by discretizing the unknown fluorescent yield distribution. The final linear relationship between the unknown fluorescence yield and the measured surface data can be obtained as follows:where is linear system matrix which is large-sized and ill-posed.
2.2. Inverse Reconstruction of FMT by DCA- Algorithm
The CS theory provides sufficient conditions for the exact recovery of the sparse signals from limited number of measurements. One commonly used concept is the mutual coherence [17, 22] which is defined aswhere and are different columns of . The mutual coherence of system matrix derived by FEM method is always as high as above 90% . In the highly coherent regime of CS, () and norm regularizers are expected to yield the sparest solution that regularization always fails to [17, 18].
Recently, a DCA- algorithm was proposed and theoretical properties of minimization have been proved in papers [17, 23]. Considering the advantages of minimization, we converted linear matrix equation (3) into the following unconstrained optimization problem:where is a regularization parameter which is usually empirically selected and denotes the regularization operator.
To resolve minimization problem (5), the difference of convex algorithm (DCA)  which is a descent method without line search was used. Equation (5) can be decomposed into DC decomposition as , where
In (6), is differentiable with gradient . An iterative scheme was used to solve as follows:
In each DCA iteration, there is a -regularized convex subproblem that needs to be solved:
We use the augmented Lagrangian method and transform (8) into the following:
The subproblem is solved by minimizing with respect to , minimizing with respect to , and updating successively. In order to solve (9) with a fast speed of convergence, an ADMM strategy with an adaptive penalty  was utilized as follows:
In the above iterations, the update of is based on the soft-thresholding operator, where
Meanwhile, the penalty was updated as an adaptive form as follows:where is an upper bound of and is defined as follows:where is a constant.
Algorithm 1 presents the iterative process of DCA- algorithm for FMT reconstruction. To begin with the iteration, the initial value was set as subproblem.
3. Experiments and Results
In this section, the simulations both on 3D digital mouse model and in vivo experiments were used to demonstrate the potential and feasibility of the DCA- algorithm for FMT reconstruction. To investigate the performance of DCA- algorithm, four representative regularizers, including , , , and , were used for a systematical comparison. More specifically, iterative reweighted least squares algorithm (IRLS-) , incomplete variables truncated conjugate gradient algorithm (IVTCG-) , Tikhonov regularization algorithm (Tikhonov-) , and OMP algorithm  were compared with the DCA- algorithm, respectively, as the corresponding method for the above regularizers.
The qualities of reconstruction results are quantitatively evaluated in terms of the absolute location error (LE) , reconstructed fluorescent yield (Recon. FY) , normalized root mean square error (NRMSE) , the percentage of nonzero coefficient (PNZ) , and time cost. The experiment codes were written in MATLAB and were performed on a desktop computer with 3.40 GHz Intel® Xeon® Processor E3-1231 and 12 G RAM.
3.1. Numerical Simulation Experiments
A 33 mm height torso extracted from a 3D mouse atlas was utilized to simulate the heterogeneity of biological tissues . Figure 1(a) shows the mouse model with six organs. Table 1 lists the specific optical parameters. A cylinder with a radius of 0.8 mm and a height of 1.6 mm was positioned at 17.8, 6.6, and 16.4 mm to mimic the fluorescent target. The actual fluorescent yield was set to be 0.05 mm−1. For excitation, we used 18 excitation sources being located on the plane of mm as shown in Figure 2(a). The surface data on the opposite side with a 120° field of view (FOV) were measured for each excitation source. A total of 18 datasets were assembled for the subsequent reconstruction process.
(a) 3D mouse with single target
(a) The plane of excitation source of
The forward FEM mesh was discretized into 24231 nodes and 128300 tetrahedral elements. Meanwhile, the FEM mesh for inverse reconstruction was discretized into 2601 nodes and 12752 tetrahedral elements. The mutual coherence of the system matrix for inverse reconstruction was 99.96%.
Figures 1(b)–1(f) present a comparison of reconstruction results with 3D views for single fluorescent target. The corresponding 2D section-views on the excitation plane are demonstrated in Figures 2(b)–2(f). Table 2 gives the quantitative results of the five regularization methods.
As shown in Figures 1(b)–1(f), Figures 2(b)–2(f), and Table 2, reconstruction results of and were remarkable. Compared to the other three methods, results of DCA- and IRLS- have fewer artifacts, lower LE, lower NRMSE, and lower PNZ. Meanwhile, the Recon. FY by DCA- and IRLS- were closer to 0.05 mm−1. The proposed DCA- completely outperforms the other methods, except for a slightly larger time consumption compared to OMP.
Generally speaking, the quality of FMT reconstruction is influenced by the number of excitation sources. To test the stability of the algorithm, different numbers of excitation sources were used for reconstruction. Table 3 gives the corresponding reconstructed results with 18, 12, 8, and 4. Obviously, the decreased number of excitation sources leads to significant reduction of measurements. Nevertheless, the results of DCA- are generally satisfactory even in the case of 4 excitation sources.
The quality of reconstructed results is sensitive to measurement noise because of the severe ill-condition of system matrix. For stability test, four different levels of Gaussian noise (5%, 15%, 25%, and 35%) were added to the synthetic measurements. Table 4 shows the reconstruction results under 4 different noise levels. It shows that the DCA- algorithm is quite resilient with Gaussian noise.
3.2. In Vivo Evaluation with Implanted Fluorophore
The performance of DCA- and IRLS- was remarkably compared to the other three methods in the simulation experiments. In this section, we further evaluated the performance of the proposed algorithm with in vivo experimental data .
In this experiment, an adult BALB/C mouse with a glass tube implanted into its abdomen was used. The experimental data was acquired by a hybrid FMT/Micro-CT system . The glass tube (0.6 mm and the height of 2.8 mm) was filled with Cy5.5 solution (with the extinction coefficient of about 0.019 mm−1 and quantum efficiency of 0.23 at the peak excitation wavelength of 671 nm) . The center of the target was determined at 21.1, 27.8, and 7.4 mm by the Micro-CT. The fluorescent yield of Cy5.5 was 0.0402 mm−1 . For reconstruction, the CT data was segmented into five major anatomical components, including muscle, heart, lungs, liver, and kidneys. Table 5 shows the optical properties of different organs .
For inverse reconstruction, the segmented mouse torso data was discretized into a mesh with 3049 nodes and 14932 tetrahedral elements. Mutual coherence of the system matrix for inverse reconstruction was 99.87%. Comparison results between DCA- and IRLS- are shown in Table 6 and Figure 3. The 3D views of reconstructed results for in vivo experiments via DCA- are shown in Figure 4.
4. Discussion and Conclusion
In this paper, novel norm regularization was proposed to solve the inverse problem of FMT with highly coherent system matrix. To accurately recover the small fluorescent target, an iterative method based on DCA algorithm was presented to solve the nonconvex minimization problem. And the ADMM method with an adaptive penalty was used to get fast convergence for the subproblem.
Simulated data on a 3D heterogeneous mouse model and in vivo experimental data acquired by a hybrid FMT/Micro-CT system were used to demonstrate the feasibility of the DCA- algorithm for FMT. The comparative results of single target show that the DCA- algorithm has better performance compared to other typical algorithms based on , , , and norm regularizer. The robustness tests further illustrate that the DCA- algorithm is stable and robust to measurement noise. In addition, decreasing the number of excitation sources from 18 to 4, DCA- still yields satisfactory results.
However, the reconstructed fluorescent yield of the proposed method was still smaller than the true value. So new strategies that may further improve fluorescent yield will be our future research focuses. Moreover, we will also focus on investigating the multitargets resolution and new application of norm regularizer in other imaging modalities in the near future.
In conclusion, both numerical experiments and in vivo experiments validated the good performance of regularizer for FMT. Moreover, comparative experiments indicate that outperforms the iterative reweighted strategies for with when system matrix is highly coherent.
The authors declare that there is no conflict of interests regarding the publication of this paper.
The authors would like to thank the School of Life Science and Technology of Xidian University for providing experimental data acquisition system. This work was supported by the National Natural Science Foundation of China under Grant nos. 61372046 and 11571012 and the Science and Technology Plan Program in Shaanxi Province of China under Grant no. 2015KW-002.
X. He, F. Dong, J. Yu, H. Guo, and Y. Hou, “Reconstruction algorithm for fluorescence molecular tomography using sorted L-one penalized estimation,” Journal of the Optical Society of America A: Optics, Image Science, and Vision, vol. 32, no. 11, pp. 1928–1935, 2015.View at: Publisher Site | Google Scholar
J. Shi, X. Cao, F. Liu, B. Zhang, J. Luo, and J. Bai, “Greedy reconstruction algorithm for fluorescence molecular tomography by means of truncated singular value decomposition conversion,” Journal of the Optical Society of America A, vol. 30, no. 3, pp. 437–447, 2013.View at: Publisher Site | Google Scholar
F. Yang, M. S. Ozturk, L. Zhao et al., “High-resolution mesoscopic fluorescence molecular tomography based on compressive sensing,” IEEE Transactions on Bio-Medical Engineering, vol. 62, no. 1, pp. 248–255, 2015.View at: Google Scholar
Z. Lin, R. Liu, and Z. Su, “Linearized alternating directional method with adaptive penalty for low-rank representation,” in Advances in Neural Information Processing Systems, pp. 612–620, 2011.View at: Google Scholar
M. A. Naser and M. S. Patterson, “Improved bioluminescence and fluorescence reconstruction algorithms using diffuse optical tomography, normalized data, and optimized selection of the permissible source region,” Biomedical Optics Express, vol. 2, no. 1, pp. 169–184, 2011.View at: Publisher Site | Google Scholar