Generalizing diffuse interface methods on graphs: nonsmooth potentials and hypergraphs
From MaRDI portal
Publication:4640163
DOI10.1137/17M1117835zbMATH Open1385.68032arXiv1611.06094WikidataQ129867809 ScholiaQ129867809MaRDI QIDQ4640163FDOQ4640163
Authors: Jessica Bosch, Steffen Klamt, Martin Stoll 
Publication date: 16 May 2018
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Abstract: Diffuse interface methods have recently been introduced for the task of semi-supervised learning. The underlying model is well-known in materials science but was extended to graphs using a Ginzburg--Landau functional and the graph Laplacian. We here generalize the previously proposed model by a non-smooth potential function. Additionally, we show that the diffuse interface method can be used for the segmentation of data coming from hypergraphs. For this we show that the graph Laplacian in almost all cases is derived from hypergraph information. Additionally, we show that the formerly introduced hypergraph Laplacian coming from a relaxed optimization problem is well suited to be used within the diffuse interface method. We present computational experiments for graph and hypergraph Laplacians.
Full work available at URL: https://arxiv.org/abs/1611.06094
Recommendations
- Diffuse interface methods for multiclass segmentation of high-dimensional data
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data
- Convergence of the graph Allen-Cahn scheme
- An MBO scheme on graphs for classification and image processing
- Laplacian-optimized diffusion for semi-supervised learning
hypergraphsiterative algorithmssemi-supervised learningsemismooth Newton methoddiffuse interface methods
Numerical mathematical programming methods (65K05) Learning and adaptive systems in artificial intelligence (68T05) PDEs on graphs and networks (ramified or polygonal spaces) (35R02)
Cites Work
- ARPACK Users' Guide
- Title not available (Why is that?)
- Title not available (Why is that?)
- Methods of conjugate gradients for solving linear systems
- Inpainting of Binary Images Using the Cahn–Hilliard Equation
- On the Cahn–Hilliard Equation with Degenerate Mobility
- Free energy of a nonuniform system. I: Interfacial free energy
- Modelling and simulations of multi-component lipid membranes and open membranes via diffuse interface approaches
- An MBO scheme on graphs for classification and image processing
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data
- Linking anisotropic sharp and diffuse surface motion laws via gradient flows
- Fast solvers for Cahn-Hilliard inpainting
- A fractional inpainting model based on the vector-valued Cahn-Hilliard equation
- Cahn-Hilliard inpainting and a generalization for grayvalue images
- Active contours without edges
- Allen-Cahn and Cahn-Hilliard variational inequalities solved with optimization techniques
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Efficient numerical solution of discrete multi-component Cahn-Hilliard systems
- An error bound for the finite element approximation of a model for phase separation of a multi-component alloy
- On the Finite Element Solution of the Pure Neumann Problem
- Finite element approximation of a model for phase separation of a multi-component alloy with non-smooth free energy
- Threshold dynamics for the piecewise constant Mumford-Shah functional
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- Diffuse interface methods for multiclass segmentation of high-dimensional data
- An adaptive finite-element Moreau–Yosida-based solver for a non-smooth Cahn–Hilliard problem
- Solving the Cahn-Hilliard variational inequality with a semi-smooth Newton method
- Unconditionally stable schemes for higher order inpainting
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- A method based on total variation for network modularity optimization using the MBO scheme
- Convergence of the graph Allen-Cahn scheme
Cited In (11)
- Diffuse interface methods for multiclass segmentation of high-dimensional data
- Graph Merriman-Bence-Osher as a semidiscrete implicit Euler scheme for graph Allen-Cahn flow
- An MBO scheme for minimizing the graph Ohta-Kawasaki functional
- Pseudoinverse graph convolutional networks. Fast filters tailored for large eigengaps of dense graphs and hypergraphs
- A literature survey of matrix methods for data science
- Mass-conserving diffusion-based dynamics on graphs
- Convergence of the graph Allen-Cahn scheme
- Proximal gradient methods for general smooth graph total variation model in unsupervised learning
- Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products
- Classification and image processing with a semi‐discrete scheme for fidelity forced Allen–Cahn on graphs
- Partial differential equations and variational methods for geometric processing of images
Uses Software
This page was built for publication: Generalizing diffuse interface methods on graphs: nonsmooth potentials and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640163)
