Proximity algorithms for image models: Denoising

Charles A. Micchelli, Lixin Shen, Yuesheng Xu

Research output: Contribution to journalArticlepeer-review

222 Scopus citations


This paper introduces a novel framework for the study of the total-variation model for image denoising. In the model, the denoised image is the proximity operator of the total-variation evaluated at a given noisy image. The total-variation can be viewed as the composition of a convex function (the ℓ1 norm for the anisotropic total-variation or the ℓ2 norm for the isotropic total-variation) with a linear transformation (the first-order difference operator). These two facts lead us to investigate the proximity operator of the composition of a convex function with a linear transformation. Under the assumption that the proximity operator of a given convex function (e.g., the ℓ1 norm or the ℓ2 norm) can be readily obtained, we propose a fixed-point algorithm for computing the proximity operator of the composition of the convex function with a linear transformation. We then specialize this fixed-point methodology to the total-variation denoising models. The resulting algorithms are compared with the Goldstein-Osher split-Bregman denoising algorithm. An important advantage of the fixed-point framework leads us to a convenient analysis for convergence of the proposed algorithms as well as a platform for us to develop efficient numerical algorithms via various fixed-point iterations. Our numerical experience indicates that the methods proposed here perform favorably.

Original languageEnglish (US)
Article number045009
JournalInverse Problems
Issue number4
StatePublished - Apr 1 2011

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Mathematical Physics
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Proximity algorithms for image models: Denoising'. Together they form a unique fingerprint.

Cite this