The quadratic Wasserstein metric for inverse data matching

From MaRDI portal
Publication:5000594

DOI10.1088/1361-6420/AB7E04zbMATH Open1465.49029arXiv1911.06911OpenAlexW2984655496MaRDI QIDQ5000594FDOQ5000594


Authors: Björn Engquist, Kui Ren, Yunan Yang Edit this on Wikidata


Publication date: 14 July 2021

Published in: Inverse Problems (Search for Journal in Brave)

Abstract: This work characterizes, analytically and numerically, two major effects of the quadratic Wasserstein (W2) distance as the measure of data discrepancy in computational solutions of inverse problems. First, we show, in the infinite-dimensional setup, that the W2 distance has a smoothing effect on the inversion process, making it robust against high-frequency noise in the data but leading to a reduced resolution for the reconstructed objects at a given noise level. Second, we demonstrate that for some finite-dimensional problems, the W2 distance leads to optimization problems that have better convexity than the classical L2 and H1 distances, making it a more preferred distance to use when solving such inverse matching problems.


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




Recommendations




Cites Work


Cited In (15)





This page was built for publication: The quadratic Wasserstein metric for inverse data matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000594)