Searched refs:trainIdx (Results 1 - 25 of 39) sorted by relevance

12

/external/opencv3/modules/core/misc/java/src/java/
H A Dcore+DMatch.java18 public int trainIdx; field in class:DMatch
35 trainIdx = _trainIdx;
43 trainIdx = _trainIdx;
57 return "DMatch [queryIdx=" + queryIdx + ", trainIdx=" + trainIdx
H A Dcore+MatOfDMatch.java55 buff[_channels*i+1] = m.trainIdx;
/external/opencv3/modules/cudafeatures2d/src/cuda/
H A Dbf_radius_match.cu65 const int trainIdx = blockIdx.x * BLOCK_SIZE + threadIdx.x;
102 if (queryIdx < query.rows && trainIdx < train.rows && mask(queryIdx, trainIdx) && distVal < maxDistance)
107 bestTrainIdx.ptr(queryIdx)[ind] = trainIdx;
116 const PtrStepSzi& trainIdx, const PtrStepSzf& distance, const PtrStepSz<unsigned int>& nMatches, cudaStream_t stream)
124 trainIdx, PtrStepi(), distance, nMatches.data, trainIdx.cols);
133 const PtrStepSzi& trainIdx, const PtrStepSzi& imgIdx, const PtrStepSzf& distance, const PtrStepSz<unsigned int>& nMatches,
149 trainIdx, imgIdx, distance, nMatches.data, trainIdx
[all...]
H A Dbf_match.cu127 const int trainIdx = t * BLOCK_SIZE + threadIdx.x;
129 if (queryIdx < query.rows && trainIdx < train.rows && distVal < bestDistance && mask(queryIdx, trainIdx))
133 bestTrainIdx = trainIdx;
171 const PtrStepSzi& trainIdx, const PtrStepSzf& distance,
179 matchUnrolledCached<BLOCK_SIZE, MAX_DESC_LEN, Dist><<<grid, block, smemSize, stream>>>(query, train, mask, trainIdx.data, distance.data);
230 const PtrStepSzi& trainIdx, const PtrStepSzi& imgIdx, const PtrStepSzf& distance,
238 matchUnrolledCached<BLOCK_SIZE, MAX_DESC_LEN, Dist><<<grid, block, smemSize, stream>>>(query, trains, n, mask, trainIdx.data, imgIdx.data, distance.data);
287 const int trainIdx = t * BLOCK_SIZE + threadIdx.x;
289 if (queryIdx < query.rows && trainIdx < trai
[all...]
H A Dbf_knnmatch.cu352 const int trainIdx = t * BLOCK_SIZE + threadIdx.x;
354 if (queryIdx < query.rows && trainIdx < train.rows && mask(queryIdx, trainIdx))
364 bestTrainIdx1 = trainIdx;
370 bestTrainIdx2 = trainIdx;
411 const PtrStepSz<int2>& trainIdx, const PtrStepSz<float2>& distance,
419 matchUnrolledCached<BLOCK_SIZE, MAX_DESC_LEN, Dist><<<grid, block, smemSize, stream>>>(query, train, mask, trainIdx.data, distance.data);
472 const PtrStepSz<int2>& trainIdx, const PtrStepSz<int2>& imgIdx, const PtrStepSz<float2>& distance,
480 matchUnrolledCached<BLOCK_SIZE, MAX_DESC_LEN, Dist><<<grid, block, smemSize, stream>>>(query, trains, n, mask, trainIdx.data, imgIdx.data, distance.data);
531 const int trainIdx
[all...]
/external/opencv3/modules/core/misc/java/test/
H A DDMatchTest.java16 assertEquals(4, dm1.trainIdx);
24 assertEquals(6, dm2.trainIdx);
40 String expected = "DMatch [queryIdx=2, trainIdx=6, imgIdx=-1, distance=8.0]";
/external/opencv3/modules/cudafeatures2d/src/
H A Dbrute_force_matcher.cpp59 const PtrStepSzi& trainIdx, const PtrStepSzf& distance,
62 const PtrStepSzi& trainIdx, const PtrStepSzf& distance,
65 const PtrStepSzi& trainIdx, const PtrStepSzf& distance,
69 const PtrStepSzi& trainIdx, const PtrStepSzi& imgIdx, const PtrStepSzf& distance,
72 const PtrStepSzi& trainIdx, const PtrStepSzi& imgIdx, const PtrStepSzf& distance,
75 const PtrStepSzi& trainIdx, const PtrStepSzi& imgIdx, const PtrStepSzf& distance,
82 const PtrStepSzb& trainIdx, const PtrStepSzb& distance, const PtrStepSzf& allDist,
85 const PtrStepSzb& trainIdx, const PtrStepSzb& distance, const PtrStepSzf& allDist,
88 const PtrStepSzb& trainIdx, const PtrStepSzb& distance, const PtrStepSzf& allDist,
92 const PtrStepSzb& trainIdx, cons
[all...]
/external/opencv3/modules/features2d/src/
H A Dmatchers.cpp64 UMat &trainIdx, UMat &distance, int distType)
72 ensureSizeIsEnough(1, query_rows, CV_32S, trainIdx);
106 idx = k.set(idx, ocl::KernelArg::PtrWriteOnly(trainIdx));
117 static bool ocl_matchConvert(const Mat &trainIdx, const Mat &distance, std::vector< std::vector<DMatch> > &matches) argument
119 if (trainIdx.empty() || distance.empty())
122 if( (trainIdx.type() != CV_32SC1) || (distance.type() != CV_32FC1 || distance.cols != trainIdx.cols) )
125 const int nQuery = trainIdx.cols;
130 const int *trainIdx_ptr = trainIdx.ptr<int>();
150 static bool ocl_matchDownload(const UMat &trainIdx, cons argument
63 ocl_matchSingle(InputArray query, InputArray train, UMat &trainIdx, UMat &distance, int distType) argument
161 ocl_knnMatchSingle(InputArray query, InputArray train, UMat &trainIdx, UMat &distance, int distType) argument
217 ocl_knnMatchConvert(const Mat &trainIdx, const Mat &distance, std::vector< std::vector<DMatch> > &matches, bool compactResult) argument
262 ocl_knnMatchDownload(const UMat &trainIdx, const UMat &distance, std::vector< std::vector<DMatch> > &matches, bool compactResult) argument
273 ocl_radiusMatchSingle(InputArray query, InputArray train, UMat &trainIdx, UMat &distance, UMat &nMatches, float maxDistance, int distType) argument
330 ocl_radiusMatchConvert(const Mat &trainIdx, const Mat &distance, const Mat &_nMatches, std::vector< std::vector<DMatch> > &matches, bool compactResult) argument
381 ocl_radiusMatchDownload(const UMat &trainIdx, const UMat &distance, const UMat &nMatches, std::vector< std::vector<DMatch> > &matches, bool compactResult) argument
698 UMat trainIdx, distance; local
708 UMat trainIdx, distance; local
857 UMat trainIdx, distance, nMatches; local
[all...]
H A Dbagofwords.cpp199 int trainIdx = matches[i].trainIdx; // cluster index local
202 dptr[trainIdx] = dptr[trainIdx] + 1.f;
204 (*pointIdxsOfClusters)[trainIdx].push_back( queryIdx );
H A Ddraw.cpp208 int i2 = matches1to2[m].trainIdx;
237 int i2 = matches1to2[i][j].trainIdx;
/external/opencv3/modules/features2d/test/ocl/
H A Dtest_brute_force_matcher.cpp131 if ((match.queryIdx != (int)i) || (match.trainIdx != (int)i * countFactor) || (match.imgIdx != 0))
164 if ((match.queryIdx != (int)i) || (match.trainIdx != (int)i * countFactor + k) || (match.imgIdx != 0))
199 if ((match.queryIdx != (int)i) || (match.trainIdx != (int)i * countFactor) || (match.imgIdx != 0))
/external/opencv3/samples/cpp/tutorial_code/calib3d/real_time_pose_estimation/src/
H A DRobustMatcher.cpp78 (*matchIterator2)[0].trainIdx &&
80 (*matchIterator1)[0].trainIdx)
85 (*matchIterator1)[0].trainIdx,
/external/opencv3/modules/features2d/test/
H A Dtest_matchers_algorithmic.cpp213 if( (match.queryIdx != (int)i) || (match.trainIdx != (int)i*countFactor) || (match.imgIdx != 0) )
242 if( match.queryIdx != (int)i || match.trainIdx != (int)i || std::abs(match.distance) > FLT_EPSILON )
244 ts->printf( cvtest::TS::LOG, "Bad match (i=%d, queryIdx=%d, trainIdx=%d, distance=%f) while test match() function for the same query and test descriptors (1).\n",
245 i, match.queryIdx, match.trainIdx, match.distance );
284 if( (match.queryIdx != (int)i) || (match.trainIdx != (int)i*countFactor + shift) || (match.imgIdx != 0) )
289 if( (match.queryIdx != (int)i) || (match.trainIdx != ((int)i-queryDescCount/2)*countFactor + shift) || (match.imgIdx != 1) )
333 if( (match.queryIdx != (int)i) || (match.trainIdx != (int)i*countFactor+k) || (match.imgIdx != 0) )
388 if( (match.queryIdx != (int)i) || (match.trainIdx != (int)i*countFactor + k + shift) ||
394 if( (match.queryIdx != (int)i) || (match.trainIdx != ((int)i-queryDescCount/2)*countFactor + k + shift) ||
437 if( (match.queryIdx != (int)i) || (match.trainIdx !
[all...]
H A Dtest_rotation_and_scale_invariance.cpp247 float angle1 = keypoints1[matches[m].trainIdx].angle;
356 const KeyPoint& p1 = keypoints1[descMatches[m].trainIdx];
461 float size0 = keypoints0[matches[m].trainIdx].size;
560 const KeyPoint& p1 = keypoints0[descMatches[m].trainIdx];
/external/opencv3/modules/features2d/src/opencl/
H A Dbrute_force_match.cl220 // loopUnrolledCached to find the best trainIdx and best distance.
267 const int trainIdx = mad24(BLOCK_SIZE, t, lidx);
269 if (queryIdx < query_rows && trainIdx < train_rows && result < myBestDistance /*&& mask(queryIdx, trainIdx)*/)
272 myBestTrainIdx = trainIdx;
333 const int trainIdx = mad24(BLOCK_SIZE, groupidx, lidx);
369 if (queryIdx < query_rows && trainIdx < train_rows && convert_float(result) < maxDistance)
375 bestTrainIdx[mad24(queryIdx, ostep, ind)] = trainIdx;
471 const int trainIdx = mad24(BLOCK_SIZE, t, lidx);
473 if (queryIdx < query_rows && trainIdx < train_row
[all...]
/external/opencv3/modules/cudafeatures2d/test/
H A Dtest_features2d.cpp307 if ((match.queryIdx != (int)i) || (match.trainIdx != (int)i * countFactor) || (match.imgIdx != 0))
351 bool validTrainIdx = (match.trainIdx == (int)i * countFactor + shift);
359 bool validTrainIdx = (match.trainIdx == ((int)i - queryDescCount / 2) * countFactor + shift);
399 if ((match.queryIdx != (int)i) || (match.trainIdx != (int)i * countFactor + k) || (match.imgIdx != 0))
439 if ((match.queryIdx != (int)i) || (match.trainIdx != (int)i * countFactor + k) || (match.imgIdx != 0))
495 if ((match.queryIdx != (int)i) || (match.trainIdx != (int)i * countFactor + k + shift) || (match.imgIdx != 0) )
500 if ((match.queryIdx != (int)i) || (match.trainIdx != ((int)i - queryDescCount / 2) * countFactor + k + shift) || (match.imgIdx != 1) )
558 if ((match.queryIdx != (int)i) || (match.trainIdx != (int)i * countFactor + k + shift) || (match.imgIdx != 0) )
563 if ((match.queryIdx != (int)i) || (match.trainIdx != ((int)i - queryDescCount / 2) * countFactor + k + shift) || (match.imgIdx != 1) )
616 if ((match.queryIdx != (int)i) || (match.trainIdx !
[all...]
/external/opencv3/samples/cpp/tutorial_code/features2D/
H A DAKAZE_match.cpp42 matched2.push_back(kpts2[first.trainIdx]);
/external/opencv3/modules/stitching/src/
H A Dmatchers.cpp95 pairwise_matches[dual_pair_idx].matches[j].trainIdx);
191 matches.insert(std::make_pair(m0.queryIdx, m0.trainIdx));
206 if (matches.find(std::make_pair(m0.trainIdx, m0.queryIdx)) == matches.end())
207 matches_info.matches.push_back(DMatch(m0.trainIdx, m0.queryIdx, m0.distance));
239 matches.insert(std::make_pair(m0.queryIdx, m0.trainIdx));
253 if (matches.find(std::make_pair(m0.trainIdx, m0.queryIdx)) == matches.end())
254 matches_info.matches.push_back(DMatch(m0.trainIdx, m0.queryIdx, m0.distance));
598 p = features2.keypoints[m.trainIdx].pt;
643 p = features2.keypoints[m.trainIdx].pt;
/external/opencv3/modules/shape/src/
H A Daff_trans.cpp200 _matches[i].trainIdx<pts2.cols)
214 Point2f pt2=pts2.at<Point2f>(0,matches[i].trainIdx);
H A Dtps_trans.cpp206 _matches[i].trainIdx<pts2.cols)
221 Point2f pt2=pts2.at<Point2f>(0,matches[i].trainIdx);
/external/opencv3/samples/cpp/
H A Dmatchmethod_orb_akaze_brisk.cpp145 cout << it->queryIdx << "\t" << it->trainIdx << "\t" << it->distance << "\n";
146 Point2d p=keyImg1[it->queryIdx].pt-keyImg2[it->trainIdx].pt;
/external/opencv3/modules/features2d/misc/java/src/cpp/
H A Dfeatures2d_converters.cpp58 mat.at< Vec<float, 4> >(i, 0) = Vec<float, 4>((float)dm.queryIdx, (float)dm.trainIdx, (float)dm.imgIdx, dm.distance);
/external/opencv3/modules/features2d/misc/java/test/
H A DFeatures2dTest.java128 lp1.add(tkp[dm.trainIdx].pt);
/external/opencv3/samples/cpp/tutorial_code/xfeatures2D/
H A DLATCH_match.cpp60 matched2.push_back(kpts2[first.trainIdx]);
/external/opencv3/samples/cpp/tutorial_code/features2D/AKAZE_tracking/
H A Dplanar_tracking.cpp64 matched2.push_back( kp[matches[i][0].trainIdx]);

Completed in 237 milliseconds

12