搜索资源列表
lwcontour
- live-wire是一种常用于医学图像的交互式分割方法,其基本思想是利用动态规划方法产生图像中给定两点间的最优路径,合理地构造代价函数和选择起始点和目标点,用以提取物体的边缘,十分有效,该份文件中包含说明文件,操作方便.-live-wire is a common medical images in the interactive segmentation method, The basic idea is to use dynamic programming methods to image
dp
- 动态规划的实现程序，用于最短路径的选择！
dp
- active contour算法中的经典算法：动态规划算法文献
动态规划提取边缘
- 对一个区域提取边缘
Dinp_2004
- 这是基于动态规划的立体匹配的代码，是当前立体匹配中很好的一种实现方式-This is the stereo matching based on dynamic programming code that is currently in a good stereo matching method to implement
1
- 实现动态规划算法和感兴趣区域提取，效果不错啊 -The realization of dynamic programming algorithm and region of interest extraction, the effect of good ah
dongtai
- 基于动态规划的点状运动目标的基于动态规划的点状运动目标的-dongtai
Image_Paper_XuXG
- 用Snake算法和基于动态规划的图搜索算法，有效地实现了复杂物体轮廓特征的提取。 -With the Snake algorithm and based on dynamic programming graph search algorithm, effective implementation of the complex features of an object contour extraction.
triangulation
- 动态规划实现对多边形的三角剖分，顺时针定义各个顶点值实现最优剖分。-Dynamic program to achieve triangulation of the polygon.Clockwise to definit the value of each vertex achieve the optimal split.
imgcompress
- 运用C语言使用动态规划算法设计思想实现的图像压缩算法源程序-Using C language using the dynamic programming algorithm design thought realize image compression algorithm source program
grays-image
- 对灰度图像进行压缩和解压缩，用动态规划的方法做的。-On the gray image compression and decompression with dynamic programming to do.
CompressImage
- 灰度图像的像素值范围在[0，255]之间，如果采用一个像素一个字节的存储方式，势必会造成空间的浪费。如果采用一定的无损压缩算法，可以大大提高减小文件大小，减少存储空间。本程序采用动态规划中图像压缩算法（图像分段合并的思想），设计一个类，实现灰度位图数据的压缩和解压过程-Grayscale pixel values in the range [0,255], if we adopt a pixel one byte is stored, it must lead to
PSO-image-segmentation-algorithm
- 为了提高算法的执行效率, 应用粒子群算法求取图像中任意两点间最短路径来定位目标边界, 并与经典的基于Dijkstra 动态规划图搜索的Liv e Wire 算法进行比较.-In order to improve the efficiency of the algorithm, particle swarm algorithm to strike any of images to locate the shortest path between two object boundaries, and
1112
- POJ1112，动态规划，宽度优先搜索预处理-POJ1112, dynamic programming, breadth-first search for pre-
Bitmap
- 采用动态规划思想编写的灰度图像压缩算法。-The use of dynamic programming algorithms written in gray-scale image compression
dynamic-programming-tutorial
- 动态规划简明教程 通过20多个例子 由浅到深 状态由一维到二维再到三维 层层深入-A Concise Guide by dynamic programming in more than 20 examples from shallow to deep condition and then by the one-dimensional to three-dimensional two-dimensional layers of depth
BitMapConduct
- 改程序用动态规划的方法实现了对灰质位图图像的压缩-Change program with the dynamic programming method for gray matter of the bitmap image compression
border_test
- 利用动态规划方法进行在二值图像中的边界跟踪算法-Edge following in binary image using DP
333
- 求凸多边形最优三角剖分。用动态规划问题有效解决该问题。多边形是平面上一条分段线形封闭曲线。-Optimal convex polygon triangulation. Dynamic programming problem with an effective solution to the problem. Sub-polygon is a plane closed curve linear.
alg_Dynamic
- 关于图分割的动态规划问题，求图内分割弦长度的最小和-a dynamic algorithm based on graph splitting