Revision as of 07:52, 8 April 2007 edit JHMM13 (talk \| contribs) Extended confirmed users 7,510 edits db-nocontent ← Previous edit		Revision as of 07:56, 8 April 2007 edit undo Bruceporteous (talk \| contribs) 96 edits No edit summary Next edit →
Line 2: The theory of graph cuts, [[Cut (graph theory)]], was first applied in [[Computer vision]] in the "classic" paper: == References == *D.M. Greig, B.T. Porteous, A.H. Seheult, ''Exact maximum a posteriori estimation for binary images'', Journal of the Royal Statistical Society Series B, 271 - 279 (1989)

Graph cuts in computer vision: Difference between revisions