Searched defs:knn (Results 1 - 15 of 15) sorted by relevance

/external/opencv3/modules/flann/include/opencv2/flann/
H A Dnn_index.h65 * \param[in] knn Number of nearest neighbors to return
68 virtual void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams& params) argument
73 assert(int(indices.cols) >= knn);
74 assert(int(dists.cols) >= knn);
77 KNNResultSet<DistanceType> resultSet(knn);
83 KNNUniqueResultSet<DistanceType> resultSet(knn);
87 if (get_param(params,"sorted",true)) resultSet.sortAndCopy(indices[i], dists[i], knn);
88 else resultSet.copy(indices[i], dists[i], knn);
H A Dflann_base.hpp211 * \param[in] knn Number of nearest neighbors to return
214 void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams& params) argument
216 nnIndex_->knnSearch(queries, indices, dists, knn, params);
H A Dlsh_index.h187 * \param[in] knn Number of nearest neighbors to return
190 virtual void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams& params) argument
195 assert(int(indices.cols) >= knn);
196 assert(int(dists.cols) >= knn);
199 KNNUniqueResultSet<DistanceType> resultSet(knn);
202 std::fill_n(indices[i], knn, -1);
203 std::fill_n(dists[i], knn, std::numeric_limits<DistanceType>::max());
205 if (get_param(params,"sorted",true)) resultSet.sortAndCopy(indices[i], dists[i], knn);
206 else resultSet.copy(indices[i], dists[i], knn);
H A Dkdtree_single_index.h209 * \param[in] knn Number of nearest neighbors to return
212 void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams& params) argument
217 assert(int(indices.cols) >= knn);
218 assert(int(dists.cols) >= knn);
220 KNNSimpleResultSet<DistanceType> resultSet(knn);
/external/opencv3/samples/tapi/
H A Dbgfg_segm.cpp22 "{ t type | mog2 | method's type (knn, mog2) }"
62 Ptr<BackgroundSubtractorKNN> knn = createBackgroundSubtractorKNN(); local
68 knn->apply(frame, fgmask);
90 knn->apply(frame, fgmask);
/external/opencv3/modules/features2d/test/ocl/
H A Dtest_brute_force_matcher.cpp144 const int knn = 2; local
149 matcher.knnMatch(uquery, utrain, matches, knn);
156 if ((int)matches[i].size() != knn)
161 for (int k = 0; k < knn; k++)
/external/opencv3/modules/features2d/perf/
H A Dperf_batchDistance.cpp32 int knn = isCrossCheck ? 1 : 0; local
44 normType, knn, Mat(), 0, isCrossCheck);
59 int knn = isCrossCheck ? 1 : 0; local
71 normType, knn, Mat(), 0, isCrossCheck);
86 int knn = isCrossCheck ? 1 : 0; local
99 NORM_L2, knn, Mat(), 0, isCrossCheck);
114 int knn = isCrossCheck ? 1 : 0; local
127 normType, knn, Mat(), 0, isCrossCheck);
/external/opencv3/modules/cudafeatures2d/test/
H A Dtest_features2d.cpp374 const int knn = 2; local
384 matcher->knnMatch(loadMat(query), loadMat(train), matches, knn, mask); local
391 if ((int)matches[i].size() != knn)
396 for (int k = 0; k < knn; k++)
414 const int knn = 3; local
424 matcher->knnMatch(loadMat(query), loadMat(train), matches, knn, mask); local
431 if ((int)matches[i].size() != knn)
436 for (int k = 0; k < knn; k++)
454 const int knn = 2; local
474 matcher->knnMatch(cv::cuda::GpuMat(query), matches, knn, mask local
476 matcher->knnMatch(cv::cuda::GpuMat(query), matches, knn); local
517 const int knn = 3; local
537 matcher->knnMatch(cv::cuda::GpuMat(query), matches, knn, masks); local
539 matcher->knnMatch(cv::cuda::GpuMat(query), matches, knn); local
[all...]
/external/opencv3/modules/features2d/test/
H A Dtest_matchers_algorithmic.cpp310 const int knn = 3; local
313 dmatcher->knnMatch( query, train, matches, knn );
325 if( (int)matches[i].size() != knn )
330 for( int k = 0; k < knn; k++ )
350 const int knn = 2; local
364 dmatcher->knnMatch( query, matches, knn, masks );
377 if( (int)matches[i].size() != knn )
382 for( int k = 0; k < knn; k++ )
H A Dtest_nearestneighbors.cpp181 int knn = 1, j; local
184 index->knnSearch( points, neighbors, dist, knn, SearchParams() );
194 index->knnSearch( query, indices, dists, knn, SearchParams() );
/external/opencv3/modules/flann/include/opencv2/
H A Dflann.hpp210 at least knn size.
212 at least knn size.
213 @param knn Number of nearest neighbors to search for.
217 std::vector<DistanceType>& dists, int knn, const ::cvflann::SearchParams& params);
218 void knnSearch(const Mat& queries, Mat& indices, Mat& dists, int knn, const ::cvflann::SearchParams& params);
271 void GenericIndex<Distance>::knnSearch(const std::vector<ElementType>& query, std::vector<int>& indices, std::vector<DistanceType>& dists, int knn, const ::cvflann::SearchParams& searchParams) argument
279 nnIndex->knnSearch(m_query,m_indices,m_dists,knn,searchParams);
284 void GenericIndex<Distance>::knnSearch(const Mat& queries, Mat& indices, Mat& dists, int knn, const ::cvflann::SearchParams& searchParams) argument
300 nnIndex->knnSearch(m_queries,m_indices,m_dists,knn, searchParams);
354 void knnSearch(const std::vector<ElementType>& query, std::vector<int>& indices, std::vector<DistanceType>& dists, int knn, cons
438 knnSearch(const std::vector<ElementType>& query, std::vector<int>& indices, std::vector<DistanceType>& dists, int knn, const ::cvflann::SearchParams& searchParams) argument
450 knnSearch(const Mat& queries, Mat& indices, Mat& dists, int knn, const ::cvflann::SearchParams& searchParams) argument
[all...]
/external/opencv3/samples/cpp/
H A Dpoints_classifier.cpp116 Ptr<KNearest> knn = KNearest::create(); local
117 knn->setDefaultK(K);
118 knn->setIsClassifier(true);
119 knn->train(prepare_train_data());
120 predict_and_paint(knn, imgDst);
/external/opencv3/modules/flann/src/
H A Dminiflann.cpp463 int knn, const SearchParams& params)
476 ((IndexType*)index)->knnSearch(_query, _indices, _dists, knn,
482 int knn, const SearchParams& params)
484 runKnnSearch_<Distance, ::cvflann::Index<Distance> >(index, query, indices, dists, knn, params);
552 OutputArray _dists, int knn, const SearchParams& params)
557 createIndicesDists( _indices, _dists, indices, dists, query.rows, knn, knn, dtype );
562 runKnnSearch<HammingDistance>(index, query, indices, dists, knn, params);
565 runKnnSearch< ::cvflann::L2<float> >(index, query, indices, dists, knn, params);
568 runKnnSearch< ::cvflann::L1<float> >(index, query, indices, dists, knn, param
462 runKnnSearch_(void* index, const Mat& query, Mat& indices, Mat& dists, int knn, const SearchParams& params) argument
481 runKnnSearch(void* index, const Mat& query, Mat& indices, Mat& dists, int knn, const SearchParams& params) argument
551 knnSearch(InputArray _query, OutputArray _indices, OutputArray _dists, int knn, const SearchParams& params) argument
[all...]
/external/opencv3/modules/calib3d/src/
H A Dcirclesgrid.cpp409 const int knn = 1; local
410 int indicesbuf[knn] = {0};
411 float distsbuf[knn] = {0.f};
412 Mat indices(1, knn, CV_32S, &indicesbuf);
413 Mat dists(1, knn, CV_32F, &distsbuf);
414 flannIndex.knnSearch(query, indices, dists, knn, flann::SearchParams());
/external/opencv3/modules/features2d/src/
H A Dmatchers.cpp572 std::vector<std::vector<DMatch> >& matches, int knn,
577 tempMatcher->knnMatch( queryDescriptors, matches, knn, std::vector<Mat>(1, mask.getMat()), compactResult );
619 void DescriptorMatcher::knnMatch( InputArray queryDescriptors, std::vector<std::vector<DMatch> >& matches, int knn, argument
625 CV_Assert( knn > 0 );
630 knnMatchImpl( queryDescriptors, matches, knn, masks, compactResult );
718 void BFMatcher::knnMatchImpl( InputArray _queryDescriptors, std::vector<std::vector<DMatch> >& matches, int knn, argument
755 if(knn == 1)
778 if(ocl_knnMatch(_queryDescriptors, utrainDescCollection[0], matches, knn, normType, compactResult) )
786 if(ocl_knnMatch(_queryDescriptors, trainDescCollection[0], matches, knn, normType, compactResult) )
821 normType, knn, mask
[all...]

Completed in 472 milliseconds