Mappings of Galois planes preserving the unit Euclidean distance

1985 ◽  
Vol 29 (1) ◽  
pp. 1-6 ◽  
Author(s):  
F. Radó
Keyword(s):  
Euclidean Distance ◽  
Galois Planes

The Earth Mover’s Distance as a Metric for the Space of Inorganic Compositions

2020 ◽  
Author(s):  
Cameron Hargreaves ◽  
Matthew Dyer ◽  
Michael Gaultois ◽  
Vitaliy Kurlin ◽  
Matthew J Rosseinsky
Keyword(s):  
Euclidean Distance ◽  
Nearest Neighbor ◽  
Nearest Neighbor Search ◽  
Inorganic Crystal Structure Database ◽  
Earth Mover’S Distance ◽  
Chemical Similarity ◽  
Earth Mover's Distance ◽  
Neighbor Search ◽  
The Earth ◽  
Binary Compounds

It is a core problem in any field to reliably tell how close two objects are to being the same, and once this relation has been established we can use this information to precisely quantify potential relationships, both analytically and with machine learning (ML). For inorganic solids, the chemical composition is a fundamental descriptor, which can be represented by assigning the ratio of each element in the material to a vector. These vectors are a convenient mathematical data structure for measuring similarity, but unfortunately, the standard metric (the Euclidean distance) gives little to no variance in the resultant distances between chemically dissimilar compositions. We present the Earth Mover’s Distance (EMD) for inorganic compositions, a well-defined metric which enables the measure of chemical similarity in an explainable fashion. We compute the EMD between two compositions from the ratio of each of the elements and the absolute distance between the elements on the modified Pettifor scale. This simple metric shows clear strength at distinguishing compounds and is efficient to compute in practice. The resultant distances have greater alignment with chemical understanding than the Euclidean distance, which is demonstrated on the binary compositions of the Inorganic Crystal Structure Database (ICSD). The EMD is a reliable numeric measure of chemical similarity that can be incorporated into automated workflows for a range of ML techniques. We have found that with no supervision the use of this metric gives a distinct partitioning of binary compounds into clear trends and families of chemical property, with future applications for nearest neighbor search queries in chemical database retrieval systems and supervised ML techniques.

Level Set Method Optimized with the Euclidean Distance Transform

2019 ◽  
Author(s):  
Luis Fernando Segalla ◽  
Alexandre Zabot ◽  
Diogo Nardelli Siebert ◽  
Fabiano Wolf
Keyword(s):  
Level Set Method ◽  
Level Set ◽  
Euclidean Distance ◽  
Distance Transform ◽  
Euclidean Distance Transform

Improving the Computational Cost for Copied Region Detection in Forensic Images

2016 ◽  
Vol 2 (1) ◽  
pp. 55
Author(s):  
Tu Huynh-Kha ◽  
Thuong Le-Tien ◽  
Synh Ha ◽  
Khoa Huynh-Van
Keyword(s):  
Wavelet Transform ◽  
Euclidean Distance ◽  
Research Work ◽  
Computational Cost ◽  
Correlation Coefficients ◽  
Zernike Moments ◽  
Computational Time ◽  
Discrete Wavelet ◽  
Feature Vectors ◽  
Region Detection

This research work develops a new method to detect the forgery in image by combining the Wavelet transform and modified Zernike Moments (MZMs) in which the features are defined from more pixels than in traditional Zernike Moments. The tested image is firstly converted to grayscale and applied one level Discrete Wavelet Transform (DWT) to reduce the size of image by a half in both sides. The approximation sub-band (LL), which is used for processing, is then divided into overlapping blocks and modified Zernike moments are calculated in each block as feature vectors. More pixels are considered, more sufficient features are extracted. Lexicographical sorting and correlation coefficients computation on feature vectors are next steps to find the similar blocks. The purpose of applying DWT to reduce the dimension of the image before using Zernike moments with updated coefficients is to improve the computational time and increase exactness in detection. Copied or duplicated parts will be detected as traces of copy-move forgery manipulation based on a threshold of correlation coefficients and confirmed exactly from the constraint of Euclidean distance. Comparisons results between proposed method and related ones prove the feasibility and efficiency of the proposed algorithm.

