Domain Adaptation for Traffic Density Estimation

By Luca Ciampi, Carlos Santiago, João Paulo Costeira, Claudio Gennaro, Giuseppe Amato. 2021

31 citations recorded by the source corpus.

Convolutional Neural Networks have produced state-of-the-art results for a multitude of computer vision tasks under supervised learning. However, the crux of these methods is the need for a massive amount of labeled data to guarantee that they generalize well to diverse testing scenarios. In many real-world applications, there is indeed a large domain shift between the distributions of the train (source) and test (target) domains, leading to a significant drop in performance at inference time. Unsupervised Domain Adaptation (UDA) is a class of techniques that aims to mitigate this drawback without the need for labeled data in the target domain. This makes it particularly useful for the tasks in which acquiring new labeled data is very expensive, such as for semantic and instance segmentation. In this work, we propose an end-to-end CNN-based UDA algorithm for traffic density estimation and counting, based on adversarial learning in the output space. The density estimation is one of those tasks requiring per-pixel annotated labels and, therefore, needs a lot of human effort. We conduct experiments considering different types of domain shifts, and we make publicly available two new datasets for the vehicle counting task that were also used for our tests. One of them, the Grand Traffic Auto dataset, is a synthetic collection of images, obtained using the graphical engine of the Grand Theft Auto video game, automatically annotated with precise per-pixel labels. Experiments show a significant improvement using our UDA algorithm compared to the model’s performance without domain adaptation. The code, the models and the datasets are freely available at https://ciampluca.github.io/unsupervised counting.

Subfields: Computer Vision and Pattern Recognition, Representation & Self-Supervised Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

In Representation & Self-Supervised Learning

Citations in the corpus

Segment Anything (2023, background): “-20 0 +20 +40 IoU delta at 1 center point GTEA [34, 63] TrashCan [52] DRAM [24] PIDRay [104] Cityscapes [25] WoodScape [112] IBD [17] EgoHOS [113] Plittersdorf [46] VISOR [28, 27] NDISPark [22, 23] Hypersim [86] OVIS [81] ADE20K [117] iShape [111] ZeroWaste-f [6] STREETS [91] LVIS [44] NDD20 [100] T”
SAM 2: Segment Anything in Images and Videos (2024, unknown): “…2022), EgoHOS (Zhang et al., 2022), GTEA (Fathi et al., 2011; Li et al., 2015), iShape (Yang et al., 2021a), NDD20 (Trotter et al., 2020), NDISPark (Ciampi et al., 2021, 2022), OVIS (Qi et al., 2022), PPDLS (Minervini et al., 2016), Plittersdorf (Haucke et al., 2022), STREETS (Snyder & Do, 2019),…”