Demo Data from SIGIR 2026 / reviewers in the wild / expert
Julian Lorenz
dblp:09/2994
· DBLP profile ↗
9ranked-venue papers
4as first author
6since 2021 · last 2026
0000-0002-8893-4355ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Theory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 |
Segmentation and scene understanding · 80% Trustworthy machine learning · 12% Reinforcement learning · 4% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Segmentation and scene understanding › scene graph generation
panoptic scene graph generation |
0.8 | 1 | 2024 | A Fair Ranking and New Model for Panoptic Scene Graph Generation · ECCV (61) 2024 |
Computer vision › Segmentation and scene understanding
scene graph generation |
0.8 | 1 | 2024 | A Fair Ranking and New Model for Panoptic Scene Graph Generation · ECCV (61) 2024 |
Machine learning › Trustworthy machine learning
fairness |
0.2 | 1 | 2024 | A Fair Ranking and New Model for Panoptic Scene Graph Generation · ECCV (61) 2024 |
Machine learning › Reinforcement learning
observational learning |
0.1 | 1 | 2007 | Observational Learning in Random Networks · COLT 2007 |
Machine learning › Graph learning
random graphs |
0.1 | 1 | 2007 | Observational Learning in Random Networks · COLT 2007 |
Methods — techniques the papers use, named apart from their topics
fair ranking · 0.8network analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Uplifting Table Tennis: A Robust, Real-World Application for 3D Trajectory and Spin EstimationabstractObtaining the precise 3D motion of a table tennis ball from standard monocular videos is a challenging problem, as existing methods trained on synthetic data struggle to generalize to the noisy, imperfect ball and table detections of the real world. This is primarily due to the inherent lack of 3D ground truth trajectories and spin annotations for real-world video. To overcome this, we propose a novel two-stage pipeline that divides the problem into a front-end perception task and a back-end 2D-to-3D uplifting task. This separation allows us to train the front-end components with abundant 2D supervision from our newly created TTHQ dataset, while the back-end uplifting network is trained exclusively on physically-correct synthetic data. We specifically re-engineer the uplifting model to be robust to common real-world artifacts, such as missing detections and varying frame rates. By integrating a ball detector and a table keypoint detector, our approach transforms a proof-of-concept uplifting method into a practical, robust, and high-performing end-to-end application for 3D table tennis trajectory and spin analysis. Daniel Kienzle, Katja Ludwig, Julian Lorenz, Shin'ichi Satoh 0001, Rainer Lienhart |
WACV | 3 |
| 2025 | MMMS: Multi-Modal Multi-Surface Interactive SegmentationabstractIn this paper, we present a method to interactively create segmentation masks on the basis of user clicks. We pay particular attention to the segmentation of multiple surfaces that are simultaneously present in the same image. Since these surfaces may be heavily entangled and adjacent, we also present a novel extended evaluation metric that accounts for the challenges of this scenario. Additionally, the presented method is able to use multi-modal inputs to facilitate the segmentation task. At the center of this method is a network architecture which takes as input an RGB image, a number of non-RGB modalities, an erroneous mask, and encoded clicks. Based on this input, the network predicts an improved segmentation mask. We design our architecture such that it adheres to two conditions: (1) The RGB backbone is only available as a black-box. (2) To reduce the response time, we want our model to integrate the interaction-specific information after the image feature extraction and the multi-modal fusion. We refer to the overall task as multi-modal multi-surface interactive segmentation (MMMS). We are able to show the effectiveness of our multi-modal fusion strategy. Using additional modalities, our system reduces the NoC@90 by up to 1.28 clicks per surface on average on DeLiVER and up to 1.19 on MFNet. On top of this, we are able to show that our RGB-only baseline achieves competitive, and in some cases even superior performance when tested in a classical, single-mask interactive segmentation scenario. Robin Schön, Julian Lorenz, Katja Ludwig, Daniel Kienle, Rainer Lienhart |
CBMI | 2 |
| 2024 | Towards Learning Monocular 3D Object Localization from 2D Labels Using the Physical Laws of MotionabstractWe present a novel method for precise 3D object localization in single images from a single calibrated camera using only 2D labels. No expensive 3D labels are needed. Thus, instead of using 3D labels, our model is trained with easy-to-annotate 2D labels along with the physical knowledge of the object’s motion. Given this information, the model can infer the latent third dimension, even though it has never seen this information during training. Our method is evaluated on both synthetic and real-world datasets, and we are able to achieve a mean distance error of just 6 cm in our experiments on real data. The results indicate the method’s potential as a step towards learning 3D object location estimation, where collecting 3D data for training is not feasible. Daniel Kienzle, Katja Ludwig, Julian Lorenz, Rainer Lienhart |
3DV | 3 |
| 2024 | UNCOVER: Data-Driven Design Support through Continuous Monitoring of Security IncidentsabstractThe seamless and secure integration of subsystems is a pivotal requirement within contemporary automotive development, necessitating the application of design methodologies like the Vee model. While this approach includes dedicated verification steps for the included contexts and provides a high level of assurance that the system will operate correctly under specified conditions, formalizing specifications outside its operational design domain is per definition not included. Additionally, black-box systems like machine learning based functions prove difficulty to test by these traditional methodologies. In this project, we introduce and demonstrate a design workflow combining the Vee model design paradigm with continuous data-driven software engineering. Our workflow assists the continuous, safe and secure development and improvement of consumer vehicle functionality over the product lifecycle. This is achieved through the continuous monitoring of anomalies, as well as system states that deviate from the established design domain. The UNCOVER methodology consists of a continuous reduction in the amount of necessary monitored messages and presents a methodology throughout the entirety of the product lifecycle. We demonstrate our methodology through a simulation and show our automatic generation of monitoring components, and an automated preselection of identified safety or security incidents. Matthias Stammler, Julian Lorenz, Eric Sax, Jürgen Becker 0001, Matthias Hamann, Patrick Bidinger, Andreas Dewald, Paraskevi Georgouti, Alexios Camarinopoulos, Günter Becker, Klaus Finsterbusch, Maximilian Kirschner, Laurenz Adolph, Carl Philipp Hohl, Maria Rill, Daniel Vonderau, Victor Pazmino Betancourt |
DATE | 2 |
| 2024 | A Fair Ranking and New Model for Panoptic Scene Graph Generation
Julian Lorenz, Alexander Pest, Daniel Kienzle, Katja Ludwig, Rainer Lienhart |
ECCV (61) | 1 |
| 2024 | The STOIC2021 COVID-19 AI challenge: Applying reusable training methodologies to private dataabstractChallenges drive the state-of-the-art of automated medical image analysis. The quantity of public training data that they provide can limit the performance of their solutions. Public access to the training methodology for these solutions remains absent. This study implements the Type Three (T3) challenge format, which allows for training solutions on private data and guarantees reusable training methodologies. With T3, challenge organizers train a codebase provided by the participants on sequestered training data. T3 was implemented in the STOIC2021 challenge, with the goal of predicting from a computed tomography (CT) scan whether subjects had a severe COVID-19 infection, defined as intubation or death within one month. STOIC2021 consisted of a Qualification phase, where participants developed challenge solutions using 2000 publicly available CT scans, and a Final phase, where participants submitted their training methodologies with which solutions were trained on CT scans of 9724 subjects. The organizers successfully trained six of the eight Final phase submissions. The submitted codebases for training and running inference were released publicly. The winning solution obtained an area under the receiver operating characteristic curve for discerning between severe and non-severe COVID-19 of 0.815. The Final phase solutions of all finalists improved upon their Qualification phase solutions. Luuk H. Boulogne, Julian Lorenz, Daniel Kienzle, Robin Schön, Katja Ludwig, Rainer Lienhart, Simon Jégou, Derik Shi, Mayug Maniparambil, Dominik Müller, Silvan Mertes, Niklas Schröter, Fabio Hellmann, Miriam Elia, Ine Dirks, Matías N. Bossa, Abel Díaz Berenguer, Tanmoy Mukherjee, Jef Vandemeulebroucke, Hichem Sahli, Nikos Deligiannis, Panagiotis Gonidakis, Ngoc Dung Huynh, Muhammad Imran Razzak, Mohamed Reda Bouadjenek, Mario Verdicchio, Pasquale Borrelli, Marco Aiello 0003, James A. Meakin, Alexander Lemm, Christoph Russ, Razvan Ionasec, Nikos Paragios, Bram van Ginneken, Marie-Pierre Revel |
Medical Image Anal. | 2 |
| 2009 | Optimal Algorithms for k-Search with Application in Option Pricing
Julian Lorenz, Konstantinos Panagiotou, Angelika Steger |
Algorithmica | 1 |
| 2007 | Observational Learning in Random Networks
Julian Lorenz, Martin Marciniszyn, Angelika Steger |
COLT | 1 |
| 2007 | Optimal Algorithms for k -Search with Application in Option Pricing
Julian Lorenz, Konstantinos Panagiotou, Angelika Steger |
ESA | 1 |