Graph cuts in computer vision: Difference between revisions

Revision as of 19:56, 17 April 2007

Revision as of 21:02, 20 April 2007

Line 9:

== References ==

*J.E. Besag (1986), ''On the statistical analysis of dirty pictures (with discussion)'', Journal of the Royal Statistical Society Series B, '''48''', 259 - 302.

* Y. Boykov, O. Veksler and R. Zabih (2001), "Faxt''Fast approximate energy minimisation via graph cuts", IEEE Transactions on Pattern Analysis and Machine Intelligence'', '''29''', 1222 - 1239.

*G. Funka-Lea, Y. Boykov, C. Florin, M. P. Jolly, R. 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.