2023 · 16 citations · 38 references
ComputingComputer ScienceMathematicsComputational GeometryComputer VisionGeometryFeature DescriptionMetric GeometryMetric SpacesObject RecognitionPattern RecognitionShape RepresentationDistance MetricsGeometric InvariantsInvariant Feature DescriptorsPoint Cloud RepresentationPolynomial Time ComplexityPolynomial-time AlgorithmsRigid Motions
Rigid structures such as cars or any other solid objects are often represented by finite clouds of unlabeled points. The most natural equivalence on these point clouds is rigid motion or isometry maintaining all inter-point distances. Rigid patterns of point clouds can be reliably compared only by complete isometry invariants that can also be called equivariant descriptors without false negatives (isometric clouds having different descriptions) and without false positives (non-isometric clouds with the same description). Noise and motion in data motivate a search for invariants that are continuous under perturbations of points in a suitable metric. We propose the first continuous and complete invariant of unlabeled clouds in any Euclidean space. For a fixed dimension, the new metric for this invariant is computable in a polynomial time in the number of points.
38
Geometric Deep Learning: Going beyond Euclidean data
Michael M. Bronstein, Joan Bruna, Yann LeCun et al. · IEEE Signal Processing Magazine · 2017 · 3.6K citations · Full text
Boosting Adversarial Attacks with Momentum
Yinpeng Dong, Fangzhou Liao, Tianyu Pang et al. · 2018 · 2.9K citations