Home
last modified time | relevance | path

Searched refs:rag (Results 1 – 25 of 952) sorted by relevance

12345678910>>...39

/dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/future/graph/
H A Dgraph_cut.py51 rag = rag.copy()
56 rag.remove_edges_from(to_remove)
136 rag = rag.copy()
138 for node in rag.nodes():
151 def partition_by_cut(cut, rag): argument
180 sub1 = rag.subgraph(nodes1)
181 sub2 = rag.subgraph(nodes2)
230 def _label_all(rag, attr_name): argument
242 node = min(rag.nodes())
268 d, w = _ncut.DW_matrices(rag)
[all …]
H A Dgraph_merge.py5 def _revalidate_node_edges(rag, node, heap_list): argument
24 for nbr in rag.neighbors(node):
25 data = rag[node][nbr]
29 _invalidate_edge(rag, node, nbr)
96 rag = rag.copy()
99 for n1, n2, data in rag.edges(data=True):
115 for nbr in rag.neighbors(n1):
116 _invalidate_edge(rag, n1, nbr)
118 for nbr in rag.neighbors(n2):
122 next_id = rag.next_id()
[all …]
H A Drag.py439 rag = RAG()
445 for n in rag.nodes():
446 rag.nodes[n].update({'labels': [n]})
448 return rag
452 def show_rag(labels, rag, image, border_color='black', edge_width=1.5, argument
508 rag = rag.copy()
532 for n, d in rag.nodes(data=True):
540 for (n, data), region in zip(rag.nodes(data=True), regions):
553 lines = [[rag.nodes[n1]['centroid'][::-1], rag.nodes[n2]['centroid'][::-1]]
554 for (n1, n2) in rag.edges()]
[all …]
/dports/graphics/vigra/vigra-8acd73a/vigranumpy/src/core/
H A Dexport_graph_rag_visitor.hxx325 const RagGraph & rag, in pyAccNodeSeeds() argument
357 const RagGraph & rag, in pyProjectGroundTruth() argument
387 RagGraph & rag, in pyMakeRegionAdjacencyGraph() argument
406 RagGraph & rag, in pyMakeRegionAdjacencyGraphFast() argument
425 const RagGraph & rag, in pyRagEdgeFeatures() argument
505 const RagGraph & rag, in pyRagEdgeFeaturesMb() argument
583 const RagGraph & rag, in pyRagEdgeMeanFromImplicit() argument
646 const RagGraph & rag, in pyRagEdgeFeaturesFromImplicit() argument
722 const RagGraph & rag, in pyRagFindEdges() argument
772 const RagGraph & rag, in pyRagNodeFeaturesSingleband() argument
[all …]
H A DgridGraphNd.cxx67 const AdjacencyListGraph & rag, in pySerializeAffiliatedEdges() argument
72 const size_t sSize = affiliatedEdgesSerializationSize(gridGraph, rag, affiliatedEdges); in pySerializeAffiliatedEdges()
76 serializeAffiliatedEdges(gridGraph, rag, affiliatedEdges, out.begin()); in pySerializeAffiliatedEdges()
88 const AdjacencyListGraph & rag, in pyDeserializeAffiliatedEdges() argument
96 …deserializeAffiliatedEdges(gridGraph, rag, *affEdges_, serialization.begin(), serialization.end()); in pyDeserializeAffiliatedEdges()
/dports/graphics/vigra/vigra-8acd73a/vigranumpy/examples/
H A Dgraph_watersheds.py36 rag = graphs.regionAdjacencyGraph(gridGraph, labels) variable
40 ragEdgeWeights = rag.accumulateEdgeFeatures(gridGraphEdgeIndicator)
41 ragNodeWeights = rag.accumulateNodeFeatures(gradMag)
44 seeds = graphs.nodeWeightedWatershedsSeeds(rag, ragNodeWeights)
47 labelsNodeWeighted = graphs.nodeWeightedWatersheds(rag, ragNodeWeights, seeds)
50 labelsEdgeWeighted = graphs.edgeWeightedWatersheds(rag, ragEdgeWeights, seeds)
55 rag.showNested(img, labelsNodeWeighted)
59 rag.showNested(img, labelsEdgeWeighted)
H A Dgraph_agglomerative_clustering.py34 rag = graphs.regionAdjacencyGraph(gridGraph, labels) variable
37 edgeWeights = rag.accumulateEdgeFeatures(gridGraphEdgeIndicator)
41 nodeFeatures = rag.accumulateNodeFeatures(imgLab)
44 labels = graphs.agglomerativeClustering(graph=rag, edgeWeights=edgeWeights,
56 rag.show(img)
61 rag.show(img, labels)
66 rag.showNested(img, labels)
H A Dmerge_graph.py26 rag = graphs.regionAdjacencyGraph(gridGraph, labels) variable
29 mg = graphs.mergeGraph(rag)
41 randEdgeId = numpy.random.randint(rag.edgeNum)
56 rag.show(img,labels)
60 asImage = rag.projectLabelsToGridGraph(labels)
H A Dgraph_felzenszwalb.py32 rag = graphs.regionAdjacencyGraph(gridGraph, labels) variable
35 edgeWeights = rag.accumulateEdgeFeatures(gridGraphEdgeIndicator)
38 labels = graphs.felzenszwalbSegmentation(rag, edgeWeights,
42 rag.show(img, labels)
H A Dgraph_3cycles.py36 rag = graphs.regionAdjacencyGraph(gridGraph, labels) variable
39 cycles = graphs.find3CyclesEdges(rag)
46 f = numpy.zeros(rag.edgeNum)
48 rag.showEdgeFeature(img, f)
/dports/graphics/vigra/vigra-8acd73a/src/examples/tutorial/
H A Dgraph_agglomerative_clustering.cxx77 RAG rag; in main() local
81 RAG::EdgeMap<std::vector<ImageGraph::Edge>> affiliatedEdges(rag); in main()
82 makeRegionAdjacencyGraph(imageGraph, labelArray, rag, affiliatedEdges); in main()
85 RAG::EdgeMap<float> edgeWeights(rag), in main()
86 edgeLengths(rag); in main()
89 for(RAG::EdgeIt rag_edge(rag); rag_edge != lemon::INVALID; ++rag_edge) in main()
120 RAG::NodeMap<TinyVector<float, 3>> meanColor(rag); in main()
121 RAG::NodeMap<unsigned int> regionSize(rag); in main()
130 RAG::NodeMap<unsigned int> nodeLabels(rag); in main()
131 hierarchicalClustering(rag, // input: the superpixel adjacency graph in main()
/dports/math/vtk9/VTK-9.1.0/Filters/ParallelDIY2/Testing/Cxx/
H A DTestRedistributeDataSetFilterWithPolyData.cxx72 vtkNew<vtkRandomAttributeGenerator> rag; in TestRedistributeDataSetFilterWithPolyData() local
73 rag->SetInputConnection(dsf->GetOutputPort()); in TestRedistributeDataSetFilterWithPolyData()
74 rag->SetDataTypeToDouble(); in TestRedistributeDataSetFilterWithPolyData()
75 rag->SetNumberOfComponents(1); in TestRedistributeDataSetFilterWithPolyData()
76 rag->SetComponentRange(0, 1.0); in TestRedistributeDataSetFilterWithPolyData()
77 rag->GenerateCellScalarsOn(); in TestRedistributeDataSetFilterWithPolyData()
78 rag->AttributesConstantPerBlockOn(); in TestRedistributeDataSetFilterWithPolyData()
81 mapper->SetInputConnection(rag->GetOutputPort()); in TestRedistributeDataSetFilterWithPolyData()
H A DTestRedistributeDataSetFilter.cxx137 vtkNew<vtkRandomAttributeGenerator> rag; in TestRedistributeDataSetFilter() local
138 rag->SetDataTypeToDouble(); in TestRedistributeDataSetFilter()
139 rag->SetNumberOfComponents(1); in TestRedistributeDataSetFilter()
140 rag->SetComponentRange(0, 1.0); in TestRedistributeDataSetFilter()
141 rag->GenerateCellScalarsOn(); in TestRedistributeDataSetFilter()
142 rag->AttributesConstantPerBlockOn(); in TestRedistributeDataSetFilter()
143 rag->SetInputConnection(dsf->GetOutputPort()); in TestRedistributeDataSetFilter()
146 mapper->SetInputConnection(rag->GetOutputPort()); in TestRedistributeDataSetFilter()
/dports/graphics/vigra/vigra-8acd73a/include/vigra/
H A Dgraph_rag_project_back.hxx76 const AdjacencyListGraph & rag, in projectBack()
90 bgFeatures[bgNode] = ragFeatures[rag.nodeFromId(bgLabels[bgNode])]; in projectBack()
97 bgFeatures[bgNode] = ragFeatures[rag.nodeFromId(bgLabels[bgNode])]; in projectBack()
118 const AdjacencyListGraph & rag, in projectBack()
140 bgFeatures[node] = ragFeatures[rag.nodeFromId(bgLabels[node])]; in projectBack()
153 bgFeatures[node] = ragFeatures[rag.nodeFromId(bgLabels[node])]; in projectBack()
176 const AdjacencyListGraph & rag, in projectBack() argument
184 …k::RagProjectBack< BASE_GRAPH,BASE_GRAPH_LABELS,RAG_FEATURES,BASE_GRAPH_FEATURES>::projectBack(rag, in projectBack()
H A Dgraph_algorithms.hxx168 AdjacencyListGraph & rag, in makeRegionAdjacencyGraph() argument
172 rag=AdjacencyListGraph(); in makeRegionAdjacencyGraph()
186 rag.addNode(l); in makeRegionAdjacencyGraph()
195 rag.addEdge( rag.nodeFromId(lu),rag.nodeFromId(lv)); in makeRegionAdjacencyGraph()
200 affiliatedEdges.assign(rag); in makeRegionAdjacencyGraph()
208 EdgeGraphOut ragEdge= rag.findEdge(rag.nodeFromId(lu),rag.nodeFromId(lv)); in makeRegionAdjacencyGraph()
219 const AdjacencyListGraph & rag, in affiliatedEdgesSerializationSize() argument
275 affEdges.assign(rag); in deserializeAffiliatedEdges()
1218 Overlap overlap(rag); in projectGroundTruth()
1269 const RAGGRAPH & rag, in ragFindEdges() argument
[all …]
/dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/future/graph/tests/
H A Dtest_rag.py16 g = graph.rag.RAG()
63 rag = graph.rag_mean_color(img, labels)
64 new_labels = graph.cut_threshold(labels, rag, 10, in_place=False)
68 new_labels = graph.cut_threshold(labels, rag, 10)
87 rag = graph.rag_mean_color(img, labels, mode='similarity')
89 new_labels = graph.cut_normalized(labels, rag, in_place=False)
94 new_labels = graph.cut_normalized(labels, rag)
122 def merge_hierarchical_mean_color(labels, rag, thresh, rag_copy=True, argument
124 return graph.merge_hierarchical(labels, rag, thresh, rag_copy,
168 rag = graph.rag_mean_color(img, labels, mode='similarity')
[all …]
/dports/archivers/py-bup/bup-0.31/t/
H A Dtestfile21109 erghea rag.vf_inyvq() naq j.rkvfgf(rag.fun) naq rag.fun
1115 erghea abg nyernql_fnirq(rag) be rag.fun_zvffvat()
1452 naq (rag.vf_inyvq() be rag.vf_qryrgrq() be abg rag.zbqr)):
1468 yvar += "%7f %7f " % (bpg(rag.zbqr), bpg(rag.tvgzbqr))
2969 erghea rag.vf_inyvq() naq j.rkvfgf(rag.fun) naq rag.fun
2975 erghea abg nyernql_fnirq(rag) be rag.fun_zvffvat()
3312 naq (rag.vf_inyvq() be rag.vf_qryrgrq() be abg rag.zbqr)):
3328 yvar += "%7f %7f " % (bpg(rag.zbqr), bpg(rag.tvgzbqr))
4829 erghea rag.vf_inyvq() naq j.rkvfgf(rag.fun) naq rag.fun
4835 erghea abg nyernql_fnirq(rag) be rag.fun_zvffvat()
[all …]
H A Dtestfile11109 erghea rag.vf_inyvq() naq j.rkvfgf(rag.fun) naq rag.fun
1115 erghea abg nyernql_fnirq(rag) be rag.fun_zvffvat()
1452 naq (rag.vf_inyvq() be rag.vf_qryrgrq() be abg rag.zbqr)):
1468 yvar += "%7f %7f " % (bpg(rag.zbqr), bpg(rag.tvgzbqr))
2969 erghea rag.vf_inyvq() naq j.rkvfgf(rag.fun) naq rag.fun
2975 erghea abg nyernql_fnirq(rag) be rag.fun_zvffvat()
3312 naq (rag.vf_inyvq() be rag.vf_qryrgrq() be abg rag.zbqr)):
3328 yvar += "%7f %7f " % (bpg(rag.zbqr), bpg(rag.tvgzbqr))
4829 erghea rag.vf_inyvq() naq j.rkvfgf(rag.fun) naq rag.fun
4835 erghea abg nyernql_fnirq(rag) be rag.fun_zvffvat()
[all …]
/dports/archivers/py-bup/bup-0.31/t/sampledata/y/
H A Dtestfile11109 erghea rag.vf_inyvq() naq j.rkvfgf(rag.fun) naq rag.fun
1115 erghea abg nyernql_fnirq(rag) be rag.fun_zvffvat()
1452 naq (rag.vf_inyvq() be rag.vf_qryrgrq() be abg rag.zbqr)):
1468 yvar += "%7f %7f " % (bpg(rag.zbqr), bpg(rag.tvgzbqr))
2969 erghea rag.vf_inyvq() naq j.rkvfgf(rag.fun) naq rag.fun
2975 erghea abg nyernql_fnirq(rag) be rag.fun_zvffvat()
3312 naq (rag.vf_inyvq() be rag.vf_qryrgrq() be abg rag.zbqr)):
3328 yvar += "%7f %7f " % (bpg(rag.zbqr), bpg(rag.tvgzbqr))
4829 erghea rag.vf_inyvq() naq j.rkvfgf(rag.fun) naq rag.fun
4835 erghea abg nyernql_fnirq(rag) be rag.fun_zvffvat()
[all …]
/dports/databases/arrow/apache-arrow-6.0.1/go/parquet/internal/encoding/
H A Dencoding_benchmarks_test.go201 rag := testutils.NewRandomArrayGenerator(0)
202 dict := rag.Float64(int64(tt.nunique), 0)
203 indices := rag.Int32(tt.nvalues, 0, int32(tt.nunique)-1, 0)
250 rag := testutils.NewRandomArrayGenerator(0)
251 dict := rag.Int32(int64(tt.nunique), 0, math.MaxInt32-1, 0)
304 rag := testutils.NewRandomArrayGenerator(0)
360 rag := testutils.NewRandomArrayGenerator(0)
407 rag := testutils.NewRandomArrayGenerator(0)
409 indices := rag.Int32(nvalues, 0, nunique-1, 0)
434 rag := testutils.NewRandomArrayGenerator(0)
[all …]
/dports/graphics/vigra/vigra-8acd73a/test/graph_algorithm/
H A Dtest.cxx414 GraphType rag; in testRegionAdjacencyGraph() local
419 shouldEqual(rag.nodeNum(),3); in testRegionAdjacencyGraph()
420 shouldEqual(rag.edgeNum(),2); in testRegionAdjacencyGraph()
422 const Node rn1 = rag.nodeFromId(1); in testRegionAdjacencyGraph()
423 const Node rn7 = rag.nodeFromId(7); in testRegionAdjacencyGraph()
424 const Node rn3 = rag.nodeFromId(3); in testRegionAdjacencyGraph()
426 should(rag.nodeFromId(0)==lemon::INVALID); in testRegionAdjacencyGraph()
427 should(rag.nodeFromId(2)==lemon::INVALID); in testRegionAdjacencyGraph()
428 should(rag.nodeFromId(4)==lemon::INVALID); in testRegionAdjacencyGraph()
437 const Edge re17 = rag.findEdge(rn1,rn7); in testRegionAdjacencyGraph()
[all …]
/dports/databases/arrow/apache-arrow-6.0.1/cpp/src/arrow/compute/
H A Dfunction_benchmark.cc50 random::RandomArrayGenerator rag(kSeed); in BM_CastDispatch() local
52 auto int_scalars = ToScalars(rag.Int64(kScalarCount, 0, 1 << 20)); in BM_CastDispatch()
68 random::RandomArrayGenerator rag(kSeed); in BM_CastDispatchBaseline() local
70 auto int_scalars = ToScalars(rag.Int64(kScalarCount, 0, 1 << 20)); in BM_CastDispatchBaseline()
181 random::RandomArrayGenerator rag(kSeed); in BM_ExecBatchIterator() local
188 args[i] = rag.Int64(length, 0, 100)->data(); in BM_ExecBatchIterator()
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwdft/grid/
H A Dgrid_ssw.F150 double precision rag,mu,sk
158 rag=rq(n,i)
164 mu = (rag - rq(n,j))*rij(ij)
200 double precision rag,mu,sk
213 rag=rq(n,i)
233 mu = (rag - rq(n,j))*rij(ij)
/dports/games/cataclysm-dda-tiles/Cataclysm-DDA-0.F/tests/
H A Ditem_tname_test.cpp229 item rag( "rag" ); variable
230 rag.set_flag( flag_WET );
231 REQUIRE( rag.has_flag( flag_WET ) );
233 CHECK( rag.tname() == "rag (wet)" );
238 item rag( "rag" ); variable
239 rag.set_flag( flag_FILTHY );
240 REQUIRE( rag.is_filthy() );
242 CHECK( rag.tname() == "rag (filthy)" );
/dports/games/cataclysm-dda/Cataclysm-DDA-0.F/tests/
H A Ditem_tname_test.cpp229 item rag( "rag" ); variable
230 rag.set_flag( flag_WET );
231 REQUIRE( rag.has_flag( flag_WET ) );
233 CHECK( rag.tname() == "rag (wet)" );
238 item rag( "rag" ); variable
239 rag.set_flag( flag_FILTHY );
240 REQUIRE( rag.is_filthy() );
242 CHECK( rag.tname() == "rag (filthy)" );

12345678910>>...39