TY - GEN
T1 - Noise Resistant Focal Loss for Object Detection
AU - Hu, Zibo
AU - Gao, Kun
AU - Zhang, Xiaodian
AU - Dou, Zeyang
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - Noise robustness and hard example mining are two important aspects in object detection. A common view is that the two techniques are contradictory and they cannot be combined. In this paper, we show that there is a possibility to combine the best of two techniques. We find that, even using the hard example mining technique, recent deep neural network-based object detectors themselves have abilities to distinguish correct annotations and wrong annotations during the early stage of training. Based on this observation, we design a simple strategy to separate the wrong annotations from training data, reducing their loss weights and correcting their labels during training. The proposed method is simple, it doesn’t add any computational overhead during model inference. Moreover, the proposed method combines the hard example mining and noise resistance property in one model. Experiments on PASCAL VOC and DOTA datasets show that the proposed method not only archieves competitive performances on clean dataset, but also outperforms the baseline by a large margin when data contain severe noise.
AB - Noise robustness and hard example mining are two important aspects in object detection. A common view is that the two techniques are contradictory and they cannot be combined. In this paper, we show that there is a possibility to combine the best of two techniques. We find that, even using the hard example mining technique, recent deep neural network-based object detectors themselves have abilities to distinguish correct annotations and wrong annotations during the early stage of training. Based on this observation, we design a simple strategy to separate the wrong annotations from training data, reducing their loss weights and correcting their labels during training. The proposed method is simple, it doesn’t add any computational overhead during model inference. Moreover, the proposed method combines the hard example mining and noise resistance property in one model. Experiments on PASCAL VOC and DOTA datasets show that the proposed method not only archieves competitive performances on clean dataset, but also outperforms the baseline by a large margin when data contain severe noise.
KW - Focal loss
KW - Hard example mining
KW - Noise resistant focal loss
KW - Noise robustness
UR - http://www.scopus.com/inward/record.url?scp=85093978363&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-60639-8_10
DO - 10.1007/978-3-030-60639-8_10
M3 - Conference contribution
AN - SCOPUS:85093978363
SN - 9783030606381
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 114
EP - 125
BT - Pattern Recognition and Computer Vision - 3rd Chinese Conference, PRCV 2020, Proceedings
A2 - Peng, Yuxin
A2 - Zha, Hongbin
A2 - Liu, Qingshan
A2 - Lu, Huchuan
A2 - Sun, Zhenan
A2 - Liu, Chenglin
A2 - Chen, Xilin
A2 - Yang, Jian
PB - Springer Science and Business Media Deutschland GmbH
T2 - 3rd Chinese Conference on Pattern Recognition and Computer Vision, PRCV 2020
Y2 - 16 October 2020 through 18 October 2020
ER -