[英]What algorithm opencv GCGRAPH (max flow) is based on?
opencv has an implementation of max-flow algorithm (class GCGRAPH
in file gcgraph.hpp). OpenCV的最大流算法的实现(类
GCGRAPH
文件gcgraph.hpp)。 It's available here . 它可以在这里找到 。
Does anyone know which particular max-flow algorithm is implemented by this class? 有谁知道这个类实现了哪种特定的max-flow算法?
I am not 100% confident about this, but I believe that the algorithm is based on this research paper describing max-flow algorithms for computer vision . 我对此并不是100%有信心,但我相信该算法是基于这篇描述计算机视觉最大流算法的研究论文 。 Specifically, Section 3 describes a new algorithm for computing maximum flows.
具体而言,第3节描述了一种用于计算最大流量的新算法。
I haven't lined up every detail of the paper's algorithm with the implementation of the algorithm, but many details seem to match: 我没有通过算法的实现排列论文算法的每个细节,但许多细节似乎匹配:
// grow S & T search trees, find an edge connecting them
. // grow S & T search trees, find an edge connecting them
。 std::vector<Vtx*> orphans
seems to track in the implementation. std::vector<Vtx*> orphans
似乎在实现中跟踪。 I hope this helps! 我希望这有帮助!
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.