نبذة مختصرة : Restoring images degraded by spatially varying blur is a problem encountered in many disciplines such as astrophysics, computer vision or biomedical imaging. Blurring operators are modelled using integral operators with some regularity and decrease conditions on the kernel. Recently, we studied the approximation of these operators in wavelet bases in which operators are highly compressible. They also allow to fastly compute matrix-vector products with a complexity $O(N\epsilon^{-d/M})$ for a precision $\epsilon$ in spectral norm, where N is the number of pixels of a d-dimensional image and M describes the kernel regularity. Additionnaly, we have shown that the sparsity pattern of the matrix can be pre-defined. We exploit these results to study the estimation/reconstruction of the operator from the knwoledge of few point spread functions located at arbitrary positions in the image domain. We propose an original formulation directly in the wavelet domain and a fast algorithm.
No Comments.