| Issue |
Int. J. Simul. Multidisci. Des. Optim.
Volume 4, Number 1, January 2010
|
|
|---|---|---|
| Page(s) | 33 - 38 | |
| DOI | https://doi.org/10.1051/ijsmdo/2010005 | |
| Published online | 21 July 2011 | |
Blind image restoration as a convex optimization problem
Université de Lille Nord de France, L.M.P.A., ULCO, 50 rue F. Buisson BP 699, F-62228 Calais cedex - France
Corresponding author: bouhamidi@lmpa.univ-littoral.fr
Received:
12
December
2009
Accepted:
15
February
2010
In this paper, we consider the blind image restoration as a convex constrained problem and we propose to solve this problem by a conditional gradient ethod. Such a method is based on a Thikonov regularization technique and is obtained by an approximation of the blur matrix as a Kronecker product of two matrices given as a sum of a Toeplitz and Hankel matrices. Numerical examples are given to show the efficiency of our proposed method.
Key words: Image restoration / Kronecker product / Tikhonov regularization / Convex optimization
© ASMDO, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.