咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >NETWORK INPAINTING VIA OPTIMAL... 收藏
arXiv

NETWORK INPAINTING VIA OPTIMAL TRANSPORT

作     者:Facca, Enrico Nordbotten, Jan Martin Hanson, Erik Andreas 

作者机构:Department of Mathematics University of Bergen Bergen Norway Department of Computer science Electrical engineering and Mathematical sciences Western Norway University of Applied Sciences Bergen Norway 

出 版 物:《arXiv》 (arXiv)

年 卷 期:2024年

核心收录:

主  题:Inverse problems 

摘      要: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 *** Codes 49-04, 49K20, 49N99, 65N21, 65N30, 65Z05 © 2024, CC BY.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分