Exactly computable and continuous metrics on isometry classes of finite and 1-periodic sequences
Not on the map. Why?
Abstract (arXiv)
The inevitable noise in real measurements motivates the problem to continuously quantify the similarity between rigid objects such as periodic time series and proteins given by ordered points and considered up to isometry maintaining inter-point distances. The past work produced many Hausdorff-like distances that have slow or approximate algorithms due to minimizations over infinitely many isometries. For finite and 1-periodic sequences under isometry in any high-dimensional Euclidean space, we introduce continuous metrics with faster algorithms. The key novelty in the periodic case is the continuity of new metrics under perturbations that change the minimum period.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 May 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 3.
3 papers.
- 2023Smooth, exact rotational symmetrization for deep learning on point cloudscited by 39
- 2023Completeness of Atomic Structure Representationscited by 7
- 2023Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants with no False Negatives and no False Positivescited by 7
- 2023Smooth, exact rotational symmetrization for deep learning on point clouds30 May 2023
- 2023Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants with no False Negatives and no False Positives27 Mar 2023
- 2023Completeness of Atomic Structure Representations28 Feb 2023