http://www.emgu.com
Perform k-nearest-neighbours (KNN) search

Namespace: Emgu.CV.Flann
Assembly: Emgu.CV (in Emgu.CV.dll) Version: 2.3.0.1416 (2.3.0.1416)

Syntax

C#
public void KnnSearch(
	Matrix<float> queries,
	Matrix<int> indices,
	Matrix<float> squareDistances,
	int knn,
	int checks
)
Visual Basic
Public Sub KnnSearch ( _
	queries As Matrix(Of Single), _
	indices As Matrix(Of Integer), _
	squareDistances As Matrix(Of Single), _
	knn As Integer, _
	checks As Integer _
)
Visual C++
public:
void KnnSearch(
	Matrix<float>^ queries, 
	Matrix<int>^ indices, 
	Matrix<float>^ squareDistances, 
	int knn, 
	int checks
)

Parameters

queries
Type: Emgu.CV..::..Matrix<(Of <(<'Single>)>)>
A row by row matrix of descriptors to be query for nearest neighbours
indices
Type: Emgu.CV..::..Matrix<(Of <(<'Int32>)>)>
The result of the indices of the k-nearest neighbours
squareDistances
Type: Emgu.CV..::..Matrix<(Of <(<'Single>)>)>
The square of the Eculidean distance between the neighbours
knn
Type: System..::..Int32
Number of nearest neighbors to search for
checks
Type: System..::..Int32
The number of times the tree(s) in the index should be recursively traversed. A higher value for this parameter would give better search precision, but also take more time. If automatic configuration was used when the index was created, the number of checks required to achieve the specified precision was also computed, in which case this parameter is ignored

See Also