<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06046079</id>
  <dt>j</dt>
  <an>06046079</an>
  <augroup>
    <au>Zhang, Xiaoqun</au>
    <au>Lu, Yujie</au>
    <au>Chan, Tony</au>
  </augroup>
  <ti>A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography.</ti>
  <so>J. Sci. Comput. 50, No. 3, 519-535 (2012).</so>
  <py>2012</py>
  <pu>Springer, Dordrecht</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>source reconstruction</ut>
    <ut>$\ell ^{0}$ regularization</ut>
    <ut>orthogonal matching pursuit</ut>
    <ut>Poisson noise</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s10915-011-9533-z</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We consider 3D bioluminescence tomography (BLT) source reconstruction from Poisson data in a three dimensional space. With a priori information of sources sparsity and MAP estimation of Poisson distributions, we study the minimization of the Kullback-Leihbler divergence with $\ell ^{1}$ and $\ell ^{0}$ regularization. We show numerically that although several $\ell ^{1}$ minimization algorithms are efficient for compressive sensing, they fail for BLT reconstruction due to the high coherence of the measurement matrix columns and high nonlinearity of Poisson fitting term. Instead, we propose a novel greedy algorithm for $\ell ^{0}$ regularization to reconstruct sparse solutions for the BLT problem. Numerical experiments on synthetic data obtained by the finite element methods and Monte-Carlo methods show the accuracy and efficiency of the proposed method.</ab>
    <rv></rv>
  </abgroup>
</item>