BruteSearch A MatLab Nearest Neighbour finder script
Download

BruteSearch Ranking & Summary

BruteSearch Tags

Finder RADIUS Matlab library nearest color nearest Matlab component matlab script virus finder Nearest Neighbor Problem find nearest neighbors MATLAB environment Matlab Algorithm Matlab Addon Matlab add-in nearest neighbour find nearest neighbour radius search range search neighbour Convert Matlab File script finder Nearest Neighbour Search Nearest Neighbour Filter K-Nearest Matlab plugin Matlab script matlab 6.5 matlab 7.0

BruteSearch Description

When the dataset is small, when you have to run only a few number of search, or when the dimensions of points is large, the brute search method is still faster than kd-trees data structure. Computing the distances one by one take a minor time than building the tree. Some of these problems have became less grave since the introduction of GLTree (file id 22190) which allows for a very fast tree construction. Despite this, very small dataset are still terrain for brute search algorithms. I saw many k-neighbours utilities on FEX, but all them were m-coded. I think such a brute calculation is not an m-code job. So I developed my own Nearest Neighbour finder. It is nothing special it just computes all the distances and take the ones required from the input parameters, but of course the mex implementation make it even faster than vectorized m-code. K-Nearest Neigbours and Radius (Range) Search : Nearest neighbor K-Nearest neighbors Radius Search All the tools included in BruteSearch support N-dimensions and work on double. It is also possible to choose if return the distances.

BruteSearch Related Software