IRA: A shape matching approach for recognition and comparison of generic atomic patterns

10/29/2021
by   Miha Gunde, et al.
0

We propose a versatile, parameter-less approach for solving the shape matching problem, specifically in the context of atomic structures when atomic assignments are not known a priori. The algorithm Iteratively suggests Rotated atom-centered reference frames and Assignments (Iterative Rotations and Assignments, IRA). The frame for which a permutationally invariant set-set distance, namely the Hausdorff distance, returns minimal value is chosen as the solution of the matching problem. IRA is able to find rigid rotations, reflections, translations, and permutations between structures with different numbers of atoms, for any atomic arrangement and pattern, periodic or not. When distortions are present between the structures, optimal rotation and translation are found by further applying a standard Singular Value Decomposition-based method. To compute the atomic assignments under the one-to-one assignment constraint, we develop our own algorithm, Constrained Shortest Distance Assignments (CShDA). The overall approach is extensively tested on several structures, including distorted structural fragments. Efficiency of the proposed algorithm is shown as a benchmark comparison against two other shape matching algorithms. We discuss the use of our approach for the identification and comparison of structures and structural fragments through two examples: a replica exchange trajectory of a cyanine molecule, in which we show how our approach could aid the exploration of relevant collective coordinates for clustering the data; and an SiO_2 amorphous model, in which we compute distortion scores and compare them with a classical strain-based potential. The source code and benchmark data are available at <https://github.com/mammasmias/IterativeRotationsAssignments>.

READ FULL TEXT
research
04/08/2021

Computing the sequence of k-cardinality assignments

The k-cardinality assignment problem asks for finding a maximal (minimal...
research
06/11/2018

ATOMO: Communication-efficient Learning via Atomic Sparsification

Distributed model training suffers from communication overheads due to f...
research
07/27/2022

Atomic structure generation from reconstructing structural fingerprints

Data-driven machine learning methods have the potential to dramatically ...
research
09/29/2022

Heterogeneous reconstruction of deformable atomic models in Cryo-EM

Cryogenic electron microscopy (cryo-EM) provides a unique opportunity to...
research
09/23/2018

Legal Assignments and fast EADAM with consent via classical theory of stable matchings

Gale and Shapley's college admission problem and concept of stability (G...
research
03/28/2022

Infinite-Dimensional Sparse Learning in Linear System Identification

Regularized methods have been widely applied to system identification pr...
research
04/03/2020

Finding Black Cat in a Coal Cellar – Keyphrase Extraction Keyphrase-Rubric Relationship Classification from Complex Assignments

Diversity in content and open-ended questions are inherent in complex as...

Please sign up or login with your details

Forgot password? Click here to reset