Suppr超能文献

带有路径映射的合并树测地线与重心

Merge Tree Geodesics and Barycenters with Path Mappings.

作者信息

Wetzels Florian, Pont Mathieu, Tierny Julien, Garth Christoph

出版信息

IEEE Trans Vis Comput Graph. 2024 Jan;30(1):1095-1105. doi: 10.1109/TVCG.2023.3326601. Epub 2023 Dec 25.

Abstract

Comparative visualization of scalar fields is often facilitated using similarity measures such as edit distances. In this paper, we describe a novel approach for similarity analysis of scalar fields that combines two recently introduced techniques: Wasserstein geodesics/barycenters as well as path mappings, a branch decomposition-independent edit distance. Effectively, we are able to leverage the reduced susceptibility of path mappings to small perturbations in the data when compared with the original Wasserstein distance. Our approach therefore exhibits superior performance and quality in typical tasks such as ensemble summarization, ensemble clustering, and temporal reduction of time series, while retaining practically feasible runtimes. Beyond studying theoretical properties of our approach and discussing implementation aspects, we describe a number of case studies that provide empirical insights into its utility for comparative visualization, and demonstrate the advantages of our method in both synthetic and real-world scenarios. We supply a C++ implementation that can be used to reproduce our results.

摘要

使用诸如编辑距离等相似性度量通常有助于对标量场进行比较可视化。在本文中,我们描述了一种用于标量场相似性分析的新颖方法,该方法结合了两种最近引入的技术:瓦瑟斯坦测地线/重心以及路径映射,一种与分支分解无关的编辑距离。实际上,与原始瓦瑟斯坦距离相比,我们能够利用路径映射对数据中小扰动的较低敏感性。因此,我们的方法在诸如集成汇总、集成聚类和时间序列的时间缩减等典型任务中表现出卓越的性能和质量,同时保持实际可行的运行时间。除了研究我们方法的理论特性并讨论实现方面,我们还描述了一些案例研究,这些研究为其在比较可视化中的效用提供了实证见解,并在合成和现实世界场景中展示了我们方法的优势。我们提供了一个C++实现,可用于重现我们的结果。

相似文献

1
Merge Tree Geodesics and Barycenters with Path Mappings.带有路径映射的合并树测地线与重心
IEEE Trans Vis Comput Graph. 2024 Jan;30(1):1095-1105. doi: 10.1109/TVCG.2023.3326601. Epub 2023 Dec 25.
2
Wasserstein Distances, Geodesics and Barycenters of Merge Trees.Wasserstein 距离、测地线和合并树的重心。
IEEE Trans Vis Comput Graph. 2022 Jan;28(1):291-301. doi: 10.1109/TVCG.2021.3114839. Epub 2021 Dec 24.
3
Progressive Wasserstein Barycenters of Persistence Diagrams.持久图的渐进瓦瑟斯坦重心
IEEE Trans Vis Comput Graph. 2019 Aug 12. doi: 10.1109/TVCG.2019.2934256.
4
Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing.使用局部敏感哈希的合并树快速比较分析
IEEE Trans Vis Comput Graph. 2025 Jan;31(1):141-151. doi: 10.1109/TVCG.2024.3456383. Epub 2024 Nov 25.
5
Edit Distance between Merge Trees.合并树之间的编辑距离。
IEEE Trans Vis Comput Graph. 2020 Mar;26(3):1518-1531. doi: 10.1109/TVCG.2018.2873612. Epub 2018 Oct 4.
6
Comparative Analysis of Merge Trees Using Local Tree Edit Distance.使用局部树编辑距离的合并树比较分析
IEEE Trans Vis Comput Graph. 2023 Feb;29(2):1518-1530. doi: 10.1109/TVCG.2021.3122176. Epub 2022 Dec 29.
7
Wasserstein Auto-Encoders of Merge Trees (and Persistence Diagrams).合并树(以及持久图)的瓦瑟斯坦自编码器
IEEE Trans Vis Comput Graph. 2024 Sep;30(9):6390-6406. doi: 10.1109/TVCG.2023.3334755. Epub 2024 Jul 31.
8
Computing a Stable Distance on Merge Trees.
IEEE Trans Vis Comput Graph. 2023 Jan;29(1):1168-1177. doi: 10.1109/TVCG.2022.3209395. Epub 2022 Dec 20.
10
A Structural Average of Labeled Merge Trees for Uncertainty Visualization.用于不确定性可视化的带标签合并树的结构平均值
IEEE Trans Vis Comput Graph. 2020 Jan;26(1):832-842. doi: 10.1109/TVCG.2019.2934242. Epub 2019 Aug 12.

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验