A Fast Algorithm for Solving Linear Inverse Problems with Uniform Noise Removal

Xiongjun Zhang*, Kwok Po NG

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

4 Citations (Scopus)


In this paper, we develop a fast algorithm for solving an unconstrained optimization model for uniform noise removal which is an important task in inverse problems. The optimization model consists of an ℓ data fitting term and a total variation regularization term. By utilizing the alternating direction method of multipliers (ADMM) for such optimization model, we demonstrate that one of the ADMM subproblems can be formulated by involving a projection onto ℓ 1 ball which can be solved efficiently by iterations. The convergence of the ADMM method can be established under some mild conditions. In practice, the balance between the ℓ data fitting term and the total variation regularization term is controlled by a regularization parameter. We present numerical experiments by using the L-curve method of the logarithms of data fitting term and total variation regularization term to select regularization parameters for uniform noise removal. Numerical results for image denoising and deblurring, inverse source, inverse heat conduction problems and second derivative problems have shown the effectiveness of the proposed model.

Original languageEnglish
Pages (from-to)1214-1240
Number of pages27
JournalJournal of Scientific Computing
Issue number2
Publication statusPublished - 15 May 2019

Scopus Subject Areas

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • Engineering(all)
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics

User-Defined Keywords

  • Alternating direction method of multipliers
  • Linear inverse problems
  • Total variation
  • Uniform noise
  • ℓ -Norm


Dive into the research topics of 'A Fast Algorithm for Solving Linear Inverse Problems with Uniform Noise Removal'. Together they form a unique fingerprint.

Cite this