Unsupervised landmark analysis for jump detection in molecular dynamics simulations

Molecular dynamics is a versatile and powerful method to study diffusion in solid-state ionic conductors, requiring minimal prior knowledge of equilibrium or transition states of the system's free energy surface. However, the analysis of trajectories for relevant but rare events, such as a jump of the diffusing mobile ion, is still rather cumbersome, requiring prior knowledge of the diffusive process in order to get meaningful results. In this work, we present a novel approach to detect the relevant events in a diffusive system without assuming prior information regarding the underlying process. We start from a projection of the atomic coordinates into a landmark basis to identify the dominant features in a mobile ion's environment. Subsequent clustering in landmark space enables a discretization of any trajectory into a sequence of distinct states. As a final step, the use of the smooth overlap of atomic positions descriptor allows distinguishing between different environments in a straightforward way. We apply this algorithm to ten Li-ionic systems and conduct in-depth analyses of cubic Li$_{7}$La$_{3}$Zr$_{2}$O$_{12}$, tetragonal Li$_{10}$GeP$_{2}$S$_{12}$, and the $\beta$-eucryptite LiAlSiO$_{4}$. We compare our results to existing methods, underscoring strong points, weaknesses, and insights into the diffusive behavior of the ionic conduction in the materials investigated

Efficient implementation of atom-density representations

Physically motivated and mathematically robust atom-centered representations of molecular structures are key to the success of modern atomistic machine learning. They lie at the foundation of a wide range of methods to predict the properties of both materials and molecules and to explore and visualize their chemical structures and compositions. Recently, it has become clear that many of the most effective representations share a fundamental formal connection. They can all be expressed as a discretization of n-body correlation functions of the local atom density, suggesting the opportunity of standardizing and, more importantly, optimizing their evaluation. We present an implementation, named librascal, whose modular design lends itself both to developing refinements to the density-based formalism and to rapid prototyping for new developments of rotationally equivariant atomistic representations. As an example, we discuss smooth overlap of atomic position (SOAP) features, perhaps the most widely used member of this family of representations, to show how the expansion of the local density can be optimized for any choice of radial basis sets. We discuss the representation in the context of a kernel ridge regression model, commonly used with SOAP features, and analyze how the computational effort scales for each of the individual steps of the calculation. By applying data reduction techniques in feature space, we show how to reduce the total computational cost by a factor of up to 4 without affecting the model’s symmetry properties and without significantly impacting its accuracy

Edge detection algorithm based on quantum superposition principle and photons arrival probability

The detection of object edges in images is a crucial step employed in a vast amount of computer vision applications, for which a series of different algorithms has been developed in the last decades. This paper proposes a new edge detection method based on quantum information, which is achieved in two main steps: (i) an image enhancement stage that employs the quantum superposition law and (ii) an edge detection stage based on the probability of photon arrival to the camera sensor. The proposed method has been tested on synthetic and real images devoted to agriculture applications, where Fram & Deutsh criterion has been adopted to evaluate its performance. The results show that the proposed method gives better results in terms of detection quality and computation time compared to classical edge detection algorithms such as Sobel, Kayyali, Canny and a more recent algorithm based on Shannon entropy