Lines Matching defs:node
80 CvHidHaarTreeNode* node;
310 hid_classifier->node = haar_node_ptr;
315 CvHidHaarTreeNode* node = hid_classifier->node + l;
317 memset( node, -1, sizeof(*node) );
318 node->threshold = classifier->threshold[l];
319 node->left = classifier->left[l];
320 node->right = classifier->right[l];
325 memset( &(node->feature.rect[2]), 0, sizeof(node->feature.rect[2]) );
533 &cascade->stage_classifier[i].classifier[j].node[l].feature;
672 CvHidHaarTreeNode* node = classifier->node + idx;
673 double t = node->threshold * variance_norm_factor;
675 double sum = calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight;
676 sum += calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight;
678 if( node->feature.rect[2].p0 )
679 sum += calc_sum(node->feature.rect[2],p_offset) * node->feature.rect[2].weight;
681 idx = sum < t ? node->left : node->right;
771 CvHidHaarTreeNode* node = classifier->node;
772 double sum, t = node->threshold*variance_norm_factor, a, b;
774 sum = calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight;
775 sum += calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight;
787 CvHidHaarTreeNode* node = classifier->node;
788 double sum, t = node->threshold*variance_norm_factor, a, b;
790 sum = calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight;
791 sum += calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight;
793 if( node->feature.rect[2].p0 )
794 sum += calc_sum(node->feature.rect[2],p_offset) * node->feature.rect[2].weight;
1776 icvReadHaarClassifier( CvFileStorage* fs, CvFileNode* node )
1793 CV_CALL( stages_fn = cvGetFileNodeByName( fs, node, ICV_HAAR_STAGES_NAME ) );
1795 CV_ERROR( CV_StsError, "Invalid stages node" );
1801 CV_CALL( seq_fn = cvGetFileNodeByName( fs, node, ICV_HAAR_SIZE_NAME ) );
1803 CV_ERROR( CV_StsError, "size node is not a valid sequence." );
1806 CV_ERROR( CV_StsError, "Invalid size node: width must be positive integer" );
1810 CV_ERROR( CV_StsError, "Invalid size node: height must be positive integer" );
1831 sprintf( buf, "Trees node is not a valid sequence. (stage %d)", i );
1856 sprintf( buf, "Tree node is not a valid sequence."
1884 sprintf( buf, "Tree node %d is not a valid map. (stage %d, tree %d)",
1892 sprintf( buf, "Feature node is not a valid map. "
1893 "(stage %d, tree %d, node %d)", i, j, k );
1902 sprintf( buf, "Rects node is not a valid sequence. "
1903 "(stage %d, tree %d, node %d)", i, j, k );
1916 "(stage %d, tree %d, node %d)", l, i, j, k );
1924 "(stage %d, tree %d, node %d, rect %d)", i, j, k, l );
1932 "(stage %d, tree %d, node %d, rect %d)", i, j, k, l );
1942 "(stage %d, tree %d, node %d, rect %d)", i, j, k, l );
1952 "(stage %d, tree %d, node %d, rect %d)", i, j, k, l );
1960 "(stage %d, tree %d, node %d, rect %d)", i, j, k, l );
1979 "(stage %d, tree %d, node %d)", i, j, k );
1987 "(stage %d, tree %d, node %d)", i, j, k );
1997 sprintf( buf, "left node must be valid node number. "
1998 "(stage %d, tree %d, node %d)", i, j, k );
2001 /* left node */
2010 sprintf( buf, "left node or left value must be specified. "
2011 "(stage %d, tree %d, node %d)", i, j, k );
2017 "(stage %d, tree %d, node %d)", i, j, k );
2024 "(stage %d, tree %d, node %d)", i, j, k );
2036 sprintf( buf, "right node must be valid node number. "
2037 "(stage %d, tree %d, node %d)", i, j, k );
2040 /* right node */
2049 sprintf( buf, "right node or right value must be specified. "
2050 "(stage %d, tree %d, node %d)", i, j, k );
2056 "(stage %d, tree %d, node %d)", i, j, k );
2063 "(stage %d, tree %d, node %d)", i, j, k );
2071 } /* for each node */
2178 sprintf( buf, "node %d", k );
2182 sprintf( buf, "root node" );