IMPLEMENTASI METODE EUCLIDEAN DISTANCE UNTUK EKSTRAKSI FITUR JARAK PADA CITRA SKELETON

2019 ◽  
Vol 24 (2) ◽  
pp. 134-139
Author(s):  
Miftahul Jannah ◽  
Nurul Humaira
Keyword(s):  
Euclidean Distance

Gait adalah cara atau sikap berjalan kaki seseorang. Tiap orang memiliki cara berjalan yang berbeda, sehingga gerak jalan seseorang sulit untuk disembunyikan ataupun direkayasa. Analisis gait adalah ilmu pengetahuan yang mempelajari tentang kemampuan atau cara bergerak manusia. Dalam bidang kedokteran, analisis gait digunakan untuk menentukan penanganan dan terapi bagi pasien rehabilitasi medik. Dalam penelitian ini digunakan fitur jarak pada citra skeleton. Ekstraksi fitur jarak pada citra skeleton menggunakan metode euclidean distance terbagi dalam beberapa tahapan, dimulai dengan mengambil citra skeleton, konversi citra RGB menjadi citra Biner, proses menemukan titik koordinat dari titik akhir dan titik percabangan, dan ekstraksi fitur pada skeleton. Metode yang digunakan menghasilkan persentase tingkat keberhasilan sebesar 87.84%.

Spheric radial basis functions in Mahalanobis measuring for displaying local field features

2019 ◽  
Vol 952 (10) ◽  
pp. 2-9
Author(s):  
Yu.M. Neiman ◽  
L.S. Sugaipova ◽  
V.V. Popadyev
Keyword(s):  
Gravitational Field ◽  
Quadratic Form ◽  
Local Field ◽  
Euclidean Distance ◽  
Basis Functions ◽  
Spherical Functions ◽  
Local Models ◽  
Stationary Field ◽  
Modeling Process ◽  
The Earth

As we know the spherical functions are traditionally used in geodesy for modeling the gravitational field of the Earth. But the gravitational field is not stationary either in space or in time (but the latter is beyond the scope of this article) and can change quite strongly in various directions. By its nature, the spherical functions do not fully display the local features of the field. With this in mind it is advisable to use spatially localized basis functions. So it is convenient to divide the region under consideration into segments with a nearly stationary field. The complexity of the field in each segment can be characterized by means of an anisotropic matrix resulting from the covariance analysis of the field. If we approach the modeling in this way there can arise a problem of poor coherence of local models on segments’ borders. To solve the above mentioned problem it is proposed in this article to use new basis functions with Mahalanobis metric instead of the usual Euclidean distance. The Mahalanobis metric and the quadratic form generalizing this metric enables us to take into account the structure of the field when determining the distance between the points and to make the modeling process continuous.

scholarly journals Vector Modulator-based Analog Beamforming Using the Least Euclidean Distance Criterion

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Masoud Abbasi Alaei ◽  
Andre B. J. Kokkeler ◽  
Pieter-Tjerk De Boer
Keyword(s):  
Euclidean Distance ◽  
Vector Modulator

Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks

2000 ◽  
Vol 32 (01) ◽  
pp. 1-18 ◽  
Author(s):  
F. Baccelli ◽  
K. Tchoumatchenko ◽  
S. Zuyev
Keyword(s):  
Communication Networks ◽  
Mobile Networks ◽  
Path Length ◽  
Euclidean Distance ◽  
Voronoi Tessellation ◽  
Voronoi Cells ◽  
Ergodic Properties ◽  
Potential Applications ◽  
The Mean ◽  
Mobile Communication Networks

Consider the Delaunay graph and the Voronoi tessellation constructed with respect to a Poisson point process. The sequence of nuclei of the Voronoi cells that are crossed by a line defines a path on the Delaunay graph. We show that the evolution of this path is governed by a Markov chain. We study the ergodic properties of the chain and find its stationary distribution. As a corollary, we obtain the ratio of the mean path length to the Euclidean distance between the end points, and hence a bound for the mean asymptotic length of the shortest path. We apply these results to define a family of simple incremental algorithms for constructing short paths on the Delaunay graph and discuss potential applications to routeing in mobile communication networks.

Sign in / Sign up

Export Citation Format

Share Document