Home
last modified time | relevance | path

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

/external/opencv3/modules/flann/include/opencv2/flann/
Dkmeans_index.h355 branching_ = get_param(params,"branching",32); in dataset_()
434 if (branching_<2) { in buildIndex()
445 computeClustering(root_, indices_, (int)size_, branching_,0); in buildIndex()
451 save_value(stream, branching_); in saveIndex()
463 load_value(stream, branching_); in loadIndex()
479 index_params_["branching"] = branching_; in loadIndex()
619 for(int i=0; i<branching_; ++i) { in save_tree()
638 node->childs = pool_.allocate<KMeansNodePtr>(branching_); in load_tree()
639 for(int i=0; i<branching_; ++i) { in load_tree()
653 for (int k=0; k<branching_; ++k) { in free_centers()
[all …]
Dhierarchical_clustering_index.h366 branching_ = get_param(params,"branching",32); in dataset()
466 if (branching_<2) { in buildIndex()
478 computeClustering(root[i], indices[i], (int)size_, branching_,0); in buildIndex()
491 save_value(stream, branching_); in saveIndex()
516 load_value(stream, branching_); in loadIndex()
531 params["branching"] = branching_; in loadIndex()
625 for(int i=0; i<branching_; ++i) { in save_tree()
642 node->childs = pool.allocate<NodePtr>(branching_); in load_tree()
643 for(int i=0; i<branching_; ++i) { in load_tree()
764 DistanceType* domain_distances = new DistanceType[branching_]; in findNN()
[all …]