Click or drag to resize

IndexKnnSearch Method
Perform k-nearest-neighbours (KNN) search

Namespace:  Emgu.CV.Flann
Assembly:  Emgu.CV.World (in Emgu.CV.World.dll) Version: (
public void KnnSearch(
	IInputArray queries,
	IOutputArray indices,
	IOutputArray squareDistances,
	int knn,
	int checks = 32,
	float eps = 0f,
	bool sorted = true


Type: Emgu.CVIInputArray
A row by row matrix of descriptors to be query for nearest neighbours
Type: Emgu.CVIOutputArray
The result of the indices of the k-nearest neighbours
Type: Emgu.CVIOutputArray
The square of the Eculidean distance between the neighbours
Type: SystemInt32
Number of nearest neighbors to search for
checks (Optional)
Type: SystemInt32
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
eps (Optional)
Type: SystemSingle
The search epsilon
sorted (Optional)
Type: SystemBoolean
If set to true, the search result is sorted
See Also