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

Vivek Trivedy

dblp:340/0148 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2024
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
divergence minimization
0.812024
Image Retrieval with Self-Supervised Divergence Minimization and Cross-Attention Classification · IJCAI 2024
Information retrieval
image retrieval
0.812024
Image Retrieval with Self-Supervised Divergence Minimization and Cross-Attention Classification · IJCAI 2024

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

self-supervised learning · 1.5cross-attention · 1.5
YearPublicationVenuePosition
2024 Learning Object Focused Attention
Vivek Trivedy, Amani Almalki, Longin Jan Latecki
ICPR (9)1
2024 Image Retrieval with Self-Supervised Divergence Minimization and Cross-Attention Classification
Vivek Trivedy, Longin Jan Latecki
IJCAI1
2023 CNN2Graph: Building Graphs for Image Classification
abstract
Neural Network classifiers generally operate via the i.i.d. assumption where examples are passed through independently during training. We propose CNN2GNN and CNN2Transformer which instead leverage inter-example information for classification. We use Graph Neural Networks (GNNs) to build a latent space bipartite graph and compute cross-attention scores between input images and a proxy set. Our approach addresses several challenges of existing methods. Firstly, it is end-to-end differentiable despite the generally discrete nature of graph construction. Secondly, it allows inductive inference at no extra cost. Thirdly, it presents a simple method to construct graphs from arbitrary datasets that captures both example level and class level information. Finally, it addresses the proxy collapse problem by combining contrastive and cross-entropy losses rather than separate clustering algorithms. Our results increase classification performance over baseline experiments and outperform other methods. We also conduct an empirical investigation showing that Transformer style attention scales better than GAT attention with dataset size.
Vivek Trivedy, Longin Jan Latecki
WACV1