An investigation on semi-blind deconvolution by using nonlinear programming
The semi-blind deconvolution problem (SBDP) [the authors, Sci. Sin., Ser. A 30, 1318-1332 (1987; Zbl 0642.94008); ibid., 1333-1344 (1987; Zbl 0642.94009)] is converted into a specific nonlinear programming problem. In this more general situation the relationship between the existence of a unique solution of the SBDP and the autocorrelation and crosscorrelation sequences of partial sample points is uncovered. As a result the robustness of the SBDP solution under noise situation is improved and the incompleteness of the SBDP solution method proposed in earlier papers of the authors (cited above) is reduced.
- Blind Deconvolution Using Convex Programming
- A non-iterative regularization approach to blind deconvolution
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- A nonparametric procedure for blind image deblurring
- A semiblind regularization algorithm for inverse problems with application to image deblurring
- Constrained numerical optimization methods for blind deconvolution
- Algorithm and constraints for exact non-blind deconvolution
- scientific article; zbMATH DE number 4047575
- Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm
- Blind image deconvolution. Methods and convergence
This page was built for publication: An investigation on semi-blind deconvolution by using nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812617)