Home
last modified time | relevance | path

Searched refs:num_candidates (Results 1 – 7 of 7) sorted by relevance

/external/tensorflow/tensorflow/examples/android/jni/object_tracking/
Dkeypoint_detector.cc36 const int num_candidates, in ScoreKeypoints() argument
48 for (int i = 0; i < num_candidates; ++i) { in ScoreKeypoints()
61 for (int i = 0; i < num_candidates; ++i) { in ScoreKeypoints()
77 void KeypointDetector::SortKeypoints(const int num_candidates, in SortKeypoints() argument
79 qsort(candidate_keypoints, num_candidates, sizeof(Keypoint), KeypointCompare); in SortKeypoints()
84 for (int i = 0; i < num_candidates; ++i) { in SortKeypoints()
90 i - 1, last_score, i, curr_score, num_candidates); in SortKeypoints()
101 const int num_candidates, in SelectKeypointsInBox() argument
130 for (int i = 0; i < num_candidates; ++i) { in SelectKeypointsInBox()
156 const int num_candidates, in SelectKeypoints() argument
[all …]
Dkeypoint_detector.h78 const int num_candidates,
81 void SortKeypoints(const int num_candidates,
90 const int num_candidates,
102 const int num_candidates,
/external/tensorflow/tensorflow/contrib/losses/python/metric_learning/
Dmetric_loss_ops.py679 num_candidates = array_ops.shape(candidate_ids)[0]
685 pairwise_distances_chosen, [1, num_candidates])
695 keepdims=True), [num_candidates, -1]),
698 nmi_scores = array_ops.zeros([num_candidates])
703 return iteration < num_candidates
711 pad_after = array_ops.zeros([num_candidates - 1 - iteration])
795 return iteration < num_candidates
804 pad_after = array_ops.zeros([num_candidates - 1 - iteration])
816 num_candidates = array_ops.size(cluster_member_ids)
817 scores_margin = array_ops.zeros([num_candidates])
/external/libtextclassifier/actions/
Dngram-model.cc170 const uint64 num_candidates = GetNumSkipGrams( in Eval() local
199 const int num_misses = num_candidates - num_matches; in Eval()
202 num_candidates; in Eval()
/external/icu/icu4c/source/common/
Ddictbe.cpp328 …int32_t num_candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, ra… in divideUpDictionaryRange() local
330 if (num_candidates > 0) { in divideUpDictionaryRange()
558 …int32_t num_candidates = words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, ran… in divideUpDictionaryRange() local
560 if (num_candidates > 0) { in divideUpDictionaryRange()
751 …int32_t num_candidates = words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary,… in divideUpDictionaryRange() local
753 if (num_candidates > 0) { in divideUpDictionaryRange()
956 …int32_t num_candidates = words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, r… in divideUpDictionaryRange() local
958 if (num_candidates > 0) { in divideUpDictionaryRange()
/external/libvpx/libvpx/vp9/encoder/
Dvp9_mcomp.c1023 const int num_candidates[MAX_PATTERN_SCALES], in vp9_pattern_search()
1058 for (i = 0; i < num_candidates[t]; i++) { in vp9_pattern_search()
1067 for (i = 0; i < num_candidates[t]; i++) { in vp9_pattern_search()
1100 for (i = 0; i < num_candidates[s]; i++) { in vp9_pattern_search()
1109 for (i = 0; i < num_candidates[s]; i++) { in vp9_pattern_search()
1132 next_chkpts_indices[0] = (k == 0) ? num_candidates[s] - 1 : k - 1; in vp9_pattern_search()
1134 next_chkpts_indices[2] = (k == num_candidates[s] - 1) ? 0 : k + 1; in vp9_pattern_search()
1193 const int num_candidates[MAX_PATTERN_SCALES], in vp9_pattern_search_sad()
1232 for (i = 0; i < num_candidates[t]; i++) { in vp9_pattern_search_sad()
1241 for (i = 0; i < num_candidates[t]; i++) { in vp9_pattern_search_sad()
[all …]
/external/libaom/libaom/av1/encoder/
Dmcomp.c1120 const int num_candidates[MAX_PATTERN_SCALES], in pattern_search()
1129 const int last_is_4 = num_candidates[0] == 4; in pattern_search()
1161 for (i = 0; i < num_candidates[t]; i++) { in pattern_search()
1170 for (i = 0; i < num_candidates[t]; i++) { in pattern_search()
1204 for (i = 0; i < num_candidates[s]; i++) { in pattern_search()
1213 for (i = 0; i < num_candidates[s]; i++) { in pattern_search()
1236 next_chkpts_indices[0] = (k == 0) ? num_candidates[s] - 1 : k - 1; in pattern_search()
1238 next_chkpts_indices[2] = (k == num_candidates[s] - 1) ? 0 : k + 1; in pattern_search()
1278 for (i = 0; i < num_candidates[s]; i++) { in pattern_search()
1287 for (i = 0; i < num_candidates[s]; i++) { in pattern_search()
[all …]