HomeSort by relevance Sort by last modified time
    Searched defs:DistanceType (Results 1 - 15 of 15) sorted by null

  /external/opencv3/modules/flann/include/opencv2/flann/
ground_truth.h 45 typedef typename Distance::ResultType DistanceType;
49 std::vector<DistanceType> dists(n);
56 DistanceType tmp = distance(dataset[i], query, dataset.cols);
nn_index.h 49 typedef typename Distance::ResultType DistanceType;
68 virtual void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams& params)
77 KNNResultSet<DistanceType> resultSet(knn);
83 KNNUniqueResultSet<DistanceType> resultSet(knn);
102 virtual int radiusSearch(const Matrix<ElementType>& query, Matrix<int>& indices, Matrix<DistanceType>& dists, float radius, const SearchParams& params)
113 DistanceType* dists_ptr = NULL;
120 RadiusUniqueResultSet<DistanceType> resultSet((DistanceType)radius);
172 virtual void findNeighbors(ResultSet<DistanceType>& result, const ElementType* vec, const SearchParams& searchParams) = 0;
composite_index.h 75 typedef typename Distance::ResultType DistanceType;
175 void findNeighbors(ResultSet<DistanceType>& result, const ElementType* vec, const SearchParams& searchParams)
linear_index.h 54 typedef typename Distance::ResultType DistanceType;
106 void findNeighbors(ResultSet<DistanceType>& resultSet, const ElementType* vec, const SearchParams& /*searchParams*/)
110 DistanceType dist = distance_(data, vec, dataset_.cols);
flann_base.hpp 104 typedef typename Distance::ResultType DistanceType;
214 void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams& params)
228 int radiusSearch(const Matrix<ElementType>& query, Matrix<int>& indices, Matrix<DistanceType>& dists, float radius, const SearchParams& params)
236 void findNeighbors(ResultSet<DistanceType>& result, const ElementType* vec, const SearchParams& searchParams)
index_testing.h 67 typedef typename Distance::ResultType DistanceType;
69 DistanceType ret = 0;
71 DistanceType den = distance(inputData[groundTruth[i]], target, veclen);
72 DistanceType num = distance(inputData[neighbors[i]], target, veclen);
90 typedef typename Distance::ResultType DistanceType;
98 KNNResultSet<DistanceType> resultSet(nn+skipMatches);
102 std::vector<DistanceType> dists(nn+skipMatches);
106 DistanceType distR = 0;
141 typedef typename Distance::ResultType DistanceType;
147 DistanceType dist = 0
    [all...]
lsh_index.h 82 typedef typename Distance::ResultType DistanceType;
190 virtual void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams& params)
199 KNNUniqueResultSet<DistanceType> resultSet(knn);
203 std::fill_n(dists[i], knn, std::numeric_limits<DistanceType>::max());
220 void findNeighbors(ResultSet<DistanceType>& result, const ElementType* vec, const SearchParams& /*searchParams*/)
284 DistanceType hamming_distance;
322 DistanceType hamming_distance;
339 void getNeighbors(const ElementType* vec, ResultSet<DistanceType>& result)
355 DistanceType hamming_distance;
autotuned_index.h 74 typedef typename Distance::ResultType DistanceType;
151 virtual void findNeighbors(ResultSet<DistanceType>& result, const ElementType* vec, const SearchParams& searchParams)
hierarchical_clustering_index.h 84 typedef typename Distance::ResultType DistanceType;
127 DistanceType sq = distance(dataset[centers[index]], dataset[centers[j]], dataset.cols);
162 DistanceType best_val = 0;
164 DistanceType dist = distance(dataset[centers[0]],dataset[dsindices[j]],dataset.cols);
166 DistanceType tmp_dist = distance(dataset[centers[i]],dataset[dsindices[j]],dataset.cols);
205 DistanceType* closestDistSq = new DistanceType[n];
243 DistanceType dist = distance(dataset[dsindices[i]], dataset[dsindices[index]], dataset.cols);
258 DistanceType dist = distance(dataset[dsindices[i]], dataset[dsindices[bestNewIndex]], dataset.cols);
292 DistanceType* closestDistSq = new DistanceType[n]
    [all...]
