搜索资源列表
graphcut
- 在计算机视觉中的立体匹配算法----最大流最小割,最新的研究成果.-in computer vision of the stereo matching algorithm-largest flow minimum cut, the latest research results.
最大流最小割
- 图割算法，最大流最小割，用于图像分割。
max flow/min cut
- max flow/min cut 实现最大流最小割算法的程序
graph_cut
- 最大流最小割的代码，功能很好很强大，可以用在图形剪除这方面。-Maximum flow minimum cut of the code, very very powerful feature can be used to cut off this area in the graphics.
dinic_l
- 主要实现图片的打开，并用最大流最小割定理实现图片的切割-Picture open, and the maximum flow minimum cut theorem of pictures cut
Algorithm
- 一些算法的简单实现，最大流最小割、B树、最大堆、最短路径等-Simple implementation of the algorithm, the maximum flow minimum cut tree B, the maximum heap shortest path
Puma-phase-unwrapping
- 利用图割方法（最大流最小割）进行相位解缠-Use graph cut method (maximum flow minimum cut) for phase unwrapping
maxflowmincut
- 基于图论的图像分割——最大流最小割算法。内含最大流最小割算法通用matlab程序。-Maximum flow minimum cut algorithm- based on graph theory image segmentation. Maximum flow minimum cut algorithm contains generic matlab program.
maxflow
- 最大流 最小割 是图割理论的重要部分，能用于双目立体视觉的立体匹配当中。-Max-flow is the important part of graph-cut theory,it also used to the stereo matching.
dinic
- dinic算法的实现。用来计算最大流最小割问题-Dinic algorithm for solving min-cut or max-flow problems
maxflow
- 最大流分割程序，利用最大流最小割定理进行图像分割的matlab源码-Maximum flow segmentation program, using the maximum flow minimum cut theorem for image segmentation matlab source
Bk_matlab
- 利用能量最小法中的图割法，解决图像分类问题，最大流=最小割(The minimum method of energy in the map cut method to solve the problem of image classification)