搜索资源列表
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
- 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
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.
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
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
alg_Dynamic
- 关于图分割的动态规划问题，求图内分割弦长度的最小和-a dynamic algorithm based on graph splitting
lane-detection
- 车道偏离识别的程序，采用的是动态规划算法，对弯道也有比较高的识别率-lane departure algorithm, which has good performance even for curve lane.
DPStereoMatch
- 利用动态规划算法的优点，使用一种基于行列动态规划的自适应立体匹配算法，采用自适应代价函数和能量最小化模型，对最优化问题进行求解。-Take advantage of the dynamic programming algorithm uses an adaptive stereo matching algorithm based on dynamic programming ranks, adaptive cost function and energy minimization model f
ImageProcess
- 该程序是全局搜索方式进行立体匹配，算法是采用的动态规划算法，只要自己创建一个工程，即可使用，效果不错-The program is a global search for ways stereo matching algorithm is a dynamic programming algorithm is used, as long as you create a project, you can use, good results
indirect
- dp问题的讲解,动态规划的定义应用等等,主要对于竞赛做题的应用,()
woqla-instantiation
- 自由始端和终端的动态规划,求指标函数最小值的逆序算法递归 ％ 计算程序,x是状态变量,一列代表一个阶段状态；M-函数 ％ De()
czpunco
- 我做的一些C语言练习题,里面一共有76道题目,主要用到一些计算机常用的算法,如 递归,分治,动态规划,回溯法,AO算法等,除()