Revision as of 15:28, 20 September 2007 edit John Vandenberg (talk \| contribs) Extended confirmed users 68,510 edits →References: link to recently created Journal of the Royal Statistical Society ← Previous edit		Revision as of 17:35, 14 November 2007 edit undo 64.46.248.8 (talk) added first names for keyword search Next edit →
Line 14: * Y. Boykov, O. Veksler and R. Zabih (1998), "[http://www.cs.cornell.edu/~rdz/Papers/BVZ-cvpr98.pdf Markov Random Fields with Efficient Approximations]", ''International Conference on Computer Vision and Pattern Recognition (CVPR)''. * Y. Boykov, O. Veksler and R. Zabih (2001), "[http://www.cs.cornell.edu/~rdz/Papers/BVZ-pami01-final.pdf Fast approximate energy minimisation via graph cuts]", ''IEEE Transactions on Pattern Analysis and Machine Intelligence'', '''29''', 1222 - 1239. G.Gareth Funka-Lea, Y.Yuri Boykov, C.Charles Florin, M. P. Jolly, R.Romain Moreau-Gobard, R. Ramaraj and D. Rinck (2006), ''Automatic heart isolation for CT coronary visualization using graph cuts'', IEEE International Symposium on Biomedical Imaging, 614 - 617. D. Geman and S. Geman (1984), ''Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images'', IEEE Trans. Pattn Anal. Mach. Intell., '''6''', 721 - 741. *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.

Graph cuts in computer vision: Difference between revisions