Convex optimization-based blind deconvolution for images taken with coherent illumination

Journal Article (2019)
Author(s)

Reinier Doelman (TU Delft - Team Raf Van de Plas)

M. Verhaegen (TU Delft - Team Raf Van de Plas)

Research Group
Team Raf Van de Plas
Copyright
© 2019 R. Doelman, M.H.G. Verhaegen
DOI related publication
https://doi.org/10.1364/JOSAA.36.000678
More Info
expand_more
Publication Year
2019
Language
English
Copyright
© 2019 R. Doelman, M.H.G. Verhaegen
Research Group
Team Raf Van de Plas
Issue number
4
Volume number
36
Pages (from-to)
678-685
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

A rank-constrained reformulation of the blind deconvolution problem on images taken with coherent illumination is proposed. Since in the reformulation the rank constraint is imposed on a matrix that is affine in the decision variables, we propose a novel convex heuristic for the blind deconvolution problem. The proposed heuristic allows for easy incorporation of prior information on the decision variables and the use of the phase diversity concept. The convex optimization problem can be iteratively re-parameterized to obtain better estimates. The proposed methods are demonstrated on numerically illustrative examples.

Files

Josaa_36_4_678.pdf
(pdf | 3.05 Mb)
License info not available