搜索资源列表
CannyJava
- Canny Edge Detector which returns edges and gradient-angle fully written in java.
exinpaint
- 修改图像边缘处的不平整部分 删除边缘处的细节 并将它修复-Modify the image edges are not smooth the edges of some of the details removed and fix it
edgedetector
- canny detector code which performs extracting edges from a image and gives efficient results compared to other methods
pca_idl
- 对整幅图片做PCA变换，提取光谱特征，消除噪声，平滑边缘，易主成分重新绘制图像-Pictures do the whole PCA transform, extract spectral features, remove noise, smooth edges, easy to re-draw the image principal component
video_edge_play
- 在opencv下实现视频及其边缘的同时播放，其中边缘检测是利用的canny边缘检测方法。-Under the opencv and edges but also for video playback, which is to use the canny edge detection edge detection methods.
Generalized-Computation-of-Gaussian-Derivatives-Us
- 对三维图像进行求导的一个程序，利用高斯卷积后对图像求导相当于对高斯函数求导的性质。是用itk库写的一个通用模板类，里面还有例子。-Computation of local image derivatives is an important operation in many image processing tasks that involve feature detection and extraction, such as edges, corners or more complicat
xiaoyuan
- 校园导航程序，支持任意数的顶点和边数，直接输入即可，可以查询两点间的所有路径，最短距离，Dijstra和Floyd算法都有-Campus navigation, support for any number of vertices and edges, can be directly input, you can query all paths between two points, the shortest distance, Dijstra and Floyd algorithm has
exp6
- 合肥工业大学数据结构试验六图结构试验 包括完整的实验要求、实验预习报告、实验最终报告 实验要求： <1>求给定图中的边（或弧）的数目。 <2>求解出从给定顶点到所有顶点的最短路径（以边数计算）。 <3>判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） <4>对给定的图G及出发点v0，设计算法从V0出发深度遍历图G，并构造出相应的生成树。 -Hefei University of testing six graph
edges_demo
- edges demo-edges demo
edge_detection
- Edge detection is a feature of this Code and you can find out the edges of an image seamelessly using matlab by this code
AComputationalApproachtoEdgeDetection
- canny边缘检测经典算法，在学校数据库下的-a paper about the detection of edges invented by canny,downloaded from the school database
project3handout
- 使用Dijkstra方法实现的求最短路径，可以按规定格式读入文件，可以添加，删除节点，可以添加删除边-Implemented using the Dijkstra shortest path method, you can read the required file format, you can add, delete nodes, you can add and delete edges
XGraph2
- 能够建立有向图无向图的邻接矩阵和邻接表表示法，深度优先和广度优先搜索，能够存储和显示相应的搜索结果（深度优先或广度优先生成森林（或生成树）、深度优先或广度优先序列和编号）。以文件形式输入图的顶点和边，并显示相应的结果。-To build a directed graph undirected adjacency matrix and adjacency list representation, depth-first and breadth-first search, to store and
canny
- Canny算子可有效的检测图像的边缘，得到较为清晰，较为准确的边缘。-Canny operator can effectively detect the edges of the image to get a more clear, more precise edges.
New_Compressed_(zipped)_Folder
- 有效的进行图像边缘的路径追踪，完成图像边缘的完善。-Effectively track the path of the image edge, the improvement of image edges.
pic
- 对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。 -For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
Manhattan
- 在 VLSI 设计中,多点互连是物理设计阶段的关键问题之一,而互连的点数等于 2 或大于 2 分别对应于 Manhattan 空间上有障碍时的最短路径问题和最小 Steiner 树问题,显然前者是后者的基础.连接图是研究最短路径 问题的有效工具,已有的典型连接图包括基于轨迹的GC 和GT 以及基于自由区的GF 和GG.工作包括3个方面:设计并分析了在各种连接图上实现动态的点对之间的最短路径查询算法 分析了在各个连接图上构造 3-Steiner 树的算 法,对于已有的 GC 上的 3-
web
- 网站的内容，就如同书的文字一般重要，书没有了内页，就算封面再漂亮、再精致，都只是个徒俱美丽空壳的纸版罢了；如果书的内容杂乱无章或是不切合书名，那么买书的人一定会非常懊恼也非常生气。网站也是一样的道理，如果网站没有内容，就算装扮得再美轮美奂，也不配称为网站；如果网站的内容杂七杂八或是与站名摸不着边儿，那么不小心踏进来的浏览者，必然会非常举丧也非常不悦。我做这个旅游网站主要分为旅游线路、机票服务、代办签证、包车服务、留言反馈这几个部分。还有一些其他的链接。-Content of the site,
Training-User-Patterns
- You may wish to edit your newly created pattern before launching the OCR process. An incorrectly trained pattern may adversely affect OCR quality. A pattern should contain only whole characters or ligatures. Characters with cut edges and characters w
Edge_DEtection
- Edge detection is one of the most commonly used operations in image analysis, and there are probably more algorithms in the literature for enhancing and detecting edges than any other single subject. The reason for this that edges form the out