| /external/opencv3/3rdparty/libwebp/enc/ |
| D | histogram.c | 29 memset(p->distance_, 0, sizeof(p->distance_)); in HistogramClear()
99 ++histo->distance_[code]; in VP8LHistogramAddSinglePixOrCopy()
208 + PopulationCost(p->distance_, NUM_DISTANCE_CODES) in VP8LHistogramEstimateBits()
210 + ExtraCost(p->distance_, NUM_DISTANCE_CODES); in VP8LHistogramEstimateBits()
218 + BitsEntropy(p->distance_, NUM_DISTANCE_CODES) in VP8LHistogramEstimateBitsBulk()
220 + ExtraCost(p->distance_, NUM_DISTANCE_CODES); in VP8LHistogramEstimateBitsBulk()
234 out->distance_[i] += in->distance_[i]; in HistogramAdd()
280 out->distance_[i] = a->distance_[i] + b->distance_[i]; in HistogramAddEval()
282 cost += PopulationCost(out->distance_, NUM_DISTANCE_CODES); in HistogramAddEval()
283 cost += ExtraCost(out->distance_, NUM_DISTANCE_CODES); in HistogramAddEval()
[all …]
|
| D | histogram.h | 40 int distance_[NUM_DISTANCE_CODES]; member
|
| D | backward_references.c | 381 double distance_[NUM_DISTANCE_CODES]; member
440 NUM_DISTANCE_CODES, histo.distance_, m->distance_); in CostModelBuild()
471 return m->distance_[code] + extra_bits_count; in GetDistanceCost()
|
| D | vp8l.c | 233 ok = ok && VP8LCreateHuffmanTree(histo->distance_, 15, codes + 4); in GetHuffBitLengthsAndCodes()
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| D | kmeans_index.h | 126 … DistanceType sq = distance_(dataset_[centers[index]], dataset_[centers[j]], dataset_.cols); in chooseCentersRandom()
163 … DistanceType dist = distance_(dataset_[centers[0]],dataset_[indices[j]],dataset_.cols); in chooseCentersGonzales()
165 … DistanceType tmp_dist = distance_(dataset_[centers[i]],dataset_[indices[j]],dataset_.cols); in chooseCentersGonzales()
212 … closestDistSq[i] = distance_(dataset_[indices[i]], dataset_[indices[index]], dataset_.cols); in chooseCentersKMeanspp()
240 … DistanceType dist = distance_(dataset_[indices[i]], dataset_[indices[index]], dataset_.cols); in chooseCentersKMeanspp()
255 …DistanceType dist = distance_(dataset_[indices[i]], dataset_[indices[bestNewIndex]], dataset_.cols… in chooseCentersKMeanspp()
348 : dataset_(inputData), index_params_(params), root_(NULL), indices_(NULL), distance_(d) in dataset_()
681 variance += distance_(vec, ZeroIterator<ElementType>(), veclen_); in computeNodeStatistics()
687 variance -= distance_(mean, ZeroIterator<ElementType>(), veclen_); in computeNodeStatistics()
691 tmp = distance_(mean, dataset_[indices[i]], veclen_); in computeNodeStatistics()
[all …]
|
| D | autotuned_index.h | 77 dataset_(inputData), distance_(d) in dataset_()
110 bestIndex_ = create_index_by_type(dataset_, bestParams_, distance_); in buildIndex()
141 bestIndex_ = create_index_by_type<Distance>(dataset_, params, distance_); in loadIndex()
231 KMeansIndex<Distance> kmeans(sampledDataset_, cost.params, distance_); in evaluate_kmeans()
239 …sion(kmeans, sampledDataset_, testDataset_, gt_matches_, target_precision_, checks, distance_, nn); in evaluate_kmeans()
256 KDTreeIndex<Distance> kdtree(sampledDataset_, cost.params, distance_); in evaluate_kdtree()
264 …sion(kdtree, sampledDataset_, testDataset_, gt_matches_, target_precision_, checks, distance_, nn); in evaluate_kdtree()
437 compute_ground_truth<Distance>(sampledDataset_, testDataset_, gt_matches_, 0, distance_); in estimateBuildParams()
508 compute_ground_truth<Distance>(dataset_, testDataset, gt_matches, 1, distance_); in estimateSearchParams()
525 …precision(*kmeans, dataset_, testDataset, gt_matches, target_precision_, checks, distance_, nn, 1); in estimateSearchParams()
[all …]
|
| D | linear_index.h | 59 dataset_(inputData), index_params_(params), distance_(d) in dataset_()
110 DistanceType dist = distance_(data, vec, dataset_.cols); in findNeighbors()
126 Distance distance_; variable
|
| D | lsh_index.h | 91 dataset_(input_data), index_params_(params), distance_(d) in dataset_()
288 hamming_distance = distance_(vec, dataset_[*training_index], dataset_.cols); in getNeighbors()
327 hamming_distance = distance_(vec, dataset_[*training_index], dataset_.cols); in getNeighbors()
360 … hamming_distance = distance_(vec, dataset_[*training_index], (int)dataset_.cols); in getNeighbors()
388 Distance distance_; variable
|
| D | kdtree_index.h | 86 dataset_(inputData), index_params_(params), distance_(d) in dataset_()
486 DistanceType dist = distance_(dataset_[index], vec, veclen_); in searchLevel()
506 DistanceType new_distsq = mindist + distance_.accum_dist(val, node->divval, node->divfeat); in searchLevel()
524 DistanceType dist = distance_(dataset_[index], vec, veclen_); in searchLevelExact()
543 DistanceType new_distsq = mindist + distance_.accum_dist(val, node->divval, node->divfeat); in searchLevelExact()
614 Distance distance_; variable
|
| D | kdtree_single_index.h | 86 dataset_(inputData), index_params_(params), distance_(d) in dataset_()
527 dists[i] = distance_.accum_dist(vec[i], root_bbox_[i].low, (int)i); in computeInitialDistances()
531 dists[i] = distance_.accum_dist(vec[i], root_bbox_[i].high, (int)i); in computeInitialDistances()
550 DistanceType dist = distance_(vec, data_[index], dim_, worst_dist); in searchLevel()
570 cut_dist = distance_.accum_dist(val, node->divhigh, idx); in searchLevel()
575 cut_dist = distance_.accum_dist( val, node->divlow, idx); in searchLevel()
629 Distance distance_; variable
|
| /external/chromium-trace/catapult/telemetry/telemetry/internal/actions/ |
| D | swipe.js | 14 this.distance_ = opt_options.distance;
21 this.distance_ = 0;
59 this.options_.distance_,
|
| /external/webp/src/dsp/ |
| D | lossless_enc_mips32.c | 344 ADD_VECTOR(a->distance_, b->distance_, out->distance_, in HistogramAdd()
352 ADD_VECTOR_EQ(a->distance_, out->distance_, NUM_DISTANCE_CODES, 0); in HistogramAdd()
|
| D | lossless_enc.c | 1110 out->distance_[i] = a->distance_[i] + b->distance_[i]; in HistogramAdd()
1122 out->distance_[i] += a->distance_[i]; in HistogramAdd()
|
| D | lossless_enc_sse2.c | 249 out->distance_[i] = a->distance_[i] + b->distance_[i]; in HistogramAdd()
|
| /external/webp/src/enc/ |
| D | histogram.c | 155 ++histo->distance_[code]; in VP8LHistogramAddSinglePixOrCopy()
257 + PopulationCost(p->distance_, NUM_DISTANCE_CODES, NULL) in VP8LHistogramEstimateBits()
259 + VP8LExtraCost(p->distance_, NUM_DISTANCE_CODES); in VP8LHistogramEstimateBits()
287 *cost += GetCombinedEntropy(a->distance_, b->distance_, NUM_DISTANCE_CODES); in GetCombinedHistogramEntropy()
289 VP8LExtraCostCombined(a->distance_, b->distance_, NUM_DISTANCE_CODES); in GetCombinedHistogramEntropy()
370 PopulationCost(h->distance_, NUM_DISTANCE_CODES, NULL) + in UpdateHistogramCost()
371 VP8LExtraCost(h->distance_, NUM_DISTANCE_CODES); in UpdateHistogramCost()
|
| D | histogram.h | 39 uint32_t distance_[NUM_DISTANCE_CODES]; member
|
| D | backward_references.c | 479 double distance_[NUM_DISTANCE_CODES]; member
527 NUM_DISTANCE_CODES, histo->distance_, m->distance_); in CostModelBuild()
558 return m->distance_[code] + extra_bits; in GetDistanceCost()
877 ++histo->distance_[code]; in ComputeCacheEntropy()
|
| D | vp8l.c | 483 VP8LCreateHuffmanTree(histo->distance_, 15, buf_rle, huff_tree, codes + 4); in GetHuffBitLengthsAndCodes()
|
| /external/opencv3/modules/stitching/src/ |
| D | matchers.cpp | 139 GpuMat train_idx_, distance_, all_dist_; member in __anon0431e8210111::GpuMatcher
263 distance_.release(); in collectGarbage()
|
| /external/opencv3/doc/py_tutorials/py_ml/py_svm/py_svm_basics/ |
| D | py_svm_basics.markdown | 49 to the decision boundary is given by, \f$distance_{support \, vectors}=\frac{1}{||w||}\f$. Margin is
|