mlsanityData to 14 Oct 2026

Traffic Scenario Clustering by Iterative Optimisation of Self-Supervised Networks Using a Random Forest Activation Pattern Similarity

arXiv 2105.07639 ↗First posted 17 May 2021cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Traffic scenario categorisation is an essential component of automated driving, for e.,g., in motion planning algorithms and their validation. Finding new relevant scenarios without handcrafted steps reduce the required resources for the development of autonomous driving dramatically. In this work, a method is proposed to address this challenge by introducing a clustering technique based on a novel data-adaptive similarity measure, called Random Forest Activation Pattern (RFAP) similarity. The RFAP similarity is generated using a tree encoding scheme in a Random Forest algorithm. The clustering method proposed in this work takes into account that there are labelled scenarios available and the information from the labelled scenarios can help to guide the clustering of unlabelled scenarios. It consists of three steps. First, a self-supervised Convolutional Neural Network~(CNN) is trained on all available traffic scenarios using a defined self-supervised objective. Second, the CNN is fine-tuned for classification of the labelled scenarios. Third, using the labelled and unlabelled scenarios an iterative optimisation procedure is performed for clustering. In the third step at each epoch of the iterative optimisation, the CNN is used as a feature generator for an unsupervised Random Forest. The trained forest, in turn, provides the RFAP similarity to adapt iteratively the feature generation process implemented by the CNN. Extensive experiments and ablation studies have been done on the highD dataset. The proposed method shows superior performance compared to baseline clustering techniques.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 19 of its 39 references that are in the map. First posted on arXiv 17 May 2021.

Builds on

19 of 39 references.

References · 19

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  4. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  5. 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,591
  6. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
  7. 2017Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning resultscited by 472
  8. 2018A Survey on Deep Transfer Learningcited by 419
  9. 2018The highD Dataset: A Drone Dataset of Naturalistic Vehicle Trajectories on German Highways for Validation of Highly Automated Driving Systemscited by 277
  10. 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 225
  11. 2017Learning Spatio-Temporal Features with 3D Residual Networks for Action Recognitioncited by 178
  12. 2020Automatically Discovering and Learning New Visual Categories with Ranking Statisticscited by 143
7 more
  1. 2018Scenarios for Development, Test and Validation of Automated Vehiclescited by 48
  2. 2020LSD-C: Linearly Separable Deep Clusterscited by 16
  3. 2016Shuffle and Learn: Unsupervised Learning using Temporal Order Verificationcited by 13
  4. 2020An Unsupervised Random Forest Clustering Technique for Automatic Traffic Scenario Categorizationcited by 13
  5. 2020A Deep Learning Framework for Generation and Analysis of Driving Scenario Trajectoriescited by 12
  6. 2020Unsupervised and Supervised Learning with the Random Forest Algorithm for Traffic Scenario Clustering and Classificationcited by 8
  7. 2020Deep Representation Learning and Clustering of Traffic Scenarioscited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

3 papers.