Graph cuts in computer vision (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graph cuts in computer vision" in English language version.

refsWebsite

Global rank English rank

3cornell.edu

332^nd place

246^th place

2leogrady.net

low place

1mit.edu

415^th place

327^th place

1uchicago.edu

230^th place

214^th place

1brown.edu

2,481^st place

1,558^th place

1uwo.ca

5,491^st place

3,397^th place

1ai.google

low place

1psu.edu

207^th place

136^th place

1ist.ac.at

low place

1lipn.fr

low place

1web.archive.org

1^st place

1polymtl.ca

low place

1microsoft.com

153^rd place

151^st place

1ucl.ac.uk

1,306^th place

885^th place

1storage.googleapis.com

5,609^th place

3,891^st place

1doi.org

2^nd place

1worldcat.org

5^th place

ai.google

Ben Appleton and Hugues Talbot (2006), "Globally Minimal Surfaces by Continuous Maximal Flows", IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 106–118

brown.edu

dam.brown.edu

D. Geman and S. Geman (1984), Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images, IEEE Trans. Pattern Anal. Mach. Intell., 6, 721–741.

cornell.edu

cs.cornell.edu

Boykov, Y., Veksler, O., and Zabih, R. (2001), "Fast approximate energy minimization via graph cuts," IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11): 1222-1239.
Y. Boykov, O. Veksler and R. Zabih (1998), "Markov Random Fields with Efficient Approximations", International Conference on Computer Vision and Pattern Recognition (CVPR).
Y. Boykov, O. Veksler and R. Zabih (2001), "Fast approximate energy minimisation via graph cuts", IEEE Transactions on Pattern Analysis and Machine Intelligence, 29, 1222–1239.

doi.org

Cederbaum, I. (1962-08-01). "On optimal operation of communication nets". Journal of the Franklin Institute. 274 (2): 130–141. doi:10.1016/0016-0032(62)90401-5. ISSN 0016-0032.

ist.ac.at

pub.ist.ac.at

Vladimir Kolmogorov and Yuri Boykov (2005), "What Metrics Can Be Approximated by Geo-Cuts, or Global Optimization of Length/Area and Flux", Proc. of ICCV pp. 564–571

leogrady.net

Camille Couprie, Leo Grady, Laurent Najman and Hugues Talbot, "Power Watersheds: A Unifying Graph-Based Optimization Framework”, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 33, No. 7, pp. 1384-1399, July 2011
Leo Grady and Christopher Alvino (2009), "The Piecewise Smooth Mumford-Shah Functional on an Arbitrary Graph", IEEE Trans. on Image Processing, pp. 2547–2561

lipn.fr

Nicolas Lermé, François Malgouyres and Lucas Létocart (2010), "Reducing graphs in graph cut segmentation Archived 2012-03-27 at the Wayback Machine", Proc. of ICIP, pp. 3045–3048

microsoft.com

research.microsoft.com

Yin Li, Jian Sun, Chi-Keung Tang, and Heung-Yeung Shum (2004), "Lazy Snapping", ACM Transactions on Graphics, pp. 303–308

mit.edu

persci.mit.edu

Adelson, Edward H., and James R. Bergen (1991), "The plenoptic function and the elements of early vision", Computational models of visual processing 1.2 (1991).

polymtl.ca

step.polymtl.ca

Herve Lombaert, Yiyong Sun, Leo Grady, Chenyang Xu (2005), "A Multilevel Banded Graph Cuts Method for Fast Image Segmentation", Proc. of ICCV, pp. 259–265

psu.edu

citeseerx.ist.psu.edu

Ali Kemal Sinop and Leo Grady, "A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields A New Algorithm", Proc. of ICCV, 2007

storage.googleapis.com

patentimages.storage.googleapis.com

P.J. Yim: "Method and System for Image Segmentation," United States Patent US8929636, January 6, 2016

uchicago.edu

classes.cs.uchicago.edu

D.M. Greig, B.T. Porteous and A.H. Seheult (1989), Exact maximum a posteriori estimation for binary images, Journal of the Royal Statistical Society, Series B, 51, 271–279.

ucl.ac.uk

discovery.ucl.ac.uk

Yuri Boykov, Vladimir Kolmogorov: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9): 1124–1137 (2004)

uwo.ca

csd.uwo.ca

Yuri Boykov and Vladimir Kolmogorov (2003), "Computing Geodesics and Minimal Surfaces via Graph Cuts", Proc. of ICCV

web.archive.org

Nicolas Lermé, François Malgouyres and Lucas Létocart (2010), "Reducing graphs in graph cut segmentation Archived 2012-03-27 at the Wayback Machine", Proc. of ICIP, pp. 3045–3048

worldcat.org

search.worldcat.org

Cederbaum, I. (1962-08-01). "On optimal operation of communication nets". Journal of the Franklin Institute. 274 (2): 130–141. doi:10.1016/0016-0032(62)90401-5. ISSN 0016-0032.