Comparison of formulations and solution methods for image restoration problems

DOI10.1088/0266-5611/17/6/326MaRDI QIDQ2774155zbMATH OpenOpenAlexWikidataFDO

Authors Kirsi Majava, Tommi Kärkkäinen, Marko M. Mäkelä

Publication date 11 June 2002

Published in Inverse Problems (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5d32a83de27e0259adc1ca9f466a32bd0b736ef1

zbMATH Keywords

bundle-Newton methodconjugate gradient methodimage restorationnonsmooth optimizationproximal bundle method

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Review text

The aim of the paper is to analyse and compare different formulations and their solution methods for image restoration (denoising) problems. Two of the three formulations considered are smooth enough to satisfy the assumptions for convergence of ordinary gradient-based optimization methods, such as the conjugate gradient method. For solving the third problem, two general methods of nonsmooth optimization are applied: a first-order proximal bundle method and a second-order bundle-Newton method. Moreover, a new generalization of active-set methods is proposed and analysed.

Recommendations

• Nonmonotone and monotone active-set method for image restoration. I: Convergence analysis.
• Nonmonotone and monotone active-set methods for image restoration. II: Numerical results.
• Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
• An active set strategy based on the augmented Lagrangian formulation for image restoration
• Iterative methods for solving the dual formulation arising from image restoration

Cited in

(14)

• Nonmonotone and monotone active-set method for image restoration. I: Convergence analysis.
• Nonmonotone and monotone active-set methods for image restoration. II: Numerical results.
• A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
• TV-like regularization for backward parabolic problems
• MLP in Layer-Wise Form with Applications to Weight Decay
• Sparsity based nonlocal image restoration: an alternating optimization approach
• Robust Formulations for Training Multilayer Perceptrons
• New limited memory bundle method for large-scale nonsmooth optimization
• Dualization of signal recovery problems
• Comparative analysis of the prox penalty and Bregman algorithms for image denoising
• An inertial Hestenes-Stiefel algorithm for nonsmooth convex optimization and its applications in machine learning
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization

This page was built for publication: Comparison of formulations and solution methods for image restoration problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2774155)