{'fraction_non_alphanumeric': 0.024013722126929673, 'fraction_numerical': 0.0008576329331046312, 'mean_word_length': 5.308108108108108, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Near-duplicated Loss for Accurate Object Localization

Multi-class object detection always involves the tasks of accurate target localization which is mainly related to bounding box regression. Smooth L1 loss is the most popular bounding box regression loss used in the current state-of-the-art object detection systems. However, such loss for regressing the parameters of a bounding box can’t accurately and consistently regress the bounding box to the associated ground truth well. We instead propose the near-duplicated loss, a loss that better evaluate the disparity between the bounding box and the ground truth consistently. We present an approximate algorithm associated with a kernel function that not only considers the absolute distance but also involves the relative overlap area between the two bounding boxes. The new loss doesn’t need additional supervision and is easy to embed into existing networks. Our final result, by incorporating the near-duplicated loss into the state-of-the-art object detection detectors (Faster RCNN, RetinaNet), shows consistent and significant improvements on popular object detection benchmarks (MS COCO and Pascal VOC).