1,950 research outputs found
Land cover mapping at very high resolution with rotation equivariant CNNs: towards small yet accurate models
In remote sensing images, the absolute orientation of objects is arbitrary.
Depending on an object's orientation and on a sensor's flight path, objects of
the same semantic class can be observed in different orientations in the same
image. Equivariance to rotation, in this context understood as responding with
a rotated semantic label map when subject to a rotation of the input image, is
therefore a very desirable feature, in particular for high capacity models,
such as Convolutional Neural Networks (CNNs). If rotation equivariance is
encoded in the network, the model is confronted with a simpler task and does
not need to learn specific (and redundant) weights to address rotated versions
of the same object class. In this work we propose a CNN architecture called
Rotation Equivariant Vector Field Network (RotEqNet) to encode rotation
equivariance in the network itself. By using rotating convolutions as building
blocks and passing only the the values corresponding to the maximally
activating orientation throughout the network in the form of orientation
encoding vector fields, RotEqNet treats rotated versions of the same object
with the same filter bank and therefore achieves state-of-the-art performances
even when using very small architectures trained from scratch. We test RotEqNet
in two challenging sub-decimeter resolution semantic labeling problems, and
show that we can perform better than a standard CNN while requiring one order
of magnitude less parameters
A General Theory of Equivariant CNNs on Homogeneous Spaces
We present a general theory of Group equivariant Convolutional Neural
Networks (G-CNNs) on homogeneous spaces such as Euclidean space and the sphere.
Feature maps in these networks represent fields on a homogeneous base space,
and layers are equivariant maps between spaces of fields. The theory enables a
systematic classification of all existing G-CNNs in terms of their symmetry
group, base space, and field type. We also consider a fundamental question:
what is the most general kind of equivariant linear map between feature spaces
(fields) of given types? Following Mackey, we show that such maps correspond
one-to-one with convolutions using equivariant kernels, and characterize the
space of such kernels
Isotropy of Angular Frequencies and Weak Chimeras With Broken Symmetry
The notion of a weak chimeras provides a tractable definition for chimera
states in networks of finitely many phase oscillators. Here we generalize the
definition of a weak chimera to a more general class of equivariant dynamical
systems by characterizing solutions in terms of the isotropy of their angular
frequency vector - for coupled phase oscillators the angular frequency vector
is given by the average of the vector field along a trajectory. Symmetries of
solutions automatically imply angular frequency synchronization. We show that
the presence of such symmetries is not necessary by giving a result for the
existence of weak chimeras without instantaneous or setwise symmetries for
coupled phase oscillators. Moreover, we construct a coupling function that
gives rise to chaotic weak chimeras without symmetry in weakly coupled
populations of phase oscillators with generalized coupling
Learning SO(3) Equivariant Representations with Spherical CNNs
We address the problem of 3D rotation equivariance in convolutional neural
networks. 3D rotations have been a challenging nuisance in 3D classification
tasks requiring higher capacity and extended data augmentation in order to
tackle it. We model 3D data with multi-valued spherical functions and we
propose a novel spherical convolutional network that implements exact
convolutions on the sphere by realizing them in the spherical harmonic domain.
Resulting filters have local symmetry and are localized by enforcing smooth
spectra. We apply a novel pooling on the spectral domain and our operations are
independent of the underlying spherical resolution throughout the network. We
show that networks with much lower capacity and without requiring data
augmentation can exhibit performance comparable to the state of the art in
standard retrieval and classification benchmarks.Comment: Camera-ready. Accepted to ECCV'18 as oral presentatio
- …