搜索资源列表
cut.c
- cut.c 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？
segment on graph cut
- segment on graph cut
graph-cut background subtraction
- 基于graph-cut的背景减除算法。.....
max flow/min cut
- max flow/min cut 实现最大流最小割算法的程序
grow-cut MATLAB代码
- growcut的MATLAB源代码，可以跑通
3_MinCut.rar
- 一个经典的求解最大流最小割代码 VC++版本,A classical solution of maximum flow minimum cut code VC++ Version
Graph_Cut.rar
- Graph Cut algorithm implementation. Includes MATLAB compiled codes.,Graph Cut algorithm implementation. Includes MATLAB compiled codes.
000GrabCut.zip
- graph cut algorithm ,graph cut algorithm
GrabCut.zip
- Implementation of grab cut image segmentation algorithm,Implementation of grab cut image segmentation algorithm
GraphCutSegmentationInTensorSpace
- 英国sussex大学图像研究所James Malcolm博士写的Graph cut分割，可对图像进行实时分割，解压到linux下后可直接编译运行-Graph cut segmentation in tensor space Often intensity alone does not provide enough discriminating power for image segmentation. This work demonstrates extending the standard
hanfeng612
- matlab gui界面设计，包括：图像的剪切和显示，彩色图像灰度直方图获取；灰度直方图，直方图均衡化和直方图匹配等-matlab gui interface design, including: images cut and shows histogram for color image gray histogram, histogram equalization and histogram matching
FGseg2
- 采用graph-cut背景减除的算法-backgroud subtraction algorithm using graph-cut
gco-v3.0
- graph cut 优化算法的最新版本，包含C++版本（在VS2005以上版本可以调通）和Matlab接口，-graph cut optimization algorithm of the latest version, includes C++ version (or later in the VS2005 can be transferred through) and the Matlab interface
brain
- MICCAI2008脑影像分割文章，包括Interactive Liver Tumor Segmentation using Graph-cut and watershed等-Brain image segmentation MICCAI2008 articles, including the Interactive Liver Tumor Segmentation using Graph-cut and watershed, etc.
Ncut
- 自己写的Normalized Cut图像分割，聚类程序，程序非常清晰，花了很长时间调试。-Normalize Cut
graph cut优化库
- graph cut --matlab c++混编 graph cut优化库
GraphCut
- Graph cut经典算法实现，本人整理的，进一步理解图割理论的知识-Graph cut
NetCut-3.0
- net cut is soft were to know who is use ur network. you can cut conection of your client or hacker that make ur system error-net cut is soft were to know who is use ur network. you can cut conection of your client or hacker that make ur system error
cut-the-minimum-cut-problem
- cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ， t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum cut problem network G = (V, E)
Maximum flow / min cut
- Maximum flow / minimum cut through path algorithm