Lines Matching refs:centers
51 // graph. centers will contain the vertices that are the identified
52 // as the canonical views/cluster centers, and membership is a map
60 vector<int>* centers,
66 const vector<int>& centers) const;
68 void ComputeClusterMembership(const vector<int>& centers,
84 vector<int>* centers,
88 cv.ComputeClustering(graph, options, centers, membership);
97 vector<int>* centers,
100 CHECK_NOTNULL(centers)->clear();
116 ComputeClusteringQualityDifference(*view, *centers);
128 (centers->size() >= options_.min_views)) {
132 centers->push_back(best_view);
137 ComputeClusterMembership(*centers, membership);
158 const vector<int>& centers) const {
182 for (int i = 0; i < centers.size(); ++i) {
184 graph_->EdgeWeight(centers[i], candidate);
210 const vector<int>& centers,
216 for (int i = 0; i < centers.size(); ++i) {
217 center_to_cluster_id[centers[i]] = i;
