A Graph-guided Hybrid Regularization Method For Bioluminescence Tomography. (March 2023)
- Record Type:
- Journal Article
- Title:
- A Graph-guided Hybrid Regularization Method For Bioluminescence Tomography. (March 2023)
- Main Title:
- A Graph-guided Hybrid Regularization Method For Bioluminescence Tomography
- Authors:
- Chu, Mengxiang
Guo, Hongbo
He, Xuelei
Wang, Beilei
Liu, Yanqiu
Hu, Xiangong
Yu, Jingjing
He, Xiaowei - Abstract:
- Highlights: The graph-guided-sparsity-inducing penalty can strengthen the bioluminescent energy spatial aggregation and relation, since it reflects not only the non-linear inverse relationship between bioluminescent energy deviation and their distance for any two nodes, but also the connection between the local bioluminescent energy clusters consisting of multiple the nearest adjacent nodes. The GGHR method based on three constraints (sparsity, smoothness, graph-guided penalty) can better balance the sparsity, smoothness and morphological characteristics of the bioluminescence targets. Dual decomposition and Nesterov's smoothing technique are used to provide an efficient optimization approach for solving the non-separable and non-smooth constrain problem. The GGHR method can effectively alleviate the ill-posed inverse problem. The GGHR method performs well in spatial location, morphology and bioluminescent energy recovery and preclinical practicality. 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 BLTHighlights: The graph-guided-sparsity-inducing penalty can strengthen the bioluminescent energy spatial aggregation and relation, since it reflects not only the non-linear inverse relationship between bioluminescent energy deviation and their distance for any two nodes, but also the connection between the local bioluminescent energy clusters consisting of multiple the nearest adjacent nodes. The GGHR method based on three constraints (sparsity, smoothness, graph-guided penalty) can better balance the sparsity, smoothness and morphological characteristics of the bioluminescence targets. Dual decomposition and Nesterov's smoothing technique are used to provide an efficient optimization approach for solving the non-separable and non-smooth constrain problem. The GGHR method can effectively alleviate the ill-posed inverse problem. The GGHR method performs well in spatial location, morphology and bioluminescent energy recovery and preclinical practicality. 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 L 1 and L 2 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. … (more)
- Is Part Of:
- Computer methods and programs in biomedicine. Volume 230(2023)
- Journal:
- Computer methods and programs in biomedicine
- Issue:
- Volume 230(2023)
- Issue Display:
- Volume 230, Issue 2023 (2023)
- Year:
- 2023
- Volume:
- 230
- Issue:
- 2023
- Issue Sort Value:
- 2023-0230-2023-0000
- Page Start:
- Page End:
- Publication Date:
- 2023-03
- Subjects:
- Bioluminescence tomography -- Graph-guided hybrid regularization -- Smooth approximation -- Morphology recovery -- Spatial localization
Medicine -- Computer programs -- Periodicals
Biology -- Computer programs -- Periodicals
Computers -- Periodicals
Medicine -- Periodicals
Médecine -- Logiciels -- Périodiques
Biologie -- Logiciels -- Périodiques
Biology -- Computer programs
Medicine -- Computer programs
Periodicals
Electronic journals
610.28 - Journal URLs:
- http://www.sciencedirect.com/science/journal/01692607 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cmpb.2022.107329 ↗
- Languages:
- English
- ISSNs:
- 0169-2607
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.095000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 25945.xml