English
Related papers

Related papers: A Normalized Gaussian Wasserstein Distance for Tin…

200 papers

Tiny object detection (TOD) in aerial images is challenging since a tiny object only contains a few pixels. State-of-the-art object detectors do not provide satisfactory results on tiny objects due to the lack of supervision from…

Computer Vision and Pattern Recognition · Computer Science 2022-06-29 Chang Xu , Jinwang Wang , Wen Yang , Huai Yu , Lei Yu , Gui-Song Xia

In object detection, a well-defined similarity metric can significantly enhance model performance. Currently, the IoU-based similarity metric is the most commonly preferred choice for detectors. However, detectors using IoU as a similarity…

Computer Vision and Pattern Recognition · Computer Science 2025-11-03 Ziqian Guan , Xieyi Fu , Pengjun Huang , Hengyuan Zhang , Hubin Du , Yongtao Liu , Yinglin Wang , Qang Ma

Boundary discontinuity and its inconsistency to the final detection metric have been the bottleneck for rotating detection regression loss design. In this paper, we propose a novel regression loss based on Gaussian Wasserstein distance as a…

Computer Vision and Pattern Recognition · Computer Science 2022-04-19 Xue Yang , Junchi Yan , Qi Ming , Wentao Wang , Xiaopeng Zhang , Qi Tian

Wasserstein metrics are increasingly being used as similarity scores for images treated as discrete measures on a grid, yet their behavior under noise remains poorly understood. In this work, we consider the sensitivity of the signed…

Statistics Theory · Mathematics 2026-05-19 Erik Lager , Gilles Mordant , Amit Moscovich

While theoretically appealing, the application of the Wasserstein distance to large-scale machine learning problems has been hampered by its prohibitive computational cost. The sliced Wasserstein distance and its variants improve the…

Machine Learning · Computer Science 2022-03-18 Xiongjie Chen , Yongxin Yang , Yunpeng Li

Regression loss design is an essential topic for oriented object detection. Due to the periodicity of the angle and the ambiguity of width and height definition, traditional L1-distance loss and its variants have been suffered from the…

Computer Vision and Pattern Recognition · Computer Science 2023-12-13 Yuke Zhu , Yumeng Ruan , Zihua Xiong , Sheng Guo

Deep neural networks (DNNs) are known to be vulnerable to adversarial attacks that would trigger misclassification of DNNs but may be imperceptible to human perception. Adversarial defense has been an important way to improve the robustness…

Machine Learning · Computer Science 2023-02-22 Qicheng Wang , Shuhai Zhang , Jiezhang Cao , Jincheng Li , Mingkui Tan , Yang Xiang

The $2$-Wasserstein distance is sensitive to minor geometric differences between distributions, making it a very powerful dissimilarity metric. However, due to this sensitivity, a small outlier mass can also cause a significant increase in…

Machine Learning · Computer Science 2024-06-04 Sharath Raghvendra , Pouyan Shirzadian , Kaiyi Zhang

Intersection over Union (IoU) is the most popular evaluation metric used in the object detection benchmarks. However, there is a gap between optimizing the commonly used distance losses for regressing the parameters of a bounding box and…

Computer Vision and Pattern Recognition · Computer Science 2019-04-16 Hamid Rezatofighi , Nathan Tsoi , JunYoung Gwak , Amir Sadeghian , Ian Reid , Silvio Savarese

In Few-Shot Object Detection (FSOD), detecting small objects is extremely difficult. The limited supervision cripples the localization capabilities of the models and a few pixels shift can dramatically reduce the Intersection over Union…

Computer Vision and Pattern Recognition · Computer Science 2023-07-20 Pierre Le Jeune , Anissa Mokraoui

For most of the anchor-based detectors, Intersection over Union(IoU) is widely utilized to assign targets for the anchors during training. However, IoU pays insufficient attention to the closeness of the anchor's center to the truth box's…

Computer Vision and Pattern Recognition · Computer Science 2021-03-26 Shengkai Wu , Jinrong Yang , Hangcheng Yu , Lijun Gou , Xiaoping Li

General-purpose object-detection algorithms often dismiss the fine structure of detected objects. This can be traced back to how their proposed regions are evaluated. Our goal is to renegotiate the trade-off between the generality of these…

Computer Vision and Pattern Recognition · Computer Science 2021-06-01 Azim Ahmadzadeh , Dustin J. Kempton , Yang Chen , Rafal A. Angryk

In generative modeling, the Wasserstein distance (WD) has emerged as a useful metric to measure the discrepancy between generated and real data distributions. Unfortunately, it is challenging to approximate the WD of high-dimensional…

Computer Vision and Pattern Recognition · Computer Science 2019-04-16 Jiqing Wu , Zhiwu Huang , Dinesh Acharya , Wen Li , Janine Thoma , Danda Pani Paudel , Luc Van Gool

In generative modeling, the Wasserstein distance (WD) has emerged as a useful metric to measure the discrepancy between generated and real data distributions. Unfortunately, it is challenging to approximate the WD of high-dimensional…

Computer Vision and Pattern Recognition · Computer Science 2019-04-17 Jiqing Wu , Zhiwu Huang , Dinesh Acharya , Wen Li , Janine Thoma , Danda Pani Paudel , Luc Van Gool

The most popular evaluation metric for object detection in 2D images is Intersection over Union (IoU). Existing implementations of the IoU metric for 3D object detection usually neglect one or more degrees of freedom. In this paper, we…

Computer Vision and Pattern Recognition · Computer Science 2022-11-14 Michael G. Adam , Martin Piccolrovazzi , Sebastian Eger , Eckehard Steinbach

A novel object detection method is presented that handles freely rotated objects of arbitrary sizes, including tiny objects as small as $2\times 2$ pixels. Such tiny objects appear frequently in remotely sensed images, and present a…

Computer Vision and Pattern Recognition · Computer Science 2022-02-16 Mohsen Zand , Ali Etemad , Michael Greenspan

We study the behavior of the Wasserstein-$2$ distance between discrete measures $\mu$ and $\nu$ in $\mathbb{R}^d$ when both measures are smoothed by small amounts of Gaussian noise. This procedure, known as Gaussian-smoothed optimal…

Statistics Theory · Mathematics 2022-06-15 Yunzi Ding , Jonathan Niles-Weed

Existing detection methods commonly use a parameterized bounding box (BBox) to model and detect (horizontal) objects and an additional rotation angle parameter is used for rotated objects. We argue that such a mechanism has fundamental…

Computer Vision and Pattern Recognition · Computer Science 2022-09-23 Xue Yang , Gefan Zhang , Xiaojiang Yang , Yue Zhou , Wentao Wang , Jin Tang , Tao He , Junchi Yan

Wasserstein distances define a metric between probability measures on arbitrary metric spaces, including meta-measures (measures over measures). The resulting Wasserstein over Wasserstein (WoW) distance is a powerful, but computationally…

Machine Learning · Computer Science 2026-02-20 Moritz Piening , Robert Beinert

The training and test data for deep-neural-network-based classifiers are usually assumed to be sampled from the same distribution. When part of the test samples are drawn from a distribution that is sufficiently far away from that of the…

Machine Learning · Computer Science 2021-12-14 Yinan Wang , Wenbo Sun , Jionghua "Judy" Jin , Zhenyu "James" Kong , Xiaowei Yue
‹ Prev 1 2 3 10 Next ›