Home
last modified time | relevance | path

Searched refs:subsetSize (Results 1 – 5 of 5) sorted by relevance

/external/skia/bench/
Dnanobench.cpp888 const uint32_t subsetSize = sampleSize * minOutputSize; in rawNext() local
892 subset = SkIRect::MakeXYWH(0, 0, subsetSize, subsetSize); in rawNext()
896 subset = SkIRect::MakeXYWH(width - subsetSize, 0, subsetSize, in rawNext()
897 subsetSize); in rawNext()
901 subset = SkIRect::MakeXYWH((width - subsetSize) / 2, in rawNext()
902 (height - subsetSize) / 2, subsetSize, subsetSize); in rawNext()
906 subset = SkIRect::MakeXYWH(0, height - subsetSize, subsetSize, in rawNext()
907 subsetSize); in rawNext()
911 subset = SkIRect::MakeXYWH(width - subsetSize, in rawNext()
912 height - subsetSize, subsetSize, subsetSize); in rawNext()
/external/opencv3/modules/cudaobjdetect/src/cuda/
Dlbp.cu200 …, nodes(_nodes), leaves(_leaves), subsets(_subsets), features(_features), subsetSize(_subsetSize){} in Cascade()
218 …int idx = (subsets[ current_node * subsetSize + c] & ( 1 << shift)) ? current_leave : current_lea… in operator ()()
240 const int subsetSize; member
292 … const int subsetSize, PtrStepSz<int4> objects, unsigned int* classified, PtrStepSzi integral) in classifyPyramid() argument
297 …tages, (ClNode*)mnodes.ptr(), mleaves.ptr(), msubsets.ptr(), (uchar4*)mfeatures.ptr(), subsetSize); in classifyPyramid()
/external/opencv3/modules/cudaobjdetect/src/
Dcascadeclassifier.cpp391 const int subsetSize,
499 int subsetSize; member in __anon05f261dc0311::LbpCascade_Impl
587 …leaves_mat, subsets_mat, features_mat, subsetSize, candidates, dclassified.ptr<unsigned int>(), in… in detectMultiScale()
674 subsetSize = (ncategories + 31) / 32; in load()
675 nodeStep = 3 + ( ncategories > 0 ? subsetSize : 1 ); in load()
724 if( subsetSize > 0 ) in load()
725 subsets.reserve(subsets.size() + nodeCount * subsetSize); in load()
736 if( subsetSize > 0 ) in load()
737 for( int j = 0; j < subsetSize; j++, ++iIt ) in load()
/external/opencv3/modules/objdetect/src/
Dcascadedetect.hpp549 size_t subsetSize = (cascade.data.ncategories + 31)/32; in predictCategorical() local
570 const int* subset = &cascadeSubsets[(root + idx)*subsetSize]; in predictCategorical()
628 size_t subsetSize = (cascade.data.ncategories + 31)/32; in predictCategoricalStump() local
644 const int* subset = &cascadeSubsets[wi*subsetSize]; in predictCategoricalStump()
655 cascadeSubsets += ntrees*subsetSize; in predictCategoricalStump()
Dcascadedetect.cpp1187 int subsetSize = (data.ncategories + 31)/32; in ocl_detectMultiScaleNoGrouping() local
1197 subsetSize, in ocl_detectMultiScaleNoGrouping()
1600 int subsetSize = (ncategories + 31)/32, in read() local
1601 nodeStep = 3 + ( ncategories>0 ? subsetSize : 1 ); in read()
1648 if( subsetSize > 0 ) in read()
1649 subsets.reserve(subsets.size() + tree.nodeCount*subsetSize); in read()
1659 if( subsetSize > 0 ) in read()
1661 for( int j = 0; j < subsetSize; j++, ++internalNodesIter ) in read()