Lines Matching full:neighbors
69 virtual int findNeighbors( Mat& points, Mat& neighbors ) = 0;
167 int knnSearch( Mat& points, Mat& neighbors );
168 int radiusSearch( Mat& points, Mat& neighbors );
178 int CV_FlannTest::knnSearch( Mat& points, Mat& neighbors )
180 Mat dist( points.rows, neighbors.cols, CV_32FC1);
184 index->knnSearch( points, neighbors, dist, knn, SearchParams() );
187 Mat neighbors1( neighbors.size(), CV_32SC1 );
201 if( cvtest::norm( neighbors, neighbors1, NORM_L1 ) != 0 )
207 int CV_FlannTest::radiusSearch( Mat& points, Mat& neighbors )
209 Mat dist( 1, neighbors.cols, CV_32FC1);
210 Mat neighbors1( neighbors.size(), CV_32SC1 );
219 n( 1, neighbors.cols, CV_32SC1, neighbors.ptr<int>(i) );
220 index->radiusSearch( p, n, dist, radius, neighbors.cols, SearchParams() );
227 index->radiusSearch( query, indices, dists, radius, neighbors.cols, SearchParams() );
233 if( cvtest::norm( neighbors, neighbors1, NORM_L1 ) != 0 )
251 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }
261 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return radiusSearch( points, neighbors ); }
271 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return radiusSearch( points, neighbors ); }
281 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }
291 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }
300 virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }
