Assignment Flows
From MaRDI portal
Publication:3300540
DOI10.1007/978-3-030-31351-7_8OpenAlexW4247163269MaRDI QIDQ3300540
Publication date: 29 July 2020
Published in: Handbook of Variational Methods for Nonlinear Geometric Data (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-31351-7_8
Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems (65Mxx) Numerical methods for partial differential equations, boundary value problems (65Nxx)
Related Items (9)
On the correspondence between replicator dynamics and assignment flows ⋮ Learning linear assignment flows for image labeling via exponential integration ⋮ On the geometric mechanics of assignment flows for metric data labeling ⋮ Learning linearized assignment flows for image labeling ⋮ Unsupervised assignment flow: label learning on feature manifolds by spatially regularized geometric assignment ⋮ Learning adaptive regularization for image labeling using geometric assignment ⋮ Assignment flow for order-constrained OCT segmentation ⋮ Continuous-domain assignment flows ⋮ Assignment flows for data labeling on graphs: convergence and stability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational Optimal Transport: With Applications to Data Science
- Nonlinear total variation based noise removal algorithms
- The dynamics of nonlinear relaxation labeling processes.
- High order Runge-Kutta methods on manifolds
- Image labeling by assignment
- Support-vector networks
- Foundations of quantization for probability distributions
- Symplectic Runge--Kutta Schemes for Adjoint Equations, Automatic Differentiation, Optimal Control, and More
- Introduction to Smooth Manifolds
- On the Foundations of Relaxation Labeling Processes
- Continuous Multiclass Labeling Approaches and Algorithms
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Numerical solution of saddle point problems
- Approximation algorithms for classification problems with pairwise relationships
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Graphical Models, Exponential Families, and Variational Inference
- Information, Physics, and Computation
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Scene Labeling by Relaxation Operations
- Evolutionary game dynamics
- A Graph Framework for Manifold-Valued Data
- Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment
- Quantization
- Geometric numerical integration of the assignment flow
- Geometric Modeling in Probability and Statistics
- Total Variation Regularization for Manifold-Valued Data
- Information Geometry
- A Copositive Programming Approach to Graph Partitioning
- Geometric Numerical Integration
- Elements of Information Theory
- All of Nonparametric Statistics
- Riemannian geometry and geometric analysis
This page was built for publication: Assignment Flows
