搜索资源列表
MinCut
- Applications of min-cut model.
maxflowandmincut
- 最大流最小分割算法的实现。maxflow -Maximum flow minimum partition algorithm. maxflow
contract-mincut
- Algorytmin Contract for searching minimal cut in simple graf.
ImageSegmentation
- Image Segmentation by Branch-and-Mincut
MinCut
- 这是一个非常好的图象分割程序,基于纹理分割的,保证别人没有上传过-very good image segtation
maxflow-v3.0.src
- MAXFLOW - software for computing mincut/maxflow in a graph Version 3.0- MAXFLOW - software for computing mincut/maxflow in a graph Version 3.0
BranchAndMincut
- 该程序包含“Branch-and-mincut”算法构架的c++可执行文件，可以使用多种高阶先验概率分布进行特定图像的分割。 -This software contains the C++ implementation of the "branch-and-mincut" framework for image segmentation with various high-level priors as described in the paper:
BranchAndMincut
- This software contains the C++ implementation of the "branch-and-mincut" framework for image segmentation-This software contains the C++ implementation of the " branch-and-mincut" framework for image segmentation
mincut
- 这是一重要的图像修补源代码，基于图像快的修补，是修补算法的经典制作（2）-image cutting
dgc
- 动态的基于图模型的图像分割算法 ，利用最大流最小波-DYNNAMIC GRAPH CUTS- software for dynamically computing mincut/maxflow in a graph
mincut
- a very good way for oier or acmer the min cut problem
match-v3.4.src.tar
- 计算机视觉中的，基于图论的图像分割，最大流/最小切-maxflow/mincut ,graph cuts,computer vision
mincut
- An implementation of "A min cut algorithm" by Stoer and Wagner. In addition there is an option to find the minimal cut that does not separate a set of vertices. This is not a mincut-maxflow algorithm.
MinCut
- 实现最小割，基于图的图像分割算法，学习必备。-Minimum cut graph-based image segmentation algorithm, learning essential.
MinCut
- Computer global min-cut in a graph. Implements random contraction algorithm. Need to be run multiple time for better solutions.
LSA_TR_v2.02
- 基于图割方法的图像分割，是一种重要的图像分割个方法。文章是一篇发表在CVPR2014上的文章。-The LSA_TR library is a general optimization algorithm for arbitrary binary pairwise energies. It implements the LSA-TR algorithm. The library includes matlab files along with C++ code for maxflow/mincu
mincut
- A program for mincut graph