| /external/ceres-solver/internal/ceres/ |
| canonical_views_clustering.cc | 56 // graph. centers will contain the vertices that are the identified
57 // as the canonical views/cluster centers, and membership is a map
65 vector<int>* centers,
71 const vector<int>& centers) const;
73 void ComputeClusterMembership(const vector<int>& centers,
89 vector<int>* centers,
93 cv.ComputeClustering(options, graph, centers, membership);
102 vector<int>* centers,
105 CHECK_NOTNULL(centers)->clear();
121 ComputeClusteringQualityDifference(*view, *centers);
[all...] |
| canonical_views_clustering.h | 94 // centers will contain the vertices that are the identified
95 // as the canonical views/cluster centers, and membership is a map
105 vector<int>* centers,
|
| visibility_based_preconditioner.cc | 198 vector<int> centers; local
206 ¢ers,
208 num_clusters_ = centers.size();
|
| /external/chromium_org/third_party/libwebp/enc/ |
| analysis.c | 77 const int centers[NUM_MB_SEGMENTS],
80 int min = centers[0], max = centers[0];
85 if (min > centers[n]) min = centers[n];
86 if (max < centers[n]) max = centers[n];
92 const int alpha = 255 * (centers[n] - mid) / (max - min);
93 const int beta = 255 * (centers[n] - min) / (max - min);
145 int centers[NUM_MB_SEGMENTS] local
[all...] |
| /external/webp/src/enc/ |
| analysis.c | 77 const int centers[NUM_MB_SEGMENTS],
80 int min = centers[0], max = centers[0];
85 if (min > centers[n]) min = centers[n];
86 if (max < centers[n]) max = centers[n];
92 const int alpha = 255 * (centers[n] - mid) / (max - min);
93 const int beta = 255 * (centers[n] - min) / (max - min);
145 int centers[NUM_MB_SEGMENTS] local
[all...] |
| /development/ndk/platforms/android-18/samples/gles3jni/jni/ |
| gles3jni.cpp | 169 float centers[2][MAX_INSTANCES_PER_SIDE]; local
173 centers[d][i] = scene2clip[d] * (CELL_SIZE*(i + 0.5f) + offset);
179 // outer product of centers[0] and centers[1]
183 offsets[2*idx + major] = centers[0][i];
184 offsets[2*idx + minor] = centers[1][j];
|
| /external/opencv/ml/src/ |
| ml_inner_functions.cpp | 267 CvMat* centers = _centers; local
286 CV_CALL(centers = cvCreateMat (num_of_clusters, dim, CV_32FC1));
295 CV_CALL(centers = cvCreateMat (num_of_clusters, dim, CV_64FC1));
308 CV_CALL(cvGetCol (centers, ¢ers_comp, i));
314 if( (cvGetErrStatus () < 0) || (centers != _centers) )
315 cvReleaseMat (¢ers);
317 return _centers ? _centers : centers;
[all...] |
| mlem.cpp | 576 CvMat* centers = 0; local
595 CV_CALL( centers = cvCreateMat( nclusters, dims, CV_64FC1 ));
602 CV_CALL( cvConvert( centers0, centers ));
625 const double* c = (double*)(centers->data.ptr + k*centers->step);
658 CV_SWAP( centers, old_centers, temp );
659 cvZero( centers );
662 // update centers
667 double* c = (double*)(centers->data.ptr + k*centers->step)
[all...] |
| _ml.h | 250 /* Generates a set of classes centers in quantity <num_of_clusters> that are generated as
252 <data> should have horizontal orientation. If <centers> != NULL, the function doesn't
253 allocate any memory and stores generated centers in <centers>, returns <centers>.
254 If <centers> == NULL, the function allocates memory and creates the matrice. Centers
259 CvMat* centers CV_DEFAULT(0));
318 (labels and/or centers and/or probs) back to the output arrays */
321 const CvMat* centers, CvMat* dst_centers
[all...] |
| /external/opencv/cxcore/src/ |
| cxutils.cpp | 48 CvMat* centers = 0; local
94 CV_CALL( centers = cvCreateMat( cluster_count, dims, CV_64FC1 ));
98 // init centers
107 // computer centers
108 cvZero( centers );
115 double* c = (double*)(centers->data.ptr + k*centers->step);
140 double* c = (double*)(centers->data.ptr + k*centers->step);
178 double* c = (double*)(centers->data.ptr + k*centers->step)
[all...] |
| /external/opencv/cv/src/ |
| cvhough.cpp | 872 CvSeq *nz, *centers; local
892 CV_CALL( centers = cvCreateSeq( CV_32SC1, sizeof(CvSeq), sizeof(int), storage ));
970 cvSeqPush(centers, &base);
974 center_count = centers->total;
979 cvCvtSeqToArray( centers, sort_buf );
982 cvClearSeq( centers );
983 cvSeqPushMulti( centers, sort_buf, center_count );
992 for( i = 0; i < centers->total; i++ )
994 int ofs = *(int*)cvGetSeqElem( centers, i );
[all...] |
| cvcalibinit.cpp | 1022 CvPoint2D32f *centers = 0; local
[all...] |
| /cts/apps/CameraITS/pymodules/its/ |
| image.py | 632 # the average value of a small patch at each of the 4 patch centers.
634 centers = []
640 centers.append((xc,yc))
660 origin_center = centers[origin_index]
661 prev_center = centers[prev_index]
662 next_center = centers[next_index]
|
| /external/chromium_org/third_party/libjpeg_turbo/simd/ |
| jdsammmx.asm | 43 ; The upsampling algorithm is linear interpolation between pixel centers,
45 ; speed and visual quality. The centers of the output pixels are 1/4 and 3/4
46 ; of the way between input pixel centers.
|
| jdsamss2-64.asm | 44 ; The upsampling algorithm is linear interpolation between pixel centers,
46 ; speed and visual quality. The centers of the output pixels are 1/4 and 3/4
47 ; of the way between input pixel centers.
|
| jdsamss2.asm | 43 ; The upsampling algorithm is linear interpolation between pixel centers,
45 ; speed and visual quality. The centers of the output pixels are 1/4 and 3/4
46 ; of the way between input pixel centers.
|
| /external/chromium_org/chrome/browser/resources/local_ntp/ |
| local_ntp.js | 46 // Vertically centers the most visited section for a non-Google provided page.
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| d3d.h | [all...] |
