## SPIRAL Out of Convexity: Sparsity-regularized Algorithms for Photon-limited Imaging

### [DOI] [PDF]

### Abstract

The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Gaussian noise model, and instead require a Poisson noise model. As a result, accurate reconstruction of a spatially or temporally distributed phenomenon ($f^⋆$) from Poisson data ($y$) cannot be accomplished by minimizing a conventional $\ell_2$-$\ell_1$ objective function. The problem addressed in this paper is the estimation of $f^⋆$ from y in an inverse problem setting, where (a) the number of unknowns may potentially be larger than the number of observations and (b) $f^⋆$ admits a sparse representation. The optimization formulation considered in this paper uses a negative Poisson log-likelihood objective function with nonnegativity constraints (since Poisson intensities are naturally nonnegative). This paper describes computational methods for solving the constrained sparse Poisson inverse problem. In particular, the proposed approach incorporates key ideas of using quadratic separable approximations to the objective function at each iteration and computationally efficient partition-based multiscale estimation methods.

### Citation

Z. T. Harmany, R. F. Marcia and R. M. Willett, “SPIRAL out of convexity: Sparsity-regularized algorithms for photon-limited imaging”, in *Proceedings of SPIE*, 2010, 75330R–75330R-12.

### BibTeX

```
@inproceedings{harmany-spie2010-spiralout,
``` doi = {10.1117/12.850771}, title = {SPIRAL out of convexity: Sparsity-regularized algorithms for photon-limited imaging}, author = {Harmany, Zachary T. and Marcia, Roummel F. and Willett, Rebecca M.}, booktitle = {Proceedings of SPIE}, year = {2010}, pages = {75330R–75330R-12}, abstract = {The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Gaussian noise model, and instead require a Poisson noise model. As a result, accurate reconstruction of a spatially or temporally distributed phenomenon ($f^⋆$) from Poisson data ($y$) cannot be accomplished by minimizing a conventional $\ell_2$-$\ell_1$ objective function. The problem addressed in this paper is the estimation of $f^⋆$ from y in an inverse problem setting, where (a) the number of unknowns may potentially be larger than the number of observations and (b) $f^⋆$ admits a sparse representation. The optimization formulation considered in this paper uses a negative Poisson log-likelihood objective function with nonnegativity constraints (since Poisson intensities are naturally nonnegative). This paper describes computational methods for solving the constrained sparse Poisson inverse problem. In particular, the proposed approach incorporates key ideas of using quadratic separable approximations to the objective function at each iteration and computationally efficient partition-based multiscale estimation methods.} ```
}
``` |