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

DOI10.1002/gamm.202100004arXiv2010.14556OpenAlexW3137048837MaRDI QIDQ6068273

Jonas Latz, Yves van Gennip, Unnamed Author

Publication date: 15 December 2023

Published in: GAMM-Mitteilungen (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.14556

zbMATH Keywords

Allen-Cahn equationgraph dynamicsNyström extensionfidelity constraintStrang formula

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Eigenvalues, singular values, and eigenvectors (15A18) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) PDEs with randomness, stochastic partial differential equations (35R60) Ginzburg-Landau equations (35Q56) PDEs on graphs and networks (ramified or polygonal spaces) (35R02) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (2)

Gradient flows and randomised thresholding: sparse inversion and classification* ⋮ Shape transformation on curved surfaces using a phase-field model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Recompression techniques for adaptive cross approximation
• Digital picture processing. An introduction. Transl. from the Russian
• A family of embedded Runge-Kutta formulae
• Auction dynamics: a volume constrained MBO scheme
• \(\Gamma\)-convergence of graph Ginzburg-Landau functionals
• Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images
• Mean curvature, threshold dynamics, and phase field theory on finite graphs
• Threshold dynamics for the piecewise constant Mumford-Shah functional
• A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
• An MBO Scheme on Graphs for Classification and Image Processing
• Optimal approximations by piecewise smooth functions and associated variational problems
• Uncertainty Quantification in Graph-Based Classification of High Dimensional Data
• Local minimisers and singular perturbations
• The Cahn–Hilliard gradient theory for phase separation with non-smooth free energy Part I: Mathematical analysis
• The Cahn–Hilliard gradient theory for phase separation with non-smooth free energy Part II: Numerical analysis
• Active contours without edges
• Generalizing Diffuse Interface Methods on Graphs: Nonsmooth Potentials and Hypergraphs
• Diffuse Interface Models on Graphs for Classification of High Dimensional Data
• Graph Merriman--Bence--Osher as a SemiDiscrete Implicit Euler Scheme for Graph Allen--Cahn Flow
• Lie Groups, Lie Algebras, and Representations
• Enhancing joint reconstruction and segmentation with non-convex Bregman iteration
• On the Construction and Comparison of Difference Schemes
• A Review of Image Denoising Algorithms, with a New One
• A Stochastic Approximation Method

This page was built for publication: Classification and image processing with a semi‐discrete scheme for fidelity forced Allen–Cahn on graphs