Searched refs:edge (Results 1 - 25 of 253) sorted by path

1234567891011

/external/ImageMagick/Magick++/demo/
H A Ddemo.cpp168 cout << " edge ..." << endl;
171 example.edge( );
/external/ImageMagick/Magick++/lib/
H A DImage.cpp2799 void Magick::Image::edge(const double radius_) function in class:Magick::Image
H A DSTL.cpp346 image_.edge( _radius );
/external/ImageMagick/Magick++/lib/Magick++/
H A DImage.h851 void edge(const double radius_=0.0);
1011 // An edge preserving noise reduction filter.
/external/ImageMagick/MagickCore/
H A Ddraw.c432 (void) LogMagickEvent(DrawEvent,GetMagickModule()," begin active-edge");
436 (void) LogMagickEvent(DrawEvent,GetMagickModule()," edge %.20g:",
450 (void) LogMagickEvent(DrawEvent,GetMagickModule()," end active-edge");
493 edge,
511 edge=0;
528 if (edge == number_edges)
537 polygon_info->edges[edge].number_points=(size_t) n;
538 polygon_info->edges[edge].scanline=(-1.0);
539 polygon_info->edges[edge].highwater=0;
540 polygon_info->edges[edge]
486 edge, local
891 DestroyEdge(PolygonInfo *polygon_info, const size_t edge) argument
969 AffineEdge(const Image *image,const AffineMatrix *affine, const double y,const SegmentInfo *edge) argument
1101 edge; local
[all...]
H A Dfeature.c127 % o lower_precent: percentage of edge pixels in the lower threshold.
129 % o upper_percent: percentage of edge pixels in the upper threshold.
164 edge,
183 if (GetMatrixElement(canny_cache,0,0,&edge) == MagickFalse)
185 edge.x=x;
186 edge.y=y;
187 if (SetMatrixElement(canny_cache,0,0,&edge) == MagickFalse)
195 status=GetMatrixElement(canny_cache,i,0,&edge);
207 if (IsAuthenticPixel(edge_image,edge.x+u,edge
162 edge, local
[all...]
/external/ImageMagick/www/api/
H A Ddecorate.php129 <p>RaiseImage() creates a simulated three-dimensional button-like effect by lightening and darkening the edges of the image. Members width and height of raise_info define the width of the vertical and horizontal edge of the effect.</p>
H A Deffect.php322 <p>KuwaharaImage() is an edge preserving noise reduction filter.</p>
H A Dfeature.php89 <dd>percentage of edge pixels in the lower threshold. </dd>
93 <dd>percentage of edge pixels in the upper threshold. </dd>
141 <p>Use HoughLineImage() in conjunction with any binary edge extracted image (we recommand Canny) to identify lines in the image. The algorithm accumulates counts for every white pixel for every possible orientation (for angles from 0 to 179 in 1 degree increments) and distance from the center of the image to the corner (in 1 px increments) and stores the counts in an accumulator matrix of angle vs distance. The size of the accumulator is 180x(diagonal/2). Next it searches this space for peaks in counts and converts the locations of the peaks to slope and intercept in the normal x,y input image space. Use the slope/intercepts to find the endpoints clipped to the bounds of the image. The lines are then drawn. The counts are a measure of the length of the lines</p>
H A Dfx.php129 <p>CharcoalImage() creates a new image that is a copy of an existing one with the edge highlighted. It allocates the memory necessary for the new Image structure and returns a pointer to the new image.</p>
H A Dmagick-image.php4865 <p>MagickRaiseImage() creates a simulated three-dimensional button-like effect by lightening and darkening the edges of the image. Members width and height of raise_info define the width of the vertical and horizontal edge of the effect.</p>
6754 <p>MagickShearImage() slides one edge of an image along the X or Y axis, creating a parallelogram. An X direction shear slides an edge along the X axis, while a Y direction shear slides an edge along the Y axis. The amount of the shear is controlled by a shear angle. For X direction shears, x_shear is measured relative to the Y axis, and similarly, for Y direction shears y_shear is measured relative to the X axis. Empty triangles left over from shearing the image are filled with the background color.</p>
H A Dmorphology.php107 <p>AcquireKernelBuiltIn() returned one of the 'named' built-in types of kernels used for special purposes such as gaussian blurring, skeleton pruning, and edge distance determination.</p>
142 <dd> LoG:{radius},{sigma} "Laplacian of a Gaussian" or "Mexician Hat" Kernel. The supposed ideal edge detection, zero-summing kernel. </dd>
168 <dd> Laplacian:{type} Discrete Lapacian Kernels, (without normalization) Type 0 : 3x3 with center:8 surounded by -1 (8 neighbourhood) Type 1 : 3x3 with center:4 edge:-1 corner:0 (4 neighbourhood) Type 2 : 3x3 with center:4 edge:1 corner:-2 Type 3 : 3x3 with center:4 edge:-2 corner:1 Type 5 : 5x5 laplacian Type 7 : 7x7 laplacian Type 15 : 5x5 LoG (sigma approx 1.4) Type 19 : 9x9 LoG (sigma approx 1.4) </dd>
194 <dd> However this kernel is als at the heart of the FreiChen Edge Detection Process which uses a set of 9 specially weighted kernel. These 9 kernels not be normalized, but directly applied to the image. The results is then added together, to produce the intensity of an edge in a specific direction. The square root of the pixel value can then be taken as the cosine of the edge, and at least 2 such runs at 90 degrees from each other, both the direction and the strength of the edge can be determined. </dd>
216 <dd> The first 4 are for edge detection, the next 4 are for line detection and the last is to add a average component to the results. </dd>
250 <dd> Ring:{radius1},{radius2}[,{scale}] A ring of the values given that falls between the two radii. Defaults to a ring of approximataly 3 radius in a 7x7 kernel. This is the 'edge' pixel
[all...]
H A Dquantize.php67 <p>The tree's root node represents the entire domain, (0,0,0) through (Cmax,Cmax,Cmax). Each lower level in the tree is generated by subdividing one node's cube into eight smaller cubes of equal size. This corresponds to bisecting the parent cube with planes passing through the midpoints of each edge.</p>
H A Dshear.php67 <p>If the artifact "deskew:auto-crop" is given the image will be automatically cropped of the excess background. The value is the border width of all pixels around the edge that will be used to determine an average border color for the automatic trim.</p>
117 <p>ShearImage() creates a new image that is a shear_image copy of an existing one. Shearing slides one edge of an image along the X or Y axis, creating a parallelogram. An X direction shear slides an edge along the X axis, while a Y direction shear slides an edge along the Y axis. The amount of the shear is controlled by a shear angle. For X direction shears, x_shear is measured relative to the Y axis, and similarly, for Y direction shears y_shear is measured relative to the X axis. Empty triangles left over from shearing the image are filled with the background color defined by member 'background_color' of the image.. ShearImage() allocates the memory necessary for the new Image structure and returns a pointer to the new image.</p>
/external/annotation-tools/annotation-file-utilities/lib/
H A Dguava-20.0.jarMETA-INF/MANIFEST.MF META-INF/ META-INF/maven/ META-INF/maven/com. ...
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
H A DDFA.as5 * Any state that has a semantic predicate edge is special; those states
101 // eot[s]>=0 indicates that an EOT edge goes to another
108 // which assumed here that the EOT edge always
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h424 * A vector used to detect cycles in the edge dependecies. It is used
463 * A method that adds an edge from one node to another. An edge
475 void (*addEdge) (struct ANTLR3_TOPO_struct * topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
481 * is only as large as the largest node index you created an edge for. This means
482 * that if you had an input of 32 nodes, but that largest node with an edge
496 * on the previously supplied edge data.
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c116 static void addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
2316 addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency) argument
2322 if (edge>dependency)
2324 maxEdge = edge;
2330 // We need to add an edge to says that the node indexed by 'edge' is
2334 // First see if we have enough room in the edges array to add the edge?
2372 // If the edge was flagged as depending on itself, then we just
2376 if (edge == dependency)
2381 // Pick up the bit map for the requested edge
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/
H A DTestDotTreeGenerator.cs65 + @" edge [arrowsize=.5, color=""black"", style=""bold""]" + newline
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.pas994 /// Any state that has a semantic predicate edge is special; those states are
5172 // eot[s]>=0 indicates that an EOT edge goes to another
5179 // which assumed here that the EOT edge always
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Ddot.rb77 | edge [arrowsize=.5];
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DDFA.java171 /** Map an edge transition table to a unique set number; ordered so
188 /** The unique edge transition class number; every time we see a new
191 * some of the big edge transition tables are seen about 57 times.
215 /** just the Vector<Integer> indicating which unique edge table is at
504 Transition edge = (Transition) s.transition(j);
505 Label label = edge.label;
555 Transition edge = (Transition) s.transition(j);
556 Label label = edge.label;
560 Utils.integer(edge.target.stateNumber));
570 Utils.integer(edge
[all...]
H A DDFAOptimizer.java98 * It can yield states that have only a single edge on EOT to an accept
105 * for keyword versus ID as the state with EOT edge emanating from it will
106 * also have another edge.
192 Transition edge = (Transition) d.transition(i);
193 DFAState edgeTarget = ((DFAState)edge.target);
196 edge.label.toString(d.dfa.nfa.grammar)+"->"+
221 Transition edge = (Transition) d.transition(i);
222 DFAState edgeTarget = ((DFAState)edge.target);
225 edge.label.toString(d.dfa.nfa.grammar)+"->"+
228 // if only one edge comin
[all...]
H A DLL1DFA.java39 * predicates to resolve edge set collisions.
43 * an LL(1) DFA. One edge per set.
87 IntervalSet edge = (IntervalSet)it.next();
88 List<Integer> alts = edgeMap.get(edge);
90 //System.out.println(edge+" -> "+alts);
93 Label e = getLabelForSet(edge);

Completed in 6762 milliseconds

1234567891011