Fourier Series Coder: A Novel Perspective on Angle Boundary Discontinuity Problem for Oriented Object Detection

• URL: http://arxiv.org/abs/2604.20281v2
• Date: Thu, 23 Apr 2026 08:35:32 GMT
• Title: Fourier Series Coder: A Novel Perspective on Angle Boundary Discontinuity Problem for Oriented Object Detection
• Abstract summary: Fourier Series Coder (FSC) is a lightweight plug-and-play component that establishes a continuous, reversible, and mathematically robust angle encoding-decoding paradigm.<n>We show that FSC achieves highly competitive overall performance, yielding substantial improvements in high-precision detection.
• Score: 6.238493492175993
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the rapid advancement of intelligent driving and remote sensing, oriented object detection has gained widespread attention. However, achieving high-precision performance is fundamentally constrained by the Angle Boundary Discontinuity (ABD) and Cyclic Ambiguity (CA) problems, which typically cause significant angle fluctuations near periodic boundaries. Although recent studies propose continuous angle coders to alleviate these issues, our theoretical and empirical analyses reveal that state-of-the-art methods still suffer from substantial cyclic errors. We attribute this instability to the structural noise amplification within their non-orthogonal decoding mechanisms. This mathematical vulnerability significantly exacerbates angular deviations, particularly for square-like objects. To resolve this fundamentally, we propose the Fourier Series Coder (FSC), a lightweight plug-and-play component that establishes a continuous, reversible, and mathematically robust angle encoding-decoding paradigm. By rigorously mapping angles onto a minimal orthogonal Fourier basis and explicitly enforcing a geometric manifold constraint, FSC effectively prevents feature modulus collapse. This structurally stabilized representation ensures highly robust phase unwrapping, intrinsically eliminating the need for heuristic truncations while achieving strict boundary continuity and superior noise immunity. Extensive experiments across three large-scale datasets demonstrate that FSC achieves highly competitive overall performance, yielding substantial improvements in high-precision detection. The code will be available at https://github.com/weiminghong/FSC.

Related papers

• Time-Frequency Consistency Learning for Robust Speech Deepfake Detection [31.448593507749745]
  We simulate a unified AFE pipeline comprising acoustic echo cancellation, noise suppression, automatic gain control, and voice activity detection.<n>The results show that the nonlinear and time-frequency coupled distortions introduced by AFE significantly degrade detection performance.<n>We propose a Time-Frequency Consistency Learning framework, which aims to learn invariant spoofing representations that remain stable before and after AFE processing.
  arXiv  Detail & Related papers  (2026-07-20T09:51:03Z)
• Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals [83.0127582612634]
  Near-boundary Rescue (NSR) is a minimal, plug-and-play modification that retains out-of-bound tokens to recover lost signals.<n>NSR substantially improves training stability and delivers consistent gains over strong baselines such as DAPO and GSPO.
  arXiv  Detail & Related papers  (2026-05-21T16:45:31Z)
• UnGAP: Uncertainty-Guided Affine Prompting for Real-Time Crack Segmentation [16.902729686979303]
  Uncertainty-Prompted Feature Modulator (UPFM) treats aleatoric uncertainty as an active visual prompt rather than a mere output.<n>UnGAP balances superior segmentation accuracy with real-time inference speed.
  arXiv  Detail & Related papers  (2026-05-04T09:18:57Z)
• AIFIND: Artifact-Aware Interpreting Fine-Grained Alignment for Incremental Face Forgery Detection [23.80607349547519]
  We propose AIFIND, Artifact-Aware Interpreting Fine-Grained Alignment for Incremental Face Forgery Detection.<n>We use semantic anchors to stabilize incremental learning.
  arXiv  Detail & Related papers  (2026-04-17T16:17:12Z)
• DOC-GS: Dual-Domain Observation and Calibration for Reliable Sparse-View Gaussian Splatting [80.43237927269575]
  In this paper, we revisit sparse-view 3DGS reconstruction from a new perspective.<n>We identify the core challenge as the unobservability of Gaussian primitive reliability.<n>Motivated by this observation, we propose a unified Dual-domain Observation and geometrics in rendered images framework.
  arXiv  Detail & Related papers  (2026-04-08T07:01:24Z)
• Unlocking Off-the-Grid Sparse Recovery with Unlimited Sensing: Simultaneous Super-Resolution in Time and Amplitude [18.640139709652562]
  Super-resolution or off-the-grid sparse recovery is a classical problem in signal processing.<n>We show that modulo encoding within the Unlimited Sensing Framework (USF) enables digital super-resolution.<n>We develop new theoretical results that extend to non-bandlimited kernels commonly encountered in practice and introduce a robust algorithm for off-the-grid sparse recovery.
  arXiv  Detail & Related papers  (2025-10-19T17:57:24Z)
• CWF: Consolidating Weak Features in High-quality Mesh Simplification [50.634070540791555]
  We propose a smooth functional that simultaneously considers all of these requirements. The functional comprises a normal anisotropy term and a Centroidal Voronoi Tessellation (CVT) energy term.
  arXiv  Detail & Related papers  (2024-04-24T05:37:17Z)
• SGCNeRF: Few-Shot Neural Rendering via Sparse Geometric Consistency Guidance [136.15885067858298]
  This study presents a novel feature-matching-based sparse geometry regularization module, enhanced by a spatially consistent geometry filtering mechanism and a frequency-guided geometric regularization strategy.<n>Our experiments demonstrate that SGCNeRF achieves superior geometry-consistent outcomes and also surpasses FreeNeRF, with improvements of 0.7 dB in PSNR on LLFF and DTU.
  arXiv  Detail & Related papers  (2024-04-01T08:37:57Z)
• Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation [52.73824786627612]
  This paper establishes new convergence results for textitgeodesic strongly monotone games.<n>Our key result shows that RGD attains last-iterate linear convergence in a textitgeometry-agnostic fashion.<n>Overall, this paper presents the first geometry-agnostic last-iterate convergence analysis for games beyond the Euclidean settings.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• Rethinking Boundary Discontinuity Problem for Oriented Object Detection [42.136448033031634]
  We show that even state-of-the-art IoU-like methods fail to solve the boundary discontinuity problem. In existing IoU-like methods, the model essentially attempts to fit the angular relationship between box and object, where the break point at angular boundary makes the predictions highly unstable. We propose a dual-optimization paradigm for angles. We decouple reversibility and joint-optim from single smoothing function into two distinct entities, which for the first time achieves the objectives of both correcting angular boundary and blending angle with other parameters.
  arXiv  Detail & Related papers  (2023-05-17T09:04:22Z)
• Phase-Shifting Coder: Predicting Accurate Orientation in Oriented Object Detection [10.99534239215483]
  A novel differentiable angle coder named phase-shifting coder (PSC) is proposed to accurately predict the orientation of objects. We provide a unified framework for various periodic fuzzy problems in oriented object detection. Visual analysis and experiments on three datasets prove the effectiveness and the potentiality of our approach.
  arXiv  Detail & Related papers  (2022-11-11T17:31:25Z)
• 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.