搜索资源列表
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源代码，可以跑通
IEC 60793-1-44 Optical fibres - Measurement methods and test procedures - Cut-off wavelength
- IEC 60793-1-44 Optical fibres - Measurement methods and test procedures - Cut-off wavelength
最大流最小割定理
- 最大流最小割定理-maximum flow minimum cut theorem
C_Sharp版的记事本
- 一个不错的C#记事本,实现了基本的剪贴,复制,粘贴...换有打印,页面设置,很类似于Windows自带的记事本啊,很不错啊,一定要看.-a good C# notebook, the realization of the basic cut-and-paste, copy, paste ... for a print page setup, very similar to the Windows Notepad ah, which wa
Cut_Line
- 直线的裁剪 直线的裁剪-cutting straight line cut straight cutting line cut straight cut
match-v3.1.src.tar
- 计算机视觉中Stereo Vision的Graph Cut实现。一个比较Robust的算法。-computer vision Stereo Vision Graph Cut achieve. A more robust algorithm.
graphcut
- 在计算机视觉中的立体匹配算法----最大流最小割,最新的研究成果.-in computer vision of the stereo matching algorithm-largest flow minimum cut, the latest research results.
cutbmpy
- cut bmp file from the column direction. User can choose where the image should be cut.-cut bmp file from the column direction. Use r can choose where the image should be cut.
NcutClustering_7
- 这是N-Cut算法的matlab程序，可用于图像分割等-This is the N-Cut algorithm Matlab procedures can be used for image segmentation, etc.
NcutImage_7_AMD64
- Normalized cut code in matlab -Normalized cut code in Matlab
match-v3.2.src.tar
- the newest graph cut source code and there are some new algorithm in it-the newest graph cut source code and there a 're some new algorithm in it
branch-cut
- 干涉合成孔径雷达成像的相位解缠的枝切法程序。-Interferometric synthetic aperture radar imaging of the phase unwrapping process of the branch-cut method.
cut
- 完成计算机图形学中图形的裁剪，首先绘制四边形，然后绘制直线，将四边形外的部分裁剪掉。-Completion of computer graphics in the cut graph, first of all draw quadrilateral, and then draw a straight line will be outside the quadrilateral part of cutting out.
branch-and-cut-algorithm
- 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。-Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to int
cut
- image segmentation: introduction of graph cut, grab cut, normalize cut,-image segmentation: introduction of graph cut, grab cut, normalize cut,...
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