Home
last modified time | relevance | path

Searched refs:neighbors (Results 1 – 25 of 40) sorted by relevance

12

/external/ceres-solver/internal/ceres/
Dparameter_block_ordering_test.cc96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]); in TEST_F() local
97 EXPECT_EQ(neighbors.size(), 2); in TEST_F()
98 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end()); in TEST_F()
99 EXPECT_TRUE(neighbors.find(parameter_blocks[3]) != neighbors.end()); in TEST_F()
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); in TEST_F() local
104 EXPECT_EQ(neighbors.size(), 1); in TEST_F()
105 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end()); in TEST_F()
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); in TEST_F() local
110 EXPECT_EQ(neighbors.size(), 3); in TEST_F()
111 EXPECT_TRUE(neighbors.find(parameter_blocks[0]) != neighbors.end()); in TEST_F()
[all …]
Dgraph_algorithms_test.cc139 const HashSet<int>& neighbors = forest->Neighbors(0); in TEST() local
140 EXPECT_EQ(neighbors.size(), 2); in TEST()
141 EXPECT_TRUE(neighbors.find(4) != neighbors.end()); in TEST()
142 EXPECT_TRUE(neighbors.find(3) != neighbors.end()); in TEST()
146 const HashSet<int>& neighbors = forest->Neighbors(3); in TEST() local
147 EXPECT_EQ(neighbors.size(), 1); in TEST()
148 EXPECT_TRUE(neighbors.find(0) != neighbors.end()); in TEST()
152 const HashSet<int>& neighbors = forest->Neighbors(4); in TEST() local
153 EXPECT_EQ(neighbors.size(), 1); in TEST()
154 EXPECT_TRUE(neighbors.find(0) != neighbors.end()); in TEST()
[all …]
Dgraph_algorithms.h134 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); in IndependentSetOrdering() local
135 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin(); in IndependentSetOrdering()
136 it != neighbors.end(); in IndependentSetOrdering()
209 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); in StableIndependentSetOrdering() local
210 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin(); in StableIndependentSetOrdering()
211 it != neighbors.end(); in StableIndependentSetOrdering()
295 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1); in Degree2MaximumSpanningForest() local
296 for (typename HashSet<Vertex>::const_iterator it2 = neighbors.begin(); in Degree2MaximumSpanningForest()
297 it2 != neighbors.end(); in Degree2MaximumSpanningForest()
Dcanonical_views_clustering.cc171 const IntSet& neighbors = graph_->Neighbors(candidate); in ComputeClusteringQualityDifference() local
172 for (IntSet::const_iterator neighbor = neighbors.begin(); in ComputeClusteringQualityDifference()
173 neighbor != neighbors.end(); in ComputeClusteringQualityDifference()
198 const IntSet& neighbors = graph_->Neighbors(canonical_view); in UpdateCanonicalViewAssignments() local
199 for (IntSet::const_iterator neighbor = neighbors.begin(); in UpdateCanonicalViewAssignments()
200 neighbor != neighbors.end(); in UpdateCanonicalViewAssignments()
Dsingle_linkage_clustering.cc63 const HashSet<int>& neighbors = graph.Neighbors(vertex1); in ComputeSingleLinkageClustering() local
64 for (HashSet<int>::const_iterator it2 = neighbors.begin(); in ComputeSingleLinkageClustering()
65 it2 != neighbors.end(); in ComputeSingleLinkageClustering()
Dvisibility_based_preconditioner.cc514 const HashSet<int>& neighbors = forest.Neighbors(cluster1); in ForestToClusterPairs() local
515 for (HashSet<int>::const_iterator it2 = neighbors.begin(); in ForestToClusterPairs()
516 it2 != neighbors.end(); in ForestToClusterPairs()
/external/opencv3/modules/features2d/test/
Dtest_nearestneighbors.cpp69 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 ) in knnSearch() argument
180 Mat dist( points.rows, neighbors.cols, CV_32FC1); in knnSearch()
184 index->knnSearch( points, neighbors, dist, knn, SearchParams() ); in knnSearch()
187 Mat neighbors1( neighbors.size(), CV_32SC1 ); in knnSearch()
201 if( cvtest::norm( neighbors, neighbors1, NORM_L1 ) != 0 ) in knnSearch()
207 int CV_FlannTest::radiusSearch( Mat& points, Mat& neighbors ) in radiusSearch() argument
209 Mat dist( 1, neighbors.cols, CV_32FC1); in radiusSearch()
[all …]
/external/opencv3/modules/calib3d/src/
Dcalibinit.cpp115 struct CvCBCorner* neighbors[4]; // Neighbor corners member
123 if( neighbors[i] ) in meanDist()
125 float dx = neighbors[i]->pt.x - pt.x; in meanDist()
126 float dy = neighbors[i]->pt.y - pt.y; in meanDist()
149 struct CvCBQuad *neighbors[4]; // Pointers of quad neighbors member
677 CvCBQuad *neighbor = q->neighbors[i]; in icvOrderFoundConnectedQuads()
785 CvCBQuad *neighbor = quads[i]->neighbors[j]; in icvOrderFoundConnectedQuads()
832 if (quads[i]->neighbors[j] && quads[i]->neighbors[j]->ordered) in icvOrderFoundConnectedQuads()
864 if (!quad->neighbors[i]) // ok, create and add neighbor in icvAddOuterQuad()
875 quad->neighbors[i] = q; in icvAddOuterQuad()
[all …]
Dcirclesgrid.cpp454 vertices[id1].neighbors.insert(id2); in addEdge()
455 vertices[id2].neighbors.insert(id1); in addEdge()
463 vertices[id1].neighbors.erase(id2); in removeEdge()
464 vertices[id2].neighbors.erase(id1); in removeEdge()
473 return it->second.neighbors.find(id2) != it->second.neighbors.end(); in areVerticesAdjacent()
486 return it->second.neighbors.size(); in getDegree()
499 …for (Neighbors::const_iterator it2 = it1->second.neighbors.begin(); it2 != it1->second.neighbors.e… in floydWarshall()
533 return it->second.neighbors; in getNeighbors()
/external/opencv/cv/src/
Dcvcalibinit.cpp104 struct CvCBCorner* neighbors[4]; // Neighbor corners member
120 struct CvCBQuad *neighbors[4]; // Pointers of quad neighbors member
597 CvCBQuad *neighbor = q->neighbors[i]; in icvOrderFoundConnectedQuads()
707 CvCBQuad *neighbor = quads[i]->neighbors[j]; in icvOrderFoundConnectedQuads()
754 if (quads[i]->neighbors[j] && quads[i]->neighbors[j]->ordered) in icvOrderFoundConnectedQuads()
786 if (!quad->neighbors[i]) // ok, create and add neighbor in icvAddOuterQuad()
797 quad->neighbors[i] = q; in icvAddOuterQuad()
799 q->neighbors[j] = quad; in icvAddOuterQuad()
825 if (quad->neighbors[(i+3)%4] && in icvAddOuterQuad()
826 quad->neighbors[(i+3)%4]->ordered && in icvAddOuterQuad()
[all …]
Dcvsnakes.cpp82 int neighbors = win.height * win.width; in icvSnake8uC1R() local
162 Econt = (float *) cvAlloc( neighbors * sizeof( float )); in icvSnake8uC1R()
163 Ecurv = (float *) cvAlloc( neighbors * sizeof( float )); in icvSnake8uC1R()
164 Eimg = (float *) cvAlloc( neighbors * sizeof( float )); in icvSnake8uC1R()
165 E = (float *) cvAlloc( neighbors * sizeof( float )); in icvSnake8uC1R()
238 for( k = 0; k < neighbors; k++ ) in icvSnake8uC1R()
276 for( k = 0; k < neighbors; k++ ) in icvSnake8uC1R()
341 for( k = 0; k < neighbors; k++ ) in icvSnake8uC1R()
361 for( k = 0; k < neighbors; k++ ) in icvSnake8uC1R()
DmycvHaarDetectObjects.cpp1313 comps[idx].neighbors++; in mycvHaarDetectObjects()
1323 int n = comps[i].neighbors; in mycvHaarDetectObjects()
1331 comp.neighbors = n; in mycvHaarDetectObjects()
1349 comps[idx].neighbors++; in mycvHaarDetectObjects()
1361 int n = comps[i].neighbors; in mycvHaarDetectObjects()
1391 comp.neighbors = n; in mycvHaarDetectObjects()
1412 result_comp.neighbors = bseq == seq ? 1 : comp->neighbors; in mycvHaarDetectObjects()
1452 comp.neighbors = 1; in mycvHaarDetectObjects()
1475 comps[idx].neighbors++; in mycvHaarDetectObjects()
1486 int n = comps[i].neighbors; in mycvHaarDetectObjects()
[all …]
Dcvhaar.cpp1281 comps[idx].neighbors++; in cvHaarDetectObjects()
1291 int n = comps[i].neighbors; in cvHaarDetectObjects()
1299 comp.neighbors = n; in cvHaarDetectObjects()
1317 comps[idx].neighbors++; in cvHaarDetectObjects()
1329 int n = comps[i].neighbors; in cvHaarDetectObjects()
1359 comp.neighbors = n; in cvHaarDetectObjects()
1380 result_comp.neighbors = bseq == seq ? 1 : comp->neighbors; in cvHaarDetectObjects()
1416 comp.neighbors = 1; in cvHaarDetectObjects()
1439 comps[idx].neighbors++; in cvHaarDetectObjects()
1450 int n = comps[i].neighbors; in cvHaarDetectObjects()
[all …]
/external/libvpx/libvpx/vp8/decoder/
Derror_concealment.c433 EC_BLOCK *neighbors, in find_neighboring_blocks() argument
444 assign_neighbor(&neighbors[i], mi - mi_stride - 1, 15); in find_neighboring_blocks()
448 assign_neighbor(&neighbors[i], mi - mi_stride, j); in find_neighboring_blocks()
456 assign_neighbor(&neighbors[i], mi - mi_stride + 1, 12); in find_neighboring_blocks()
460 assign_neighbor(&neighbors[i], mi + 1, j); in find_neighboring_blocks()
468 assign_neighbor(&neighbors[i], mi + mi_stride + 1, 0); in find_neighboring_blocks()
472 assign_neighbor(&neighbors[i], mi + mi_stride, j); in find_neighboring_blocks()
480 assign_neighbor(&neighbors[i], mi + mi_stride - 1, 4); in find_neighboring_blocks()
485 assign_neighbor(&neighbors[i], mi - 1, j); in find_neighboring_blocks()
497 EC_BLOCK *neighbors, in interpolate_mvs() argument
[all …]
/external/libvpx/libvpx/vp9/common/
Dvp9_scan.h29 const int16_t *neighbors; member
35 static INLINE int get_coef_context(const int16_t *neighbors, in get_coef_context() argument
37 return (1 + token_cache[neighbors[MAX_NEIGHBORS * c + 0]] + in get_coef_context()
38 token_cache[neighbors[MAX_NEIGHBORS * c + 1]]) >> 1; in get_coef_context()
/external/opencv3/modules/flann/include/opencv2/flann/
Dindex_testing.h48 inline int countCorrectMatches(int* neighbors, int* groundTruth, int n) in countCorrectMatches() argument
53 if (neighbors[i]==groundTruth[k]) { in countCorrectMatches()
65 … int* neighbors, int* groundTruth, int veclen, int n, const Distance& distance) in computeDistanceRaport() argument
72 DistanceType num = distance(inputData[neighbors[i]], target, veclen); in computeDistanceRaport()
103 int* neighbors = &indices[skipMatches]; in search_with_ground_truth() local
118 correct += countCorrectMatches(neighbors,matches[i], nn); in search_with_ground_truth()
119 …distR += computeDistanceRaport<Distance>(inputData, testData[i], neighbors, matches[i], (int)testD… in search_with_ground_truth()
/external/libvpx/libvpx/vp8/encoder/
Dmcomp.c869 MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}} ; in vp8_hex_search() local
1009 this_mv.as_mv.row = br + neighbors[i].row; in vp8_hex_search()
1010 this_mv.as_mv.col = bc + neighbors[i].col; in vp8_hex_search()
1019 this_mv.as_mv.row = br + neighbors[i].row; in vp8_hex_search()
1020 this_mv.as_mv.col = bc + neighbors[i].col; in vp8_hex_search()
1032 br += neighbors[best_site].row; in vp8_hex_search()
1033 bc += neighbors[best_site].col; in vp8_hex_search()
1734 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}}; in vp8_refining_search_sad_c() local
1767 this_row_offset = ref_mv->as_mv.row + neighbors[j].row; in vp8_refining_search_sad_c()
1768 this_col_offset = ref_mv->as_mv.col + neighbors[j].col; in vp8_refining_search_sad_c()
[all …]
/external/opencv3/modules/ml/src/
Dkdtree.hpp70 OutputArray neighbors = noArray(),
77 OutputArray neighbors = noArray(),
/external/libvpx/libvpx/vp9/encoder/
Dvp9_mcomp.c832 static const MV neighbors[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; in calc_int_cost_list() local
850 const MV this_mv = {br + neighbors[i].row, in calc_int_cost_list()
851 bc + neighbors[i].col}; in calc_int_cost_list()
861 const MV this_mv = {br + neighbors[i].row, in calc_int_cost_list()
862 bc + neighbors[i].col}; in calc_int_cost_list()
1301 static const MV neighbors[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; in vp9_pattern_search_sad() local
1306 const MV this_mv = { br + neighbors[i].row, in vp9_pattern_search_sad()
1307 bc + neighbors[i].col }; in vp9_pattern_search_sad()
1314 const MV this_mv = {br + neighbors[i].row, in vp9_pattern_search_sad()
1315 bc + neighbors[i].col}; in vp9_pattern_search_sad()
[all …]
/external/mesa3d/src/gallium/auxiliary/gallivm/
Dlp_bld_sample_soa.c694 LLVMValueRef neighbors[2][2][4]; in lp_build_sample_image_linear() local
759 data_ptr, neighbors[0][0]); in lp_build_sample_image_linear()
764 data_ptr, neighbors[0][1]); in lp_build_sample_image_linear()
770 neighbors[0][0][chan], in lp_build_sample_image_linear()
771 neighbors[0][1][chan]); in lp_build_sample_image_linear()
783 data_ptr, neighbors[1][0]); in lp_build_sample_image_linear()
788 data_ptr, neighbors[1][1]); in lp_build_sample_image_linear()
794 neighbors[0][0][chan], in lp_build_sample_image_linear()
795 neighbors[0][1][chan], in lp_build_sample_image_linear()
796 neighbors[1][0][chan], in lp_build_sample_image_linear()
[all …]
/external/opencv3/modules/videostab/src/
Dinpainting.cpp339 std::priority_queue<std::pair<float,int> > neighbors; in inpaint() local
350 neighbors.push(std::make_pair(-err, idx + i)); in inpaint()
366 while (!neighbors.empty()) in inpaint()
368 int neighbor = neighbors.top().second; in inpaint()
369 neighbors.pop(); in inpaint()
/external/opencv/ml/src/
Dmlknearest.cpp151 float* neighbor_responses, const float** neighbors, float* dist ) const in find_neighbors_direct() argument
193 nn = neighbors ? neighbors + (start + i)*k : 0; in find_neighbors_direct()
/external/opencv3/modules/objdetect/include/opencv2/objdetect/
Dobjdetect_c.h120 int neighbors; member
/external/opencv3/doc/tutorials/imgproc/gausian_median_blur_bilateral_filter/
Dgausian_median_blur_bilateral_filter.markdown40 - This filter is the simplest of all! Each output pixel is the *mean* of its kernel neighbors (
62 biggest weight. The weight of its neighbors decreases as the spatial distance between them and
225 … - *Size(w, h)*: The size of the kernel to be used (the neighbors to be considered). \f$w\f$ and
/external/opencv/cv/include/
Dcvtypes.h378 int neighbors; member

12