Controlled Binary Assignment Flows
Organizations: Institute for Mathematics, Image and Pattern Analysis Group, Heidelberg University, Germany · Research Station Geometry and Dynamics, Heidelberg University
Abstract
This paper introduces a geometric approach to the representation and learning of time-variant parametrizations of deep assignment flows, for binary data labelings on graphs. Each edge carries an optimally controlled parameter flow in a 2-dimensional totally geodesic submanifold, based on objectives derived from a non-local linear scale space representation of the input data. The aggregation of triplets of such flows in 5-dimensional totally geodesic submanifolds is learned from data. The fusion of these flows determines the trajectory in the high-dimensional symmetric parameter space and by geometric integration the layers of binary deep assignment flows. Numerical results demonstrate the expressivity and the limitation of our highly parallel geometric local synthesis approach to high-dimensional deep assignment flow parametrizations.
Figures & tables
| Rotated MNIST | ||
|---|---|---|
| Diff. Stage | Foreground Acc. | Background Acc. |
| 0 | 97.26 % | 98.83 % |
| 1 | 96.67 % | 98.62 % |
| 2 | 92.83 % | 98.34 % |
Geometric Representation Learning
Geometric representation learning encodes data to preserve its intrinsic shape, distances, symmetries, and relationships.
See all 268 papers