Home
last modified time | relevance | path

Searched refs:edgels (Results 1 – 25 of 39) sorted by relevance

12

/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/sdet/
H A Dsdet_sel_base.cxx1651 sub_chain->edgels.push_back(chain->edgels[j]); in post_process_to_break_contours()
2485 if (c1->edgels.size()>c2->edgels.size()){ in is_longer()
2527 std::reverse(c2->edgels.begin(), c2->edgels.end()); in correct_CFG_topology()
2548 std::reverse(c1->edgels.begin(), c1->edgels.end()); in correct_CFG_topology()
2560 if(c1->edgels.front()==c1->edgels.back()) in correct_CFG_topology()
2681 e1 = c1->edgels[c1->edgels.size()-5]; in get_continuity()
2705 if((c1->edgels.front()==c2->edgels.front()&&c1->edgels.back()==c2->edgels.back()) in share_same_ends()
2706 || (c1->edgels.front()==c2->edgels.back()&&c1->edgels.back()==c2->edgels.front())) in share_same_ends()
2721 if(c1->edgels.size()==4 && (c1->edgels.front()==c1->edgels.back())) in regular_contour_filter()
3015 end->edgels.push_back(new_chain5->edgels.back()); in Construct_Hypothesis_Tree()
[all …]
H A Dsdet_edgel.h101 sdet_edgel_list edgels;
105 sdet_edgel_chain(): edgels(0), temp(false){} in sdet_edgel_chain()
110 edgels(chain.edgels.size()), temp(false) in sdet_edgel_chain()
112 for (unsigned i=0; i<chain.edgels.size(); i++) in sdet_edgel_chain()
113 edgels[i] = chain.edgels[i]; in sdet_edgel_chain()
122 sdet_edgel_list_iter lit = n_chain->edgels.begin(); in merge()
123 for(;lit!=n_chain->edgels.end();lit++){ in merge()
124 if ((*lit)==edgels.back()) in merge()
128 edgels.push_back(*lit); in merge()
135 edgels.push_back(i); in append()
[all …]
H A Dsdet_edgemap.h57 std::vector<sdet_edgel*> edgels; variable
63 sdet_edgemap(int width, int height) : edgels(0) { edge_cells.resize(height, width); } in sdet_edgemap()
66 sdet_edgemap(int width, int height, std::vector<sdet_edgel*>& edgels) : edgels(0) in sdet_edgemap() argument
69 for (auto & edgel : edgels) in sdet_edgemap()
85 edgels.clear(); in ~sdet_edgemap()
93 unsigned num_edgels() const { return edgels.size(); } ///< number of edgels in the edgemap in num_edgels()
102 e->id = edgels.size(); //assign unique id in insert()
105 edgels.push_back(e); in insert()
H A Dsdet_curve_fragment_graph.h89 sdet_edgel* e1 = chain->edgels.front(); in insert_fragment()
90 sdet_edgel* e2 = chain->edgels.back(); in insert_fragment()
101 sdet_edgel* e1 = chain->edgels.front(); in remove_fragment()
102 sdet_edgel* e2 = chain->edgels.back(); in remove_fragment()
115 sdet_edgel* e1 = chain->edgels.front(); in extract_fragment()
116 sdet_edgel* e2 = chain->edgels.back(); in extract_fragment()
H A Dsdet_contour.cxx200 vertexMap = new vbl_array_2d<vtol_vertex_2d_sptr>(edgels.GetSizeX(), edgels.GetSizeY()); in FindNetwork()
202 edgeMap = new vbl_array_2d<vtol_edge_2d_sptr>(edgels.GetSizeX(), edgels.GetSizeY()); in FindNetwork()
282 floatPixel(edgels, i, j) = -1; in RecordPixel()
388 const int xmax = edgels.GetSizeX()-rmax-1; in FindChains()
389 const int ymax = edgels.GetSizeY()-rmax-1; in FindChains()
404 floatPixel(edgels, i, j) = 0; in FindChains()
412 if (NextPixel(x, y, edgels)) in FindChains()
425 floatPixel(edgels, ii, jj) = 0; in FindChains()
450 while (NextPixel(x, y, edgels)) in FindChains()
564 floatPixel(edgels, i, j) = - floatPixel(edgels, i, j); in FindChains()
[all …]
H A Dsdet_contour.h95 bool FindNetwork(gevd_bufferxy& edgels, bool junctionp,
140 int FindChains(gevd_bufferxy& edgels,
146 int FindJunctions(gevd_bufferxy& edgels,
164 const gevd_bufferxy& edgels);
H A Dsdet_third_order_edge_det.h34 std::vector<vdgl_edgel>& edgels() { return edgels_; } in edgels() function
39 …scii(const std::string& filename, unsigned ni, unsigned nj, const std::vector<vdgl_edgel>& edgels);
H A Dsdet_detector.h115 std::vector<vtol_edge_2d_sptr >& edgels);
118 std::vector<vtol_edge_2d_sptr >& edgels);
/dports/graphics/vigra/vigra-8acd73a/vigranumpy/src/core/
H A Dedgedetection.cxx93 std::vector<Edgel> edgels; in pythonFindEdgelsFromGrad() local
102 if(edgels[i].strength >= threshold) in pythonFindEdgelsFromGrad()
103 pyEdgels.append(edgels[i]); in pythonFindEdgelsFromGrad()
113 std::vector<Edgel> edgels; in pythonFindEdgels() local
122 if(edgels[i].strength >= threshold) in pythonFindEdgels()
123 pyEdgels.append(edgels[i]); in pythonFindEdgels()
133 std::vector<Edgel> edgels; in pythonFindEdgels3x3FromGrad() local
142 if(edgels[i].strength >= threshold) in pythonFindEdgels3x3FromGrad()
143 pyEdgels.append(edgels[i]); in pythonFindEdgels3x3FromGrad()
153 std::vector<Edgel> edgels; in pythonFindEdgels3x3() local
[all …]
/dports/graphics/vigra/vigra-8acd73a/include/vigra/
H A Dedgedetection.hxx1456 edgels.push_back(edgel); in internalCannyFindEdgels()
1604 BackInsertable & edgels) in cannyEdgelList() argument
1628 BackInsertable & edgels) in cannyEdgelList() argument
1644 BackInsertable & edgels) in cannyEdgelList() argument
1646 cannyEdgelList(srcImageRange(src), edgels); in cannyEdgelList()
1954 std::vector<Edgel> edgels; in doxygen_overloaded_function() local
1963 Diff2D pix((int)(edgels[i].x + 0.5), (int)(edgels[i].y + 0.5)); in doxygen_overloaded_function()
2578 edgels.push_back(edgel); in internalCannyFindEdgels3x3()
2721 BackInsertable & edgels) in cannyEdgelList3x3() argument
2744 BackInsertable & edgels) in cannyEdgelList3x3() argument
[all …]
H A Dslanted_edge_mtf.hxx186 ArrayVector<Edgel> edgels; in prepareSlantedEdgeInput() local
187 cannyEdgelList(sul, slr, src, edgels, 2.0); in prepareSlantedEdgeInput()
188 std::sort(edgels.begin(), edgels.end(), SortEdgelsByStrength()); in prepareSlantedEdgeInput()
195 x += edgels[k].x; in prepareSlantedEdgeInput()
196 y += edgels[k].y; in prepareSlantedEdgeInput()
197 x2 += sq(edgels[k].x); in prepareSlantedEdgeInput()
198 xy += edgels[k].x*edgels[k].y; in prepareSlantedEdgeInput()
199 y2 += sq(edgels[k].y); in prepareSlantedEdgeInput()
/dports/misc/vxl/vxl-3.3.2/contrib/gel/gevd/
H A Dgevd_contour.cxx153 vertexMap = new vbl_array_2d<vtol_vertex_2d_sptr>(edgels.GetSizeX(), edgels.GetSizeY()); in FindNetwork()
155 edgeMap = new vbl_array_2d<vtol_edge_2d_sptr>(edgels.GetSizeX(), edgels.GetSizeY()); in FindNetwork()
212 floatPixel(edgels, i, j) = -floatPixel(edgels, i, j); // flip sign in RecordPixel()
299 const int xmax = edgels.GetSizeX()-rmax-1; in FindChains()
300 const int ymax = edgels.GetSizeY()-rmax-1; in FindChains()
313 floatPixel(edgels, i, j) = 0; in FindChains()
322 if (NextPixel(x, y, edgels)) in FindChains()
335 floatPixel(edgels, ii, jj) = 0; in FindChains()
409 floatPixel(edgels, i, j) = - floatPixel(edgels, i, j); in FindChains()
471 maxpix = floatPixel(edgels, x, y); in DetectJunction()
[all …]
H A Dgevd_region_proc.cxx175 std::vector<vtol_edge_2d_sptr> * edgels = detector.GetEdges(); in extract_regions() local
177 if (edgels->empty()) { in extract_regions()
183 std::vector<vtol_edge_2d_sptr>::iterator eit; = edgels.begin(); in extract_regions()
184 for (eit = edgels->begin(); eit != edgels->end(); eit++) in extract_regions()
192 det.DoBreakCorners(edgels, broken_edgels); in extract_regions()
197 cl.DoCleanEdgelChains(*edgels, clean_edgels); in extract_regions()
H A Dgevd_contour.h90 bool FindNetwork(gevd_bufferxy& edgels, // link pixels into network
112 gevd_bufferxy& edgels, // edge elements AND with mask
151 int FindChains(gevd_bufferxy& edgels, // link pixels into chains
155 int FindJunctions(gevd_bufferxy& edgels, // merge end/end and end/contour
H A Dgevd_step.h78 gevd_bufferxy*& edgels, //!< strength = dG * I
85 gevd_bufferxy& edgels, //!< from end points of contours
H A Dgevd_fold.h112 gevd_bufferxy*& edgels, //!< strength = dG * I
132 gevd_bufferxy& edgels, //!< from end points of contours
/dports/misc/vxl/vxl-3.3.2/contrib/conversions/geometry/
H A Dosl_to_vdgl.h12 std::vector<vdgl_edgel> edgels; edgels.reserve(dc.size()); in osl_to_vdgl() local
16 edgels.emplace_back(dc.x[i],dc.y[i],dc.grad[i],dc.theta[i]); in osl_to_vdgl()
18 return vdgl_digital_curve(new vdgl_interpolator_linear(new vdgl_edgel_chain(edgels))); in osl_to_vdgl()
H A DDigitalCurve_to_vdgl.h16 std::vector<vdgl_edgel> edgels; edgels.reserve(dc.length()); in DigitalCurve_to_vdgl() local
27 edgels.push_back(vdgl_edgel(dc_x[i],dc_y[i],dc_g[i],dc_t[i])); in DigitalCurve_to_vdgl()
29 return vdgl_digital_curve(new vdgl_interpolator_linear(new vdgl_edgel_chain(edgels))); in DigitalCurve_to_vdgl()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bpro/core/sdet_pro/processes/
H A Dsdet_detect_third_order_edges_process.cxx78 std::vector<vdgl_edgel> edgels = det.edgels(); in sdet_detect_third_order_edges_process() local
81 << "#edgels = " << edgels.size() << std::endl; in sdet_detect_third_order_edges_process()
83 …third_order_edge_det::save_edg_ascii(out_edg_map_path, input_image.ni(), input_image.nj(), edgels); in sdet_detect_third_order_edges_process()
91 for (auto edgel : edgels) { in sdet_detect_third_order_edges_process()
181 std::vector<vdgl_edgel> edgels = det.edgels(); in sdet_detect_third_order_edges_dt_process() local
189 for (unsigned k = 0; k < edgels.size(); k++) { in sdet_detect_third_order_edges_dt_process()
190 vdgl_edgel edgel = edgels[k]; in sdet_detect_third_order_edges_dt_process()
/dports/misc/vxl/vxl-3.3.2/contrib/oxl/osl/examples/
H A Dfit_lines.cxx19 std::list<osl_edge*> edgels; in main() local
20 osl_easy_canny(0, image, &edgels); in main()
25 fit.incremental_fit_to_list(&edgels, &fit_results); in main()
/dports/graphics/panomatic/panomatic-0.9.4/vigra/include/vigra/
H A Dslanted_edge_mtf.hxx187 ArrayVector<Edgel> edgels; in prepareSlantedEdgeInput() local
188 cannyEdgelList(sul, slr, src, edgels, 2.0); in prepareSlantedEdgeInput()
189 std::sort(edgels.begin(), edgels.end(), SortEdgelsByStrength()); in prepareSlantedEdgeInput()
196 x += edgels[k].x; in prepareSlantedEdgeInput()
197 y += edgels[k].y; in prepareSlantedEdgeInput()
198 x2 += sq(edgels[k].x); in prepareSlantedEdgeInput()
199 xy += edgels[k].x*edgels[k].y; in prepareSlantedEdgeInput()
200 y2 += sq(edgels[k].y); in prepareSlantedEdgeInput()
H A Dedgedetection.hxx1201 BackInsertable & edgels) in internalCannyFindEdgels() argument
1238 edgels.push_back(edgel); in internalCannyFindEdgels()
1351 internalCannyFindEdgels(dx, dy, tmp, edgels); in cannyEdgelList()
1357 BackInsertable & edgels, double scale) in cannyEdgelList() argument
1448 std::vector<Edgel> edgels; in cannyEdgeImage() local
1450 cannyEdgelList(sul, slr, sa, edgels, scale); in cannyEdgeImage()
1452 for(unsigned int i=0; i<edgels.size(); ++i) in cannyEdgeImage()
1454 if(gradient_threshold < edgels[i].strength) in cannyEdgeImage()
1456 Diff2D pix((int)(edgels[i].x + 0.5), (int)(edgels[i].y + 0.5)); in cannyEdgeImage()
2006 edgels.push_back(edgel); in internalCannyFindEdgels3x3()
[all …]
/dports/misc/vxl/vxl-3.3.2/contrib/gel/vtol/examples/
H A Dexample_vdgl.cxx49 std::vector<vdgl_edgel> edgels; in main() local
52 edgels.emplace_back( data[i], data[i+1], 0, 1); in main()
55 vdgl_edgel_chain_sptr edgel_chain= new vdgl_edgel_chain( edgels); in main()
/dports/graphics/vigra/vigra-8acd73a/test/simpleanalysis/
H A Dtest.cxx604 std::vector<vigra::Edgel> edgels; in cannyEdgelListTest() local
612 should(edgels[i].x == edgels[i].y); in cannyEdgelListTest()
632 std::vector<vigra::Edgel> edgels; in cannyEdgelListTest() local
636 cannyEdgelList(grad, edgels); in cannyEdgelListTest()
643 should(edgels[i].x == edgels[i].y); in cannyEdgelListTest()
657 std::vector<vigra::Edgel> edgels; in cannyNegativeThresholdTest() local
676 std::vector<vigra::Edgel> edgels; in cannyNegativeThresholdTest() local
688 std::vector<vigra::Edgel> edgels; in cannyEdgelList3x3Test() local
693 if (edgels[i].strength < 1.0e-10) in cannyEdgelList3x3Test()
696 should(edgels[i].x == edgels[i].y); in cannyEdgelList3x3Test()
[all …]
/dports/misc/vxl/vxl-3.3.2/contrib/oxl/osl/
H A Dosl_canny_rothwell.cxx307 osl_edgel_chain *edgels; in Initial_hysteresis() local
323 px = edgels->GetX(); in Initial_hysteresis()
324 py = edgels->GetY(); in Initial_hysteresis()
325 pg = edgels->GetGrad(); in Initial_hysteresis()
331 edges.push_front(edgels); in Initial_hysteresis()
339 edgels = edges.front(); edges.pop_front(); in Initial_hysteresis()
340 px = edgels->GetX(); in Initial_hysteresis()
341 py = edgels->GetY(); in Initial_hysteresis()
342 pg = edgels->GetGrad(); in Initial_hysteresis()
343 for (unsigned int i=0; i<edgels->size(); ++i) in Initial_hysteresis()
[all …]

12