Searched refs:stageIdx (Results 1 – 5 of 5) sorted by relevance
88 int scaleIdx, tileIdx, stageIdx;169 for( stageIdx = 0; stageIdx < SPLIT_STAGE; stageIdx++ )171 int ntrees = stages[stageIdx].ntrees;221 if( s < stages[stageIdx].threshold )225 if( stageIdx == SPLIT_STAGE && (ystep == 1 || ((ix | iy) & 1) == 0) )233 for( stageIdx = SPLIT_STAGE; stageIdx < N_STAGES; stageIdx++ )246 … __global const Stump* stump = (__global const Stump*)nodes + stages[stageIdx].first;248 __global const Node* node = nodes + stages[stageIdx].first*NODE_COUNT;249 __global const float* leaves = leaves0 + stages[stageIdx].first*(NODE_COUNT+1);252 int ntrees = stages[stageIdx].ntrees;[all …]
35 for(int stageIdx = 0; stageIdx < hf.stagesSize; stageIdx++) { in initInnerLoop() local36 const HaarStage stage = cascadeStages[stageIdx]; in initInnerLoop()
114 for( int stageIdx = 0; stageIdx < nstages; stageIdx++ ) {115 const HaarStage stage = stages[stageIdx];
596 for( int stageIdx = 0; stageIdx < nstages; stageIdx++ ) in predictOrderedStump() local598 const CascadeClassifierImpl::Data::Stage& stage = cascadeStages[stageIdx]; in predictOrderedStump()612 return -stageIdx; in predictOrderedStump()
1683 for( size_t stageIdx = 0; stageIdx < nstages; stageIdx++ ) in read() local1685 const Stage& stage = stages[stageIdx]; in read()