http://www.emgu.com
Perform k-nearest-neighbours (KNN) search
Namespace:
Emgu.CV.Flann
Assembly:
Emgu.CV.World (in Emgu.CV.World.dll) Version: 4.0.1.3373 (4.0.1.3373)
Syntaxpublic void KnnSearch(
IInputArray queries,
IOutputArray indices,
IOutputArray squareDistances,
int knn,
int checks = 32,
float eps = 0f,
bool sorted = true
)
Public Sub KnnSearch (
queries As IInputArray,
indices As IOutputArray,
squareDistances As IOutputArray,
knn As Integer,
Optional checks As Integer = 32,
Optional eps As Single = 0F,
Optional sorted As Boolean = true
)
public:
void KnnSearch(
IInputArray^ queries,
IOutputArray^ indices,
IOutputArray^ squareDistances,
int knn,
int checks = 32,
float eps = 0f,
bool sorted = true
)
member KnnSearch :
queries : IInputArray *
indices : IOutputArray *
squareDistances : IOutputArray *
knn : int *
?checks : int *
?eps : float32 *
?sorted : bool
(* Defaults:
let _checks = defaultArg checks 32
let _eps = defaultArg eps 0f
let _sorted = defaultArg sorted true
*)
-> 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 (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