Abstract
Abstract. When working with hydrological data, the ability to quantify the similarity of different datasets is useful. The choice of how to make this quantification has a direct influence on the results, with different measures of similarity emphasising particular sources of error (for example, errors in amplitude as opposed to displacements in time and/or space). The Wasserstein distance considers the similarity of mass distributions through a transport lens. In a hydrological context, it measures the “effort” required to rearrange one distribution of water into the other. While being more broadly applicable, particular interest is paid to hydrographs in this work. The Wasserstein distance is adapted for working with hydrographs in two different ways and tested in a calibration and “averaging” of a hydrograph context. This alternative definition of fit is shown to be successful in accounting for timing errors due to imprecise rainfall measurements. The averaging of an ensemble of hydrographs is shown to be suitable when differences among the members are in peak shape and timing but not in total peak volume, where the traditional mean works well.
Subject
General Earth and Planetary Sciences,General Engineering,General Environmental Science
Reference38 articles.
1. Ambrosio, L., Gigli, N., and Savaré, G.: Gradient flows: in metric
spaces and in the space of probability measures, Birkhäuser, ISBN 3764387211, 2008. a, b
2. Benamou, J.-D., Froese, B. D., and Oberman, A. M.: Numerical solution of the
Optimal Transportation problem using the Monge–Ampère equation, J. Comput. Phys., 260, 107–126, https://doi.org/10.1016/j.jcp.2013.12.015, 2014. a
3. Bonneel, N., Rabin, J., Peyré, G., and Pfister, H.: Sliced and Radon
Wasserstein Barycenters of Measures, J. Math. Imag. Vis., 51, 22–45, https://doi.org/10.1007/s10851-014-0506-3, 2015. a, b, c
4. Brenier, Y.: Polar factorization and monotone rearrangement of vector-valued
functions, Commun. Pure Appl. Math., 44, 375–417, https://doi.org/10.1002/cpa.3160440402, 1991. a
5. Cuturi, M.: Sinkhorn Distances: Lightspeed Computation of Optimal Transport,
in: vol. 26, Advances in Neural Information Processing Systems, 5–10 December 2013, Nevada, USA, https://doi.org/10.48550/arXiv.1306.0895, 2013. a
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献