Home | History | Annotate | Download | only in src

Lines Matching full:npoints

68                 int npoints = points0.cols;
70 npoints, (float*)points0.data, (float*)points1.data, mask.data);
85 static Mat normalizePoints(int npoints, Point2f *points)
88 for (int i = 0; i < npoints; ++i)
93 cx /= npoints;
94 cy /= npoints;
97 for (int i = 0; i < npoints; ++i)
103 d /= npoints;
106 for (int i = 0; i < npoints; ++i)
121 int npoints, Point2f *points0, Point2f *points1, float *rmse)
124 for (int i = 0; i < npoints; ++i)
129 M(0,2) /= npoints;
130 M(1,2) /= npoints;
135 for (int i = 0; i < npoints; ++i)
138 *rmse = std::sqrt(*rmse / npoints);
146 int npoints, Point2f *points0, Point2f *points1, float *rmse)
148 Mat_<float> T0 = normalizePoints(npoints, points0);
149 Mat_<float> T1 = normalizePoints(npoints, points1);
151 Mat_<float> A(2*npoints, 3), b(2*npoints, 1);
155 for (int i = 0; i < npoints; ++i)
171 *rmse = static_cast<float>(norm(A*sol, b, NORM_L2) / std::sqrt(static_cast<double>(npoints)));
182 int npoints, Point2f *points0, Point2f *points1, float *rmse)
186 for(int i=0; i<npoints; ++i)
212 for (int i = 0; i < npoints; ++i)
219 *rmse = std::sqrt(*rmse / npoints);
226 int npoints, Point2f *points0, Point2f *points1, float *rmse)
231 for (int i = 0; i < npoints; ++i)
237 mean0 *= 1.f / npoints;
238 mean1 *= 1.f / npoints;
243 for (int i = 0; i < npoints; ++i)
266 for (int i = 0; i < npoints; ++i)
273 *rmse = std::sqrt(*rmse / npoints);
281 int npoints, Point2f *points0, Point2f *points1, float *rmse)
283 Mat_<float> T0 = normalizePoints(npoints, points0);
284 Mat_<float> T1 = normalizePoints(npoints, points1);
286 Mat_<float> A(2*npoints, 4), b(2*npoints, 1);
290 for (int i = 0; i < npoints; ++i)
306 *rmse = static_cast<float>(norm(A*sol, b, NORM_L2) / std::sqrt(static_cast<double>(npoints)));
320 int npoints, Point2f *points0, Point2f *points1, float *rmse)
322 Mat_<float> T0 = normalizePoints(npoints, points0);
323 Mat_<float> T1 = normalizePoints(npoints, points1);
325 Mat_<float> A(2*npoints, 6), b(2*npoints, 1);
329 for (int i = 0; i < npoints; ++i)
345 *rmse = static_cast<float>(norm(A*sol, b, NORM_L2) / std::sqrt(static_cast<double>(npoints)));
361 const int npoints = points0.getMat().checkVector(2);
362 CV_Assert(points1.getMat().checkVector(2) == npoints);
375 return impls[model](npoints, points0_, points1_, rmse);
385 const int npoints = points0.getMat().checkVector(2);
386 CV_Assert(points1.getMat().checkVector(2) == npoints);
388 if (npoints < params.size)
418 indices[i] = static_cast<unsigned>(rng) % npoints;
433 for (int i = 0; i < npoints; ++i)
458 for (int i = 0, j = 0; i < npoints && j < ninliersMax ; ++i)
492 const int npoints = points0.getMat().checkVector(2);
493 CV_Assert(points1.getMat().checkVector(2) == npoints);
507 for (int i = 0; i < npoints; ++i)
514 if (static_cast<float>(ninliers) / npoints < minInlierRatio_)
534 const int npoints = points0.getMat().checkVector(2);
535 CV_Assert(points1.getMat().checkVector(2) == npoints);
547 if(npoints <= 0)
555 int ncols = 6 + 2*npoints;
556 int nrows = 4*npoints;
574 for (int i = 0; i < npoints; ++i, c += 2)
590 for (int i = 0; i < npoints; ++i, r += 4)