Linear inverse problems with noise: primal and primal-dual splitting

Details Linear inverse problems with noise: primal and primal-dual splitting Linear inverse problems with noise: primal and primal-dual splitting

2011-03-11

arxiv.org/abs/1103.2208v1

Statistics

Applications

Scientific paper

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). On the other hand, as a prior, the images to restore are assumed to be positive and sparsely represented in a dictionary of waveforms. 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, and 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.

Affiliated with

Also associated with

No associations

Rating

Linear inverse problems with noise: primal and primal-dual splitting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear inverse problems with noise: primal and primal-dual splitting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear inverse problems with noise: primal and primal-dual splitting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-430025