Home
last modified time | relevance | path

Searched refs:cutfeat (Results 1 – 2 of 2) sorted by relevance

/external/opencv3/modules/flann/include/opencv2/flann/
Dkdtree_single_index.h363 int cutfeat; in divideTree() local
365 middleSplit_(&vind_[0]+left, right-left, idx, cutfeat, cutval, bbox); in divideTree()
367 node->divfeat = cutfeat; in divideTree()
370 left_bbox[cutfeat].high = cutval; in divideTree()
374 right_bbox[cutfeat].low = cutval; in divideTree()
377 node->divlow = left_bbox[cutfeat].high; in divideTree()
378 node->divhigh = right_bbox[cutfeat].low; in divideTree()
400 …void middleSplit(int* ind, int count, int& index, int& cutfeat, DistanceType& cutval, const Boundi… in middleSplit() argument
404 cutfeat = 0; in middleSplit()
410 cutfeat = i; in middleSplit()
[all …]
Dkdtree_index.h287 int cutfeat; in divideTree() local
289 meanSplit(ind, count, idx, cutfeat, cutval); in divideTree()
291 node->divfeat = cutfeat; in divideTree()
306 void meanSplit(int* ind, int count, int& index, int& cutfeat, DistanceType& cutval) in meanSplit() argument
334 cutfeat = selectDivision(var_); in meanSplit()
335 cutval = mean_[cutfeat]; in meanSplit()
338 planeSplit(ind, count, cutfeat, cutval, lim1, lim2); in meanSplit()
393 void planeSplit(int* ind, int count, int cutfeat, DistanceType cutval, int& lim1, int& lim2) in planeSplit() argument
399 while (left<=right && dataset_[ind[left]][cutfeat]<cutval) ++left; in planeSplit()
400 while (left<=right && dataset_[ind[right]][cutfeat]>=cutval) --right; in planeSplit()
[all …]