Recognition of near-duplicate periodic patterns by continuous metrics with approximation guarantees
Olga Anosova, Daniel Widdowson, Vitaliy Kurlin

TL;DR
This paper introduces continuous metrics with approximation guarantees for recognizing near-duplicate periodic patterns in Euclidean space, addressing noise robustness and enabling efficient detection of similar crystal structures.
Contribution
It develops a novel class of continuous metrics for periodic pattern recognition that are Lipschitz continuous and computationally efficient, improving over previous finite subset descriptors.
Findings
Metrics are applicable in any Euclidean dimension.
Algorithms approximate metrics with small error bounds.
Practical application in crystal database duplicate detection.
Abstract
This paper rigorously solves the challenging problem of recognizing periodic patterns under rigid motion in Euclidean geometry. The 3-dimensional case is practically important for justifying the novelty of solid crystalline materials (periodic crystals) and for patenting medical drugs in a solid tablet form. Past descriptors based on finite subsets fail when a unit cell of a periodic pattern discontinuously changes under almost any perturbation of atoms, which is inevitable due to noise and atomic vibrations. The major problem is not only to find complete invariants (descriptors with no false negatives and no false positives for all periodic patterns) but to design efficient algorithms for distance metrics on these invariants that should continuously behave under noise. The proposed continuous metrics solve this problem in any Euclidean dimension and are algorithmically approximated…
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.
