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

Gopika Sudhakaran

dblp:213/0247 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0007-3721-5602ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Graphics, 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.

Artificial intelligence
3 papers
Vision and language · 48% Segmentation and scene understanding · 23% Knowledge representation and reasoning · 18%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language
visual relationship detection
1.522025
ART: Adaptive Relation Tuning for Generalized Relation Prediction · ICCV 2025
Vision Relation Transformer for Unbiased Scene Graph Generation · ICCV 2023
Natural language and speech › Language models and text generation
instruction tuning
0.912025
ART: Adaptive Relation Tuning for Generalized Relation Prediction · ICCV 2025
Computer vision › Vision and language
vision-language model
0.912025
ART: Adaptive Relation Tuning for Generalized Relation Prediction · ICCV 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › neuro-symbolic reasoning
differentiable reasoning
0.812024
DeiSAM: Segment Anything with Deictic Prompting · NeurIPS 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic-based reasoning
0.812024
DeiSAM: Segment Anything with Deictic Prompting · NeurIPS 2024
Computer vision › Segmentation and scene understanding
prompt-based segmentation
0.812024
DeiSAM: Segment Anything with Deictic Prompting · NeurIPS 2024
Computer vision › Vision and language › visual reasoning
scene graph reasoning
0.812024
DeiSAM: Segment Anything with Deictic Prompting · NeurIPS 2024
Computer vision › Vision and language
visual reasoning
0.812024
DeiSAM: Segment Anything with Deictic Prompting · NeurIPS 2024
Computer vision › Segmentation and scene understanding
scene graph generation
0.712023
Vision Relation Transformer for Unbiased Scene Graph Generation · ICCV 2023
Computer vision › Segmentation and scene understanding › image segmentation
scene segmentation
0.312025
ART: Adaptive Relation Tuning for Generalized Relation Prediction · ICCV 2025
Computer vision › Segmentation and scene understanding
scene understanding
0.212023
Vision Relation Transformer for Unbiased Scene Graph Generation · ICCV 2023

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

prompt tuning · 0.9instruction tuning · 0.9adaptive sampling · 0.9scene graph · 0.8large language model · 0.8differentiable logic reasoner · 0.8vision relation transformer · 0.7mutually exclusive expert learning · 0.7graph attention · 0.7
YearPublicationVenuePosition
2025 ART: Adaptive Relation Tuning for Generalized Relation Prediction
abstract
Visual relation detection (VRD) is the task of identifying the relationships between objects in a scene. VRD models trained solely on relation detection data struggle to generalize beyond the relations on which they are trained. While prompt tuning has been used to adapt vision-language models (VLMs) for VRD, it uses handcrafted prompts and struggles with novel or complex relations. We argue that instruction tuning offers a more effective solution by fine-tuning VLMs on diverse instructional data. We thus introduce ART, an Adaptive Relation Tuning framework that adapts VLMs for VRD through instruction tuning and strategic instance selection. By converting VRD datasets into an instruction tuning format and employing an adaptive sampling algorithm, ART directs the VLM to focus on informative relations while maintaining generalizability. Specifically, we focus on the relation classification, where subject-object boxes are given and the model predicts the predicate between them. We tune on a held-in set and evaluate across multiple held-out datasets of varying complexity. Our approach strongly improves over its baselines and can infer unseen relation concepts, a capability absent in mainstream VRD methods. We demonstrate ART's practical value by using the predicted relations for segmenting complex scenes.
Gopika Sudhakaran, Hikaru Shindo, Patrick Schramowski, Simone Schaub-Meyer, Kristian Kersting, Stefan Roth 0001
ICCV1
2024 DeiSAM: Segment Anything with Deictic Prompting
abstract
Large-scale, pre-trained neural networks have demonstrated strong capabilities in various tasks, including zero-shot image segmentation. To identify concrete objects in complex scenes, humans instinctively rely on deictic descriptions in natural language, i.e., referring to something depending on the context such as "The object that is on the desk and behind the cup.". However, deep learning approaches cannot reliably interpret such deictic representations due to their lack of reasoning capabilities in complex scenarios. To remedy this issue, we propose DeiSAM — a combination of large pre-trained neural networks with differentiable logic reasoners — for deictic promptable segmentation. Given a complex, textual segmentation description, DeiSAM leverages Large Language Models (LLMs) to generate first-order logic rules and performs differentiable forward reasoning on generated scene graphs. Subsequently, DeiSAM segments objects by matching them to the logically inferred image regions. As part of our evaluation, we propose the Deictic Visual Genome (DeiVG) dataset, containing paired visual input and complex, deictic textual prompts. Our empirical results demonstrate that DeiSAM is a substantial improvement over purely data-driven baselines for deictic promptable segmentation.
Hikaru Shindo, Manuel Brack, Gopika Sudhakaran, Devendra Singh Dhami, Patrick Schramowski, Kristian Kersting
NeurIPS3
2023 Vision Relation Transformer for Unbiased Scene Graph Generation
abstract
Recent years have seen a growing interest in Scene Graph Generation (SGG), a comprehensive visual scene understanding task that aims to predict entity relationships using a relation encoder-decoder pipeline stacked on top of an object encoder-decoder backbone. Unfortunately, current SGG methods suffer from an information loss regarding the entities’ local-level cues during the relation encoding process. To mitigate this, we introduce the Vision rElation TransfOrmer (VETO), consisting of a novel local-level entity relation encoder. We further observe that many existing SGG methods claim to be unbiased, but are still biased towards either head or tail classes. To overcome this bias, we introduce a Mutually Exclusive ExperT (MEET) learning strategy that captures important relation features without bias towards head or tail classes. Experimental results on the VG and GQA datasets demonstrate that VETO + MEET boosts the predictive performance by up to 47% over the state of the art while being ∼ 10× smaller.1
Gopika Sudhakaran, Devendra Singh Dhami, Kristian Kersting, Stefan Roth 0001
ICCV1