A Normalized Gaussian Wasserstein Distance for Tiny Object Detection
Jinwang Wang, Chang Xu, Wen Yang, Lei Yu

TL;DR
This paper introduces a novel Normalized Wasserstein Distance metric for tiny object detection, improving detection accuracy by addressing the limitations of IoU-based metrics in anchor-based detectors.
Contribution
The paper proposes a new Wasserstein distance-based evaluation metric modeled as Gaussian distributions, enhancing tiny object detection performance.
Findings
Achieves 6.7 AP improvement over baseline
Outperforms state-of-the-art methods by 6.0 AP
Validates effectiveness on a new tiny object dataset
Abstract
Detecting tiny objects is a very challenging problem since a tiny object only contains a few pixels in size. We demonstrate that state-of-the-art detectors do not produce satisfactory results on tiny objects due to the lack of appearance information. Our key observation is that Intersection over Union (IoU) based metrics such as IoU itself and its extensions are very sensitive to the location deviation of the tiny objects, and drastically deteriorate the detection performance when used in anchor-based detectors. To alleviate this, we propose a new evaluation metric using Wasserstein distance for tiny object detection. Specifically, we first model the bounding boxes as 2D Gaussian distributions and then propose a new metric dubbed Normalized Wasserstein Distance (NWD) to compute the similarity between them by their corresponding Gaussian distributions. The proposed NWD metric can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Visual Attention and Saliency Detection · Domain Adaptation and Few-Shot Learning
