Iterative thresholding meets free-discontinuity problems (Q707746): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031407697 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0901.2605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Mumford–Shah-Type Regularization, Viewed as a Relaxed Sparsity Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4710887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of functional depending on jumps by elliptic functional via t-convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete approximation of a free discontinuity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative thresholding for sparse approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of an adaptive finite-element approximation of the Mumford-Shah functional / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique Solutions for a Class of Discontinuous Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Image Segmentation by Variational Methods: Mumford and Shah Functional and the Discrete Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete approximation of the Mumford-Shah functional in dimension two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Image recovery via total variation minimization and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Convex Sets of Finite Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital inpainting based on the Mumford–Shah–Euler image model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative thresholding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximations by piecewise smooth functions and associated variational problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thresholding implied by truncated quadratic regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak convergence of the sequence of successive approximations for nonexpansive mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mumford-Shah level-set approach for the inversion and segmentation of X-ray tomography data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variational approach to the reconstruction of cracks by boundary measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regularization of the inverse conductivity problem with discontinuous conductivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction in the inverse crack problem by variational methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear total variation based noise removal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study in the BV space of a denoising-deblurring variational problem / rank
 
Normal rank

Revision as of 07:00, 3 July 2024

scientific article
Language Label Description Also known as
English
Iterative thresholding meets free-discontinuity problems
scientific article

    Statements

    Iterative thresholding meets free-discontinuity problems (English)
    0 references
    0 references
    0 references
    8 October 2010
    0 references
    This very important and useful paper is devoted to the study of iterative thresholding meets free-discontinuity problems. It is the first one in this consideration. Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower-dimensional set consisting of the discontinuities of the function. The proposed terminology was introduced by \textit{E. De Giorgi} [in: Frontiers in pure and applied mathematics, Coll. Pap. Ded. J.-L. Lions Occas. 60th Birthday, 55--62 (1991; Zbl 0758.49002)] to indicate a class of variational problems that pertain to the minimization of a functional, involving both volume and surface energies, depending on a closed set \(K \subset \mathbb{R}^d\), and a function \(u\) on \(\mathbb{R}^d\) usually smooth outside \(K\) (\(K\) is not fixed a priori and is an unknown of the problem, or \(K\) is not a boundary in general, but a free-surface inside the domain of the problem). Here a free-discontinuity problem is the one modeled by the so-called Mumford-Shah functional,which is defined by: \[ J(u,K): = \int_{\Omega \backslash K}[| \nabla u|^2 + \alpha (u-g)^2]dx + \beta \mathcal{H}^{d-1}(K \cap \Omega) \] (The set \(\Omega\) is a bounded open subset of \(\mathbb{R}^d\), \(\alpha, \beta >0\) are fixed constants and \(g \in L^\infty (\Omega)\), \(\mathcal{H}^N\) denotes the \(N\)-dimensional Hausdorff measure, \(d=1,2\).) The minimizing function \(u \in W^{1,2} (\Omega \backslash K)\) approximate a given noisy image \(g\). The problem of minimization of \(J\) with respect to \(u\) (for fixed \(K\)) is equivalent to solving the system of equations: \( \Delta u = \alpha (u-g)\) in \(\Omega \backslash K\), \(\frac{\partial u}{\partial \nu}=0\) on \(\partial \Omega \cap K\) (\(\nu\) is the outward - pointing normal vector at any \(x \in \partial \Omega \cup K\). The relevant unknown in free-discontinuity problem is the set \(K\). Because there is no topology on the closed sets, ensures compactness of the minimizing sequences and the lower semicontinuity of the Hausdorff measure, the existence of minimizers \((u, K)\) of \(J\) is a very difficult problem. Main result: The authors show that discretizations of regularized functionals of the type: \[ J(u) = \alpha \|Ku-g\|^2_{L_2(\Omega)} + MS(u)\tag{1} \] where \(K: L_2 (\Omega) \rightarrow L_2 (\Omega)\) is bounded operator which is not boundedly invertible, and \(g=K \overline{u} + n\) (\(n\) is a stochastic noise), \(MS (u) = \int_{\Omega \backslash S_u}| \nabla u|^2 + \beta \mathcal{H}^{d-1}(S_u)\) (\(S_u\) is the well-defined discontinuity set of \(u\)). The authors show that discretizations of the type (1) always have minimizers. Here, these discretizations correspond to functionals of the form \[ \mathcal{T}_h (u): \alpha h^2 \|Ku - g\|^2_{l_2} + h^2 \sum_{(hi,hj) \in \Omega_h} [W_h (\frac{u_{i+1,j}- u_{i,j}} {h} + W_h (\frac{U_{i,j+1}- u_{i,j}}{h})],\tag{2} \] with \(W_h(t)= \min \{t^2, \frac{\beta}{h}\}\), and that such functionals admit minimizers, is proved. The discrete Mumford-Shah approximation \[ \begin{multlined} J_h(u) := h^2 \sum_{(hi,hj)} W_h (\frac{u_{i+1,j} - u_{i,j}} {h}) + h^2 \sum_{(hi,hj)\in \Omega_h} W_h (\frac{u_{i,j+1} - u_{i,j}} {h}) + \\ \alpha h^2 \sum_{(hi,hj) \in \Omega_h} (u_{i,j} - g_{i,j})^2 \end{multlined} \] can be written in the form (2). Moreover in the one-dimensional situation the authors show that such minimizers, along with fixed points of proposed algorithm, will have components that fall either below on threshold in absolute value, or fall above a second, strictly larger threshold, which depend only on the parameters \(\alpha\) and \(\beta\), and not on the data \((K,g)\). Any a priori information concerning these thresholds may thus be incorporated towards selection of the parameters \((\alpha, \beta)\). As a consequence of these achievements, the authors prove that global minimizers are always isolated, although not necessarily unique, whereas local minimizers may constitute a continuum of unstable equilibria. Thus the proposed analysis will shed light on fundamental properties virtues, and limitations, of regularization by means of the Mumford-Shah functional \(MS\) and provide a rigorous justification of the numerical results appearing in the literature.
    0 references
    Free-discontinuity problems
    0 references
    Inverse problems
    0 references
    Iterative thresholding
    0 references
    Convergence analysis
    0 references
    Stability of equilibria
    0 references
    \(\Gamma\) - approximating discrete functional
    0 references
    Constrained optimization
    0 references
    Energy functional
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references