GMR-Conv: An Efficient Rotation and Reflection Equivariant Convolution Kernel Using Gaussian Mixture Rings
Yuexi Du, Jiazhen Zhang, Nicha C. Dvornek, John A. Onofrey
TL;DR
GMR-Conv introduces Gaussian Mixture Ring kernels to achieve rotation and reflection equivariance with high efficiency, addressing discretization errors that plague traditional radial symmetric convolutions. The method decomposes the full kernel into Gaussian-smoothed rings and a channel-wise 1-by-1 mixing, delivering large receptive fields with reduced parameters and favorable computational complexity $O(HW n(k^2+C_{in}C_{out}))$. The authors provide continuous-space equivariance proofs, extensive 2D and 3D experiments across eight classification tasks and segmentation, and ablations showing when smoothing and family of rings improve performance. Overall, GMR-Conv offers a plug-and-play, hardware-friendly approach that preserves geometric priors while achieving competitive or superior performance on orientation-agnostic data, highlighting a practical path toward robust equivariant networks.
Abstract
Symmetry, where certain features remain invariant under geometric transformations, can often serve as a powerful prior in designing convolutional neural networks (CNNs). While conventional CNNs inherently support translational equivariance, extending this property to rotation and reflection has proven challenging, often forcing a compromise between equivariance, efficiency, and information loss. In this work, we introduce Gaussian Mixture Ring Convolution (GMR-Conv), an efficient convolution kernel that smooths radial symmetry using a mixture of Gaussian-weighted rings. This design mitigates discretization errors of circular kernels, thereby preserving robust rotation and reflection equivariance without incurring computational overhead. We further optimize both the space and speed efficiency of GMR-Conv via a novel parameterization and computation strategy, allowing larger kernels at an acceptable cost. Extensive experiments on eight classification and one segmentation datasets demonstrate that GMR-Conv not only matches conventional CNNs' performance but can also surpass it in applications with orientation-less data. GMR-Conv is also proven to be more robust and efficient than the state-of-the-art equivariant learning methods. Our work provides inspiring empirical evidence that carefully applied radial symmetry can alleviate the challenges of information loss, marking a promising advance in equivariant network architectures. The code is available at https://github.com/XYPB/GMR-Conv.
