| /external/ceres-solver/internal/ceres/ |
| D | canonical_views_clustering.cc | 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()
[all …]
|
| D | canonical_views_clustering.h | 105 vector<int>* centers,
|
| D | visibility_based_preconditioner.cc | 198 vector<int> centers; in ClusterCameras() local
206 ¢ers, in ClusterCameras()
208 num_clusters_ = centers.size(); in ClusterCameras()
|
| /external/webp/src/enc/ |
| D | analysis.c | 77 const int centers[NUM_MB_SEGMENTS], in SetSegmentAlphas()
80 int min = centers[0], max = centers[0]; in SetSegmentAlphas()
85 if (min > centers[n]) min = centers[n]; in SetSegmentAlphas()
86 if (max < centers[n]) max = centers[n]; in SetSegmentAlphas()
92 const int alpha = 255 * (centers[n] - mid) / (max - min); in SetSegmentAlphas()
93 const int beta = 255 * (centers[n] - min) / (max - min); in SetSegmentAlphas()
149 int centers[NUM_MB_SEGMENTS]; in AssignSegments() local
170 centers[k] = min_a + (n * range_a) / (2 * nb); in AssignSegments()
185 while (n + 1 < nb && abs(a - centers[n + 1]) < abs(a - centers[n])) { in AssignSegments()
202 displaced += abs(centers[n] - new_center); in AssignSegments()
[all …]
|
| /external/opencv/ml/src/ |
| D | mlem.cpp | 576 CvMat* centers = 0; in kmeans() local
595 CV_CALL( centers = cvCreateMat( nclusters, dims, CV_64FC1 )); in kmeans()
602 CV_CALL( cvConvert( centers0, centers )); in kmeans()
625 const double* c = (double*)(centers->data.ptr + k*centers->step); in kmeans()
658 CV_SWAP( centers, old_centers, temp ); in kmeans()
659 cvZero( centers ); in kmeans()
667 double* c = (double*)(centers->data.ptr + k*centers->step); in kmeans()
693 double* c = (double*)(centers->data.ptr + k*centers->step); in kmeans()
754 cvReleaseMat( ¢ers ); in kmeans()
|
| D | ml_inner_functions.cpp | 267 CvMat* centers = _centers; in icvGenerateRandomClusterCenters() local
286 CV_CALL(centers = cvCreateMat (num_of_clusters, dim, CV_32FC1)); in icvGenerateRandomClusterCenters()
295 CV_CALL(centers = cvCreateMat (num_of_clusters, dim, CV_64FC1)); in icvGenerateRandomClusterCenters()
308 CV_CALL(cvGetCol (centers, ¢ers_comp, i)); in icvGenerateRandomClusterCenters()
314 if( (cvGetErrStatus () < 0) || (centers != _centers) ) in icvGenerateRandomClusterCenters()
315 cvReleaseMat (¢ers); in icvGenerateRandomClusterCenters()
317 return _centers ? _centers : centers; in icvGenerateRandomClusterCenters()
1414 const CvMat* centers, CvMat* dst_centers, in cvWritebackLabels() argument
1469 if( dst_centers && (!centers || centers->data.ptr != dst_centers->data.ptr) ) in cvWritebackLabels()
1473 if( !centers ) in cvWritebackLabels()
[all …]
|
| D | _ml.h | 259 CvMat* centers CV_DEFAULT(0));
321 const CvMat* centers, CvMat* dst_centers,
|
| /external/opencv/cxcore/src/ |
| D | cxutils.cpp | 48 CvMat* centers = 0; in cvKMeans2() local
94 CV_CALL( centers = cvCreateMat( cluster_count, dims, CV_64FC1 )); in cvKMeans2()
108 cvZero( centers ); in cvKMeans2()
115 double* c = (double*)(centers->data.ptr + k*centers->step); in cvKMeans2()
140 double* c = (double*)(centers->data.ptr + k*centers->step); in cvKMeans2()
178 double* c = (double*)(centers->data.ptr + k*centers->step); in cvKMeans2()
211 CV_SWAP( centers, old_centers, temp ); in cvKMeans2()
236 cvReleaseMat( ¢ers ); in cvKMeans2()
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/callbacks/ |
| D | DebugDraw.java | 180 …public abstract void drawParticles(Vec2[] centers, float radius, ParticleColor[] colors, int count… in drawParticles() argument
187 public abstract void drawParticlesWireframe(Vec2[] centers, float radius, ParticleColor[] colors, in drawParticlesWireframe() argument
|
| /external/opencv/cv/src/ |
| D | cvhough.cpp | 872 CvSeq *nz, *centers; in icvHoughCirclesGradient() local
892 CV_CALL( centers = cvCreateSeq( CV_32SC1, sizeof(CvSeq), sizeof(int), storage )); in icvHoughCirclesGradient()
970 cvSeqPush(centers, &base); in icvHoughCirclesGradient()
974 center_count = centers->total; in icvHoughCirclesGradient()
979 cvCvtSeqToArray( centers, sort_buf ); in icvHoughCirclesGradient()
982 cvClearSeq( centers ); in icvHoughCirclesGradient()
983 cvSeqPushMulti( centers, sort_buf, center_count ); in icvHoughCirclesGradient()
992 for( i = 0; i < centers->total; i++ ) in icvHoughCirclesGradient()
994 int ofs = *(int*)cvGetSeqElem( centers, i ); in icvHoughCirclesGradient()
|
| D | cvcalibinit.cpp | 1022 CvPoint2D32f *centers = 0; in icvCleanFoundConnectedQuads() local
1039 CV_CALL( centers = (CvPoint2D32f *)cvAlloc( sizeof(centers[0])*quad_count )); in icvCleanFoundConnectedQuads()
1057 centers[i] = ci; in icvCleanFoundConnectedQuads()
1081 CvPoint2D32f temp = centers[skip]; // temporarily make index 'skip' the same as in icvCleanFoundConnectedQuads()
1082 … centers[skip] = center; // pattern center (so it is not counted for convex hull) in icvCleanFoundConnectedQuads()
1083 CvMat pointMat = cvMat(1, quad_count, CV_32FC2, centers); in icvCleanFoundConnectedQuads()
1085 centers[skip] = temp; in icvCleanFoundConnectedQuads()
1124 centers[min_box_area_index] = centers[quad_count]; in icvCleanFoundConnectedQuads()
1130 cvFree( ¢ers ); in icvCleanFoundConnectedQuads()
|
| /external/libjpeg-turbo/simd/ |
| D | jdsample-sse2-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.
|
| D | jdsample-sse2.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.
|
| D | jdsample-mmx.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/mesa3d/src/gallium/docs/source/cso/ |
| D | rasterizer.rst | 237 Whether the rasterizer should use (0.5, 0.5) pixel centers. When not set,
238 the rasterizer will use (0, 0) for pixel centers.
|
| /external/ceres-solver/docs/source/ |
| D | features.rst | 9 Google's data centers, desktops and on cellphones. It is clean,
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| D | btSoftBody.cpp | 1206 btAlignedObjectArray<btVector3> centers; in generateClusters() local
1215 centers.resize(k,cog); in generateClusters()
1236 c = centers[i]+(c-centers[i])*w; in generateClusters()
1237 changed |= ((c-centers[i]).length2()>SIMD_EPSILON); in generateClusters()
1238 centers[i] = c; in generateClusters()
1246 btScalar kdist=ClusterMetric(centers[0],nx); in generateClusters()
1249 const btScalar d=ClusterMetric(centers[j],nx); in generateClusters()
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/docs/ |
| D | raster.txt | 68 Note that, for the rasterizer, pixel centers are located at
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/ |
| D | ChangeLog.21 | 6381 alignment when stem widths are less than 1.5 pixels wide centers the
|