计划读的文献-Graph Cut

1, Fast Approximate Energy Minimization via Graph Cuts. PAMI 2001

2, An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.  PAMI 2004

3, What Energy Functions can be Minimized via Graph Cuts? PAMI 2004

4, Fast Approximate Energy Minimization with Label Costs IJCV2012

5, Efficient Planar Graph Cuts with Applications in Computer Vision CVPR2009

6，A Scalable Graph-Cut Algorithm for N-D Grids CVPR2008

 

 

相关代码：

http://vision.csd.uwo.ca/code/