| /dports/science/py-dlib/dlib-19.22/dlib/svm/ |
| H A D | kkmeans.h | 71 return *centers[i]; in get_kcentroid()
86 centers.set_size(num); in set_number_of_centers()
155 centers.swap(item.centers); in swap()
304 vector_type1& centers,
329 centers.clear();
341 const double k_cc = k(centers[i], centers[i]);
468 centers.assign(centers.size(), zero);
553 … centers[i] = matrix_cast<scalar_type>(gaussian_randm(centers[i].nr(), centers[i].nc(), seed++));
556 centers[i] /= len;
592 centers.assign(centers.size(), zero);
[all …]
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/svm/ |
| H A D | kkmeans.h | 71 return *centers[i]; in get_kcentroid()
86 centers.set_size(num); in set_number_of_centers()
155 centers.swap(item.centers); in swap()
304 vector_type1& centers,
329 centers.clear();
341 const double k_cc = k(centers[i], centers[i]);
468 centers.assign(centers.size(), zero);
553 … centers[i] = matrix_cast<scalar_type>(gaussian_randm(centers[i].nr(), centers[i].nc(), seed++));
556 centers[i] /= len;
592 centers.assign(centers.size(), zero);
[all …]
|
| /dports/games/54321/54321/data/ |
| H A D | ts2.hlp | 14 subimage centers 226 88 0 0 36 36
15 subimage centers 262 88 36 0 36 36
16 subimage centers 226 124 0 36 36 36
17 subimage centers 262 124 36 36 36 36
18 subimage centers 298 124 72 0 36 36
19 subimage centers 226 160 0 72 36 36
20 subimage centers 262 160 36 72 36 36
21 subimage centers 298 160 72 36 36 36
37 subimage centers 226 248 0 0 36 36
38 subimage centers 262 248 36 0 36 36
[all …]
|
| H A D | ts1.hlp | 15 subimage centers 226 88 0 0 36 36
16 subimage centers 262 88 36 0 36 36
17 subimage centers 298 88 72 0 36 36
18 subimage centers 226 124 0 36 36 36
19 subimage centers 262 124 36 36 36 36
20 subimage centers 226 160 0 72 36 36
21 subimage centers 262 160 36 72 36 36
22 subimage centers 298 160 72 36 36 36
38 subimage centers 226 248 0 0 36 36
39 subimage centers 262 248 36 0 36 36
[all …]
|
| /dports/science/R-cran-e1071/e1071/R/ |
| H A D | cmeans.R | 11 if(missing(centers))
26 if(length(centers) == 1) {
27 ncenters <- centers
38 centers <- as.matrix(centers)
79 initcenters <- centers
81 rownames(centers) <- pos
88 centers = as.double(centers),
105 centers = as.double(centers),
120 centers <- matrix(retval$centers, ncol = xcols,
132 retval <- list(centers = centers, size = clustersize, globalVar
[all …]
|
| H A D | cshell.R | 12 if (is.matrix(centers))
13 ncenters <- dim(centers)[1]
16 ncenters <- centers
38 initcenters <- centers
42 rownames(centers) <- pos
53 centers = as.double(centers),
66 centers <- matrix(retval$centers, ncol = xcols, dimnames = dimnames(initcenters))
128 centers = as.double(centers),
146 centers <- matrix(retval$centers, ncol = xcols,
158 centers <- matrix(retval$centers, ncol = xcols,
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/internal/Surface_mesh_segmentation/ |
| H A D | Expectation_maximization.h | 104 std::vector<Gaussian_center> centers;
154 k_means.fill_with_centers(centers);
163 sort(centers.begin(), centers.end());
218 it != centers.end(); ++it) { in calculate_initial_mixing_and_deviation()
243 centers[i].deviation = std::sqrt(centers[i].deviation / member_count[i]); in calculate_initial_mixing_and_deviation()
253 centers.clear(); in initiate_centers_randomly()
265 centers.clear(); in initiate_centers_plus_plus()
298 centers[center_i].deviation = new_deviation; in calculate_parameters()
299 centers[center_i].mean = new_mean; in calculate_parameters()
390 max_centers = centers; in calculate_clustering_with_multiple_run()
[all …]
|
| H A D | K_means_clustering.h | 58 centers.reserve(number_of_centers); in forgy_initialization()
110 centers.reserve(number_of_centers); in plus_plus_initialization()
120 centers.push_back(points[initial_index]); in plus_plus_initialization()
246 centers) in calculate_new_center()
260 centers[center_id].add_point(data); in calculate_new_center()
279 std::vector<K_means_center> centers;
315 sort(centers.begin(), centers.end());
345 centers.clear(); in initiate_centers_randomly()
355 centers.clear(); in initiate_centers_plus_plus()
410 min_centers = centers; in calculate_clustering_with_multiple_run()
[all …]
|
| /dports/math/R/R-4.1.2/src/library/stats/R/ |
| H A D | kmeans.R | 31 centers = centers,
54 centers = centers, k,
60 centers = as.double(centers), k,
88 if(missing(centers))
95 if(length(centers) == 1L) {
96 k <- centers
108 centers <- as.matrix(centers)
112 k <- nrow(centers)
135 centers <- matrix(Z$centers, k)
141 structure(list(cluster = cluster, centers = centers, totss = totss, nameattr
[all …]
|
| /dports/math/libRmath/R-4.1.1/src/library/stats/R/ |
| H A D | kmeans.R | 31 centers = centers,
54 centers = centers, k,
60 centers = as.double(centers), k,
88 if(missing(centers))
95 if(length(centers) == 1L) {
96 k <- centers
108 centers <- as.matrix(centers)
112 k <- nrow(centers)
135 centers <- matrix(Z$centers, k)
141 structure(list(cluster = cluster, centers = centers, totss = totss, nameattr
[all …]
|
| /dports/misc/darknet/darknet-darknet_yolo_v4_pre/scripts/ |
| H A D | kmeansiou.c | 29 double best_dist = dist(datum, centers.vals[best], centers.cols); in closest_center()
30 for(j = 0; j < centers.rows; ++j){ in closest_center()
31 double new_dist = dist(datum, centers.vals[j], centers.cols); in closest_center()
43 return dist(datum, centers.vals[ci], centers.cols); in dist_to_closest_center()
62 zero_matrix(centers); in kmeans_maximization()
92 matrix centers; member
99 int clusters = centers.rows; in smart_centers()
102 centers.rows = i; in smart_centers()
132 smart_centers(data, centers); in do_kmeans()
140 m.centers = centers; in do_kmeans()
[all …]
|
| /dports/science/qwalk/mainline-1.0.1-300-g1b7e381/src/orbitals/ |
| H A D | MO_matrix_basfunc.cpp | 78 int centermax=centers.size(); in init()
202 centers.writeinput(indent2, os); in writeinput()
217 centers.updateDistance(e, sample); in updateVal()
240 centers.getDistance(e, cen2, R); in updateVal()
242 int b=centers.basis(cen2,n); in updateVal()
278 centers.updateDistance(e, sample); in updateLap()
289 centers.getDistance(e, cen2, R); in updateLap()
291 int b=centers.basis(cen2,n); in updateLap()
339 centers.updateDistance(e, sample); in updateHessian()
351 centers.getDistance(e, cen2, R); in updateHessian()
[all …]
|
| H A D | MO_matrix_Cbasfunc.cpp | 80 int centermax=centers.size(); in init()
203 centers.writeinput(indent2, os); in writeinput()
276 centers.read(centertext, newpos, sys); in read()
277 centers.assignBasis(basis); in read()
282 for(int i=0; i< centers.size(); i++) in read()
318 centers.updateDistance(e, sample); in updateVal()
344 centers.getDistance(e, cen2, R); in updateVal()
346 int b=centers.basis(cen2,n); in updateVal()
382 centers.updateDistance(e, sample); in updateLap()
393 centers.getDistance(e, cen2, R); in updateLap()
[all …]
|
| H A D | MO_matrix_cutoff.h | 287 for(int n=0; n< centers.nbasis(centers.equiv_centers(ion,0)); n++) { in writeorb()
288 int fnum=centers.basis(centers.equiv_centers(ion,0),n); in writeorb()
296 for(int n=0; n< centers.nbasis(centers.equiv_centers(ion,0)); n++) { in writeorb()
297 int fnum=centers.basis(centers.equiv_centers(ion,0),n); in writeorb()
328 for(int n=0; n< centers.nbasis(centers.equiv_centers(ion,0)); n++) { in writeorb()
329 int fnum=centers.basis(centers.equiv_centers(ion,0),n); in writeorb()
440 int centermax=centers.size(); in updateVal()
466 b=centers.basis(ion,n); in updateVal()
508 int centermax=centers.size(); in updateLap()
538 b=centers.basis(ion, n); in updateLap()
[all …]
|
| /dports/databases/postgis32/postgis-3.2.0/liblwgeom/ |
| H A D | lwkmeans.c | 25 POINT4D *centers,
45 POINT4D *centers, in improve_structure() argument
164 if (centers[i].m) in update_means()
166 centers[i].x /= centers[i].m; in update_means()
167 centers[i].y /= centers[i].m; in update_means()
168 centers[i].z /= centers[i].m; in update_means()
186 centers[0] = objs[0]; in kmeans_init()
222 centers[0] = objs[p1]; in kmeans_init()
223 centers[1] = objs[p2]; in kmeans_init()
279 POINT4D *centers, in kmeans() argument
[all …]
|
| /dports/misc/darknet/darknet-darknet_yolo_v4_pre/src/ |
| H A D | matrix.c | 194 float best_dist = dist(datum, centers.vals[best], centers.cols); in closest_center()
195 for (j = 0; j < centers.rows; ++j) { in closest_center()
196 float new_dist = dist(datum, centers.vals[j], centers.cols); in closest_center()
208 return dist(datum, centers.vals[ci], centers.cols); in dist_to_closest_center()
225 matrix old_centers = make_matrix(centers.rows, centers.cols); in kmeans_maximization()
229 for (i = 0; i < centers.rows; ++i) { in kmeans_maximization()
232 centers.vals[i][j] = 0; in kmeans_maximization()
241 for (i = 0; i < centers.rows; ++i) { in kmeans_maximization()
249 for (i = 0; i < centers.rows; ++i) { in kmeans_maximization()
251 if(centers.vals[i][j] == 0) centers.vals[i][j] = old_centers.vals[i][j]; in kmeans_maximization()
[all …]
|
| /dports/databases/postgis31/postgis-3.1.4/liblwgeom/ |
| H A D | lwkmeans.c | 69 memset(centers, 0, sizeof(POINT4D) * k); in update_means()
76 centers[cluster].m += objs[i].m; in update_means()
80 if (centers[i].m) in update_means()
82 centers[i].x /= centers[i].m; in update_means()
83 centers[i].y /= centers[i].m; in update_means()
84 centers[i].z /= centers[i].m; in update_means()
152 centers[0] = objs[p1]; in kmeans_init()
153 centers[1] = objs[p2]; in kmeans_init()
199 centers[i] = objs[candidate_center]; in kmeans_init()
236 memset(centers, 0, sizeof(POINT4D) * k); in lwgeom_cluster_kmeans()
[all …]
|
| /dports/graphics/blender/blender-2.91.0/extern/ceres/internal/ceres/ |
| H A D | canonical_views_clustering.cc | 63 vector<int>* centers,
86 vector<int>* centers, in ComputeCanonicalViewsClustering() argument
99 vector<int>* centers, in ComputeClustering() argument
102 CHECK(centers != nullptr); in ComputeClustering()
104 centers->clear(); in ComputeClustering()
134 centers->push_back(best_view); in ComputeClustering()
158 const vector<int>& centers) const { in ComputeClusteringQualityDifference()
180 for (int i = 0; i < centers.size(); ++i) { in ComputeClusteringQualityDifference()
206 const vector<int>& centers, in ComputeClusterMembership() argument
213 for (int i = 0; i < centers.size(); ++i) { in ComputeClusterMembership()
[all …]
|
| /dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/ |
| H A D | canonical_views_clustering.cc | 63 vector<int>* centers,
71 void ComputeClusterMembership(const vector<int>& centers,
86 vector<int>* centers, in ComputeCanonicalViewsClustering() argument
99 vector<int>* centers, in ComputeClustering() argument
102 CHECK(centers != nullptr); in ComputeClustering()
104 centers->clear(); in ComputeClustering()
133 centers->push_back(best_view); in ComputeClustering()
138 ComputeClusterMembership(*centers, membership); in ComputeClustering()
177 for (int i = 0; i < centers.size(); ++i) { in ComputeClusteringQualityDifference()
208 for (int i = 0; i < centers.size(); ++i) { in ComputeClusterMembership()
[all …]
|
| /dports/science/R-cran-e1071/e1071/src/ |
| H A D | cshell.c | 26 double *centers, int *itermax, int *iter, in subcshell() argument
57 centers[i+(*ncenters)*col]=0.0; in subcshell()
71 centers[i+(*ncenters)*col]/=sum2; in subcshell()
90 …distance+= (x[k+(*xrows)*col]-centers[i+(*ncenters)*col])*(x[k+(*xrows)*col]-centers[i+(*ncenters)… in subcshell()
130 …tempu1+=(x[k+(*xrows)*col]-centers[i+(*ncenters)*col])*(x[k+(*xrows)*col]-centers[i+(*ncenters)*co… in subcshell()
131 …tempu2+=(x[k+(*xrows)*col]-centers[j+(*ncenters)*col])*(x[k+(*xrows)*col]-centers[j+(*ncenters)*co… in subcshell()
166 …serror += (x[k+(*xrows)*n] - centers[m+(*ncenters)*n])*(x[k+(*xrows)*n] - centers[m +(*ncenters)*n… in subcshell()
248 …tempu1+=(x[k+(*xrows)*col]-centers[i+(*ncenters)*col])*(x[k+(*xrows)*col]-centers[i+(*ncenters)*co… in cshell()
249 …tempu2+=(x[k+(*xrows)*col]-centers[j+(*ncenters)*col])*(x[k+(*xrows)*col]-centers[j+(*ncenters)*co… in cshell()
323 …tempu1+=(x[k+(*xrows)*col]-centers[i+(*ncenters)*col])*(x[k+(*xrows)*col]-centers[i+(*ncenters)*co… in cshell_assign()
[all …]
|
| /dports/science/py-dlib/dlib-19.22/dlib/test/ |
| H A D | kmeans.cpp | 48 std::vector<sample_type> centers; in run_test() local
51 find_clusters_using_kmeans(samples, centers); in run_test()
53 DLIB_TEST(centers.size() == seed_centers.size()); in run_test()
55 std::vector<int> hits(centers.size(),0); in run_test()
60 for (unsigned long j = 0; j < centers.size(); ++j) in run_test()
62 if (length(samples[i] - centers[j]) < best_dist) in run_test()
77 std::vector<sample_type> centers; in run_test() local
80 find_clusters_using_angular_kmeans(samples, centers); in run_test()
82 DLIB_TEST(centers.size() == seed_centers.size()); in run_test()
84 std::vector<int> hits(centers.size(),0); in run_test()
[all …]
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/test/ |
| H A D | kmeans.cpp | 48 std::vector<sample_type> centers; in run_test() local
51 find_clusters_using_kmeans(samples, centers); in run_test()
53 DLIB_TEST(centers.size() == seed_centers.size()); in run_test()
55 std::vector<int> hits(centers.size(),0); in run_test()
60 for (unsigned long j = 0; j < centers.size(); ++j) in run_test()
62 if (length(samples[i] - centers[j]) < best_dist) in run_test()
77 std::vector<sample_type> centers; in run_test() local
80 find_clusters_using_angular_kmeans(samples, centers); in run_test()
82 DLIB_TEST(centers.size() == seed_centers.size()); in run_test()
84 std::vector<int> hits(centers.size(),0); in run_test()
[all …]
|
| /dports/databases/postgis30/postgis-3.0.4/liblwgeom/ |
| H A D | lwkmeans.c | 70 centers[i]->x = 0.0; in update_means()
71 centers[i]->y = 0.0; in update_means()
78 centers[cluster]->x += objs[i]->x; in update_means()
79 centers[cluster]->y += objs[i]->y; in update_means()
87 centers[i]->x /= weights[i]; in update_means()
88 centers[i]->y /= weights[i]; in update_means()
184 centers[0] = &(centers_raw[0]); in kmeans_init()
186 centers[1] = &(centers_raw[1]); in kmeans_init()
237 centers[i] = &(centers_raw[i]); in kmeans_init()
259 POINT2D** centers; in lwgeom_cluster_2d_kmeans() local
[all …]
|
| /dports/databases/postgis25/postgis-2.5.5/liblwgeom/ |
| H A D | lwkmeans.c | 73 centers[i]->x = 0.0; in update_means()
74 centers[i]->y = 0.0; in update_means()
81 centers[cluster]->x += objs[i]->x; in update_means()
82 centers[cluster]->y += objs[i]->y; in update_means()
90 centers[i]->x /= weights[i]; in update_means()
91 centers[i]->y /= weights[i]; in update_means()
182 centers[0] = &(centers_raw[0]); in kmeans_init()
184 centers[1] = &(centers_raw[1]); in kmeans_init()
233 centers[i] = &(centers_raw[i]); in kmeans_init()
255 POINT2D** centers; in lwgeom_cluster_2d_kmeans() local
[all …]
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/ |
| H A D | canonical_views_clustering.cc | 62 vector<int>* centers,
86 vector<int>* centers, in ComputeCanonicalViewsClustering() argument
99 vector<int>* centers, in ComputeClustering() argument
102 CHECK_NOTNULL(centers)->clear(); in ComputeClustering()
134 centers->push_back(best_view); in ComputeClustering()
139 ComputeClusterMembership(*centers, membership); in ComputeClustering()
160 const vector<int>& centers) const { in ComputeClusteringQualityDifference()
184 for (int i = 0; i < centers.size(); ++i) { in ComputeClusteringQualityDifference()
212 const vector<int>& centers, in ComputeClusterMembership() argument
218 for (int i = 0; i < centers.size(); ++i) { in ComputeClusterMembership()
[all …]
|