BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

121 related articles for article (PubMed ID: 37703168)

  • 1. 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]  

  • 2. A Topological Similarity Measure Between Multi-Resolution Reeb Spaces.
    Ramamurthi Y; Agarwal T; Chattopadhyay A
    IEEE Trans Vis Comput Graph; 2022 Dec; 28(12):4360-4374. PubMed ID: 34101594
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Computing Reeb Graphs as a Union of Contour Trees.
    Doraiswamy H; Natarajan V
    IEEE Trans Vis Comput Graph; 2013 Feb; 19(2):249-62. PubMed ID: 22529327
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Persistent Reeb Graph Matching for Fast Brain Search.
    Shi Y; Li J; Toga AW
    Mach Learn Med Imaging; 2014; 8679():306-313. PubMed ID: 25594076
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Output-Sensitive Construction of Reeb Graphs.
    Doraiswamy H; Natarajan V
    IEEE Trans Vis Comput Graph; 2012 Jan; 18(1):146-59. PubMed ID: 21301023
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Using Foliation Leaves to Extract Reeb Graphs on Surfaces.
    Wang S; Wang W; Zhao H
    IEEE Trans Vis Comput Graph; 2023 Apr; 29(4):2117-2131. PubMed ID: 35015643
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A Structural Average of Labeled Merge Trees for Uncertainty Visualization.
    Yan L; Wang Y; Munch E; Gasparovic E; Wang B
    IEEE Trans Vis Comput Graph; 2020 Jan; 26(1):832-842. PubMed ID: 31403426
    [TBL] [Abstract][Full Text] [Related]  

  • 8. 3D Surface-Based Geometric and Topological Quantification of Retinal Microvasculature in OCT-Angiography via Reeb Analysis.
    Zhang J; Kashani AH; Shi Y
    Med Image Comput Comput Assist Interv; 2019; 11764():57-65. PubMed ID: 33860287
    [TBL] [Abstract][Full Text] [Related]  

  • 9. 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]  

  • 10. Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees.
    Tierny J; Gyulassy A; Simon E; Pascucci V
    IEEE Trans Vis Comput Graph; 2009; 15(6):1177-84. PubMed ID: 19834187
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Anisotropic Laplace-Beltrami Eigenmaps: Bridging Reeb Graphs and Skeletons.
    Shi Y; Lai R; Krishna S; Sicotte N; Dinov I; Toga AW
    Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit; 2008 Jul; 2008():1-7. PubMed ID: 21339850
    [TBL] [Abstract][Full Text] [Related]  

  • 12. 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]  

  • 13. Interactive Visualization for Singular Fibers of Functions f : R³ → R².
    Sakurai D; Saeki O; Carr H; Wu HY; Yamamoto T; Duke D; Takahashi S
    IEEE Trans Vis Comput Graph; 2016 Jan; 22(1):945-54. PubMed ID: 26529738
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Shape Analysis with Hyperbolic Wasserstein Distance.
    Shi J; Zhang W; Wang Y
    Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit; 2016 Jun; 2016():5051-5061. PubMed ID: 28392672
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A Comparative Study of the Perceptual Sensitivity of Topological Visualizations to Feature Variations.
    Athawale TM; Triana B; Kotha T; Pugmire D; Rosen P
    IEEE Trans Vis Comput Graph; 2024 Jan; 30(1):1074-1084. PubMed ID: 37871073
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Wasserstein Discriminant Dictionary Learning for Graph Representation.
    Zhang T; Liu G; Cui Z; Liu W; Zheng W; Yang J
    IEEE Trans Pattern Anal Mach Intell; 2024 Jun; PP():. PubMed ID: 38837929
    [TBL] [Abstract][Full Text] [Related]  

  • 17. 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]  

  • 18. 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]  

  • 19. Edit Distance between Merge Trees.
    Sridharamurthy R; Masood TB; Kamakshidasan A; Natarajan V
    IEEE Trans Vis Comput Graph; 2020 Mar; 26(3):1518-1531. PubMed ID: 30295620
    [TBL] [Abstract][Full Text] [Related]  

  • 20. The Topology ToolKit.
    Tierny J; Favelier G; Levine JA; Gueunet C; Michaux M
    IEEE Trans Vis Comput Graph; 2018 Jan; 24(1):832-842. PubMed ID: 28866503
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.