Two subtle convex nonlocal approximations of the BV-norm
Related publications (40)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
There are many important applications that are multitask-oriented in the sense that there are multiple optimum parameter vectors to be inferred simultaneously by networked agents. In this paper, we formulate an online multitask learning problem where node ...
This study investigates the use of interface Peclet number P = w/(D-l/V-tip), to determine the interface width (w) used in phase-field simulations, where D-l is the liquid diffusivity and V-tip is the tip velocity. The maximum simulation interface width (w ...
We investigate the nonsmooth and nonconvex L1 -Potts functional in discrete and continuous time. We show Γ-convergence of discrete L1 -Potts functionals toward their continuous counterpart and obtain a convergence statement for the corr ...
We prove that solutions of a mildly regularized Perona–Malik equation converge, in a slow time scale, to solutions of the total variation flow. The convergence result is global-in-time, and holds true in any space dimension. The proof is based on the gener ...
We analyze the stochastic initial-boundary value problem for the elastic wave equation with random coefficients and deterministic data. We propose a stochastic collocation method for computing statistical moments of the solution or statistics of some given ...
We present an empirical study that illustrates the potential of dual eye-tracking to detect successful understanding and social processes during pair programming. The gaze of forty pairs of programmers was recorded during a program understanding task. An a ...
Inference of Markov random field images segmentation models is usually performed using iterative methods which adapt the well-known expectation-maximization (EM) algorithm for independent mixture models. However, some of these adaptations are ad-hoc and ma ...
We study the semilinear wave equation ∂t2ψ−Δψ=∣ψ∣p−1ψ for p>3 with radial data in three spatial dimensions. There exists an explicit solution which blows up at t=T>0 given by $\displaystyl ...
Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying non-coupled ensemb ...
We show how to combine our earlier results to deduce strong convergence of the interfaces in the planar critical Ising model and its random-cluster representation to Schramm’s SLE curves with parameter κ = 3 and κ = 16 / 3 respectively. ...