资源列表
LPM_algorithm
- 用最长路径矩阵算法来计算DFG的迭代边界，其中定义了一个三维的矩阵来存储每次迭代的结果-calculate the iteration bound of DFG with the longest path matrix algorithm, defining a 3-dimention matrix to store the iteration results
jose
- Jose，及约瑟夫算法的实现，是一个很好的数据结构算法-Jose
dijkstra_z
- 单源dijkstra邻接阵形式 单源最短路径,dijkstra算法,邻接阵形式,复杂度O(n^2)-Dijkstra adjacency matrix form of single-source single-source shortest path, dijkstra algorithm, adjacency matrix form, the complexity of O (n ^ 2)
boundary
- 用matlab对图像边缘进行提取，使图像边缘部分能能清晰地展现出来-boundary.rar
CH8_4_3
- MATLAB 7.x图像处理中第八章4.3程序：约束最小二乘滤波复原-image processing program with MATLAB 7.x Chapter 8.4.3: constrained least squares restoration filter
ImageCov
- 计算两副图像之间的相关性函数，并对函数参数进行了详细说明。-Calculating the correlation function between the two images, and function parameters is described in detail.
fbm2
- 基于Delaunay三角网的改进随机中点位移插值算法-Improved random midpoint displacement interpolation algorithm based on Delaunay triangulation
s4
- 分水岭算法 在每一个局部极小值表面，刺穿一个小孔，然后把整个模型慢慢浸入水中，随着浸入的加深，每一个局部极小值的影响域慢慢向外扩展，在两个集水盆汇合处构筑大坝，即形成分水岭。-Watershed algorithm in each local minimum surface, pierce a small hole, and then the whole model is slowly immersed in water, With the immersion deepening, the do
main
- 一个双向链表的在0pengl中可以被广泛运用，赋予的形的含义.-A doubly linked list in 0pengl can be widely used, the meaning given shape.
kuaisusaomiao
- 这是通过快速扫描算法提取鱼眼图像的有效区域 有点像逐行逐列算法 但又不一样 是一种改进 大大节省了时间 而且效果还好-The function is meant to get yuyan picture fast sweep solution.
Sobel
- sobel将图像中的每个像素的上、下、左、右四邻域的灰度值加权差, 与之接近的邻域的权最大-Right sobel gray value of each pixel in the image, down, left and right neighbors field of weight difference, with the largest neighborhood close
question1
- 实现开操作和闭操作，图像处理,通过图像进行膨胀和腐蚀，完成开操作和闭操作-open and close