/external/opencv3/modules/flann/include/opencv2/flann/ |
linear_index.h | 59 dataset_(inputData), index_params_(params), distance_(d) 110 DistanceType dist = distance_(data, vec, dataset_.cols); 126 Distance distance_; member in class:cvflann::LinearIndex
|
autotuned_index.h | 77 dataset_(inputData), distance_(d) 110 bestIndex_ = create_index_by_type(dataset_, bestParams_, distance_); 141 bestIndex_ = create_index_by_type<Distance>(dataset_, params, distance_); 231 KMeansIndex<Distance> kmeans(sampledDataset_, cost.params, distance_); 239 float searchTime = test_index_precision(kmeans, sampledDataset_, testDataset_, gt_matches_, target_precision_, checks, distance_, nn); 256 KDTreeIndex<Distance> kdtree(sampledDataset_, cost.params, distance_); 264 float searchTime = test_index_precision(kdtree, sampledDataset_, testDataset_, gt_matches_, target_precision_, checks, distance_, nn); 437 compute_ground_truth<Distance>(sampledDataset_, testDataset_, gt_matches_, 0, distance_); 508 compute_ground_truth<Distance>(dataset_, testDataset, gt_matches, 1, distance_); 525 searchTime = test_index_precision(*kmeans, dataset_, testDataset, gt_matches, target_precision_, checks, distance_, nn, 1) 581 Distance distance_; member in class:cvflann::AutotunedIndex [all...] |
kmeans_index.h | 126 DistanceType sq = distance_(dataset_[centers[index]], dataset_[centers[j]], dataset_.cols); 163 DistanceType dist = distance_(dataset_[centers[0]],dataset_[indices[j]],dataset_.cols); 165 DistanceType tmp_dist = distance_(dataset_[centers[i]],dataset_[indices[j]],dataset_.cols); 212 closestDistSq[i] = distance_(dataset_[indices[i]], dataset_[indices[index]], dataset_.cols); 240 DistanceType dist = distance_(dataset_[indices[i]], dataset_[indices[index]], dataset_.cols); 255 DistanceType dist = distance_(dataset_[indices[i]], dataset_[indices[bestNewIndex]], dataset_.cols); 348 : dataset_(inputData), index_params_(params), root_(NULL), indices_(NULL), distance_(d) 681 variance += distance_(vec, ZeroIterator<ElementType>(), veclen_); 687 variance -= distance_(mean, ZeroIterator<ElementType>(), veclen_); 691 tmp = distance_(mean, dataset_[indices[i]], veclen_) 1152 Distance distance_; member in class:cvflann::KMeansIndex [all...] |
lsh_index.h | 91 dataset_(input_data), index_params_(params), distance_(d) 288 hamming_distance = distance_(vec, dataset_[*training_index], dataset_.cols); 327 hamming_distance = distance_(vec, dataset_[*training_index], dataset_.cols); 360 hamming_distance = distance_(vec, dataset_[*training_index], (int)dataset_.cols); 388 Distance distance_; member in class:cvflann::LshIndex
|
kdtree_index.h | 86 dataset_(inputData), index_params_(params), distance_(d) 486 DistanceType dist = distance_(dataset_[index], vec, veclen_); 506 DistanceType new_distsq = mindist + distance_.accum_dist(val, node->divval, node->divfeat); 524 DistanceType dist = distance_(dataset_[index], vec, veclen_); 543 DistanceType new_distsq = mindist + distance_.accum_dist(val, node->divval, node->divfeat); 614 Distance distance_; member in class:cvflann::KDTreeIndex
|
kdtree_single_index.h | 86 dataset_(inputData), index_params_(params), distance_(d) 527 dists[i] = distance_.accum_dist(vec[i], root_bbox_[i].low, (int)i); 531 dists[i] = distance_.accum_dist(vec[i], root_bbox_[i].high, (int)i); 550 DistanceType dist = distance_(vec, data_[index], dim_, worst_dist); 570 cut_dist = distance_.accum_dist(val, node->divhigh, idx); 575 cut_dist = distance_.accum_dist( val, node->divlow, idx); 629 Distance distance_; member in class:cvflann::KDTreeSingleIndex
|
/external/opencv3/3rdparty/libwebp/enc/ |
histogram.c | 29 memset(p->distance_, 0, sizeof(p->distance_)); 99 ++histo->distance_[code]; 208 + PopulationCost(p->distance_, NUM_DISTANCE_CODES) 210 + ExtraCost(p->distance_, NUM_DISTANCE_CODES); 218 + BitsEntropy(p->distance_, NUM_DISTANCE_CODES) 220 + ExtraCost(p->distance_, NUM_DISTANCE_CODES); 234 out->distance_[i] += in->distance_[i]; 280 out->distance_[i] = a->distance_[i] + b->distance_[i] [all...] |
histogram.h | 40 int distance_[NUM_DISTANCE_CODES]; member in struct:__anon21893
|
backward_references.c | 381 double distance_[NUM_DISTANCE_CODES]; member in struct:__anon21888 440 NUM_DISTANCE_CODES, histo.distance_, m->distance_); 471 return m->distance_[code] + extra_bits_count;
|
vp8l.c | 233 ok = ok && VP8LCreateHuffmanTree(histo->distance_, 15, codes + 4); [all...] |
/external/chromium-trace/catapult/telemetry/telemetry/internal/actions/ |
swipe.js | 14 this.distance_ = opt_options.distance; 21 this.distance_ = 0; 59 this.options_.distance_,
|
/external/webp/src/enc/ |
histogram.h | 39 uint32_t distance_[NUM_DISTANCE_CODES]; member in struct:__anon27453
|
histogram.c | 155 ++histo->distance_[code]; 257 + PopulationCost(p->distance_, NUM_DISTANCE_CODES, NULL) 259 + VP8LExtraCost(p->distance_, NUM_DISTANCE_CODES); 287 *cost += GetCombinedEntropy(a->distance_, b->distance_, NUM_DISTANCE_CODES); 289 VP8LExtraCostCombined(a->distance_, b->distance_, NUM_DISTANCE_CODES); 370 PopulationCost(h->distance_, NUM_DISTANCE_CODES, NULL) + 371 VP8LExtraCost(h->distance_, NUM_DISTANCE_CODES); [all...] |
backward_references.c | 479 double distance_[NUM_DISTANCE_CODES]; member in struct:__anon27444 527 NUM_DISTANCE_CODES, histo->distance_, m->distance_); 558 return m->distance_[code] + extra_bits; 877 ++histo->distance_[code]; [all...] |
vp8l.c | 483 VP8LCreateHuffmanTree(histo->distance_, 15, buf_rle, huff_tree, codes + 4); [all...] |
/external/webp/src/dsp/ |
lossless_enc_mips32.c | 344 ADD_VECTOR(a->distance_, b->distance_, out->distance_, 352 ADD_VECTOR_EQ(a->distance_, out->distance_, NUM_DISTANCE_CODES, 0);
|
lossless_enc_sse2.c | 249 out->distance_[i] = a->distance_[i] + b->distance_[i];
|
lossless_enc.c | [all...] |
/external/opencv3/modules/stitching/src/ |
matchers.cpp | 139 GpuMat train_idx_, distance_, all_dist_; member in class:__anon22635::GpuMatcher 263 distance_.release();
|