A Graph-guided Hybrid Regularization Method For Bioluminescence Tomography

Abstract

Background and objective: Bioluminescence tomography (BLT) is a powerful and sensitive imaging technique having great potential in preclinical application, such as tumor imaging, monitoring and therapy, etc. Regularization plays an important role in BLT reconstruction for considering the priori information to overcome the inherent ill-posedness of the inverse problem. Therefore, well-designed regularization term and sophisticated algorithm for solving the consequent optimization problem are key to improve the BLT quality.Methods: To balance the sparsity, smoothness and morphological characteristics of the bioluminescence targets, we constructed a novel Graph-Guided Hybrid Regularization (GGHR) method by combining graph-guided penalty term with L1 and L2 norm regularizer. To solve the corresponding minimization problem with hybrid penalties, the dual decomposition and Nesterov’s smoothing technique were adopted to decouple and transform the non-separable and non-smooth graph-guided penalty term into a differential smooth approximation form, which was solved by the fast iterative shrinkage thresholding algorithm.Results: The performance of the proposed GGHR method was verified and evaluated through a series of simulation, phantom and in vivo experiments. The comparison results demonstrated that the GGHR method outperformed current mainstream reconstruction algorithms in spatial localization, morphology recovery and in vivo practicality.Conclusions: The proposed GGHR method is a robust and practicality reconstruction algorithm for further highlighting the positive effect of hybrid regularization on BLT applications.