Please log in

Paper / Information search system

日本語

ENGLISH

Help

Please log in

  • Summary & Details

Annotation of Traffic Scenarios for Autonomous Drive Verification Using Active Learning

Detailed Information

Author(E)1) Sanna Jarl, 2) Julia Wennerblom, 3) Maria Svedlund, 4) Sadegh Rahrovani, 5) Morteza Hagir Chehreghani
Affiliation(E)1) Chalmers University of Technology, 2) Chalmers University of Technology, 3) Volvo Cars Coorporation, 4) Volvo Cars Coorporation, 5) Chalmers University of Technology
Abstract(E)New business models and digitalization have revolutionized the automotive sector, as many other industries. Self-driving vehicles are considered to be one mega trend that is of high importance for the future of automotive industry. In order to comfortably integrate Autonomous Drive (AD) in society, it must be safe and tested properly; a demand that requires extracting and annotating large amounts of driving scenarios for verification and validation of autonomous cars. However, annotating the driving scenarios based only on explicit rules (i.e., knowledge-based methods) can be subject to errors, such as false positive/negative classification of scenarios that lie on the border of two scenario classes, missing unknown scenario classes and anomalies. On the other side, verifying labels by the annotators is not cost-efficient. For this purpose, active learning is a paradigm which increases annotation accuracy by efficient inclusion of an annotator/expert. A classifier is trained on a small labelled dataset, and the bulk of unlabeled data is then classified. The label of the most informative data samples is queried, for instance by an expert, added to the annotated dataset whereafter the classifier is retrained. The goal of this study is to test the performance of active learning on time series data, coming form vehicle motion trajectories. To model the temporal nature of data, we consider three latent space representations: multivariate Time Series t-Distributed Stochastic Neighbor Embedding (mTSNE), Recurrent Autoencoder (RAE) and Variational-Recurrent Autoencoder (VRAE). We study two different classifiers for this task: neural networks and Support Vector Machines (SVMs). Furthermore, we investigate three query strategies, namely entropy, margin and random.

About search

close

How to use the search box

You can enter up to 5 search conditions. The number of search boxes can be increased or decreased with the "+" and "-" buttons on the right.
If you enter multiple words separated by spaces in one search box, the data that "contains all" of the entered words will be searched (AND search).
Example) X (space) Y → "X and Y (including)"

How to use "AND" and "OR" pull-down

If "AND" is specified, the "contains both" data of the phrase entered in the previous and next search boxes will be searched. If you specify "OR", the data that "contains" any of the words entered in the search boxes before and after is searched.
Example) X AND Y → "X and Y (including)"  X OR Z → "X or Z (including)"
If AND and OR searches are mixed, OR search has priority.
Example) X AND Y OR Z → X AND (Y OR Z)
If AND search and multiple OR search are mixed, OR search has priority.
Example) W AND X OR Y OR Z → W AND (X OR Y OR Z)

How to use the search filters

Use the "search filters" when you want to narrow down the search results, such as when there are too many search results. If you check each item, the search results will be narrowed down to only the data that includes that item.
The number in "()" after each item is the number of data that includes that item.

Search tips

When searching by author name, enter the first and last name separated by a space, such as "Taro Jidosha".