Similarity of particle systems using an invariant root mean square deviation measure

06/17/2021
by   Johannes Bulin, et al.
0

Determining whether two particle systems are similar is a common problem in particle simulations. When the comparison should be invariant under permutations, orthogonal transformations, and translations of the systems, special techniques are needed. We present an algorithm that can test particle systems of finite size for similarity and, if they are similar, can find the optimal alignment between them. Our approach is based on an invariant version of the root mean square deviation (RMSD) measure and is capable of finding the globally optimal solution in O(n^3) operations where n is the number of three-dimensional particles.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/06/2019

On cylindrical regression in three-dimensional Euclidean space

The three-dimensional cylindrical regression problem is a problem of fin...
01/13/2019

Generating Adversarial Perturbation with Root Mean Square Gradient

Deep Neural Models are vulnerable to adversarial perturbations in classi...
05/06/2021

Random density matrices: analytical results for mean root fidelity and mean square Bures distance

Bures distance holds a special place among various distance measures due...
08/10/2018

On the optimal designs for the prediction of complex Ornstein-Uhlenbeck processes

Physics, chemistry, biology or finance are just some examples out of the...
09/04/2019

Optimal translational-rotational invariant dictionaries for images

We provide the construction of a set of square matrices whose translates...
06/10/2021

Investigating Alternatives to the Root Mean Square for Adaptive Gradient Methods

Adam is an adaptive gradient method that has experienced widespread adop...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.