Home
last modified time | relevance | path

Searched refs:knn (Results 1 – 20 of 20) sorted by relevance

/external/opencv3/modules/flann/include/opencv2/flann/
Dnn_index.h68 …mentType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams… in knnSearch() argument
73 assert(int(indices.cols) >= knn); in knnSearch()
74 assert(int(dists.cols) >= knn); in knnSearch()
77 KNNResultSet<DistanceType> resultSet(knn); in knnSearch()
83 KNNUniqueResultSet<DistanceType> resultSet(knn); in knnSearch()
87 if (get_param(params,"sorted",true)) resultSet.sortAndCopy(indices[i], dists[i], knn); in knnSearch()
88 else resultSet.copy(indices[i], dists[i], knn); in knnSearch()
Dlsh_index.h190 …mentType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams… in knnSearch() argument
195 assert(int(indices.cols) >= knn); in knnSearch()
196 assert(int(dists.cols) >= knn); in knnSearch()
199 KNNUniqueResultSet<DistanceType> resultSet(knn); in knnSearch()
202 std::fill_n(indices[i], knn, -1); in knnSearch()
203 std::fill_n(dists[i], knn, std::numeric_limits<DistanceType>::max()); in knnSearch()
205 if (get_param(params,"sorted",true)) resultSet.sortAndCopy(indices[i], dists[i], knn); in knnSearch()
206 else resultSet.copy(indices[i], dists[i], knn); in knnSearch()
Dflann_base.hpp214 …mentType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams… in knnSearch() argument
216 nnIndex_->knnSearch(queries, indices, dists, knn, params); in knnSearch()
Dkdtree_single_index.h212 …mentType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams… in knnSearch() argument
217 assert(int(indices.cols) >= knn); in knnSearch()
218 assert(int(dists.cols) >= knn); in knnSearch()
220 KNNSimpleResultSet<DistanceType> resultSet(knn); in knnSearch()
Dminiflann.hpp137 OutputArray dists, int knn, const SearchParams& params=SearchParams());
/external/opencv3/modules/features2d/perf/
Dperf_batchDistance.cpp32 int knn = isCrossCheck ? 1 : 0; variable
44 normType, knn, Mat(), 0, isCrossCheck); in TEST_CYCLE()
59 int knn = isCrossCheck ? 1 : 0; variable
71 normType, knn, Mat(), 0, isCrossCheck); in TEST_CYCLE()
86 int knn = isCrossCheck ? 1 : 0; in PERF_TEST_P() local
99 NORM_L2, knn, Mat(), 0, isCrossCheck); in PERF_TEST_P()
114 int knn = isCrossCheck ? 1 : 0; variable
127 normType, knn, Mat(), 0, isCrossCheck); in TEST_CYCLE()
/external/opencv3/modules/flann/include/opencv2/
Dflann.hpp217 … std::vector<DistanceType>& dists, int knn, const ::cvflann::SearchParams& params);
218 …void knnSearch(const Mat& queries, Mat& indices, Mat& dists, int knn, const ::cvflann::SearchParam…
271 …>& query, std::vector<int>& indices, std::vector<DistanceType>& dists, int knn, const ::cvflann::S… in knnSearch() argument
279 nnIndex->knnSearch(m_query,m_indices,m_dists,knn,searchParams); in knnSearch()
284 void GenericIndex<Distance>::knnSearch(const Mat& queries, Mat& indices, Mat& dists, int knn, const… in knnSearch() argument
300 nnIndex->knnSearch(m_queries,m_indices,m_dists,knn, searchParams); in knnSearch()
354 …>& query, std::vector<int>& indices, std::vector<DistanceType>& dists, int knn, const ::cvflann::S…
355 …void knnSearch(const Mat& queries, Mat& indices, Mat& dists, int knn, const ::cvflann::SearchParam…
438 …>& query, std::vector<int>& indices, std::vector<DistanceType>& dists, int knn, const ::cvflann::S… in knnSearch() argument
444 if (nnIndex_L1) nnIndex_L1->knnSearch(m_query,m_indices,m_dists,knn,searchParams); in knnSearch()
[all …]
/external/opencv3/modules/cudafeatures2d/test/
Dtest_features2d.cpp374 const int knn = 2; in CUDA_TEST_P() local
384 matcher->knnMatch(loadMat(query), loadMat(train), matches, knn, mask); in CUDA_TEST_P()
391 if ((int)matches[i].size() != knn) in CUDA_TEST_P()
396 for (int k = 0; k < knn; k++) in CUDA_TEST_P()
414 const int knn = 3; in CUDA_TEST_P() local
424 matcher->knnMatch(loadMat(query), loadMat(train), matches, knn, mask); in CUDA_TEST_P()
431 if ((int)matches[i].size() != knn) in CUDA_TEST_P()
436 for (int k = 0; k < knn; k++) in CUDA_TEST_P()
454 const int knn = 2; in CUDA_TEST_P() local
474 matcher->knnMatch(cv::cuda::GpuMat(query), matches, knn, masks); in CUDA_TEST_P()
[all …]
/external/opencv3/modules/flann/src/
Dminiflann.cpp463 int knn, const SearchParams& params) in runKnnSearch_() argument
476 ((IndexType*)index)->knnSearch(_query, _indices, _dists, knn, in runKnnSearch_()
482 int knn, const SearchParams& params) in runKnnSearch() argument
484 runKnnSearch_<Distance, ::cvflann::Index<Distance> >(index, query, indices, dists, knn, params); in runKnnSearch()
552 OutputArray _dists, int knn, const SearchParams& params) in knnSearch() argument
557 createIndicesDists( _indices, _dists, indices, dists, query.rows, knn, knn, dtype ); in knnSearch()
562 runKnnSearch<HammingDistance>(index, query, indices, dists, knn, params); in knnSearch()
565 runKnnSearch< ::cvflann::L2<float> >(index, query, indices, dists, knn, params); in knnSearch()
568 runKnnSearch< ::cvflann::L1<float> >(index, query, indices, dists, knn, params); in knnSearch()
572 runKnnSearch< ::cvflann::MaxDistance<float> >(index, query, indices, dists, knn, params); in knnSearch()
[all …]
/external/opencv3/samples/tapi/
Dbgfg_segm.cpp62 Ptr<BackgroundSubtractorKNN> knn = createBackgroundSubtractorKNN(); in main() local
68 knn->apply(frame, fgmask); in main()
90 knn->apply(frame, fgmask); in main()
/external/opencv3/modules/features2d/test/ocl/
Dtest_brute_force_matcher.cpp144 const int knn = 2; in OCL_TEST_P() local
149 matcher.knnMatch(uquery, utrain, matches, knn); in OCL_TEST_P()
156 if ((int)matches[i].size() != knn) in OCL_TEST_P()
161 for (int k = 0; k < knn; k++) in OCL_TEST_P()
/external/opencv3/modules/features2d/test/
Dtest_matchers_algorithmic.cpp310 const int knn = 3; in knnMatchTest() local
313 dmatcher->knnMatch( query, train, matches, knn ); in knnMatchTest()
325 if( (int)matches[i].size() != knn ) in knnMatchTest()
330 for( int k = 0; k < knn; k++ ) in knnMatchTest()
350 const int knn = 2; in knnMatchTest() local
364 dmatcher->knnMatch( query, matches, knn, masks ); in knnMatchTest()
377 if( (int)matches[i].size() != knn ) in knnMatchTest()
382 for( int k = 0; k < knn; k++ ) in knnMatchTest()
Dtest_nearestneighbors.cpp181 int knn = 1, j; in knnSearch() local
184 index->knnSearch( points, neighbors, dist, knn, SearchParams() ); in knnSearch()
194 index->knnSearch( query, indices, dists, knn, SearchParams() ); in knnSearch()
/external/opencv3/doc/py_tutorials/py_ml/py_knn/py_knn_opencv/
Dpy_knn_opencv.markdown45 knn = cv2.KNearest()
46 knn.train(train,train_labels)
47 ret,result,neighbours,dist = knn.find_nearest(test,k=5)
106 knn = cv2.KNearest()
107 knn.train(trainData, responses)
108 ret, result, neighbours, dist = knn.find_nearest(testData, k=5)
/external/opencv3/samples/cpp/
Dpoints_classifier.cpp116 Ptr<KNearest> knn = KNearest::create(); in find_decision_boundary_KNN() local
117 knn->setDefaultK(K); in find_decision_boundary_KNN()
118 knn->setIsClassifier(true); in find_decision_boundary_KNN()
119 knn->train(prepare_train_data()); in find_decision_boundary_KNN()
120 predict_and_paint(knn, imgDst); in find_decision_boundary_KNN()
/external/opencv3/modules/features2d/src/
Dmatchers.cpp572 std::vector<std::vector<DMatch> >& matches, int knn, in knnMatch() argument
577 …tempMatcher->knnMatch( queryDescriptors, matches, knn, std::vector<Mat>(1, mask.getMat()), compact… in knnMatch()
619 …atcher::knnMatch( InputArray queryDescriptors, std::vector<std::vector<DMatch> >& matches, int knn, in knnMatch() argument
625 CV_Assert( knn > 0 ); in knnMatch()
630 knnMatchImpl( queryDescriptors, matches, knn, masks, compactResult ); in knnMatch()
718 …r::knnMatchImpl( InputArray _queryDescriptors, std::vector<std::vector<DMatch> >& matches, int knn, in knnMatchImpl() argument
755 if(knn == 1) in knnMatchImpl()
778 …if(ocl_knnMatch(_queryDescriptors, utrainDescCollection[0], matches, knn, normType, compactResult)… in knnMatchImpl()
786 …if(ocl_knnMatch(_queryDescriptors, trainDescCollection[0], matches, knn, normType, compactResult) ) in knnMatchImpl()
821 normType, knn, masks.empty() ? Mat() : masks[iIdx], update, crossCheck); in knnMatchImpl()
[all …]
/external/opencv3/doc/py_tutorials/py_ml/py_knn/py_knn_understanding/
Dpy_knn_understanding.markdown117 knn = cv2.KNearest()
118 knn.train(trainData,responses)
119 ret, results, neighbours ,dist = knn.find_nearest(newcomer, 3)
143 ret, results,neighbours,dist = knn.find_nearest(newcomer, 3)
/external/opencv3/modules/calib3d/src/
Dcirclesgrid.cpp409 const int knn = 1; in parsePatternPoints() local
410 int indicesbuf[knn] = {0}; in parsePatternPoints()
411 float distsbuf[knn] = {0.f}; in parsePatternPoints()
412 Mat indices(1, knn, CV_32S, &indicesbuf); in parsePatternPoints()
413 Mat dists(1, knn, CV_32F, &distsbuf); in parsePatternPoints()
414 flannIndex.knnSearch(query, indices, dists, knn, flann::SearchParams()); in parsePatternPoints()
/external/icu/icu4c/source/data/misc/
Dmetadata.txt632 knn{
DsupplementalData.txt4418 "knn",