Skip to content
naulon
Not checkedNot checked for notices yet.

Recognizing New Classes with Synthetic Data in the Loop: Application to Traffic Sign Recognition

Gabriel Villalonga, Joost Van de Weijer, Antonio M. López

Sensors · 2020

doi:10.3390/s20030583 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

On-board vision systems may need to increase the number of classes that can be recognized in a relatively short period. For instance, a traffic sign recognition system may suddenly be required to recognize new signs. Since collecting and annotating samples of such new classes may need more time than we wish, especially for uncommon signs, we propose a method to generate these samples by combining synthetic images and Generative Adversarial Network (GAN) technology. In particular, the GAN is trained on synthetic and real-world samples from known classes to perform synthetic-to-real domain adaptation, but applied to synthetic samples of the new classes. Using the Tsinghua dataset with a synthetic counterpart, SYNTHIA-TS, we have run an extensive set of experiments. The results show that the proposed method is indeed effective, provided that we use a proper Convolutional Neural Network (CNN) to perform the traffic sign recognition (classification) task as well as a proper GAN to transform the synthetic images. Here, a ResNet101-based classifier and domain adaptation based on CycleGAN performed extremely well for a ratio <inline-formula> <math display="inline"> <semantics> <mrow> <mo>&#8764;</mo> <mn>1</mn> <mo>/</mo> <mn>4</mn> </mrow> </semantics> </math> </inline-formula> for new/known classes; even for more challenging ratios such as <inline-formula> <math display="inline"> <semantics> <mrow> <mo>&#8764;</mo> <mn>4</mn> <mo>/</mo> <mn>1</mn> </mrow> </semantics> </math> </inline-formula>, the results are also very positive.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.