
YL
Yishai Lavi, Shai Avidan
· 1 min read
ResearcharXiv cs.CV
Propose & Verify: Fast Reflection Symmetry Detection via Harmonic Fields
arXiv:2611.22856v1 Announce Type: new
Abstract: Detecting multiple reflection symmetries in 3D shapes requires aggregating geometric evidence over a large space of candidate planes, making traditional voting approaches computationally expensive. We introduce the Fourier Accelerated Symmetry Transform (FAST), a training-free framework that combines geometric pair voting with efficient spectral computation. Exploiting the fact that global reflection planes pass through the shape centroid, we reduce the search to plane orientations, while geometric consistency filtering and independent witnesses suppress unreliable pair hypotheses. Our key insight is to represent these votes as a signal over plane orientations and efficiently compute a continuous, smoothed symmetry field in the spherical-harmonic domain. Specifically, we exploit the Funk-Hecke theorem, the spherical counterpart of the Fourier convolution theorem for rotationally symmetric kernels, to transform Gaussian smoothing into multiplication of harmonic coefficients. This enables efficient field evaluation, from which symmetry candidates are extracted, refined, and geometrically verified. Across two benchmarks, including a new benchmark of highly symmetric shapes, FAST achieves the highest clean multi-plane detection $F_1$ scores among evaluated methods (0.861 and 0.947), with GPU inference below 4 ms per shape: over $100\times$ faster than the next-fastest evaluated multi-plane GPU baseline. FAST also demonstrates strong robustness to geometric noise and competitive single-plane detection, achieving 94.9% success on clean single-plane shapes.
Original source
This story was published by arXiv cs.CV and written by Yishai Lavi, Shai Avidan. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on arxiv.org


