Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction

  • Authors:

  • Xiaoqun Zhang;Martin Burger;Xavier Bresson;Stanley Osher

  • Affiliations:

  • xqzhang@math.ucla.edu and xbresson@math.ucla.edu and sjo@math.ucla.edu;martin.burger@wwu.de;-;-

  • Venue:
  • SIAM Journal on Imaging Sciences
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

Bregman methods introduced in [S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin, Multiscale Model. Simul., 4 (2005), pp. 460-489] to image processing are demonstrated to be an efficient optimization method for solving sparse reconstruction with convex functionals, such as the $\ell^1$ norm and total variation [W. Yin, S. Osher, D. Goldfarb, and J. Darbon, SIAM J. Imaging Sci., 1 (2008), pp. 143-168; T. Goldstein and S. Osher, SIAM J. Imaging Sci., 2 (2009), pp. 323-343]. In particular, the efficiency of this method relies on the performance of inner solvers for the resulting subproblems. In this paper, we propose a general algorithm framework for inverse problem regularization with a single forward-backward operator splitting step [P. L. Combettes and V. R. Wajs, Multiscale Model. Simul., 4 (2005), pp. 1168-1200], which is used to solve the subproblems of the Bregman iteration. We prove that the proposed algorithm, namely, Bregmanized operator splitting (BOS), converges without fully solving the subproblems. Furthermore, we apply the BOS algorithm and a preconditioned one for solving inverse problems with nonlocal functionals. Our numerical results on deconvolution and compressive sensing illustrate the performance of nonlocal total variation regularization under the proposed algorithm framework, compared to other regularization techniques such as the standard total variation method and the wavelet-based regularization method.