Parallel and distributed graph cuts by dual decomposition
暂无分享,去创建一个
[1] 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.
[2] Andrew Blake,et al. Fusion Moves for Markov Random Field Optimization , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3] Daniel Cremers,et al. An Experimental Comparison of Discrete and Continuous Shape Optimization Methods , 2008, ECCV.
[4] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .
[5] Harry Shum,et al. Paint selection , 2009, ACM Trans. Graph..
[6] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[7] Nikos Komodakis,et al. MRF Optimization via Dual Decomposition: Message-Passing Revisited , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[8] P. Kohli,et al. Efficiently solving dynamic Markov random fields using graph cuts , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[9] John Staples,et al. The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..
[10] Olga Veksler,et al. Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).
[11] D. Greig,et al. Exact Maximum A Posteriori Estimation for Binary Images , 1989 .
[12] Harvey J. Everett. Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .
[13] Jitendra Malik,et al. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[14] Andrew Blake,et al. "GrabCut" , 2004, ACM Trans. Graph..
[15] Camillo J. Taylor,et al. Graph Cuts via $\ell_1$ Norm Minimization , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] Dana H. Ballard,et al. Computer Vision , 1982 .
[17] 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.
[18] Jian Sun,et al. Parallel graph-cuts by adaptive bottom-up merging , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[19] Yuri Boykov,et al. A Scalable graph-cut algorithm for N-D grids , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[20] Victor S. Lempitsky,et al. Global Optimization for Shape Fitting , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[21] Nancy S. Pollard,et al. Local layering , 2009, SIGGRAPH 2009.
[22] Anders Rantzer,et al. Dynamic dual decomposition for distributed control , 2009, 2009 American Control Conference.