Demo Data from VLDB 2026 / reviewers in the wild / expert
Orcun Cetintas
dblp:300/4100
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2026
0000-0003-2496-4157ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 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
5 papers |
Video understanding and tracking · 65% Graph learning · 13% Information extraction and text analysis · 8% |
Topics — the 14 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Video understanding and tracking
multi-object tracking |
2.2 | 3 | 2026 | NOOUGAT [inline-graphic not available: see fulltext] Towards Unified Online and Offline Multi-Object Tracking · Int. J. Comput. Vis. 2026 Unifying Short and Long-Term Tracking with Graph Hierarchies · CVPR 2023 Multi-Object Tracking and Segmentation Via Neural Message Passing · Int. J. Comput. Vis. 2022 |
Computer vision › Video understanding and tracking › object tracking
unified tracking framework |
1.0 | 1 | 2026 | NOOUGAT [inline-graphic not available: see fulltext] Towards Unified Online and Offline Multi-Object Tracking · Int. J. Comput. Vis. 2026 |
Natural language and speech › Information extraction and text analysis
data annotation |
0.8 | 1 | 2024 | SPAMming Labels: Efficient Annotations for the Trackers of Tomorrow · ECCV (12) 2024 |
Computer vision › Video understanding and tracking
object tracking |
0.8 | 1 | 2024 | SPAMming Labels: Efficient Annotations for the Trackers of Tomorrow · ECCV (12) 2024 |
Machine learning › Graph learning
graph neural network |
0.7 | 1 | 2023 | Unifying Short and Long-Term Tracking with Graph Hierarchies · CVPR 2023 |
Computer vision › Segmentation and scene understanding › video segmentation
joint tracking and segmentation |
0.6 | 1 | 2022 | Multi-Object Tracking and Segmentation Via Neural Message Passing · Int. J. Comput. Vis. 2022 |
Machine learning › Graph learning › graph neural network
message passing |
0.6 | 1 | 2022 | Multi-Object Tracking and Segmentation Via Neural Message Passing · Int. J. Comput. Vis. 2022 |
Computer vision › Video understanding and tracking › multi-object tracking
multi-object tracking and segmentation |
0.6 | 1 | 2022 | Multi-Object Tracking and Segmentation Via Neural Message Passing · Int. J. Comput. Vis. 2022 |
Computer vision › Video understanding and tracking › multi-object tracking
tracking-by-detection |
0.6 | 1 | 2022 | Multi-Object Tracking and Segmentation Via Neural Message Passing · Int. J. Comput. Vis. 2022 |
Computer vision › Video understanding and tracking › multi-object tracking
multi-person tracking |
0.5 | 1 | 2021 | MOTSynth: How Can Synthetic Data Help Pedestrian Detection and Tracking? · ICCV 2021 |
Computer vision › Image recognition and object detection
pedestrian detection |
0.5 | 1 | 2021 | MOTSynth: How Can Synthetic Data Help Pedestrian Detection and Tracking? · ICCV 2021 |
Computer vision › Video understanding and tracking › object tracking
person tracking |
0.5 | 1 | 2021 | MOTSynth: How Can Synthetic Data Help Pedestrian Detection and Tracking? · ICCV 2021 |
Computer vision › Face, body and person analysis
person re-identification |
0.1 | 1 | 2021 | MOTSynth: How Can Synthetic Data Help Pedestrian Detection and Tracking? · ICCV 2021 |
Machine learning › Generative modeling
synthetic data generation |
0.1 | 1 | 2021 | MOTSynth: How Can Synthetic Data Help Pedestrian Detection and Tracking? · ICCV 2021 |
Methods — techniques the papers use, named apart from their topics
tracking-by-detection · 1.0graph matching · 1.0graph neural network · 0.7graph hierarchies · 0.7network flow formulation · 0.6message passing networks · 0.6synthetic data · 0.5rendering engine · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | NOOUGAT [inline-graphic not available: see fulltext] Towards Unified Online and Offline Multi-Object Tracking
Benjamin Missaoui, Orcun Cetintas, Guillem Brasó, Tim Meinhardt, Laura Leal-Taixé |
Int. J. Comput. Vis. | 2 |
| 2024 | SPAMming Labels: Efficient Annotations for the Trackers of Tomorrow
Orcun Cetintas, Tim Meinhardt, Guillem Brasó, Laura Leal-Taixé |
ECCV (12) | 1 |
| 2023 | Unifying Short and Long-Term Tracking with Graph HierarchiesabstractTracking objects over long videos effectively means solving a spectrum of problems, from short-term association for un-occluded objects to long-term association for objects that are occluded and then reappear in the scene. Methods tackling these two tasks are often disjoint and crafted for specific scenarios, and top-performing approaches are often a mix of techniques, which yields engineering-heavy solutions that lack generality. In this work, we question the need for hybrid approaches and introduce SUSHI, a unified and scalable multi-object tracker. Our approach processes long clips by splitting them into a hierarchy of subclips, which enables high scalability. We leverage graph neural networks to process all levels of the hierarchy, which makes our model unified across temporal scales and highly general. As a result, we obtain significant improvements over state-of-the-art on four diverse datasets. Our code and models are available at bit.ly/sushi-mot. Orcun Cetintas, Guillem Brasó, Laura Leal-Taixé |
CVPR | 1 |
| 2022 | Multi-Object Tracking and Segmentation Via Neural Message PassingabstractAbstract Graphs offer a natural way to formulate Multiple Object Tracking (MOT) and Multiple Object Tracking and Segmentation (MOTS) within the tracking-by-detection paradigm. However, they also introduce a major challenge for learning methods, as defining a model that can operate on such structured domain is not trivial. In this work, we exploit the classical network flow formulation of MOT to define a fully differentiable framework based on Message Passing Networks. By operating directly on the graph domain, our method can reason globally over an entire set of detections and exploit contextual features. It then jointly predicts both final solutions for the data association problem and segmentation masks for all objects in the scene while exploiting synergies between the two tasks. We achieve state-of-the-art results for both tracking and segmentation in several publicly available datasets. Our code is available at https://github.com/ocetintas/MPNTrackSeg Guillem Brasó, Orcun Cetintas, Laura Leal-Taixé |
Int. J. Comput. Vis. | 2 |
| 2021 | MOTSynth: How Can Synthetic Data Help Pedestrian Detection and Tracking?abstractDeep learning-based methods for video pedestrian detection and tracking require large volumes of training data to achieve good performance. However, data acquisition in crowded public environments raises data privacy concerns – we are not allowed to simply record and store data without the explicit consent of all participants. Furthermore, the annotation of such data for computer vision applications usually requires a substantial amount of manual effort, especially in the video domain. Labeling instances of pedestrians in highly crowded scenarios can be challenging even for human annotators and may introduce errors in the training data. In this paper, we study how we can advance different aspects of multi-person tracking using solely synthetic data. To this end, we generate MOTSynth, a large, highly diverse synthetic dataset for object detection and tracking using a rendering game engine. Our experiments show that MOTSynth can be used as a replacement for real data on tasks such as pedestrian detection, re-identification, segmentation, and tracking. Matteo Fabbri, Guillem Brasó, Gianluca Maugeri, Orcun Cetintas, Riccardo Gasparini, Aljosa Osep, Simone Calderara, Laura Leal-Taixé, Rita Cucchiara |
ICCV | 4 |