Fast and Robust Reconstruction for Fluorescence Molecular Tomography viaL1-2Regularization
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 meansL1minimization may not produce the sparsest solution. In this paper, we propose a novel reconstruction method by minimization of the difference ofL1andL2norms. To solve the nonconvexL1-2minimization problem, an iterative method based on the difference of convex algorithm (DCA) is presented. In each DCA iteration, the update of solution involves anL1minimization 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 andin vivoexperimental data. The results demonstrate that the DCA forL1-2minimization outperforms the representative algorithms forL1,L2,L1/2, andL0when the system matrix is highly coherent.