JF-Cut: A Parallel Graph Cut Approach for Large-Scale Image and Video
暂无分享,去创建一个
Li Chen | Wei Chen | Jun-Hai Yong | Yi Peng | Fang-Xin Ou-Yang | Wei Chen | J. Yong | Yi Peng | Li Chen | Fang-Xin Ou-Yang
[1] A. Grimshaw,et al. High Performance and Scalable Radix Sorting: a Case Study of Implementing Dynamic Parallelism for GPU Computing , 2011, Parallel Process. Lett..
[2] Vladimir Kolmogorov,et al. An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..
[3] Andrew Blake,et al. "GrabCut" , 2004, ACM Trans. Graph..
[4] Calvin R. Maurer,et al. A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[5] Dhruv Batra,et al. MaxFlow Revisited: An Empirical Comparison of Maxflow Algorithms for Dense Vision Problems , 2012, BMVC.
[6] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[7] Leo Grady,et al. A multilevel banded graph cuts method for fast image segmentation , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[8] Alexander Sorkine-Hornung,et al. Cache-efficient graph cuts on structured grids , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[9] Jian Sun,et al. Parallel graph-cuts by adaptive bottom-up merging , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[10] Tiow Seng Tan,et al. Jump flooding in GPU with applications to Voronoi diagram and distance transform , 2006, I3D '06.
[11] Ross T. Whitaker,et al. Curvature-based transfer functions for direct volume rendering: methods and applications , 2003, IEEE Visualization, 2003. VIS 2003..
[12] Han-Wei Shen,et al. View selection for volume rendering , 2005, VIS 05. IEEE Visualization, 2005..
[13] Maneesh Agrawala,et al. Interactive video cutout , 2005, ACM Trans. Graph..
[14] Joe Michael Kniss,et al. Multidimensional Transfer Functions for Interactive Volume Rendering , 2002, IEEE Trans. Vis. Comput. Graph..
[15] Andrew V. Goldberg,et al. The Partial Augment-Relabel Algorithm for the Maximum Flow Problem , 2008, ESA.
[16] Li Chen,et al. Multi-feature based transfer function design for 3D medical image visualization , 2010, 2010 3rd International Conference on Biomedical Engineering and Informatics.
[17] Xiaoru Yuan,et al. Volume cutout , 2005, The Visual Computer.
[18] Kwan-Liu Ma,et al. Visibility Histograms and Visibility-Driven Transfer Functions , 2011, IEEE Transactions on Visualization and Computer Graphics.
[19] Vladimir Kolmogorov,et al. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[20] P. J. Narayanan,et al. CUDA cuts: Fast graph cuts on the GPU , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.
[21] Harry Shum,et al. Lazy snapping , 2004, ACM Trans. Graph..
[22] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[23] James B. Orlin,et al. Max flows in O(nm) time, or better , 2013, STOC '13.