Yashwanth Ramamurthi

dblp:274/1527 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0003-4933-0898ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Visualization and visual analytics · 50% Geometric modeling and processing · 50%
Theoretical computer science
2 papers
Computational geometry · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
shape matching
1.322024
A Topological Distance Between Multi-Fields Based on Multi-Dimensional Persistence Diagrams · IEEE Trans. Vis. Comput. Graph. 2024
A Topological Similarity Measure Between Multi-Resolution Reeb Spaces · IEEE Trans. Vis. Comput. Graph. 2022
Visualization and visual analytics
topological data analysis
1.322024
A Topological Distance Between Multi-Fields Based on Multi-Dimensional Persistence Diagrams · IEEE Trans. Vis. Comput. Graph. 2024
A Topological Similarity Measure Between Multi-Resolution Reeb Spaces · IEEE Trans. Vis. Comput. Graph. 2022
Computational geometry › computational topology
topological data structures
0.422024
A Topological Distance Between Multi-Fields Based on Multi-Dimensional Persistence Diagrams · IEEE Trans. Vis. Comput. Graph. 2024
A Topological Similarity Measure Between Multi-Resolution Reeb Spaces · IEEE Trans. Vis. Comput. Graph. 2022

Methods — techniques the papers use, named apart from their topics

wasserstein distance · 1.5reeb graph decomposition · 1.5topological matching · 1.1multi-resolution reeb space · 1.1
YearPublicationVenuePosition
2024 A Topological Distance Between Multi-Fields Based on Multi-Dimensional Persistence Diagrams
abstract
The problem of computing topological distance between two scalar fields based on Reeb graphs or contour trees has been studied and applied successfully to various problems in topological shape matching, data analysis, and visualization. However, generalizing such results for computing distance measures between two multi-fields based on their Reeb spaces is still in its infancy. Towards this, in the current article we propose a technique to compute an effective distance measure between two multi-fields by computing a novel multi-dimensional persistence diagram (MDPD) corresponding to each of the (quantized) Reeb spaces. First, we construct a multi-dimensional Reeb graph (MDRG), which is a hierarchical decomposition of the Reeb space into a collection of Reeb graphs. The MDPD corresponding to each MDRG is then computed based on the persistence diagrams of the component Reeb graphs of the MDRG. Our distance measure extends the Wasserstein distance between two persistence diagrams of Reeb graphs to MDPDs of MDRGs. We prove that the proposed measure is a pseudo-metric and satisfies a stability property. Effectiveness of the proposed distance measure has been demonstrated in (i) shape retrieval contest data - SHREC 2010 and (ii) Pt-CO bond detection data from computational chemistry. Experimental results show that the proposed distance measure based on the Reeb spaces has more discriminating power in clustering the shapes and detecting the formation of a stable Pt-CO bond as compared to the similar measures between Reeb graphs.
Yashwanth Ramamurthi, Amit Chattopadhyay
IEEE Trans. Vis. Comput. Graph.1
2022 A Topological Similarity Measure Between Multi-Resolution Reeb Spaces
abstract
Searching similarity between a pair of shapes or data is an important problem in data analysis and visualization. The problem of computing similarity measures using scalar topology has been studied extensively and proven useful in the shape and data matching. Even though multi-field or multivariate (consists of multiple scalar fields) topology reveals richer topological features, research on building tools for computing similarity measures using multi-field topology is still in its infancy. In the current article, we propose a novel similarity measure between two piecewise-linear multi-fields based on their multi-resolution Reeb spaces - a newly developed data-structure that captures the topology of a multi-field. Overall, our method consists of two steps: (i) building a multi-resolution Reeb space corresponding to each of the multi-fields and (ii) proposing a similarity measure between two multi-resolution Reeb spaces by computing a list of topologically consistent matching pairs (of nodes) and the similarity between them. We demonstrate the effectiveness of the proposed similarity measure in detecting topological features from real time-varying multi-field data in two application domains - one from computational physics and one from computational chemistry.
Yashwanth Ramamurthi, Tripti Agarwal, Amit Chattopadhyay
IEEE Trans. Vis. Comput. Graph.1