Classification and image processing with a semi-discrete scheme for fidelity forced Allen–Cahn on graphs

10/27/2020
by   Jeremy Budd, et al.
0

This paper introduces a semi-discrete implicit Euler (SDIE) scheme for the Allen-Cahn equation (ACE) with fidelity forcing on graphs. Bertozzi and Flenner (2012) pioneered the use of this differential equation as a method for graph classification problems, such as semi-supervised learning and image segmentation. In Merkurjev, Kostić, and Bertozzi (2013), a Merriman-Bence-Osher (MBO) scheme with fidelity forcing was used instead, as the MBO scheme is heuristically similar to the ACE. This paper rigorously establishes the graph MBO scheme with fidelity forcing as a special case of an SDIE scheme for the graph ACE with fidelity forcing. This connection requires using the double-obstacle potential in the ACE, as was shown in Budd and Van Gennip (2020) for ACE without fidelity forcing. We also prove that solutions of the SDIE scheme converge to solutions of the graph ACE with fidelity forcing as the SDIE time step tends to zero. Next, we develop the SDIE scheme as a classification algorithm. We also introduce some innovations into the algorithms for the SDIE and MBO schemes. For large graphs, we use a QR decomposition method to compute an eigendecomposition from a Nyström extension, which outperforms the method used in e.g. Bertozzi and Flenner (2012) in accuracy, stability, and speed. Moreover, we replace the Euler discretisation for the scheme's diffusion step by a computation based on the Strang formula for matrix exponentials. We apply this algorithm to a number of image segmentation problems, and compare the performance of the SDIE and MBO schemes. We find that whilst the general SDIE scheme does not perform better than the MBO special case at this task, our other innovations lead to a significantly better segmentation than that from previous literature. We also empirically quantify the uncertainty that this segmentation inherits from the randomness in the Nyström extension.

READ FULL TEXT

page 27

page 28

page 29

page 30

page 32

page 33

page 34

page 35

research
08/25/2021

Logarithmic Euler Maruyama Scheme for Multi Dimensional Stochastic Delay Differential Equation

In this paper, we extend the logarithmic Euler-Maruyama scheme for stoch...
research
05/13/2023

Image Segmentation via Probabilistic Graph Matching

This work presents an unsupervised and semi-automatic image segmentation...
research
02/08/2020

Segmentação de imagens utilizando competição e cooperação entre partículas

This paper presents an extension proposal of the semi-supervised learnin...
research
09/08/2019

Semi-explicit discretization schemes for weakly-coupled elliptic-parabolic problems

We prove first-order convergence of the semi-explicit Euler scheme combi...
research
03/28/2020

Long time H^s_α stability of a classical scheme for Cahn-Hilliard equation with polynomial nonlinearity

In this paper we investigate the long time stability of the implicit Eul...
research
06/26/2019

Consistent Internal Energy Based Schemes for the Compressible Euler Equations

Numerical schemes for the solution of the Euler equations have recently ...

Please sign up or login with your details

Forgot password? Click here to reset