Three ways to calculate a distance matrix out of a list of n-dimensional points using scipy.
DISTMATLATLON Computes distance matrix between list of coords in X and Y
D = DISTMATLATLON(X,Y) for matrices X and Y, with columns [Lat Lon],
returns the distance matrix where the (i,j)th entry is the distance
between the i'th...
Transform a inner product matrix or kernel matrix to a square of distance matrix
This program tests an input matrix to see if it is a Euclidean distance matrix to within a user-specified tolerance. If not, it reports why and returns the closest EDM in the sense of Schoenberg.
D = DISTMAT(X,Y) for matrices X and Y returns the distance matrix where the (i,j)th entry is the d-norm distance between the ith and jth row of X and Y respectively.
DISTMAT(X,Y,d) computes a specific d-norm distance. Default=2
This implementation is based on "The Earth Mover's Distance as a Metric for Image Retrieval", Y. Rubner, C. Tomasi and L. Guibas, International Journal of Computer Vision, 40(2), pp. 99-121, 2000.
emd ---> computes the...
This program calculates the Euclidean distances of every possible pair of points, whose coordinates are given as rows in a matrix. It is particularly useful for distance-based classifiers, due to its limited computational cost. The program can be...
is program computes a map of visibility from a selected point on a topography. It has been written to help the search for radio relay best location. Because it considers only direct line of sight, it gives a good estimation for possible radio link...
DIJKSTRA Calculate Minimum Costs and Paths using Dijkstra's Algorithm
[AorV] Either A or V where
A is a NxN adjacency matrix, where A(I,J) is nonzero if and only if an edge connects point I to point J
The code computes the exact eigenpairs of (1-3)D negative Laplacian on a rectangular finite-difference grid for combinations of Dirichlet, Neumann, and Periodic boundary conditions using explicit formulas from
This function will compute the great circle distance between two points on a sphere of uniform radius using the Vincenty formula. At minimum, four inputs are required: lat1, long1, lat2, long2. Optionally, a fifth parameter (r) can be specified....
function W = euklid_W(ws,d,n)
function W = euklid_invW(ws,d,n)
PURPOSE: create an (inverse) euklidean distance spatial weight matrix
(n x m 'moving-window' style matrix with distance to center cell
Return covariance matrix for given data matrix X (row = object, column = feature)
% @author: Kardi Teknomo
See the usage for Mahalanobis distance computation in...
The little program is able to compute correctly the electric parameters (R, L und C) for a set of electric cables (radial electromagnetic field only).
It can be used for compute R, L and C matrix in order to simulate an underground...
Compute the distance map to a set of points using the fast marching algorithm.
Solves the 2-D eikonal PDE.
The following problem is considered: given a matrix A in R(mxn), a vector b in R(m) and e>0, compute a vector x satisfying norm(Ax-b)<=e if such exists, such that x has the fewest number of non-zero entries over all such vectors.
Used in image compression, the haar transform is an alternative to the DCT transformation. This file compute an n*n Haar matrix. (same use as "dctmtx")
The code implements the so called Faddeev-Leverrier algorithm to compute the coefficients of the characteristic polynomial of a given matrix and to get the inverse of the matrix without extra cost.
X must be a N-by-K matrix, N is the number of "candidate" and the K is the number of "judge".
This function uses a vectorized version of the marching cubes algorithm to compute a triangulated mesh of the isosurface within a given 3D matrix of scalar values at a given isosurface value. The output is a triangulated mesh specified in terms of...