###################################################################
# #
# 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 Vladimir Kolmogorov.
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;
}
///////////////////////////////////////////////////
没有合适的资源?快使用搜索试试~ 我知道了~
毕业设计 基于CFA图像的感兴趣区域提取技术研究源码+详细文档+全部数据资料 高分项目.zip
共1216个文件
m:388个
jpg:208个
html:99个
1.该资源内容由用户上传,如若侵权请联系客服进行举报
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
版权申诉
0 下载量 98 浏览量
2024-05-08
08:23:32
上传
评论
收藏 151.2MB ZIP 举报
温馨提示
【资源说明】 毕业设计 基于CFA图像的感兴趣区域提取技术研究源码+详细文档+全部数据资料 高分项目.zip毕业设计 基于CFA图像的感兴趣区域提取技术研究源码+详细文档+全部数据资料 高分项目.zip 【备注】 1、该项目是高分毕业设计项目源码,已获导师指导认可通过,答辩评审分达到95分 2、该资源内项目代码都经过mac/window10/11/linux测试运行成功,功能ok的情况下才上传的,请放心下载使用! 3、本项目适合计算机相关专业(如软件工程、计科、人工智能、通信工程、自动化、电子信息等)的在校学生、老师或者企业员工下载使用,也可作为毕业设计、课程设计、作业、项目初期立项演示等,当然也适合小白学习进阶。 4、如果基础还行,可以在此代码基础上进行修改,以实现其他功能,也可直接用于毕设、课设、作业等。 欢迎下载,沟通交流,互相学习,共同进步!
资源推荐
资源详情
资源评论
收起资源包目录
毕业设计 基于CFA图像的感兴趣区域提取技术研究源码+详细文档+全部数据资料 高分项目.zip (1216个子文件)
d7d32cff.7z 240KB
treefitw.asv 18KB
treetestw.asv 12KB
get_ROI_HC.asv 7KB
ksdensityw.asv 5KB
trimapGenerateMultipleSegmentations2.asv 1KB
computeQuantMatrix.asv 1KB
trimapGenerateMultipleSegmentations.asv 811B
clean.bat 572B
362.bmp 388KB
362_SLIC.bmp 388KB
319.bmp 352KB
299.bmp 352KB
334.bmp 352KB
319_SLIC.bmp 352KB
299_SLIC.bmp 352KB
334_SLIC.bmp 352KB
31.bmp 314KB
195.bmp 314KB
195_SLIC.bmp 314KB
31_SLIC.bmp 314KB
103.bmp 313KB
282.bmp 313KB
103_SLIC.bmp 313KB
282_SLIC.bmp 313KB
40.bmp 313KB
40_SLIC.bmp 313KB
986.bmp 291KB
986.bmp 291KB
986_SLIC.bmp 291KB
1_1.bmp 96KB
_SLIC.bmp 54B
pdistmex.c 21KB
linkagemex.c 18KB
train.c 9KB
qsort.c 5KB
qsort.c 5KB
dnrm2.c 1KB
ddot.c 1KB
daxpy.c 1KB
dscal.c 1KB
Compile_Check 856B
Compile_Check_kcachegrind 611B
Compile_Check_memcheck 623B
COPYING 18KB
msImageProcessor.cpp 134KB
ms.cpp 72KB
linear.cpp 54KB
DynPath.cpp 44KB
reg_RF.cpp 40KB
Objectness.cpp 33KB
classRF.cpp 33KB
CutPlanar.cpp 27KB
CmSaliencyRC.cpp 21KB
CmCv.cpp 19KB
CmCurveEx.cpp 18KB
rlist.cpp 13KB
mex_regressionRF_train.cpp 12KB
CmColorQua.cpp 12KB
CmEvaluation.cpp 11KB
diabetes_C_wrapper.cpp 11KB
CmShow.cpp 11KB
CmFile.cpp 10KB
CmSalCut.cpp 10KB
classTree2.cpp 10KB
twonorm_C_wrapper.cpp 10KB
rfutils.cpp 9KB
DataSetVOC.cpp 9KB
msSys.cpp 9KB
classTree.cpp 9KB
msSysPrompt.cpp 9KB
CmSaliencyGC.cpp 9KB
mex_ClassificationRF_train.cpp 8KB
CmFile.cpp 8KB
CutShape.cpp 8KB
cokus.cpp 7KB
cokus.cpp 7KB
CGraph.cpp 7KB
CutSegment.cpp 6KB
testCutSegment.cpp 6KB
RAList.cpp 6KB
mex_ClassificationRF_predict.cpp 5KB
tron.cpp 5KB
CutGrid.cpp 5KB
CmGMM.cpp 4KB
testCutPlanar.cpp 4KB
mex_regressionRF_predict.cpp 4KB
treevalc.cpp 4KB
segment-image.cpp 3KB
mexFeatureDistance.cpp 3KB
FilterBING.cpp 3KB
Planar.cpp 3KB
SpRecoUI.cpp 2KB
CmDefinition.cpp 2KB
testCutGrid.cpp 2KB
CmShow.cpp 2KB
PlanarException.cpp 2KB
mexMergeAdjRegs_Felzenszwalb.cpp 2KB
testCutShape.cpp 2KB
mexSegment.cpp 2KB
共 1216 条
- 1
- 2
- 3
- 4
- 5
- 6
- 13
资源评论
不走小道
- 粉丝: 3237
- 资源: 5112
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功