kdtree_index.h 74 typedef typename Distance::ResultType DistanceType;
100 mean_ = new DistanceType[veclen_];
101 var_ = new DistanceType[veclen_];
199 void findNeighbors(ResultSet<DistanceType>& result, const ElementType* vec, const SearchParams& searchParams)
230 DistanceType divval;
237 typedef BranchStruct<NodePtr, DistanceType> BranchSt;
288 DistanceType cutval;
306 void meanSplit(int* ind, int count, int& index, int& cutfeat, DistanceType& cutval)
308 memset(mean_,0,veclen_*sizeof(DistanceType));
309 memset(var_,0,veclen_*sizeof(DistanceType));
    [all...]
kdtree_single_index.h 74 typedef typename Distance::ResultType DistanceType;
212 void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams& params)
220 KNNSimpleResultSet<DistanceType> resultSet(knn);
241 void findNeighbors(ResultSet<DistanceType>& result, const ElementType* vec, const SearchParams& searchParams)
245 std::vector<DistanceType> dists(dim_,0);
246 DistanceType distsq = computeInitialDistances(vec, dists);
267 DistanceType divlow, divhigh;
278 DistanceType low, high;
283 typedef BranchStruct<NodePtr, DistanceType> BranchSt;
318 bbox[i].low = (DistanceType)dataset_[0][i]
    [all...]
kmeans_index.h 84 typedef typename Distance::ResultType DistanceType;
126 DistanceType sq = distance_(dataset_[centers[index]], dataset_[centers[j]], dataset_.cols);
161 DistanceType best_val = 0;
163 DistanceType dist = distance_(dataset_[centers[0]],dataset_[indices[j]],dataset_.cols);
165 DistanceType tmp_dist = distance_(dataset_[centers[i]],dataset_[indices[j]],dataset_.cols);
204 DistanceType* closestDistSq = new DistanceType[n];
240 DistanceType dist = distance_(dataset_[indices[i]], dataset_[indices[index]], dataset_.cols);
255 DistanceType dist = distance_(dataset_[indices[i]], dataset_[indices[bestNewIndex]], dataset_.cols);
279 int* _count, int* _belongs_to, std::vector<DistanceType>& _radiuses, bool& _converged, cv::Mutex& _mtx
    [all...]
  /external/opencv3/modules/flann/include/opencv2/
flann.hpp 112 typedef typename Distance::ResultType DistanceType;
217 std::vector<DistanceType>& dists, int knn, const ::cvflann::SearchParams& params);
221 std::vector<DistanceType>& dists, DistanceType radius, const ::cvflann::SearchParams& params);
223 DistanceType radius, 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)
275 ::cvflann::Matrix<DistanceType> m_dists(&dists[0], 1, dists.size());
294 CV_Assert(dists.type() == CvType<DistanceType>::type());
296 ::cvflann::Matrix<DistanceType> m_dists((DistanceType*)dists.ptr<DistanceType>(0), dists.rows, dists.cols)
    [all...]
  /external/opencv3/modules/features2d/test/
test_descriptors_regression.cpp 101 typedef typename Distance::ResultType DistanceType;
103 CV_DescriptorExtractorTest( const string _name, DistanceType _maxDist, const Ptr<DescriptorExtractor>& _dextractor,
125 DistanceType curMaxDist = std::numeric_limits<DistanceType>::min();
128 DistanceType dist = distance( validDescriptors.ptr<ValueType>(y), calcDescriptors.ptr<ValueType>(y), dimension );
300 const DistanceType maxDist;
316 (CV_DescriptorExtractorTest<Hamming>::DistanceType)2.f,
326 (CV_DescriptorExtractorTest<Hamming>::DistanceType)25.f,
328 (CV_DescriptorExtractorTest<Hamming>::DistanceType)12.f,
345 (CV_DescriptorExtractorTest<Hamming>::DistanceType)12.f
    [all...]
  /external/opencv3/modules/flann/src/
miniflann.cpp 466 typedef typename Distance::ResultType DistanceType;
468 int dtype = DataType<DistanceType>::type;
474 ::cvflann::Matrix<DistanceType> _dists(dists.ptr<DistanceType>(), dists.rows, dists.cols);
492 typedef typename Distance::ResultType DistanceType;
494 int dtype = DataType<DistanceType>::type;
500 ::cvflann::Matrix<DistanceType> _dists(dists.ptr<DistanceType>(), dists.rows, dists.cols);

Completed in 682 milliseconds