文件名称：Boykov的GraphCut算法
文件大小：67KB
文件格式：ZIP
更新时间：2015-07-27 03:44:54
GraphCut
Boykov的经典的Labeling算法，用于GraphCut。 To use this software, YOU MUST CITE the following in any resulting publication: [1] Efficient Approximate Energy Minimization via Graph Cuts. Y. Boykov, O. Veksler, R.Zabih. IEEE TPAMI, 20(12):1222-1239, Nov 2001. [2] What Energy Functions can be Minimized via Graph Cuts? V. Kolmogorov, R.Zabih. IEEE TPAMI, 26(2):147-159, Feb 2004. [3] An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. Y. Boykov, V. Kolmogorov. IEEE TPAMI, 26(9):1124-1137, Sep 2004. Furthermore, if you use the label cost feature (setLabelCost), you should cite [4] Fast Approximate Energy Minimization with Label Costs. A. Delong, A. Osokin, H. N. Isack, Y. Boykov. In CVPR, June 2010.
【文件预览】：
Labeling
----GCoptimization.cpp(60KB)
----matlab()
--------GCO_Delete.m(223B)
--------GCO_Create.m(526B)
--------GCO_SetLabelOrder.m(607B)
--------GCO_ComputeEnergy.m(387B)
--------README.TXT(7KB)
--------GCO_SetVerbosity.m(1KB)
--------GCO_ListHandles.m(370B)
--------gco_matlab.cpp(18KB)
--------GCO_SetDataCost.m(2KB)
--------GCO_Swap.m(702B)
--------GCO_GetLabeling.m(670B)
--------GCO_Expansion.m(1KB)
--------GCO_SetNeighbors.m(1KB)
--------GCO_BuildLib.m(2KB)
--------GCO_SetLabelCost.m(2KB)
--------GCO_SetLabeling.m(787B)
--------GCO_LoadLib.m(507B)
--------GCO_UnitTest.m(16KB)
--------GCO_SetSmoothCost.m(1KB)
--------GCO_ExpandOnAlpha.m(303B)
----block.h(7KB)
----example.cpp(13KB)
----LinkedBlockList.h(2KB)
----energy.h(10KB)
----LinkedBlockList.cpp(1KB)
----GCoptimization.h(26KB)
----graph.h(17KB)
----maxflow.cpp(17KB)
----GCO_README.TXT(21KB)
----graph.cpp(3KB)