In this work, we present a novel tool for reconstructing transport 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. Under the assumption that such physical information can be properly identified, we demonstrate through a range of numerical tests that our approach can effectively rebuild the primary features of damaged networks, even when artifacts are present.
Network inpainting via optimal transport
Facca, Enrico
Primo
;
2026
Abstract
In this work, we present a novel tool for reconstructing transport 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. Under the assumption that such physical information can be properly identified, we demonstrate through a range of numerical tests that our approach can effectively rebuild the primary features of damaged networks, even when artifacts are present.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0898122126001495-main.pdf
accesso aperto
Descrizione: versione editoriale
Tipologia:
Full text (versione editoriale)
Licenza:
Creative commons
Dimensione
1.79 MB
Formato
Adobe PDF
|
1.79 MB | Adobe PDF | Visualizza/Apri |
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


