Kolmogorov将graph cut应用于立体视觉的实例源码match-v3.1

对Vladimir Kolmogorov，Yuri Boykov大牛的算法杰作——Graph Cut进行使用演示，代码力求精简，可供Graph Cut初学者参考学习。已通过VS2005编译。-Of Vladimir Kolmogorov, Yuri Boykov big cow masterpiece algorithm- Graph Cut for the use of demonstration, the code to be simple, for beginners Reference

基于文献“计算机视觉中的能量函数最小化的最小割/最大流”的最大流算法实现-An implementation of the maxflow algorithm described in An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. Yuri Boykov and Vladimir Kolmogorov.

This directory contains the MRF energy minimization software accompanying the paper [1] A Comparative Study of Energy Minimization Methods for Markov Random Fields. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarw