Lines Matching refs:numPoints
82 int numPoints;
83 numPoints = (vectX->rows - 36)/4;
85 if( numPoints < 1 )//!!! Need to correct this minimal number of points
90 if( Jacobian->rows == numPoints*6 || Jacobian->cols != 36+numPoints*4 )
92 CV_ERROR( CV_StsUnmatchedSizes, "Size of Jacobian is not correct it must be 6*numPoints x (36+numPoints*4)" );
117 for( currProjPoint = 0; currProjPoint < numPoints; currProjPoint++ )
143 currMatr*numPoints*2+currProjPoint*2+j, 36+currProjPoint*4+i,
151 cvmSet(Jacobian,currMatr*numPoints*2+currProjPoint*2,currMatr*12+i,X[i]/piX[2]);//x' p1i
152 cvmSet(Jacobian,currMatr*numPoints*2+currProjPoint*2,currMatr*12+8+i,X[i]*tmp1);//x' p3i
155 cvmSet(Jacobian,currMatr*numPoints*2+currProjPoint*2+1,currMatr*12+4+i,X[i]/piX[2]);//y' p2i
156 cvmSet(Jacobian,currMatr*numPoints*2+currProjPoint*2+1,currMatr*12+8+i,X[i]*tmp2);//y' p3i
197 int numPoints;
198 numPoints = (vectX->rows - 36)/4;
200 if( numPoints < 1 )//!!! Need to correct this minimal number of points
205 if( resFunc->rows == 2*numPoints*3 || resFunc->cols != 1 )
207 CV_ERROR( CV_StsUnmatchedSizes, "Size of resFunc is not correct it must be 2*numPoints*3 x 1");
244 for( currPoint = 0; currPoint < numPoints; currPoint++ )
257 cvmSet(resFunc,currMatr*numPoints*2 + currPoint*2, 0,point3D_dat[0]/z);
258 cvmSet(resFunc,currMatr*numPoints*2 + currPoint*2+1,0,point3D_dat[1]/z);
293 int numPoints;
294 numPoints = resultPoints4D->cols;
295 if( numPoints < 1 )
345 if( projPoints[i]->rows != 2 || projPoints[i]->cols != numPoints )
358 CV_CALL( points4D = cvCreateMat(4,numPoints,CV_64F) );
359 CV_CALL( vectorX0 = cvCreateMat(36 + numPoints*4,1,CV_64F) );
360 CV_CALL( observRes = cvCreateMat(2*numPoints*3,1,CV_64F) );
361 CV_CALL( optimX = cvCreateMat(36+numPoints*4,1,CV_64F) );
362 //CV_CALL( error = cvCreateMat(numPoints*2*3,1,CV_64F) );
379 for( i = 0; i < numPoints; i++ )
381 cvmSet(observRes,currMatr*numPoints*2+i*2 ,0,cvmGet(projPoints[currMatr],0,i) );/* x */
382 cvmSet(observRes,currMatr*numPoints*2+i*2+1,0,cvmGet(projPoints[currMatr],1,i) );/* y */
399 for( currPoint = 0; currPoint < numPoints; currPoint++ )
423 for( currPoint = 0; currPoint < numPoints; currPoint++ )
453 int numPoints;
454 numPoints = points->cols;
456 if( numPoints < 1 )
473 for( i = 0; i < numPoints; i++)
485 for( j = 0; j < numPoints; j++)
