Lines Matching refs:centers
65 vector<int>* centers,
71 const vector<int>& centers) const;
73 void ComputeClusterMembership(const vector<int>& centers,
89 vector<int>* centers, in ComputeCanonicalViewsClustering() argument
93 cv.ComputeClustering(options, graph, centers, membership); in ComputeCanonicalViewsClustering()
102 vector<int>* centers, in ComputeClustering() argument
105 CHECK_NOTNULL(centers)->clear(); in ComputeClustering()
121 ComputeClusteringQualityDifference(*view, *centers); in ComputeClustering()
133 (centers->size() >= options_.min_views)) { in ComputeClustering()
137 centers->push_back(best_view); in ComputeClustering()
142 ComputeClusterMembership(*centers, membership); in ComputeClustering()
163 const vector<int>& centers) const { in ComputeClusteringQualityDifference()
187 for (int i = 0; i < centers.size(); ++i) { in ComputeClusteringQualityDifference()
189 graph_->EdgeWeight(centers[i], candidate); in ComputeClusteringQualityDifference()
215 const vector<int>& centers, in ComputeClusterMembership() argument
221 for (int i = 0; i < centers.size(); ++i) { in ComputeClusterMembership()
222 center_to_cluster_id[centers[i]] = i; in ComputeClusterMembership()