Kinetic Euclidean Distance Matrices

Abstract

Euclidean distance matrices (EDMs) are a major tool for localization from distances, with applications ranging from protein structure determination to global positioning and manifold learning. They are, however, static objects which serve to localize points from a snapshot of distances. If the objects move, one expects to do better by modeling the motion. In this paper, we introduce Kinetic Euclidean Distance Matrices (KEDMs)-a new kind of time-dependent distance matrices that incorporate motion. The entries of KEDMs become functions of time, the squared time-varying distances. We study two smooth trajectory models-polynomial and bandlimited trajectoriesand show that these trajectories can be reconstructed from incomplete, noisy distance observations, scattered over multiple time instants. Our main contribution is a semidefinite relaxation (SDR), inspired by SDRs for static EDMs. Similarly to the static case, the SDR is followed by a spectral factorization step; however, because spectral factorization of polynomial matrices is more challenging than for constant matrices, we propose a new factorization method that uses anchor measurements.Extensive numerical experiments show that KEDMs and the new semidefinite relaxation accurately reconstruct trajectories from noisy, incomplete distance data and that, in fact, motion improves rather than degrades localization if properly modeled. This makes KEDMs a promising tool for problems in geometry of dynamic points sets.

Assessing the Pollution Level in the Kuban River Basin by Multivariate Cluster Analysis

“…The spatial and temporal variabilities were studied by using the method of pattern recognition, Collins histogram, pie chart, stiffness diagram, Sheller's semi-logarithmic chart, Piper diagram, hierarchical cluster analysis in Q-mode (HCA), K-means clustering (KMC), principal components analysis (PCA), and fuzzy k-means clustering (FKM) (De Jalón et al, 2019). Cluster analysis allows classifying objects on the principles of similarity to other objects contained in a cluster by a predefined selection criterion (Tabaghi et al, 2019a). Methods of multivariate cluster analysis are widely used not only to identify and group surface waters according to hydro-ecological and chemical indices but also to predict and assess groundwater scarcity and the spread of meteorological and hydrological droughts (Bhuiyan et al, 2006).…”

An efficient image descriptor for image classification and CBIR

“…In addition, the Adam algorithm has been used to train the AlexNet CNN [29] and Random forest, SVM and KNN classifiers have been utilized for classification [30][31][32][33][34][35][36]. Moreover, for measuring the similarity, Euclidean distance has also been used [37,38]. In the following, used datasets, experiments and comparison results have been demonstrated and described in details.…”

Hyperbolic Distance Matrices

“…are non-linear functions of X with an unbounded gradient [13]. Similar issues arise when computing embeddings in other spaces such as Euclidean [16] or the space of polynomial trajectories [48]. A particularly effective strategy in the Euclidean case is the semidefinite relaxation which relies on the simple fact that the Euclidean Gramian is positive semidefinite.…”