Generalizing diffuse interface methods on graphs: nonsmooth potentials and hypergraphs
From MaRDI portal
Publication:4640163
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.
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
Cites work
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- A fractional inpainting model based on the vector-valued Cahn-Hilliard equation
- A method based on total variation for network modularity optimization using the MBO scheme
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- ARPACK Users' Guide
- Active contours without edges
- Allen-Cahn and Cahn-Hilliard variational inequalities solved with optimization techniques
- An MBO scheme on graphs for classification and image processing
- An adaptive finite-element Moreau–Yosida-based solver for a non-smooth Cahn–Hilliard problem
- An error bound for the finite element approximation of a model for phase separation of a multi-component alloy
- Cahn-Hilliard inpainting and a generalization for grayvalue images
- Convergence of the graph Allen-Cahn scheme
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data
- Diffuse interface methods for multiclass segmentation of high-dimensional data
- Efficient numerical solution of discrete multi-component Cahn-Hilliard systems
- Fast solvers for Cahn-Hilliard inpainting
- Finite element approximation of a model for phase separation of a multi-component alloy with non-smooth free energy
- Free energy of a nonuniform system. I: Interfacial free energy
- Inpainting of Binary Images Using the Cahn–Hilliard Equation
- Linking anisotropic sharp and diffuse surface motion laws via gradient flows
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- Methods of conjugate gradients for solving linear systems
- Modelling and simulations of multi-component lipid membranes and open membranes via diffuse interface approaches
- On the Cahn–Hilliard Equation with Degenerate Mobility
- On the Finite Element Solution of the Pure Neumann Problem
- Solving the Cahn-Hilliard variational inequality with a semi-smooth Newton method
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Threshold dynamics for the piecewise constant Mumford-Shah functional
- Unconditionally stable schemes for higher order inpainting
Cited in
(11)- Partial differential equations and variational methods for geometric processing of images
- Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products
- Convergence of the graph Allen-Cahn scheme
- Pseudoinverse graph convolutional networks. Fast filters tailored for large eigengaps of dense graphs and hypergraphs
- Mass-conserving diffusion-based dynamics on graphs
- An MBO scheme for minimizing the graph Ohta-Kawasaki functional
- Graph Merriman-Bence-Osher as a semidiscrete implicit Euler scheme for graph Allen-Cahn flow
- A literature survey of matrix methods for data science
- Proximal gradient methods for general smooth graph total variation model in unsupervised learning
- Classification and image processing with a semi‐discrete scheme for fidelity forced Allen–Cahn on graphs
- Diffuse interface methods for multiclass segmentation of high-dimensional data
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)
