Learning Invariant Representations Of Planar Curves
Gautam Pai, Aaron Wetzler, Ron Kimmel

TL;DR
This paper introduces a neural network-based framework for learning invariant geometric functions of planar curves, improving robustness and adaptability over traditional axiomatic methods, with a novel multi-scale similarity metric approach.
Contribution
It presents a new deep learning method for constructing invariant geometric functions of planar curves, outperforming axiomatic approaches in robustness and adaptability.
Findings
Learned invariants show improved noise robustness.
Method adapts well to occlusion and partial data.
Introduces a multi-scale similarity metric learning approach.
Abstract
We propose a metric learning framework for the construction of invariant geometric functions of planar curves for the Eucledian and Similarity group of transformations. We leverage on the representational power of convolutional neural networks to compute these geometric quantities. In comparison with axiomatic constructions, we show that the invariants approximated by the learning architectures have better numerical qualities such as robustness to noise, resiliency to sampling, as well as the ability to adapt to occlusion and partiality. Finally, we develop a novel multi-scale representation in a similarity metric learning paradigm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage Retrieval and Classification Techniques · Image Processing and 3D Reconstruction
