A convex relaxation method for computing exact global solutions for multiplicative noise removal

  • Authors:
  • Chunxiao Liu;Shengfeng Zhu

  • Affiliations:
  • Department of Mathematics, Hangzhou Normal University, Hangzhou 310036, PR China;Department of Mathematics, East China Normal University, Shanghai 200241, PR China

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2013

Quantified Score

Hi-index 7.29

Visualization

Abstract

We propose a convex relaxation technique for computing global solutions for the nonconvex multiplicative noise model. The method is based on functional lifting by introducing an additional dimension. We employ a primal-dual-based gradient-type algorithm in numerical implementations to overcome the nondifferentiability of the total variation term. Numerical results show that our algorithm is highly efficient. Furthermore, global solutions of the original model can be obtained with no dependence on the initial guess.