终于和陈贤弟,进入Graphcut得学习了,只是这一块一直为我所难以啃掉得硬骨头,在我毕业之前能不能咬下来,希望可以,只是近日再度回首,发现其涉及得理论,有一点前沿,虽然三四年前提出得东西,但由于作者交代得简单,含糊,使得这一技术得应用受到了严重得限制,几乎很多人都知道 Graphcut可是又有多少人可以实现这个Graphcut呢,寥寥无几吧,一年前我不懂,一年后得今天,还在为这个而愁眉不展,不忘早点解决这个问题,当然,还得于陈贤弟好好交流合作了。 Graphcut是一座大山,可是翻过了这座大山,后面还有一座更大得,不过更激发我兴趣得大山要去翻越。真实永无止境啊! 上次××问我Graphcut怎么实现我不知道,估计他也不一定懂,过段时间我实现了,就可以比上次有更大得进步了。自信也会提高很多得 |
Graph cut
1。学习algorithm课本里的关于graph那一节,或者google maxflow/mincut相关的内容,有介绍mincut的两种解法;
2。然后就开始看用graphcut解决computer vision里的问题,首先要看的是《Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images》iccv 01。这篇paper讲怎么用graphcut来做image segmentation;
3。看 Fast Approximate Energy Minimization via Graph Cuts (Boykov, Veksler and Zabih, PAMI '01),这篇paper系统介绍了如何构造graph和energy term来解stereo disparity, motion等问题,也比较直观的介绍了a-expansion。后面的关于graphcut的TPAMI的文章都没有介绍如何构造graph来解问题,这篇比较关键;
看了以上几个文章后,基本就可以看懂关于graphcut的论文了,就可以深入下去了。
http://www.cs.cornell.edu/~rdz/graphcuts.html
【简介】
Graph Cuts 不等于 graph cut(如 min cut、normalized cut、RatioCut),
这个优化算法用来解
【原理】
<Fast Approximate Energy Minimization via Graph Cuts>【应用】
Graph cuts最主要的应用是图像分割。
在Boykov 和 Kolmogorov 俩人的主页上就有大量的code。包括maxflow/min-cut、stereo algorithms等算法:
http://vision.csd.uwo.ca/code/
http://www.cs.ucl.ac.uk/staff/V.Kolmogorov/software.html
以及olga.
http://www.csd.uwo.ca/faculty/olga/code.html
【toolkit】
Lazy SnappingGrabCutTrackback:
[论文笔记] CUDA Cuts: Fast Graph Cuts on the GPU
2、http://www.wisdom.weizmann.ac.il/~bagon/matlab.html
3、http://www.cs.ucf.edu/vision/public_html/source.html
1、 GraphCut
Paper: Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images.Boykov & Jolly, ICCV 2001
Resource: http://www.cs.cornell.edu/~rdz/graphcuts.html
http://www.csd.uwo.ca/~olga/OldCode.html
http://people.csail.mit.edu/sparis/code/doc/gc/index.html
http://vision.csd.uwo.ca/code/
2、 GrowCut
Paper: Vezhnevets V., Konouchine V., "Grow-Cut" - Interactive Multi-Label N-D Image Segmentation . Accepted to Graphicon-2005.
Resource: http://www.growcut.com/
3、 GrabCut
Paper: C. Rother, V. Kolmogorov, A. Blake. GrabCut: Interactive Foreground Extraction using Iterated Graph Cuts. ACM Transactions on Graphics (SIGGRAPH'04), 2004
Resource:
http://www.cs.ru.ac.za/research/g02m1682/
https://mywebspace.wisc.edu/pwang6/personal/
4、 Lazy Snapping
Paper: Lazy Snapping. Yin Li, Jian Sun, Chi-Keung Tang, Heung-Yeung Shum, SIGGRAPH 2004
Resource: http://research.microsoft.com/en-us/um/people/jiansun/
5、 Interactive Segmentation Tool-Box
Resource: http://www.cs.cmu.edu/~mohitg/Research/segmentation.htm
http://www.imageparsing.com/InteractiveSegmentation.html
6、 Interactive Natural Image Segmentation in Java
Paper: L. A. Consularo and R. M. Cesar-Jr. and I. Bloch, Structural Image Segmentation with Interactive Model Generation, In Proc. IEEE International Conference on Image Processing, 2007.
Resource: http://structuralsegm.sourceforge.net/
7、 Interactive Segmentation Collaboration with Laurent Cohen
Paper: P. Arbelaez and L. Cohen. Constrained Image Segmentation from Hierarchical Boundaries. To appear in CVPR 2008.
Resource: http://www.cs.berkeley.edu/~arbelaez/constrained.html
8、 MSRM
Paper: J. Ning, L. Zhang, David Zhang and C. Wu, “Interactive Image Segmentation by Maximal Similarity based Region Merging,”Pattern Recognition , vol. 43, pp. 445-456, Feb, 2010.
Resource: http://www4.comp.polyu.edu.hk/~cslzhang/code.htm