###################################################################
#
#
# MAXFLOW - software for computing mincut/maxflow in a graph
#
#Version 3.01
#
# http://www.cs.ucl.ac.uk/staff/V.Kolmogorov/software.html
#
##
# Yuri Boykov (yuri@csd.uwo.ca)
#
# Vladimir Kolmogorov (v.kolmogorov@cs.ucl.ac.uk)
#
# 2001-2006
#
###################################################################
1. Introduction.
This software library implements the maxflow algorithm described in
"An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision."
Yuri Boykov and VladimirKolmogorov.
In IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI),
September 2004
This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov
at Siemens Corporate Research. To make it available for public use,
it was later reimplemented by Vladimir Kolmogorov based on open publications.
If you use this software for research purposes, you should cite
the aforementioned paper in any resulting publication.
--------------------------------------------------------------------
REUSING TREES:
Starting with version 3.0, there is a also an option of reusing search
trees from one maxflow computation to the next, as described in
"Efficiently Solving Dynamic Markov Random Fields Using Graph Cuts."
Pushmeet Kohli and Philip H.S. Torr
International Conference on Computer Vision (ICCV), 2005
If you use this option, you should cite
the aforementioned paper in any resulting publication.
Tested under windows, Visual C++ 6.0 compiler and unix (SunOS 5.8
and RedHat Linux 7.0, GNU c++ compiler).
##################################################################
2. License & disclaimer.
Copyright 2001-2006 Vladimir Kolmogorov (v.kolmogorov@cs.ucl.ac.uk), Yuri Boykov (yuri@csd.uwo.ca).
This software can be used for research purposes only.
If you require another license, you may consider using version 2.21
(which implements exactly the same algorithm, but does not have the option of reusing search trees).
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
##################################################################
3. Example usage.
This section shows how to use the library to compute
a minimum cut on the following graph:
SOURCE
/ \
1/ \2
/ 3\
node0 -----> node1|<----- |
| 4 |
\/
5\ /6
\ /
SINK
///////////////////////////////////////////////////
#include <stdio.h>
#include "graph.h"
int main()
{
typedef Graph<int,int,int> GraphType;
GraphType *g = new GraphType(/*estimated # of nodes*/ 2, /*estimated # of edges*/ 1);
g -> add_node();
g -> add_node();
g -> add_tweights( 0, /* capacities */ 1, 5 );
g -> add_tweights( 1, /* capacities */ 2, 6 );
g -> add_edge( 0, 1, /* capacities */ 3, 4 );
int flow = g -> maxflow();
printf("Flow = %d\n", flow);
printf("Minimum cut:\n");
if (g->what_segment(0) == GraphType::SOURCE)
printf("node0 is in the SOURCE set\n");
else
printf("node0 is in the SINK set\n");
if (g->what_segment(1) == GraphType::SOURCE)
printf("node1 is in the SOURCE set\n");
else
printf("node1 is in the SINK set\n");
delete g;
return 0;
}
///////////////////////////////////////////////////
没有合适的资源?快使用搜索试试~ 我知道了~
温馨提示
graphcut 入门 方法 经典文献 Fast Approximate Energy Minimization via Graph Cuts Interactive Graph Cuts for Optimal Boundary & Region Segmentation KBR-ICCV07Applications of parametric maxflow in computer vision Markov Random Fields with Efficient Approximations ijcv06Graph Cuts and Efficient N-D Image Segmentation ICCV01Interactive Graph Cuts for Optimal Boundary & Region Segmentation Interactive Organ Segmentation using Graph Cuts Hierarchical Segmentation Satisfying Constraints Exact Maximum A Posteriori Estimation for Binary Images
资源推荐
资源详情
资源评论
收起资源包目录
graphcut入门.rar (21个子文件)
graphcut入门
Fast Approximate Energy Minimization via Graph Cuts
Markov Random Fields with Efficient Approximations.pdf 226KB
pami01.pdf 586KB
说明.doc 22KB
Interactive Graph Cuts for Optimal Boundary & Region Segmentation
reference
MAP-MRF
BVZ-cvpr98.pdf 172KB
Exact Maximum A Posteriori Estimation for Binary Images.pdf 926KB
Hierarchical Segmentation Satisfying Constraints.pdf 2.59MB
mincutmaxflow implement
maxflow-v3.01.src
CHANGES.TXT 1KB
graph.h 17KB
README.TXT 4KB
maxflow.cpp 15KB
block.h 7KB
instances.inc 394B
graph.cpp 3KB
pami04.pdf 615KB
papers_iccv05.pdf 270KB
emmcvpr01.pdf 358KB
maxflow-v3.01.src.tar.gz 13KB
Interactive Organ Segmentation using Graph Cuts.pdf 294KB
ijcv06Graph Cuts and Efficient N-D Image Segmentation.pdf 953KB
ICCV01Interactive Graph Cuts for Optimal Boundary & Region Segmentation ....pdf 316KB
KBR-ICCV07Applications of parametric maxflow in computer vision.pdf 1.35MB
共 21 条
- 1
资源评论
- iwillbeok1234562013-04-20很适合初学者,会好好学习一下的
- xvanwuxvan2016-12-30没什么用,都是一些可以很容易就到下载的东西。
- liuhang20132014-04-13比较全面,适合初学者,认真看下去有收获
mqh1987000
- 粉丝: 1
- 资源: 39
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- 基于keras+fasterRCNN,在VOC格式的口罩数据集上训练,检测人群中有无戴口罩python源码+模型
- 基于opencv+qt5机器视觉的传统缺陷检测, 即采用标准图片和待测图片进行pixel to pixel的XOR操作源码+文档
- 管道内检测缺陷数据库管理系统源码+文档说明+sln
- 毕业设计-低功耗STM32F411开发板(原理图+PCB源文件+官方例程+驱动等)源码+文档说明+截图
- 基于yolov5-tensorRT检测+发动机缸体内壁缺陷检测系统源码+文档说明
- 基于C++实现的锂电池缺陷检测源码+文档说明
- push_version
- 软件自制图像批量压缩工具
- 经典缺陷检测算法源码整理包含PaDiM(2020ICPR)、PatchCore(2022CVPR)、SimpleNet+文档说明
- 基于深度学习的抗梯度噪声的缺陷检测器python源码+文档说明+模型的预训练
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功