126 related articles for article (PubMed ID: 31403427)
1. Progressive Wasserstein Barycenters of Persistence Diagrams.
Vidal J; Budin J; Tierny J
IEEE Trans Vis Comput Graph; 2019 Aug; ():. PubMed ID: 31403427
[TBL] [Abstract][Full Text] [Related]
2. Wasserstein Distances, Geodesics and Barycenters of Merge Trees.
Pont M; Vidal J; Delon J; Tierny J
IEEE Trans Vis Comput Graph; 2022 Jan; 28(1):291-301. PubMed ID: 34596544
[TBL] [Abstract][Full Text] [Related]
3. Wasserstein Dictionaries of Persistence Diagrams.
Sisouk K; Delon J; Tierny J
IEEE Trans Vis Comput Graph; 2024 Feb; 30(2):1638-1651. PubMed ID: 37930922
[TBL] [Abstract][Full Text] [Related]
4. Multisource single-cell data integration by MAW barycenter for Gaussian mixture models.
Lin L; Shi W; Ye J; Li J
Biometrics; 2023 Jun; 79(2):866-877. PubMed ID: 35220585
[TBL] [Abstract][Full Text] [Related]
5. Merge Tree Geodesics and Barycenters with Path Mappings.
Wetzels F; Pont M; Tierny J; Garth C
IEEE Trans Vis Comput Graph; 2024 Jan; 30(1):1095-1105. PubMed ID: 37878452
[TBL] [Abstract][Full Text] [Related]
6. Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data - An Algorithm and A Benchmark.
Guillou P; Vidal J; Tierny J
IEEE Trans Vis Comput Graph; 2023 Jan; PP():. PubMed ID: 37021884
[TBL] [Abstract][Full Text] [Related]
7. Scalable Gromov-Wasserstein Based Comparison of Biological Time Series.
Kravtsova N; McGee Ii RL; Dawes AT
Bull Math Biol; 2023 Jul; 85(8):77. PubMed ID: 37415049
[TBL] [Abstract][Full Text] [Related]
8. Wasserstein Auto-Encoders of Merge Trees (and Persistence Diagrams).
Pont M; Tierny J
IEEE Trans Vis Comput Graph; 2023 Nov; PP():. PubMed ID: 38015696
[TBL] [Abstract][Full Text] [Related]
9. Continual Learning of Generative Models With Limited Data: From Wasserstein-1 Barycenter to Adaptive Coalescence.
Dedeoglu M; Lin S; Zhang Z; Zhang J
IEEE Trans Neural Netw Learn Syst; 2023 Mar; PP():. PubMed ID: 37028381
[TBL] [Abstract][Full Text] [Related]
10. Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams).
Pont M; Vidal J; Tierny J
IEEE Trans Vis Comput Graph; 2023 Feb; 29(2):1573-1589. PubMed ID: 36251893
[TBL] [Abstract][Full Text] [Related]
11. Wasserstein barycenter regression for estimating the joint dynamics of renewable and fossil fuel energy indices.
De Giuli ME; Spelta A
Comput Manag Sci; 2023; 20(1):1. PubMed ID: 37520271
[TBL] [Abstract][Full Text] [Related]
12. A Progressive Approach to Scalar Field Topology.
Vidal J; Guillou P; Tierny J
IEEE Trans Vis Comput Graph; 2021 Jun; 27(6):2833-2850. PubMed ID: 33606631
[TBL] [Abstract][Full Text] [Related]
13. Linear and Deep Order-Preserving Wasserstein Discriminant Analysis.
Su B; Zhou J; Wen JR; Wu Y
IEEE Trans Pattern Anal Mach Intell; 2022 Jun; 44(6):3123-3138. PubMed ID: 33434122
[TBL] [Abstract][Full Text] [Related]
14. Jacobi Fiber Surfaces for Bivariate Reeb Space Computation.
Tierny J; Carr H
IEEE Trans Vis Comput Graph; 2017 Jan; 23(1):960-969. PubMed ID: 27875209
[TBL] [Abstract][Full Text] [Related]
15. Variational Wasserstein Clustering.
Mi L; Zhang W; Gu X; Wang Y
Comput Vis ECCV; 2018 Sep; 11219():336-352. PubMed ID: 30775724
[TBL] [Abstract][Full Text] [Related]
16. A Topological Distance Between Multi-Fields Based on Multi-Dimensional Persistence Diagrams.
Ramamurthi Y; Chattopadhyay A
IEEE Trans Vis Comput Graph; 2023 Sep; PP():. PubMed ID: 37703168
[TBL] [Abstract][Full Text] [Related]
17. Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformers.
Haviv D; Kunes RZ; Dougherty T; Burdziak C; Nawy T; Gilbert A; Pe'er D
ArXiv; 2024 Jun; ():. PubMed ID: 38827453
[TBL] [Abstract][Full Text] [Related]
18. Multimarginal Wasserstein Barycenter for Stain Normalization and Augmentation.
Nadeem S; Hollmann T; Tannenbaum A
Med Image Comput Comput Assist Interv; 2020 Oct; 12265():362-371. PubMed ID: 33458721
[TBL] [Abstract][Full Text] [Related]
19. Proxying credit curves via Wasserstein distances.
Michielon M; Khedher A; Spreij P
Ann Oper Res; 2022 Feb; ():1-17. PubMed ID: 35194285
[TBL] [Abstract][Full Text] [Related]
20. A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clustering.
Qin Y; Fasy BT; Wenk C; Summa B
IEEE Trans Vis Comput Graph; 2022 Jan; 28(1):302-312. PubMed ID: 34587087
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
