Marco Caroccia, Antonin Chambolle, Dejan Slepčev
Published 2019-06-22Version 1
We consider adaptations of the Mumford-Shah functional to graphs. These are based on discretizations of nonlocal approximations to the Mumford-Shah functional. Motivated by applications in machine learning we study the random geometric graphs associated to random samples of a measure. We establish the conditions on the graph constructions under which the minimizers of graph Mumford-Shah functionals converge to a minimizer of a continuum Mumford-Shah functional. Furthermore we explicitly identify the limiting functional. Moreover we describe an efficient algorithm for computing the approximate minimizers of the graph Mumford-Shah functional.
Asymptotics of harmonic functions in the absence of monotonicity formulas
Asymptotics of the gradient of solutions to the perfect conductivity problem
Asymptotics of the critical non-linear wave equation for a class of non star-shaped obstacles
![QR code for arXiv:1906.09521 [math.AP]](http://oss.arxitics.com/images/favicon.svg)