Convergence of the alternating minimization algorithm for blind deconvolution

DOI10.1016/S0024-3795(00)00141-5zbMath0993.65149WikidataQ57397367 ScholiaQ57397367MaRDI QIDQ1587290

R. Smith

Publication date: 20 November 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

convergenceregularizationimage processingdata fittingimage restorationblind deconvolutionalternating minimizationblurred imagespoint spread functions

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Numerical methods for integral equations (65R20) Integral equations of the convolution type (Abel, Picard, Toeplitz and Wiener-Hopf type) (45E10)

Related Items (7)

Extensions of the Justen-Ramlau blind deconvolution method ⋮ A Bayesian framework for molecular strain identification from mixed diagnostic samples ⋮ Morphological component image restoration by employing bregmanized sparse regularization and anisotropic total variation ⋮ Variable projection methods for separable nonlinear inverse problems with general-form Tikhonov regularization ⋮ Lanczos-based fast blind deconvolution methods ⋮ Accelerated Alternating Projections for Robust Principal Component Analysis ⋮ Variational methods on the space of functions of bounded Hessian for convexification and denoising

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Circulant preconditioners for Toeplitz-block matrices
• Identification and restoration of noisy blurred images using the expectation-maximization algorithm
• Fourier Analysis of Iterative Methods for Elliptic pr

This page was built for publication: Convergence of the alternating minimization algorithm for blind deconvolution