| /external/opencv/ml/src/ |
| mlboost.cpp | 346 int best_subset = -1, subset_i; local
406 best_subset = subset_i;
419 best_subset = subset_i;
424 if( best_subset < 0 )
429 for( i = 0; i <= best_subset; i++ )
501 int i, best_subset = -1, subset_i; local
550 best_subset = subset_i;
556 if( best_subset < 0 )
560 for( i = 0; i <= best_subset; i++ )
[all...] |
| mltree.cpp | 1980 int best_subset = -1, subset_i; local
[all...] |
| /external/opencv3/modules/ml/src/ |
| tree.cpp | 420 int *subset = buf, *best_subset = subset + w->maxSubsetSize; local
444 std::swap(subset, best_subset);
455 w->wsubsets[prevsz + i] = best_subset[i];
836 int prevcode = 0, best_subset = -1, subset_i, subset_n, subtract = 0;
954 best_subset = subset_i;
960 if( best_subset >= 0 )
967 for( i = 0; i <= best_subset; i++ )
978 if( best_subset & (1 << idx) )
1063 int i, si, best_subset = -1, subset_i;
1111 best_subset = subset_i
[all...] |
| /external/opencv3/apps/traincascade/ |
| old_ml_boost.cpp | 387 int best_subset = -1, subset_i; local
447 best_subset = subset_i;
460 best_subset = subset_i;
466 if( best_subset >= 0 )
472 for( i = 0; i <= best_subset; i++ )
575 int i, best_subset = -1, subset_i; local
624 best_subset = subset_i;
631 if( best_subset >= 0 )
637 for( i = 0; i <= best_subset; i++ )
[all...] |
| old_ml_tree.cpp | 2222 int prevcode = 0, best_subset = -1, subset_i, subset_n, subtract = 0; local
2459 int best_subset = -1, subset_i; local
[all...] |
