A Kronecker approximation with a convex constrained optimization method for blind image restoration

作者：Bouhamidi A; Jbilou K^*

来源：Optimization Letters, 2012, 6(7): 1251-1264.

DOI：10.1007/s11590-011-0370-7

• Blind image restoration
• Convex optimization
• Linear algebra

In many problems of linear image restoration, the point spread function is assumed to be known even if this information is usually not available. In practice, both the blur matrix and the restored image should be performed from the observed noisy and blurred image. In this case, one talks about the blind image restoration. In this paper, we propose a method for blind image restoration by using convex constrained optimization techniques for solving large-scale ill-conditioned generalized Sylvester equations. The blur matrix is approximated by a Kronecker product of two matrices having Toeplitz and Hankel forms. The Kronecker product approximation is obtained from an estimation of the point spread function. Numerical examples are given to show the efficiency of our proposed method.

• 出版日期2012-10