Filters

2016 - 201932020 - 20212

More filters

2019 - 201922020 - 20223
Reset filters

Settings

DDC: 510 × Subject: bilevel optimization ×

Search Results

Now showing 1 - 5 of 5
  • Thumbnail Image
    Item
    Optimal selection of the regularization function in a generalized total variation model. Part II: Algorithm, its analysis and numerical tests
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2016) Hintermüller, Michael; Rautenberg, Carlos N.; Wu, Tao; Langer, Andreas
    Based on the generalized total variation model and its analysis pursued in part I (WIAS Preprint no. 2235), in this paper a continuous, i.e., infinite dimensional, projected gradient algorithm and its convergence analysis are presented. The method computes a stationary point of a regularized bilevel optimization problem for simultaneously recovering the image as well as determining a spatially distributed regularization weight. Further, its numerical realization is discussed and results obtained for image denoising and deblurring as well as Fourier and wavelet inpainting are reported on.
  • Thumbnail Image
    Item
    Dualization and automatic distributed parameter selection of total generalized variation via bilevel optimization
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Hintermüller, Michael; Papafitsoros, Kostas; Rautenberg, Carlos N.; Sun, Hongpeng
    Total Generalized Variation (TGV) regularization in image reconstruction relies on an infimal convolution type combination of generalized first- and second-order derivatives. This helps to avoid the staircasing effect of Total Variation (TV) regularization, while still preserving sharp contrasts in images. The associated regularization effect crucially hinges on two parameters whose proper adjustment represents a challenging task. In this work, a bilevel optimization framework with a suitable statistics-based upper level objective is proposed in order to automatically select these parameters. The framework allows for spatially varying parameters, thus enabling better recovery in high-detail image areas. A rigorous dualization framework is established, and for the numerical solution, two Newton type methods for the solution of the lower level problem, i.e. the image reconstruction problem, and two bilevel TGV algorithms are introduced, respectively. Denoising tests confirm that automatically selected distributed regularization parameters lead in general to improved reconstructions when compared to results for scalar parameters.
  • Thumbnail Image
    Item
    Optimal selection of the regularization function in a generalized total variation model. Part I: Modelling and theory
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2016) Hintermüller, Michael; Rautenberg, Carlos N.
    A generalized total variation model with a spatially varying regularization weight is considered. Existence of a solution is shown, and the associated Fenchel-predual problem is derived. For automatically selecting the regularization function, a bilevel optimization framework is proposed. In this context, the lower-level problem, which is parameterized by the regularization weight, is the Fenchel predual of the generalized total variation model and the upper-level objective penalizes violations of a variance corridor. The latter object relies on a localization of the image residual as well as on lower and upper bounds inspired by the statistics of the extremes.
  • Thumbnail Image
    Item
    On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2021) Berthold, Holger; Heitsch, Holger; Henrion, René; Schwientek, Jan
    We present an adaptive grid refinement algorithm to solve probabilistic optimization problems with infinitely many random constraints. Using a bilevel approach, we iteratively aggregate inequalities that provide most information not in a geometric but in a probabilistic sense. This conceptual idea, for which a convergence proof is provided, is then adapted to an implementable algorithm. The efficiency of our approach when compared to naive methods based on uniform grid refinement is illustrated for a numerical test example as well as for a water reservoir problem with joint probabilistic filling level constraints.
  • Thumbnail Image
    Item
    Generating structured non-smooth priors and associated primal-dual methods
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2019) Hintermüller, Michael; Papafitsoros, Kostas
    The purpose of the present chapter is to bind together and extend some recent developments regarding data-driven non-smooth regularization techniques in image processing through the means of a bilevel minimization scheme. The scheme, considered in function space, takes advantage of a dualization framework and it is designed to produce spatially varying regularization parameters adapted to the data for well-known regularizers, e.g. Total Variation and Total Generalized variation, leading to automated (monolithic), image reconstruction workflows. An inclusion of the theory of bilevel optimization and the theoretical background of the dualization framework, as well as a brief review of the aforementioned regularizers and their parameterization, makes this chapter a self-contained one. Aspects of the numerical implementation of the scheme are discussed and numerical examples are provided.