Network Inpainting via Optimal Transport
Enrico Facca, Jan Martin Nordbotten, Erik Andreas Hanson

TL;DR
This paper introduces a new method for network inpainting that leverages optimal transport theory to effectively reconstruct damaged networks from corrupted images, demonstrating strong performance in numerical tests.
Contribution
The paper presents a novel network inpainting technique combining data misfit minimization with optimal transport-based regularization, a new approach in this domain.
Findings
Effective reconstruction of damaged networks demonstrated.
Robustness to artifacts shown in numerical tests.
Outperforms existing methods in preserving network features.
Abstract
In this work, we present a novel tool for reconstructing networks from corrupted images. The reconstructed network is the result of a minimization problem that has a misfit term with respect to the observed data, and a physics-based regularizing term coming from the theory of optimal transport. Through a range of numerical tests, we demonstrate that our suggested approach can effectively rebuild the primary features of damaged networks, even when artifacts are present.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · Generative Adversarial Networks and Image Synthesis · 3D Shape Modeling and Analysis
