GauCho: Gaussian Distributions with Cholesky Decomposition for Oriented Object Detection

• URL: http://arxiv.org/abs/2502.01565v1
• Date: Mon, 03 Feb 2025 17:47:26 GMT
• Title: GauCho: Gaussian Distributions with Cholesky Decomposition for Oriented Object Detection
• Authors: Jeffri Murrugarra-LLerena, Jose Henrique Lima Marques, Claudio R. Jung,
• Abstract summary: We propose a regression head for OOD that directly produces Gaussian distributions based on the Cholesky matrix decomposition. The proposed head, named GauCho, theoretically mitigates the boundary discontinuity problem and is fully compatible with recent Gaussian-based regression loss functions. Our experimental results show that GauCho can be a viable alternative to the traditional OBB head, achieving results comparable to or better than state-of-the-art detectors for the challenging dataset DOTA.
• Score: 2.8333806160405937
• License:
• Abstract: Oriented Object Detection (OOD) has received increased attention in the past years, being a suitable solution for detecting elongated objects in remote sensing analysis. In particular, using regression loss functions based on Gaussian distributions has become attractive since they yield simple and differentiable terms. However, existing solutions are still based on regression heads that produce Oriented Bounding Boxes (OBBs), and the known problem of angular boundary discontinuity persists. In this work, we propose a regression head for OOD that directly produces Gaussian distributions based on the Cholesky matrix decomposition. The proposed head, named GauCho, theoretically mitigates the boundary discontinuity problem and is fully compatible with recent Gaussian-based regression loss functions. Furthermore, we advocate using Oriented Ellipses (OEs) to represent oriented objects, which relates to GauCho through a bijective function and alleviates the encoding ambiguity problem for circular objects. Our experimental results show that GauCho can be a viable alternative to the traditional OBB head, achieving results comparable to or better than state-of-the-art detectors for the challenging dataset DOTA

Related papers

• Edge Wasserstein Distance Loss for Oriented Object Detection [30.63435516524413]
  We propose a novel oriented regression loss, Wasserstein Distance(EWD) loss, to alleviate the square-like problem. Specifically, for the oriented box(OBox) representation, we choose a specially-designed distribution whose probability density function is only nonzero over the edges.
  arXiv  Detail & Related papers  (2023-12-12T08:00:40Z)
• Revisiting Rotation Averaging: Uncertainties and Robust Losses [51.64986160468128]
  We argue that the main problem of current methods is the minimized cost function that is only weakly connected with the input data via the estimated epipolar. We propose to better model the underlying noise distributions by directly propagating the uncertainty from the point correspondences into the rotation averaging.
  arXiv  Detail & Related papers  (2023-03-09T11:51:20Z)
• Detecting Rotated Objects as Gaussian Distributions and Its 3-D Generalization [81.29406957201458]
  Existing detection methods commonly use a parameterized bounding box (BBox) to model and detect (horizontal) objects. We argue that such a mechanism has fundamental limitations in building an effective regression loss for rotation detection. We propose to model the rotated objects as Gaussian distributions. We extend our approach from 2-D to 3-D with a tailored algorithm design to handle the heading estimation.
  arXiv  Detail & Related papers  (2022-09-22T07:50:48Z)
• MKIoU Loss: Towards Accurate Oriented Object Detection in Aerial Images [0.0]
  A modulated Kalman IoU loss of approximate SkewIoU is proposed, named MKIoU. The proposed method can be easily extended to other Gaussian-based methods.
  arXiv  Detail & Related papers  (2022-06-30T08:17:01Z)
• G-Rep: Gaussian Representation for Arbitrary-Oriented Object Detection [13.112764410519981]
  We propose a unified Gaussian representation called G-Rep to construct Gaussian distributions for OBB, QBB, and PointSet. G-Rep achieves a unified solution to various representations and problems.
  arXiv  Detail & Related papers  (2022-05-24T05:28:08Z)
• Robust Estimation for Nonparametric Families via Generative Adversarial Networks [92.64483100338724]
  We provide a framework for designing Generative Adversarial Networks (GANs) to solve high dimensional robust statistics problems. Our work extend these to robust mean estimation, second moment estimation, and robust linear regression. In terms of techniques, our proposed GAN losses can be viewed as a smoothed and generalized Kolmogorov-Smirnov distance.
  arXiv  Detail & Related papers  (2022-02-02T20:11:33Z)
• Rethinking Rotated Object Detection with Gaussian Wasserstein Distance Loss [111.8807588392563]
  Boundary discontinuity and its inconsistency to the final detection metric have been the bottleneck for rotating detection regression loss design. We propose a novel regression loss based on Gaussian Wasserstein distance as a fundamental approach to solve the problem.
  arXiv  Detail & Related papers  (2021-01-28T12:04:35Z)
• Approximation Schemes for ReLU Regression [80.33702497406632]
  We consider the fundamental problem of ReLU regression. The goal is to output the best fitting ReLU with respect to square loss given to draws from some unknown distribution.
  arXiv  Detail & Related papers  (2020-05-26T16:26:17Z)
• On the Arbitrary-Oriented Object Detection: Classification based Approaches Revisited [94.5455251250471]
  We first show that the boundary problem suffered in existing dominant regression-based rotation detectors, is caused by angular periodicity or corner ordering. We transform the angular prediction task from a regression problem to a classification one. For the resulting circularly distributed angle classification problem, we first devise a Circular Smooth Label technique to handle the periodicity of angle and increase the error tolerance to adjacent angles.
  arXiv  Detail & Related papers  (2020-03-12T03:23:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.