Quasi-Newton approach to nonnegative image restorations

被引:61
作者
Hanke, M
Nagy, JG
Vogel, C [1 ]
机构
[1] Montana State Univ, Dept Math Sci, Bozeman, MT 59717 USA
[2] Univ Mainz, Fachbereich Math, D-6500 Mainz, Germany
[3] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 USA
关键词
block Toeplitz matrix; circulant matrix; conjugate gradient method; image restoration; Quasi-Newton method; regularization;
D O I
10.1016/S0024-3795(00)00116-6
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Image restoration, or deblurring, is the process of attempting to correct for degradation in a recorded image. Typically the blurring system is assumed to be linear and spatially invariant, and fast Fourier transform (FFT) based schemes result in efficient computational image restoration methods. However, real images have properties that cannot always be handled by linear methods. In particular, an image consists of positive light intensities, and thus a nonneg ativity constraint should be enforced. This constraint and other ways of incorporating a priori information have been suggested in various applications, and can lead to substantial improvements in the reconstructions. Nevertheless, such constraints are rarely implemented because they lead to nonlinear problems which require demanding computations. We suggest efficient implementations for three nonnegatively constrained restorations schemes: constrained least squares, maximum likelihood and maximum entropy. We show that with a certain parameterization, and using a Quasi-Newton scheme, these methods are very similar. In addition, our formulation reveals a connection between our approach for maximum likelihood and the expectation;maximization (EM) method used extensively by astronomers. Numerical experiments illustrate that our approach is superior to EM both in terms of accuracy and efficiency. (C) 2000 Elsevier Science Inc. All rights reserved.
引用
收藏
页码:223 / 236
页数:14
相关论文
共 50 条
  • [31] New quasi-Newton methods for unconstrained optimization problems
    Wei, Zengxin
    Li, Guoyin
    Qi, Liqun
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 175 (02) : 1156 - 1188
  • [32] A family of quasi-Newton methods for unconstrained optimization problems
    Salim, M. S.
    Ahmed, A. I.
    OPTIMIZATION, 2018, 67 (10) : 1717 - 1727
  • [33] A quasi-Newton bundle method based on approximate subgradients
    Shen Jie
    Pang Li-Ping
    Journal of Applied Mathematics and Computing, 2007, 23 (1-2) : 361 - 367
  • [34] Practical Quasi-Newton algorithms for singular nonlinear systems
    Sandra Buhmiler
    Nataša Krejić
    Zorana Lužanin
    Numerical Algorithms, 2010, 55 : 481 - 502
  • [35] THE QUASI-NEWTON METHOD FOR THE COMPOSITE MULTIOBJECTIVE OPTIMIZATION PROBLEMS
    Peng, Jianwen
    Zhang, Xue-Qing
    Zhang, Tao
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2024, 25 (10) : 2557 - 2569
  • [36] Iterative learning control based on quasi-Newton methods
    Avrachenkov, KE
    PROCEEDINGS OF THE 37TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 1998, : 170 - 174
  • [37] A quasi-Newton method in shape optimization for a transmission problem
    Kunstek, Petar
    Vrdoljak, Marko
    OPTIMIZATION METHODS & SOFTWARE, 2022, 37 (06) : 2273 - 2299
  • [38] A modified Quasi-Newton method for vector optimization problem
    Ansary, Md A. T.
    Panda, G.
    OPTIMIZATION, 2015, 64 (11) : 2289 - 2306
  • [39] Proximal quasi-Newton methods for nondifferentiable convex optimization
    Chen, XJ
    Fukushima, M
    MATHEMATICAL PROGRAMMING, 1999, 85 (02) : 313 - 334
  • [40] Quasi-newton method for Lp multiple kernel learning
    Hu Qinghui
    Wei Shiwei
    Li Zhiyuan
    Liu Xiaogang
    NEUROCOMPUTING, 2016, 194 : 218 - 226