Searched defs:edges (Results 1 - 25 of 54) sorted by relevance

123

/external/opencv3/modules/cudaimgproc/test/
H A Dtest_canny.cpp86 cv::cuda::GpuMat edges; local
87 canny->detect(loadMat(img, useRoi), edges); local
92 EXPECT_MAT_SIMILAR(edges_gold, edges, 2e-2);
/external/opencv3/samples/cpp/tutorial_code/ImgProc/
H A DMorphology_3.cpp94 // Extract edges and smooth image according to the logic
95 // 1. extract edges
96 // 2. dilate(edges)
99 // 5. smooth.copyTo(src, edges)
102 Mat edges; local
103 adaptiveThreshold(vertical, edges, 255, CV_ADAPTIVE_THRESH_MEAN_C, THRESH_BINARY, 3, -2);
104 imshow("edges", edges);
108 dilate(edges, edges, kerne
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java32 /** A generic graph with edges; Each node as a single Object payload.
40 List<Node> edges; // points at which nodes? field in class:Graph.Node
45 if ( edges==null ) edges = new ArrayList<Node>();
46 if ( !edges.contains(n) ) edges.add(n);
99 if ( n.edges!=null ) {
100 for (Iterator it = n.edges.iterator(); it.hasNext();) {
/external/opencv3/samples/winrt_universal/VideoCaptureXAML/video_capture_xaml/video_capture_xaml.Shared/
H A Dmain.cpp119 Mat edges; local
120 cvtColor(frame, edges, COLOR_RGB2GRAY);
121 GaussianBlur(edges, edges, Size(7, 7), 1.5, 1.5);
122 Canny(edges, edges, 0, 30, 3);
123 cvtColor(edges, frame, COLOR_GRAY2RGB);
/external/skia/src/gpu/effects/
H A DGrConvexPolyEffect.h31 * edges is a set of n edge equations where n is limited to kMaxEdges. It contains 3*n values.
32 * The edges should form a convex polygon. The positive half-plane is considered to be the
36 * Currently the edges are specified in device space. In the future we may prefer to specify
42 const SkScalar edges[]) {
46 return new GrConvexPolyEffect(edgeType, n, edges);
51 * inverse filled, or has too many edges, this will return nullptr. If offset is non-nullptr, then
58 * Creates an effect that fills inside the rect with AA edges..
73 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]);
41 Create(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) argument
H A DGrConvexPolyEffect.cpp116 // The amount of coverage removed in x and y by the edges is computed as a pair of negative
194 "edges",
254 SkScalar edges[3 * kMaxEdges]; local
273 edges[3 * n] = v.fY;
274 edges[3 * n + 1] = -v.fX;
276 edges[3 * n] = -v.fY;
277 edges[3 * n + 1] = v.fX;
280 edges[3 * n + 2] = -(edges[3 * n] * p.fX + edges[
312 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) argument
340 SkScalar edges[kMaxEdges * 3]; local
[all...]
/external/guice/extensions/grapher/src/com/google/inject/grapher/
H A DAbstractInjectorGrapher.java133 /** Performs any post processing required after all nodes and edges have been added. */
155 private void createEdges(Iterable<Edge> edges, Map<NodeId, NodeId> aliases) throws IOException { argument
156 for (Edge edge : edges) {
/external/guice/extensions/grapher/test/com/google/inject/grapher/
H A DAbstractInjectorGrapherTest.java49 final Set<Edge> edges = Sets.newHashSet(); field in class:AbstractInjectorGrapherTest.FakeGrapher
53 edges.clear();
72 assertFalse(edges.contains(edge));
73 edges.add(edge);
77 assertFalse(edges.contains(edge));
78 edges.add(edge);
141 assertEquals(expectedEdges, grapher.edges);
166 assertEquals("wrong edges", expectedEdges, grapher.edges);
182 assertEquals(expectedEdges, grapher.edges);
[all...]
/external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/
H A DGraphvizGrapher.java51 private final List<GraphvizEdge> edges = Lists.newArrayList(); field in class:GraphvizGrapher
66 edges.clear();
84 for (GraphvizEdge edge : edges) {
299 edges.add(gedge);
319 edges.add(gedge);
/external/opencv/cvaux/src/
H A Dcvdpstereo.cpp110 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); local
160 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2;
161 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1;
164 edges[y*imgW+j] = 0;
169 edges[y*imgW+j] |= 1;
174 edges[
[all...]
/external/opencv3/modules/cudaimgproc/perf/
H A Dperf_hough.cpp242 cv::Mat edges; local
243 cv::Canny(image, edges, 50, 100);
253 const cv::cuda::GpuMat d_edges(edges);
272 TEST_CYCLE() alg->detect(edges, dx, dy, positions);
311 cv::Mat edges; local
312 cv::Canny(image, edges, 50, 100);
324 const cv::cuda::GpuMat d_edges(edges);
343 TEST_CYCLE() alg->detect(edges, dx, dy, positions);
/external/opencv3/modules/imgproc/src/
H A Dgcgraph.hpp78 std::vector<Edge> edges; member in class:GCGraph
100 edges.reserve( edgeCount + 2 );
121 if( !edges.size() )
122 edges.resize( 2 );
128 vtcs[i].first = (int)edges.size();
129 edges.push_back( fromI );
134 vtcs[j].first = (int)edges.size();
135 edges.push_back( toI );
160 Edge *edgePtr = &edges[0];
261 // modify weights of the edges alon
[all...]
H A Dcanny.cpp196 hysteresis (add weak edges if they are connected with strong edges)
216 // get edges
532 // now track the edges (hysteresis thresholding)
675 // now track the edges (hysteresis thresholding)
926 // now track the edges (hysteresis thresholding)
963 void cvCanny( const CvArr* image, CvArr* edges, double threshold1, argument
966 cv::Mat src = cv::cvarrToMat(image), dst = cv::cvarrToMat(edges);
/external/opencv3/samples/cpp/
H A Dautofocus.cpp133 Mat edges; local
134 cvtColor(frame, edges, CV_BGR2GRAY);
135 GaussianBlur(edges, edges, Size(7, 7), 1.5, 1.5);
136 Canny(edges, edges, 0, 30, 3);
139 for (it = edges.begin<uchar>(), end = edges.end<uchar>(); it != end; ++it)
209 "Simple implementation of autofocus is based on edges detection.\n"
/external/skia/samplecode/
H A DSamplePathClip.cpp78 static int clip_line(const SkRect& bounds, SkPoint p0, SkPoint p1, SkPoint edges[]) { argument
79 SkPoint* edgesStart = edges;
112 *edges++ = p0;
113 *edges++ = p1;
118 *edges++ = p0;
119 *edges++ = p1;
125 *edges++ = SkPoint::Make(bounds.left(), p0.fY);
126 *edges++ = SkPoint::Make(bounds.left(), y);
131 *edges++ = p0;
132 *edges
[all...]
/external/opencv3/modules/cudaimgproc/src/
H A Dmssegmentation.cpp96 std::vector<Edge> edges; member in class:__anon15365::Graph
182 Graph<T>::Graph(int numv_, int nume_max_) : start(numv_, -1), edges(nume_max_)
193 edges[nume] = Edge(to, start[from], val);
321 for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next)
324 int c2 = comps.find(g.edges[e_it].to);
325 if (c1 != c2 && g.edges[e_it].val.dr < hr && g.edges[e_it].val.dsp < hsp)
330 std::vector<SegmLink> edges; local
331 edges.reserve(g.numv);
333 // Prepare edges connectin
[all...]
/external/skia/src/core/
H A DSkDistanceFieldGen.cpp66 static void init_glyph_data(DFData* data, unsigned char* edges, const unsigned char* image, argument
72 edges += (pad*dataWidth + pad);
95 *edges = 255; // using 255 makes for convenient debug rendering
99 ++edges;
102 edges += 2*pad;
148 static void init_distances(DFData* data, unsigned char* edges, int width, int height) { argument
156 if (*edges) {
187 ++edges;
362 // create initial distance data, particularly at edges
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:
/external/bison/src/
H A Dielr.c125 edges rather than an array because it is possible that
127 that we could end up with redundant edges. With the
128 possibility of redundant edges, it's hard to know ahead of
242 * follow (that is, it's computed by internal and successor edges) of goto
245 * successor follow edges. \c edge_counts has not been updated.
286 fprintf (stderr, "always follow edges:\n");
346 goto_number **edges; local
351 &edges, &edge_counts);
352 ielr_compute_follow_kernel_items (ritem_sees_lookahead_set, edges,
356 ielr_compute_always_follows (&edges, edge_count
[all...]
/external/eigen/Eigen/src/Core/arch/AltiVec/
H A DPacketMath.h309 Packet16uc MSQ, LSQ, edges; local
314 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
315 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges
317 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ)
318 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ)
327 Packet16uc MSQ, LSQ, edges; local
332 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
333 edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges
[all...]
/external/freetype/src/autofit/
H A Dafhints.c107 AF_Edge edges; local
112 if ( axis->edges == NULL )
114 axis->edges = axis->embedded.edges;
135 if ( axis->edges == axis->embedded.edges )
137 if ( FT_NEW_ARRAY( axis->edges, new_max ) )
139 ft_memcpy( axis->edges, axis->embedded.edges,
140 sizeof ( axis->embedded.edges ) );
304 AF_Edge edges = axis->edges; local
434 AF_Edge edges = axis->edges; local
1112 AF_Edge edges = axis->edges; local
[all...]
H A Dafhints.h36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
83 * edges.
86 * edges. An edge corresponds to a single position on the main
91 * edges, then to align segments on the edges unless it detects that
178 * interpolated linearly between their two closest edges, even if these
204 * alignment of edges and strong points, thus weak points are processed
287 FT_Fixed scale; /* used to speed up interpolation between edges */
292 FT_Short num_linked; /* number of linked edges */
314 AF_Edge edges; /* edges array */ member in struct:AF_AxisHintsRec_
322 AF_EdgeRec edges[AF_EDGES_EMBEDDED]; member in struct:AF_AxisHintsRec_::__anon5990
[all...]
H A Dafcjk.c931 /* We begin by generating a sorted table of edges for the current */
940 /* Note that the edges table is sorted along the segment/edge */
962 AF_Edge edge = axis->edges + ee;
1064 AF_Edge edges = axis->edges; local
1065 AF_Edge edge_limit = edges + axis->num_edges;
1069 for ( edge = edges; edge < edge_limit; edge++ )
1082 for ( edge = edges; edge < edge_limit; edge++ )
1171 /* Detect segments and edges for given dimension. */
1191 /* Compute all edges whic
1717 AF_Edge edges = axis->edges; local
2096 AF_Edge edges = axis->edges; local
[all...]
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c2264 * used to define edges that identify numerical node indexes that depend on other
2297 topo->limit = 1; // No edges added yet
2298 topo->edges = NULL; // No edges added yet
2334 // First see if we have enough room in the edges array to add the edge?
2336 if (topo->edges == NULL)
2338 // We don't have any edges yet, so create an array to hold them
2340 topo->edges = ANTLR3_CALLOC(sizeof(pANTLR3_BITSET) * (maxEdge + 1), 1);
2341 if (topo->edges == NULL)
2352 // WE have some edges bu
2417 pANTLR3_BITSET edges; local
[all...]
/external/opencv3/modules/core/test/
H A Dtest_io.cpp134 int edges[][2] = {{0,1},{1,2},{2,0},{0,3},{3,4},{4,1}}; local
141 cvGraphAddEdge(graph, edges[i][0], edges[i][1], 0, &edge);
360 graph2->edges->active_count != ecount || graph3->edges->active_count != ecount)
362 ts->printf( cvtest::TS::LOG, "the cloned or read graph have wrong number of vertices or edges\n" );
369 CvGraphEdge* edge2 = cvFindGraphEdge(graph2, edges[i][0], edges[i][1]);
370 CvGraphEdge* edge3 = cvFindGraphEdge(graph3, edges[i][0], edges[
[all...]

Completed in 739 milliseconds

123