Lines Matching refs:quad_count
135 static void icvFindQuadNeighbors( CvCBQuad *quads, int quad_count );
137 static int icvFindConnectedQuads( CvCBQuad *quads, int quad_count,
144 static int icvCleanFoundConnectedQuads( int quad_count,
147 static int icvOrderFoundConnectedQuads( int quad_count, CvCBQuad **quads,
157 static int icvAddOuterQuad(CvCBQuad *quad, CvCBQuad **quads, int quad_count,
229 int quad_count = 0, group_idx = 0, i = 0, dilations = 0;
287 CV_CALL( quad_count = icvGenerateQuadsEx( &quads, &corners, storage, img, thresh_img, dilations, flags ));
288 PRINTF("EX quad count: %d/%d\n", quad_count, expected_corners_num);
330 CV_CALL( quad_count = icvGenerateQuads( &quads, &corners, storage, thresh_img, flags ));
333 PRINTF("Quad count: %d/%d\n", quad_count, expected_corners_num);
341 for( i = 0; i < quad_count; i++ )
363 if( quad_count <= 0 )
367 CV_CALL( icvFindQuadNeighbors( quads, quad_count ));
370 CV_CALL( quad_group = (CvCBQuad**)cvAlloc( sizeof(quad_group[0]) * (quad_count+quad_count / 2)));
371 CV_CALL( corner_group = (CvCBCorner**)cvAlloc( sizeof(corner_group[0]) * (quad_count+quad_count / 2)*4 ));
376 CV_CALL( count = icvFindConnectedQuads( quads, quad_count, quad_group, group_idx, storage ));
385 count = icvOrderFoundConnectedQuads(count, quad_group, &quad_count, &quads, &corners,
394 for( i = 0; i < quad_count; i++ )
539 icvOrderFoundConnectedQuads( int quad_count, CvCBQuad **quads,
549 for (i=0; i<quad_count; i++)
658 quad_count = icvTrimCol(quads,quad_count,col_min,-1);
663 quad_count = icvTrimCol(quads,quad_count,col_max,+1);
674 quad_count = icvTrimRow(quads,quad_count,row_min,-1);
679 quad_count = icvTrimRow(quads,quad_count,row_max,+1);
688 for (i=0; i<quad_count; i++)
729 for (int i=0; i<quad_count; i++)
733 int added = icvAddOuterQuad(quads[i],quads,quad_count,all_quads,*all_count,corners);
735 quad_count += added;
745 int rcount = quad_count;
746 for (int i=quad_count-1; i>=0; i--) // eliminate any quad not connected to
779 icvAddOuterQuad( CvCBQuad *quad, CvCBQuad **quads, int quad_count,
793 quads[quad_count] = q;
794 quad_count++;
1019 icvCleanFoundConnectedQuads( int quad_count, CvCBQuad **quad_group, CvSize pattern_size )
1035 if( quad_count <= count )
1039 CV_CALL( centers = (CvPoint2D32f *)cvAlloc( sizeof(centers[0])*quad_count ));
1042 for( i = 0; i < quad_count; i++ )
1061 center.x /= quad_count;
1062 center.y /= quad_count;
1071 for( ; quad_count > count; quad_count-- )
1078 for( skip = 0; skip < quad_count; skip++ )
1083 CvMat pointMat = cvMat(1, quad_count, CV_32FC2, centers);
1100 for( i = 0; i < quad_count; i++ )
1122 quad_count--;
1123 quad_group[min_box_area_index] = quad_group[quad_count];
1124 centers[min_box_area_index] = centers[quad_count];
1132 return quad_count;
1138 icvFindConnectedQuads( CvCBQuad *quad, int quad_count, CvCBQuad **out_group,
1146 for( i = 0; i < quad_count; i++ )
1153 if( i < quad_count )
1186 icvCheckQuadGroup( CvCBQuad **quad_group, int quad_count,
1204 CV_CALL( corners = (CvCBCorner**)cvAlloc( quad_count*4*sizeof(corners[0]) ));
1208 for( i = 0; i < quad_count; i++ )
1450 static void icvFindQuadNeighbors( CvCBQuad *quads, int quad_count )
1457 for( idx = 0; idx < quad_count; idx++ )
1481 for( k = 0; k < quad_count; k++ )
1550 for( k = 0; k < quad_count; k++ )
1569 if( k < quad_count )
1597 int quad_count = 0;
1707 CvCBQuad* q = &(*out_quads)[quad_count];
1719 CvCBCorner* corner = &(*out_corners)[quad_count*4 + i];
1734 quad_count++;
1745 quad_count = 0;
1749 return quad_count;
1775 int quad_count = 0;
1933 CvCBQuad* q = &(*out_quads)[quad_count];
1945 CvCBCorner* corner = &(*out_corners)[quad_count*4 + i];
1960 quad_count++;
1971 quad_count = 0;
1975 return quad_count;
