Linear inverse problems with various noise models and mixed regularizations

  • Authors:
  • François-Xavier Dupé;Jalal M. Fadili;Jean-Luc Starck

  • Affiliations:
  • AIM UMR CNRS - CEA, Gif-sur-Yvette, France;GREYC-ENSICAEN-Université de Caen, Caen, France;AIM UMR CNRS - CEA, Gif-sur-Yvette, France

  • Venue:
  • Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose two algorithms for solving linear inverse problems when the observations are corrupted by noise. A proper data fidelity term (log-likelihood) is introduced to reflect the statistics of the noise (e.g. Gaussian, Poisson) independently of the degradation. On the other hand, the regularization is constructed by assuming several a priori knowledge on the images. Piecing together the data fidelity and the prior terms, the solution to the inverse problem is cast as the minimization of a non-smooth convex functional. We establish the well-posedness of the optimization problem, characterize the corresponding minimizers for different kind of noises. Then we solve it by means of primal and primal-dual proximal splitting algorithms originating from the field of non-smooth convex optimization theory. Experimental results on deconvolution, inpainting and denoising with some comparison to prior methods are also reported.