Search Results

Now showing 1 - 5 of 5
  • Item
    Uncertainty Quantification in Image Segmentation Using the Ambrosio–Tortorelli Approximation of the Mumford–Shah Energy
    (Dordrecht [u.a.] : Springer Science + Business Media B.V, 2021) Hintermüller, Michael; Stengl, Steven-Marian; Surowiec, Thomas M.
    The quantification of uncertainties in image segmentation based on the Mumford–Shah model is studied. The aim is to address the error propagation of noise and other error types in the original image to the restoration result and especially the reconstructed edges (sharp image contrasts). Analytically, we rely on the Ambrosio–Tortorelli approximation and discuss the existence of measurable selections of its solutions as well as sampling-based methods and the limitations of other popular methods. Numerical examples illustrate the theoretical findings.
  • Item
    Generalized Nash equilibrium problems with partial differential operators: Theory, algorithms, and risk aversion
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2019) Gahururu, Deborah; Hintermüller, Michael; Stengl, Steven-Marian; Surowiec, Thomas M.
    PDE-constrained (generalized) Nash equilibrium problems (GNEPs) are considered in a deterministic setting as well as under uncertainty. This includes a study of deterministic GNEPs with nonlinear and/or multivalued operator equations as forward problems and PDE-constrained GNEPs with uncertain data. The deterministic nonlinear problems are analyzed using the theory of generalized convexity for set-valued operators, and a variational approximation approach is proposed. The stochastic setting includes a detailed overview of the recently developed theory and algorithms for risk-averse PDE-constrained optimization problems. These new results open the way to a rigorous study of stochastic PDE-constrained GNEPs.
  • Item
    Uncertainty quantification in image segmentation using the Ambrosio--Tortorelli approximation of the Mumford--Shah energy
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Hintermüller, Michael; Stengl, Steven-Marian; Surowiec, Thomas M.
    The quantification of uncertainties in image segmentation based on the Mumford-Shah model is studied. The aim is to address the error propagation of noise and other error types in the original image to the restoration result and especially the reconstructed edges (sharp image contrasts). Analytically, we rely on the Ambrosio-Tortorelli approximation and discuss the existence of measurable selections of its solutions as well as sampling-based methods and the limitations of other popular methods. Numerical examples illustrate the theoretical findings.
  • Item
    A generalized $Gamma$-convergence concept for a type of equilibrium problems
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2021) Hintermüller, Michael; Stengl, Steven-Marian
    A novel generalization of Γ-convergence applicable to a class of equilibrium problems is studied. After the introduction of the latter, a variety of its applications is discussed. The existence of equilibria with emphasis on Nash equilibrium problems is investigated. Subsequently, our Γ-convergence notion for equilibrium problems, generalizing the existing one from optimization, is introduced and discussed. The work ends with its application to a class of penalized generalized Nash equilibrium problems and quasi-variational inequalities.
  • Item
    On the convexity of optimal control problems involving non-linear PDEs or VIs and applications to Nash games (changed title: Vector-valued convexity of solution operators with application to optimal control problems)
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Hintermüller, Michael; Stengl, Steven-Marian
    Generalized Nash equilibrium problems in function spaces involving PDEs are considered. One of the central issues arising in this context is the question of existence, which requires the topological characterization of the set of minimizers for each player of the associated Nash game. In this paper, we propose conditions on the operator and the functional that guarantee the reduced formulation to be a convex minimization problem. Subsequently, we generalize results of convex analysis to derive optimality systems also for non-smooth operators. Our theoretical findings are illustrated by examples.