A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling

From MaRDI portal
Publication:6173532

DOI10.1137/22M1496141zbMATH Open1521.39019arXiv2205.03991OpenAlexW4361290151MaRDI QIDQ6173532FDOQ6173532


Authors: Dmitrij Sitenko, Bastian Boll, Christoph Schnörr Edit this on Wikidata


Publication date: 21 July 2023

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

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.


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




Recommendations




Cites Work






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)