public void KnnSearch(
	IInputArray queries,
	IOutputArray indices,
	IOutputArray squareDistances,
	int knn,
	int checks
)

Public Sub KnnSearch ( 
	queries As IInputArray,
	indices As IOutputArray,
	squareDistances As IOutputArray,
	knn As Integer,
	checks As Integer
)

public:
void KnnSearch(
	IInputArray^ queries, 
	IOutputArray^ indices, 
	IOutputArray^ squareDistances, 
	int knn, 
	int checks
)

member KnnSearch : 
        queries : IInputArray * 
        indices : IOutputArray * 
        squareDistances : IOutputArray * 
        knn : int * 
        checks : int -> unit 

Parameters

queries

Type: Emgu.CVIInputArray
A row by row matrix of descriptors to be query for nearest neighbours

indices

Type: Emgu.CVIOutputArray
The result of the indices of the k-nearest neighbours

squareDistances

Type: Emgu.CVIOutputArray
The square of the Eculidean distance between the neighbours

knn

Type: SystemInt32
Number of nearest neighbors to search for

checks

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

Reference