Improving Traffic Sign Recognition by Active Search
Paper i proceeding, 2022

We describe an iterative active-learning algorithm to recognise rare traffic signs. A standard ResNet is trained on a training set containing only a single sample of the rare class. We demonstrate that by sorting the samples of a large, unlabeled set by the estimated probability of belonging to the rare class, we can efficiently identify samples from the rare class. This works despite the fact that this estimated probability is usually quite low. A reliable active-learning loop is obtained by labeling these candidate samples, including them in the training set, and iterating the procedure. Further, we show that we get similar results starting from a single synthetic sample. Our results are important as they indicate a straightforward way of improving traffic-sign recognition for automated driving systems. In addition, they show that we can make use of the information hidden in low confidence outputs, which is usually ignored.

Rare traffic signs

Active search

Active learning

Författare

Sami Jaghouar

Universite de Technologie de Compiegne

Hannes Gustafsson

Student vid Chalmers

Bernhard Mehlig

Göteborgs universitet

E. Werner

Zenseact AB

Niklas Gustafsson

Zenseact AB

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 13485 LNCS 594-606
9783031167874 (ISBN)

44th DAGM German Conference on Pattern Recognition, DAGM GCPR 2022
Konstanz, Germany,

Ämneskategorier (SSIF 2011)

Analytisk kemi

Sannolikhetsteori och statistik

Datorseende och robotik (autonoma system)

DOI

10.1007/978-3-031-16788-1_36

Mer information

Senast uppdaterat

2023-10-26