Home
last modified time | relevance | path

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

/external/opencv3/modules/flann/include/opencv2/flann/
Dkmeans_index.h922 DistanceType* domain_distances = new DistanceType[branching_]; in findNN() local
923 int closest_center = exploreNodeBranches(node, vec, domain_distances, heap); in findNN()
924 delete[] domain_distances; in findNN()
937 …odeBranches(KMeansNodePtr node, const ElementType* q, DistanceType* domain_distances, Heap<BranchS… in exploreNodeBranches() argument
941 domain_distances[best_index] = distance_(q, node->childs[best_index]->pivot, veclen_); in exploreNodeBranches()
943 domain_distances[i] = distance_(q, node->childs[i]->pivot, veclen_); in exploreNodeBranches()
944 if (domain_distances[i]<domain_distances[best_index]) { in exploreNodeBranches()
952 domain_distances[i] -= cb_index_*node->childs[i]->variance; in exploreNodeBranches()
958 heap->insert(BranchSt(node->childs[i],domain_distances[i])); in exploreNodeBranches()
1015 DistanceType* domain_distances = new DistanceType[branching_]; in getCenterOrdering() local
[all …]
Dhierarchical_clustering_index.h764 DistanceType* domain_distances = new DistanceType[branching_]; in findNN() local
766 … domain_distances[best_index] = distance(vec, dataset[node->childs[best_index]->pivot], veclen_); in findNN()
768 domain_distances[i] = distance(vec, dataset[node->childs[i]->pivot], veclen_); in findNN()
769 if (domain_distances[i]<domain_distances[best_index]) { in findNN()
775 heap->insert(BranchSt(node->childs[i],domain_distances[i])); in findNN()
778 delete[] domain_distances; in findNN()