/external/ceres-solver/internal/ceres/ |
H A D | 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); 86 ComputeCanonicalViewsClustering( const CanonicalViewsClusteringOptions& options, const Graph<int>& graph, vector<int>* centers, IntMap* membership) argument 99 ComputeClustering( const CanonicalViewsClusteringOptions& options, const Graph<int>& graph, vector<int>* centers, IntMap* membership) argument 214 ComputeClusterMembership( const vector<int>& centers, IntMap* membership) const argument [all...] |
H A D | 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,
|
H A D | visibility_based_preconditioner.cc | 198 vector<int> centers; local 206 ¢ers, 208 num_clusters_ = centers.size();
|
/external/chromium_org/third_party/libwebp/enc/ |
H A D | 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_SEGMENT local 76 SetSegmentAlphas(VP8Encoder* const enc, const int centers[NUM_MB_SEGMENTS], int mid) argument [all...] |
/external/webp/src/enc/ |
H A D | 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_SEGMENT local 76 SetSegmentAlphas(VP8Encoder* const enc, const int centers[NUM_MB_SEGMENTS], int mid) argument [all...] |
/external/opencv/ml/src/ |
H A D | 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; 1414 const CvMat* centers, CvMat* dst_centers, 1431 CV_ERROR( CV_StsBadArg, "Array of cluster centers is not a valid matrix" ); 1469 if( dst_centers && (!centers || center 1413 cvWritebackLabels( const CvMat* labels, CvMat* dst_labels, const CvMat* centers, CvMat* dst_centers, const CvMat* probs, CvMat* dst_probs, const CvMat* sample_idx, int samples_all, const CvMat* comp_idx, int dims_all ) argument [all...] |
H A D | 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 [all...] |
H A D | _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,
|
/external/opencv/cxcore/src/ |
H A D | 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 [all...] |
/external/opencv/cv/src/ |
H A D | 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 );
|
H A D | cvcalibinit.cpp | 1022 CvPoint2D32f *centers = 0; local 1038 // create an array of quadrangle centers 1039 CV_CALL( centers = (CvPoint2D32f *)cvAlloc( sizeof(centers[0])*quad_count )); 1057 centers[i] = ci; 1081 CvPoint2D32f temp = centers[skip]; // temporarily make index 'skip' the same as 1082 centers[skip] = center; // pattern center (so it is not counted for convex hull) 1083 CvMat pointMat = cvMat(1, quad_count, CV_32FC2, centers); 1085 centers[skip] = temp; 1124 centers[min_box_area_inde [all...] |
/external/chromium_org/third_party/libjpeg_turbo/simd/ |
H A D | 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.
|
H A D | 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.
|
H A D | 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.
|