Skip to Main content Skip to Navigation
Conference papers

Alternating proximal algorithm for blind image recovery

Abstract : We consider a variational formulation of blind image recovery problems. A novel iterative proximal algorithm is proposed to solve the associated nonconvex minimization problem. Under suitable assumptions, this algorithm is shown to have better convergence properties than standard alternating minimization techniques. The objective function includes a smooth convex data fidelity term and nonsmooth convex regularization terms modeling prior information on the data and on the unknown linear degradation operator. A novelty of our approach is to bring into play recent nonsmooth analysis results. The pertinence of the proposed method is illustrated in an image restoration example.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00844115
Contributor : Jean-Christophe Pesquet <>
Submitted on : Friday, July 12, 2013 - 6:34:22 PM
Last modification on : Friday, March 27, 2020 - 3:09:47 AM
Document(s) archivé(s) le : Sunday, October 13, 2013 - 10:15:08 AM

File

icip2010-2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00844115, version 1

Citation

Jérôme Bolte, Patrick Louis Combettes, Jean-Christophe Pesquet. Alternating proximal algorithm for blind image recovery. IEEE International Conference on Image Processing (ICIP 2010), Sep 2010, Honk Kong, China. pp.1673-1676. ⟨hal-00844115⟩

Share

Metrics

Record views

673

Files downloads

514