Search

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 L1 minimization may not produce the sparsest solution. In this paper, we propose a novel reconstruction method by minimization of the difference of L1 and L2 norms. To solve the nonconvex L1-2 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 L1 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 L1-2 minimization outperforms the representative algorithms for L1, L2, L1/2, and L0 when the system matrix is highly coherent. [ABSTRACT FROM AUTHOR]

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 L 1 minimization may not produce the sparsest solution. In this paper, we propose a novel reconstruction method by minimization of the difference of L 1 and L 2 norms. To solve the nonconvex L 1-2 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 L 1 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 L 1-2 minimization outperforms the representative algorithms for L 1 , L 2 , L 1/2 , and L 0 when the system matrix is highly coherent., Competing Interests: The authors declare that there is no conflict of interests regarding the publication of this paper.