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

Thorsten Bagdonat

dblp:210/8582 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0002-4008-6721ORCID · reported

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

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

Artificial intelligence
2 papers
Vision and language · 40% Image recognition and object detection · 26% Segmentation and scene understanding · 17%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection
image cropping
0.912025
FOCUS: Internal MLLM Representations for Efficient Fine-Grained Visual Question Answering · NeurIPS 2025
Computer vision › Vision and language › vision-language model
multimodal large language model
0.912025
FOCUS: Internal MLLM Representations for Efficient Fine-Grained Visual Question Answering · NeurIPS 2025
Computer vision › Vision and language
visual question answering
0.912025
FOCUS: Internal MLLM Representations for Efficient Fine-Grained Visual Question Answering · NeurIPS 2025
Machine learning › Efficient and distributed learning
distributed training
0.812024
Distributed Semantic Segmentation with Efficient Joint Source and Task Decoding · ECCV (88) 2024
Computer vision › Segmentation and scene understanding
semantic segmentation
0.812024
Distributed Semantic Segmentation with Efficient Joint Source and Task Decoding · ECCV (88) 2024
Computer vision › Image recognition and object detection
object localization
0.312025
FOCUS: Internal MLLM Representations for Efficient Fine-Grained Visual Question Answering · NeurIPS 2025

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

key-value cache · 0.9attention · 0.9joint source and task decoding · 0.8
YearPublicationVenuePosition
2025 Empirical Spatial Error Bounds for Reliable Semantic Segmentation of Pedestrians and Riders
abstract
The mean intersection over union (mloU) is a standard metric for evaluating semantic segmentation models. While steady improvements in mloU have been achieved on automotive benchmarks like Cityscapes, their impact on reliably detecting vulnerable road users, such as pedestrians and riders, remains unclear. This study empirically analyzes 167 semantic segmentation models w.r.t. the spatial distribution of the false positive rate and false negative rate in the Cityscapes dataset. Our analysis reveals that many segmentation errors occur at object contours, which hardly influence driving decisions and road user safety. Accordingly, we propose to exclude such irrelevant errors. We define spatial error bounds within which models reliably detect pedestrians and riders. Since time-to-collision is strongly related to distance, and a vertical pixel position is roughly related to distance, the vertical position of segmentation errors provides an effective way to evaluate the reliability of semantic segmentation models on an entire dataset. Our evaluation of such empirical spatial error bounds reveals that strong models (w.r.t. mloU) are related to an improved detection of existing pedestrians (false negative rate, FNR). On the other hand, mloU in general is only weakly related to hallucinations of pedestrians and riders (false positive rate, FPR). Some models even exhibit a higher FPR despite having a 11.2% absolute higher mloU.
Timo Bartels, Malte Stelzer, Jan Bickerdt, Volker Schomerus, Jan Piewek, Thorsten Bagdonat, Tim Fingscheidt
IV6
2025 A Generalized Waypoint Loss for End-to-End Autonomous Driving
abstract
Many approaches in autonomous driving generate future waypoints to form trajectories, which are then used to derive driving commands. During imitation learning for end-to-end autonomous driving, these trajectories are typically learned using a straightforward$L_{1}$loss, which compares the model's predictions to those of an expert. In this paper, we propose a separation of longitudinal and lateral components of the$L_{1}$loss that weighs these independently, thereby aligning more with the separate handling of longitudinal and lateral control by PID controllers in the model pipeline. We employ this novel generalized waypoint loss with the TransFuser architecture in the CARLA simulator and show that we can control and improve on certain infraction types, without a performance loss in any other metric. Additionally, we investigate a novel ensemble technique that produces a more cautious ensemble, reducing infractions while maintaining overall performance. For future work, our novel loss formulation enables the definition of a time-variant loss tailored to specific traffic scenarios in the training data.
Malte Stelzer, Timo Bartels, Jan Bickerdt, Volker Schomerus, Jan Piewek, Thorsten Bagdonat, Tim Fingscheidt
IV6
2025 FOCUS: Internal MLLM Representations for Efficient Fine-Grained Visual Question Answering
abstract
While Multimodal Large Language Models (MLLMs) offer strong perception and reasoning capabilities for image-text input, Visual Question Answering (VQA) focusing on small image details still remains a challenge. Although visual cropping techniques seem promising, recent approaches have several limitations: the need for task-specific fine-tuning, low efficiency due to uninformed exhaustive search, or incompatibility with efficient attention implementations. We address these shortcomings by proposing a training-free visual cropping method, dubbed FOCUS, that leverages MLLM-internal representations to guide the search for the most relevant image region. This is accomplished in four steps: first, we identify the target object(s) in the VQA prompt; second, we compute an object relevance map using the key-value (KV) cache; third, we propose and rank relevant image regions based on the map; and finally, we perform the fine-grained VQA task using the top-ranked region. As a result of this informed search strategy, FOCUS achieves strong performance across four fine-grained VQA datasets and three types of MLLMs. It outperforms three popular visual cropping methods in both accuracy and efficiency, and matches the best-performing baseline, ZoomEye, while requiring 3 – 6.5 × less compute.
Liangyu Zhong, Fabio Rosenthal, Joachim Sicking, Fabian Hüger, Thorsten Bagdonat, Hanno Gottschalk, Leo Schwinn
NeurIPS5
2024 Distributed Semantic Segmentation with Efficient Joint Source and Task Decoding
Danish Nazir, Timo Bartels, Jan Piewek, Thorsten Bagdonat, Tim Fingscheidt
ECCV (88)4