搜索资源列表
CannyEdgeDetector
- canny edge detection
ToolSpilt
- java实现 图片实现加强，模糊，平滑，边缘检测，灰度图-java implementation to achieve enhanced picture, fuzzy, smooth, edge detection, grayscale
RC_php_v2.1
- 嘉缘人才网 php v2.1商业版，非常强大的人才源码，你一定喜欢！-Ka edge talent network php v2.1 Business Edition, a very strong talent source, you must be like!
JSP-Interview-Questions-and-Answers
- Some tip and trices about Java in form of question and answer Some tip and trices about Java in form of question and answer- Some tip and trices about Java in form of question and answer Some tip and trices about Java in form of question and
27
- 这是一个flash源文件，效果很好，测试平台为flash 8.0（如果提示问题请选择合适的版本试试），代码的效果是：柔光边缘文字-This is a flash source file, the effect is very good, the test platform for Flash 8 ( if the question please choose the right version to try), code: soft edge text effect
EdgeDetection
- Edge Detection using java
javautil
- util实现Java图片水印添加功能，有添加图片水印和文字水印，可以设置水印位置，透明度、设置对线段锯齿状边缘处理、水印图片的路径，水印一般格式是gif，png,这种图片可以设置透明度、水印旋转等，可以参考代码加以改进做成小工具。-Util realize the Java image watermark to add functionality, add watermark images and text watermark, watermark can set the transparenc
ebook
- 构建一个网上书店，充分利用了JSP技术开发了网上购书系统。该系统基于Internet技术，有效地综合了计算机技术、数据库技术、网络通讯技术等多科前沿技术，是Web技术和信息技术向结合的实例。-Build an online bookstore, take full advantage of JSP technology to develop the online purchasing system. The system is based on Internet technology, to e
Prim
- 求解最小生成树的Prim算法，返回构成最小生成树的边集-Prim for the minimum spanning tree,which returns the edge set
TriangleTest
- 个人原创代码：编写Java Application程序，有一个三角形类Triangle，成员变量有底边x和另一条边y，和两边的夹角a（0<a<180），a为静态成员，成员方法有两个：求面积s（无参数）和修改角度（参数为角度）,构造函数为 Triangle(int xx,int yy,int aa) 参数分别为x,y,a赋值 在main方法中构造两个对象，求出其面积，然后使用修改角度的方法，修改两边的夹角，再求出面积值。(提示：求高的方法 h=y*Math.sin(a)).-The o
ShapeExp1
- 个人原创代码：矩形、圆形、正方形等形状的操作。编写Java Application程序，定义抽象类Shape，抽象方法为showArea()，求出面积并显示，定义矩形类Rectangle,正方形类Square,圆类 Circle，根据各自的属性，用showArea方法求出各自的面积，在main方法中构造3个对象，调用showArea方法。 定义接口DiagArea，其中包含方法double getDiagonal()求对角线长, double getArea()求面积，定义一个矩形类，实现此
algo
- This is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.
05584633
- Evolutionary Design of Edge Detector Using Rule- Changing Cellular Automata
01380502
- Evolutionary Design of Edge Detector Using Rule- Changing Cellular Automata
04678801
- Evolutionary Design of Edge Detector Using Rule- Changing Cellular Automata
05480830
- Evolutionary Design of Edge Detector Using Rule- Changing Cellular Automata
CANNY
- CANNY EDGE DETECTION Canny edge detection 的步驟： 1. 將原始影像和高斯濾波器做摺積。 2. 利用一次微分的遮罩對影像每一個像素求得四個方向的邊線強度 3. 找出四個方向中的最大值作為目前像素的邊線強度。 4. 依據步驟 3 將梯度方向分成四個區域 5. 非最大值刪除：沿著梯度方向找出最大值，並將其保留，其餘均設為零。 6. 設定兩個閥值 low T 和 high T ，用 high T 挑選出最佳的邊線像素，再從
GrafoGrafic
- Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959,[1][2] is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a
edge2
- 边缘算子分析，各种边缘算子计算方式等。喜欢的可以下载哈～-edge detection
canny
- Canny Edge Detection