搜索资源列表
paper-and-matlab-code
- 新发表论文Graph cuts based active contour model with selective local or global segmentation 附源码，基于图割的主动轮廓模型，用于有选择的局部分割或全局分割，欢迎下载！-Published Graph cuts based active the contour the model with selective local or global a segmentation attached source, the ac
Phase_unrapping_using_Graph_cuts
- 这个程序是干涉合成孔径雷达利用图割做相位解馋经典程序。-phase unwrapping via graph cuts
DE2_2_src
- 利用图割算法，进行立体匹配，也就是图像的深度提取。本程式是针对视频序列的深度估计，该程式是名古屋大学开发的-Using the graph cut algorithm for stereo matching, that is, the depth of the image extracted. This program is the depth estimation for video sequences, the program is developed by Nagoya Universit
NGC_ACM
- 图割（GC)和主动轮廓模型（ACM)相结合的一种图像分割方法，既可以进行局部图像的分割，也可进行全局图像的分割，简单实用。-A combination of graph cuts (GC) and the active contour model (ACM) image segmentation method, either local image segmentation, global image segmentation, simple and practical.
graph-cut-method-to-segment-images
- 基于图割方法的图像分割程序代码，希望对您有帮助哦！-graph cut method to segment images, it is nessary for you to have a look if you are doing image segmentation.
demoBiasedNcut.tar
- 图割算法的一种，NCut， normalized Cut。在聚类分析时，比一般基于图割方法更有效。-A graph cut algorithm, NCut, normalized Cut. Cluster analysis method based on graph cuts than the general more effective.
random-walker
- 随机游走在图像分割中的应用，它类似于图割算法，利用谱信息进行分割 -random walker
max_min_segment
- 最大流/最小割方法。为学习图像处理中的图割算法做准备，算法思想是Ford-Fulkerson方法。最大流是一个有向图，最小割就是网络中所有割中值最小的那个割。 -Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method.
fahtnytemudm
- 这是一个使用图割算法实现的图像分割程序自动加手动实现精确分割。-This is a graph cut algorithm using image segmentation program automatically added manually to achieve accurate segmentation.
gco-v3.0
- 这是一种图割算法的实现，包含标签的设置、能量函数的构造以及最大流/最小割算法的实现-This is a graph cut algorithm, including the Settings tab, the structure and function of the maximum energy flow/minimum cut algorithm implementation
Puma-phase-unwrapping
- 利用图割方法（最大流最小割）进行相位解缠-Use graph cut method (maximum flow minimum cut) for phase unwrapping
BVZ-pami01-final
- 通过图割的快速近似能量最小化。图像分割：最小割最大-Fast Approximate Energy Minimization via Graph Cuts
gco-v3.0
- graphcut 程序，非常经典以及使用，能够准确经常图割算法-Graphcut procedures, very classic and use, can accurate often graph cut algorithm
scanalyze-1.0.3a.win32.bin
- graphcut 程序，非常经典以及使用，能够准确经常图割算法-Graphcut procedures, very classic and use, can accurate often graph cut algorithm
growcut
- 图割matlab和C++源代码，自带一个例子！-Grow cut matlab source code
graph-cut
- 图割算法的实现代码，里面的内容很详细，也具体，是作者本人提供的-grahp cut
cc
- 系统地综述了基于MRF的图像分割方法。介绍了基于MRF模型的图像分割理论框架,给出了当前MRF图像建模研究的热点问题。概括了基于MRF模型的图像分割算法,包括图割算法、归一化割算法、置信度传播算法等,指出了这些算法的发展方向-Summarized the image segmentation method based on MRF. Introduces the image segmentation based on MRF model theory framework, gives the h
Graph_segment
- 基于图的快速图像分割源码，使用一种快速的图割法-Source Code for segment the image, using a effiecient graph base segment method
Graph-Cut
- 详细介绍了图割算法的原理和过程，最终得到深度图。-High Quality Depth Map Estimation Method Based on Graph Cut
Ncut_9
- 基于谱聚类算法的实现，规格化的图割算法实现-Achieve spectral clustering algorithm, the normalized graph cut algorithm