LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Dupé , François-Xavier; Fadili , Jalal M.; Starck , Jean-Luc (2012)
Publisher: Elsevier
Journal: STATISTICAL METHODOLOGY
Languages: English
Types: Article
Subjects: Statistics - Applications, Deconvolution, [ INFO.INFO-TS ] Computer Science [cs]/Signal and Image Processing, Iterative thresholding, Sparse representations, Proximal iteration, [ INFO.INFO-TI ] Computer Science [cs]/Image Processing, Poisson noise, [ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processing, [ STAT.AP ] Statistics [stat]/Applications [stat.AP]
International audience; In this paper, we propose a Bayesian MAP estimator for solving the deconvolution problems when the observations are corrupted by Poisson noise. Towards this goal, a proper data fidelity term (log-likelihood) is introduced to reflect the Poisson statistics of the noise. On the other hand, as a prior, the images to restore are assumed to be positive and sparsely represented in a dictionary of waveforms such as wavelets or curvelets. Both analysis and synthesis-type sparsity priors are considered. Piecing together the data fidelity and the prior terms, the deconvolution problem boils down to the minimization of non-smooth convex functionals (for each prior). We establish the well-posedness of each optimization problem, characterize the corresponding minimizers, and solve them by means of proximal splitting algorithms originating from the realm of non-smooth convex optimization theory. Experimental results are conducted to demonstrate the potential applicability of the proposed algorithms to astronomical imaging datasets.

Share - Bookmark

Published in

Funded by projects

  • EC | SPARSEASTRO

Cite this article