Alternating proximal algorithm for blind image recovery - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Alternating proximal algorithm for blind image recovery


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.
Fichier principal
Vignette du fichier
icip2010-2.pdf (207.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00844115 , version 1 (12-07-2013)


  • HAL Id : hal-00844115 , version 1


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⟩
270 View
374 Download


Gmail Facebook X LinkedIn More