A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling
From MaRDI portal
Publication:6173532
geometric integrationreplicator equationinformation geometryDC programmingassignment flowsimage labelingnonlocal partial difference equation
Image analysis in multivariate analysis (62H35) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Applications of difference equations (39A60) Partial difference equations (39A14) Differential geometric aspects of statistical manifolds and information geometry (53B12)
Abstract: This paper introduces a novel nonlocal partial difference equation (G-PDE) for labeling metric data on graphs. The G-PDE is derived as nonlocal reparametrization of the assignment flow approach that was introduced in extit{J.~Math.~Imaging & Vision} 58(2), 2017. Due to this parameterization, solving the G-PDE numerically is shown to be equivalent to computing the Riemannian gradient flow with respect to a nonconvex potential. We devise an entropy-regularized difference-of-convex-functions (DC) decomposition of this potential and show that the basic geometric Euler scheme for integrating the assignment flow is equivalent to solving the G-PDE by an established DC programming scheme. Moreover, the viewpoint of geometric integration reveals a basic way to exploit higher-order information of the vector field that drives the assignment flow, in order to devise a novel accelerated DC programming scheme. A detailed convergence analysis of both numerical schemes is provided and illustrated by numerical experiments.
Recommendations
- Image labeling by assignment
- Numerical integration of Riemannian gradient flows for image labeling
- Eikonal equation adaptation on weighted graphs: fast geometric diffusion process for local and non-local image and data processing
- Nonlocal Operators with Applications to Image Processing
- Geometric numerical integration of the assignment flow
Cites work
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- scientific article; zbMATH DE number 1046019 (Why is no real title available?)
- scientific article; zbMATH DE number 1111402 (Why is no real title available?)
- scientific article; zbMATH DE number 1560711 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A combinatorial Laplacian with vertex weights
- A generalized proximal point algorithm for certain non-convex minimization problems
- A nonlocal vector calculus, nonlocal volume-constrained problems, and nonlocal balance laws
- ARPACK Users' Guide
- Accelerating the DC algorithm for smooth functions
- Analysis and approximation of nonlocal diffusion problems with volume constraints
- Analysis of optimization algorithms via integral quadratic constraints: nonstrongly convex problems
- Assignment flow for order-constrained OCT segmentation
- Assignment flows for data labeling on graphs: convergence and stability
- Axioms and fundamental equations of image processing
- Continuous-domain assignment flows
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convex Analysis
- Curvature driven interface evolution
- DC programming and DCA: thirty years of developments
- DC programming: overview.
- Deep learning
- Diffuse interface models on graphs for classification of high dimensional data
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Graphical models, exponential families, and variational inference
- Handbook of Variational Methods for Nonlinear Geometric Data
- Image denoising methods. A new nonlocal principle
- Image labeling by assignment
- Information geometry
- Learning adaptive regularization for image labeling using geometric assignment
- Learning linearized assignment flows for image labeling
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- Motion of multiple junctions: A level set approach
- Nonlinear total variation based noise removal algorithms
- Nonlocal Linear Image Regularization and Supervised Segmentation
- Nonlocal Modeling, Analysis, and Computation
- Nonlocal Operators with Applications to Image Processing
- Nonlocal diffusion problems
- Nonlocal discrete \(p\)-Laplacian driven image and manifold processing
- On functions representable as a difference of convex functions
- On the \(p\)-Laplacian and \(\infty\)-Laplacian on graphs with applications in image and data processing
- On the geometric mechanics of assignment flows for metric data labeling
- PDE evolutions for M-smoothers in one, two, and three dimensions
- Riemannian geometry and geometric analysis
- Self-assignment flows for unsupervised data labeling on graphs
- Smoothing and first order methods: a unified framework
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Total Variation in Imaging
- Unsupervised assignment flow: label learning on feature manifolds by spatially regularized geometric assignment
This page was built for publication: A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173532)
