Distance

The script uses distance transform instead of thinning base as the primary method for skeletonization.The method is sensitive to the value of the user defined Thinness Parameter (TP).An alternative approach to 3D skeletonization that use the gradient and divergence of the distance transform is...

These tracks are intended to be visualised on maps, plotted as distance/altitude profiles, have statistics derived from them, etc.The 'base' trackfield CCK field knows about latitude, longitude, altitude and distance.Due to the flexibility of the system, the distance/altitude pairs can be...

It finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations). Each salesman travels to...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

Finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities without returning to the starting location).Each salesman starts at the...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

The script finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities and finally to the end location).Each salesman starts at the...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to individual cities and back to the original starting place).Each salesman starts at the first point, and...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

This function is for training a codebook for vector quantization. The data set is split to two clusters, first, and the mean of each cluster is found (centroids). The disttance of each vector from these centroids is found and each vector is associated with a cluster. The mean of vectors of each...


Platforms: Matlab

There are two stages in our experiments, one is to find the predicted values of the signal strengths (RSSId-deOaos) by using Grey prediction algorithm and second is to find the location coordinate of the mobile user by using Dynamic Triangular Location method. We have used grey prediction to...


Platforms: Matlab

ISSUE:We can observe that when the dimension of A is a multiple of 2, pixel information is misplaced (top-left-corner) or lost (bottom-right-corner)FIGURES:1st-row L-to-R: Shows an original image GREEN, then its MATLAB's radon transform (a.k.a. sinogram), then its MATLAB's inverse radon transform...


Platforms: Matlab

Gravitational search algorithm (GSA) is an optimization algorithm based on the law of gravity and mass interactions.This algorithm is based on the Newtonian gravity: "Every particle in the universe attracts every other particle with a force that is directly proportional to the product of their...


Platforms: Matlab

The function LMFsolve.m serves for finding optimal solution of an overdetermined system of nonlinear equations in the least-squares sense. The standard Levenberg- Marquardt algorithm was modified by Fletcher and coded in FORTRAN many years ago. LMFsolve is its essentially shortened version...


Platforms: Matlab

Acoustic tomography involves sending a sonic signal across a measurement area and timing how long it takes to travel the distance. A number of transducers are situated around the measurement area to achieve this. Since the absolute sonic speed is affected by temperature and wind speed, so is the...


Platforms: Matlab

Normally boxplot plots the whiskers with a maximum length based on the distance between the 25th and 75th percentile. This script uses boxplot but plots the whiskers for a specified percentile and only plots the outliers beyond the new whiskers.Note that the percentile is defined as the data...


Platforms: Matlab

Implementation based on:"Finite-Element Discretization Of Static Hamilton-Jacobi Equations Based On A Local Variational Principle"by F. Bornemann and C. RaschComments:1. There is no restriction on the type of triangulation, i.e. it does not need to be acute. But the method will require more than...


Platforms: Matlab

How do you find the shortest path from one point to another in a computationally efficient way? The A* algorithm provides one implementation where the distance to the goal is considered as a heuristic in addition to local weightings, and the best path is recovered without combinatorial complexity.


Platforms: Matlab

This is a (small) change to the current fminsearch routine to improve convergence.The current fminsearch selects n additional simplex points based on a small change in each variable. This implementation uses an adaptive procedure to select these n points while maintaining the correct relative...


Platforms: Matlab

A package of Matlab functions for exploring spatial patterns of correlation in high resolution climate data. Cross-similarity parameters (dominant lag, max-similarity, window cross-similarity) are calculated for each pair of records and presented on maps as well as plots with an intersite...


Platforms: Matlab

This function uses the Vincenty direct algorithm to solve the "forward geodesic problem," which is the problem of computing the endpoint of a geodesic (shortest-distance) path on the ellipsoidal earth, given the start point, a path length, and a starting azimuth. This process is also called...


Platforms: Matlab

INVDISTGRID Simple, robust gridding using inverse-distance interpolation. [Xi,Yi,Zi] = invdistgrid[X,Y,Z,dx] Grids values in vector Z with coordinates X and Y into an array with spacing dx using inverse-distance weighting (default power =2). All data between grid points are used in weighting. If...


Platforms: Matlab

This function solves the "forward geodesic problem," which is to compute the endpoint of a geodesic (shortest-distance) path on the ellipsoidal earth, given the start point, a path length, and a starting azimuth.In response to a user request, this function numerically inverts the previously...


Platforms: Matlab