A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
SIAM Journal on Scientific Computing
A Fast MAP Algorithm for High-Resolution Image Reconstruction with Multisensors
Multidimensional Systems and Signal Processing
Digital Image Restoration
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
Improved Methods of Maximum a Posteriori Restoration
IEEE Transactions on Computers
Iterative least squares estimators in nonlinear image restoration
IEEE Transactions on Signal Processing
A new class of quasi-Newtonian methods for optimal learning in MLP-networks
IEEE Transactions on Neural Networks
Hi-index | 7.29 |
We consider the iterative solution of unconstrained minimization problems arising from nonlinear image restoration. Our approach is based on a novel generalized BFGS method for such large-scale image restoration minimization problems. The complexity per step of the method is of O(nlogn) operations and only O(n) memory allocations are required, where n is the number of image pixels. Based on the results given in [Carmine Di Fiore, Stefano Fanelli, Filomena Lepore, Paolo Zellini, Matrix algebras in quasi-Newton methods for unconstrained minimization, Numer. Math. 94 (2003) 479-500], we show that the method is globally convergent for our nonlinear image restoration problems. Experimental results are presented to illustrate the effectiveness of the proposed method.