Searched refs:stumps (Results 1 – 8 of 8) sorted by relevance
54 static HaarStump stumps[numStumps];120 const HaarStump stump = stumps[i + stumpOfs];161 stumps[currStump] = h;
52 HaarStump* stumps; member
222 std::vector<Stump> stumps; member in cv::CascadeClassifierImpl::Data588 CV_Assert(!cascade.data.stumps.empty()); in predictOrderedStump()590 const CascadeClassifierImpl::Data::Stump* cascadeStumps = &cascade.data.stumps[0]; in predictOrderedStump()625 CV_Assert(!cascade.data.stumps.empty()); in predictCategoricalStump()630 const CascadeClassifierImpl::Data::Stump* cascadeStumps = &cascade.data.stumps[0]; in predictCategoricalStump()
1115 if (!data.stumps.empty()) in ocl_detectMultiScaleNoGrouping()1116 copyVectorToUMat(data.stumps, unodes); in ocl_detectMultiScaleNoGrouping()1456 hf.nStumps = (int) data.stumps.size(); in setHaarVars()1458 int nstumps = data.stumps.size(); in setHaarVars()1462 st.featureIdx = data.stumps[j].featureIdx; in setHaarVars()1463 st.threshold = data.stumps[j].threshold; in setHaarVars()1464 st.left = data.stumps[j].left; in setHaarVars()1465 st.right = data.stumps[j].right; in setHaarVars()1468 hf.stumps = &stumpArr[0]; in setHaarVars()1611 stumps.clear(); in read()[all …]
26 const HaarStump* cascadeStumps = &hf.stumps[0]; in initInnerLoop()
373 __global const Stump* stumps,406 __global const Stump* stump = stumps;461 __global const Stump* stumps,520 __global const Stump* stump = stumps;575 __global const Stump* stump = stumps + stages[stageIdx].first;
304 Maximal depth of a weak tree. A decent choice is 1, that is case of stumps.
190 decision trees with only a single split node per tree (called stumps ) are sufficient.