Lines Matching refs:inl
216 char* inl, /* Inlier mask */
253 char* inl; member
282 char* inl; /* Mask of inliers */ member
289 char* inl; /* Mask of inliers */ member
345 char* inl, /* Inlier mask */
417 const char* inl,
524 char* inl, /* Inlier mask */ in rhoHest() argument
535 return p->rhoHest(src, dst, inl, N, maxD, maxI, rConvg, cfd, minInl, beta, in rhoHest()
602 curr.inl = NULL; in initialize()
605 best.inl = NULL; in initialize()
711 char* inl, /* Inlier mask */ in rhoHest() argument
729 arg.inl = inl; in rhoHest()
862 best.inl = (char*)(ptr + best_inl_of); in allocatePerRun()
863 curr.inl = (char*)(ptr + curr_inl_of); in allocatePerRun()
874 best.inl = NULL; in deallocatePerRun()
875 curr.inl = NULL; in deallocatePerRun()
970 memset(best.inl, 0, arg.N); in initRun()
971 memset(curr.inl, 0, arg.N); in initRun()
1406 char* inl = curr.inl; in evaluateModelSPRT() local
1441 *inl++ = (char)isInlier; in evaluateModelSPRT()
1609 char* inl = curr.inl; in saveBestModel() local
1613 curr.inl = best.inl; in saveBestModel()
1617 best.inl = inl; in saveBestModel()
1667 testNumInl -= !!best.inl[test_n-1]; in nStarOptimize()
1708 if(arg.inl){ in outputModel()
1709 memcpy(arg.inl, best.inl, arg.N); in outputModel()
1729 if(arg.inl){ in outputZeroH()
1730 memset(arg.inl, 0, arg.N); in outputZeroH()
2098 sacCalcJacobianErrors(best.H, arg.src, arg.dst, best.inl, arg.N, in refine()
2130 sacCalcJacobianErrors(newH, arg.src, arg.dst, best.inl, arg.N, in refine()
2158 sacCalcJacobianErrors(best.H, arg.src, arg.dst, best.inl, arg.N, in refine()
2181 const char* inl, in sacCalcJacobianErrors() argument
2197 if(!inl[i]){ in sacCalcJacobianErrors()