Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vikram Ravindra

dblp:155/8679 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
4since 2021 · last 2025
0000-0002-9315-6594ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 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.

Network and information security
1 paper
Privacy and data protection · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 50% Bioinformatics and computational biology · 50%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph matching
graph alignment
0.712023
Aligning Spatially Constrained Graphs · IEEE Trans. Knowl. Data Eng. 2023
Graph algorithms and graph theory
graph matching
0.712023
Aligning Spatially Constrained Graphs · IEEE Trans. Knowl. Data Eng. 2023
Privacy and data protection
anonymization
0.512021
De-anonymization Attacks on Neuroimaging Datasets · SIGMOD Conference 2021
Privacy and data protection › de-anonymization
de-anonymization attack
0.512021
De-anonymization Attacks on Neuroimaging Datasets · SIGMOD Conference 2021
Bioinformatics and computational biology › computational neuroscience › neural response modeling
neural response prediction
0.412020
Characterizing Similarity of Visual Stimulus from Associated Neuronal Response · IJCAI 2020
Medical and health informatics › neuroimaging
neuroimaging analysis
0.412020
Characterizing Similarity of Visual Stimulus from Associated Neuronal Response · IJCAI 2020

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

block coordinate descent · 0.7matrix analysis · 0.5feature extraction · 0.5archetypal analysis · 0.4
YearPublicationVenuePosition
2025 Practical Comparisons of Reservoir Topology Performance and Input Distribution in Digital Reservoir Computers
Lewis Thelen, Vikram Ravindra
AAMAS2
2023 Aligning Spatially Constrained Graphs
abstract
We focus on the problem of aligning graphs that have a spatial basis. In such graphs, which we refer to asrigid graphs, nodes have preferred positions relative to their graph neighbors. Rigid graphs can be used to abstract objects in diverse applications such as large biomolecules, where edges corresponding to chemical bonds have preferred lengths, functional connectomes of the human brain, where edges corresponding to co-firing regions of the brain have preferred anatomical distances, and mobile device/ sensor communication logs, where edges corresponding to point-to-point communications across devices have distance constraints. Effective analysis of such graphs must account for edge lengths in addition to topological features. For instance, when identifying conserved patterns through graph alignment, it is important for matched edges to have correlated lengths, in addition to topological similarity. In this paper, we formulate the problem ofrigid graph alignmentand present a method for solving it. Our formulation of rigid graph alignment simultaneously aligns the topology of the input graphs, as well as the geometric structure represented by the edge lengths, which is solved using a block coordinate descent technique. Using detailed experiments on real and synthetic datasets, we demonstrate a number of important desirable features of our method: (i) it significantly outperforms topological and structural aligners on a wide range of problems; (ii) it scales to problems in important real-world applications; and (iii) it has excellent stability properties, in view of noise and missing data in typical applications.
Vikram Ravindra, Huda Nassar, David F. Gleich, Ananth Grama
IEEE Trans. Knowl. Data Eng.1
2021 Identifying Coherent Subgraphs In Dynamic Brain Networks
abstract
Dynamic graphs are natural abstractions for modeling correlations in brain activity. These correlation graphs are constructed from time-series signals corresponding to neuronal activity in different regions of the brain over suitably selected time windows, by linking correlated regions via edges. An important problem in the context of these dynamic correlation graphs is the discovery of sets of regions of the brain, whose activity level is temporally coherent. These manifest as temporally persistent sub-graphs that are strongly connected, referred to as coherent subgraphs. In this paper, we present a model and method for identifying coherent subgraphs in dynamic correlation graphs. We show that densely connected components in correlation graphs can be effectively modeled as low-rank sub-matrices derived from the time series signals. Specifically, we derive theoretical results showing that quasi cliques in a correlation graph can be inferred from rows of the left singular matrix of its time-series, and can be tracked in time to identify coherent subgraphs. We apply our proposed method to real-world time-series data from functional MRIs. We show that signals corresponding to nodes in coherent subgraphs can accurately predict whether the subject was actively performing a cognitive task, or was at rest. Furthermore, we also show that the same set of nodes can predict task outcomes/ conditions (such as win v/s loss in a gambling task). To the best of our knowledge, our work is the first in theoretically modeling and analyzing dynamic brain networks using spectral decomposition of the windowed time-series.
Vikram Ravindra, Geoffrey Sanders, Ananth Grama
ICIP1
2021 De-anonymization Attacks on Neuroimaging Datasets
abstract
Advances in imaging technologies, combined with inexpensive storage, have led to an explosion in the volume of publicly available neuroimaging datasets. Effective analyses of these images hold the potential for uncovering mechanisms that govern functioning of the human brain, and understanding various neurological diseases and disorders. The potential significance of these studies notwithstanding, a growing concern relates to the protection of privacy and confidentiality of subjects who participate in these studies. In this paper, we present a de-anonymization attack rooted in the innate uniqueness of the structure and function of the human brain. We show that the attack reveals not only the identity of an individual, but also the efficacy with which they performing cognitive tasks. Our attack relies on novel matrix analyses techniques that are used to extract discriminating features in neuroimages. These features correspond to individual-specific signatures that can be matched across datasets for highly accurate identification. We present data preprocessing, signature extraction, and matching techniques that are computationally inexpensive, and can scale to large datasets. We characterize the efficacy of our de-anonymization attacks on publicly available databases. Finally, we discuss implications of the attack and challenges associated with defending against such attacks.
Vikram Ravindra, Ananth Grama
SIGMOD Conference1
2020 Characterizing Similarity of Visual Stimulus from Associated Neuronal Response
abstract
The problem of characterizing brain functions such as memory, perception, and processing of stimuli has received significant attention in neuroscience literature. These experiments rely on carefully calibrated, albeit complex inputs, to record brain response to signals. A major problem in analyzing brain response to common stimuli such as audio-visual input from videos (e.g., movies) or story narration through audio books, is that observed neuronal responses are due to combinations of ``pure'' factors, many of which may be latent. In this paper, we present a novel methodological framework for deconvolving the brain's response to mixed stimuli into its constituent responses to underlying pure factors. This framework, based on archetypal analysis, is applied to the analysis of imaging data from an adult cohort watching the BBC show, Sherlock. By focusing on visual stimulus, we show strong correlation between our observed deconvolved response and third-party textual video annotations -- demonstrating the significant power of our analyses techniques. Building on these results, we show that our techniques can be used to predict neuronal responses in new subjects (how other individuals react to Sherlock), as well as to new visual content (how individuals react to other videos with known annotations). This paper reports on the first study that relates video features with neuronal responses in a rigorous algorithmic and statistical framework based on deconvolution of observed mixed imaging signals using archetypal analysis.
Vikram Ravindra, Ananth Grama
IJCAI1