This article may meet Wikipedia's criteria for speedy deletion as an article that contains no content whatsoever, or consists only of external links, categories, a "see also" section, a rephrasing of the title, chat-like comments, template tags, and/or images. Disambiguation pages and redirects are not eligible for this criterion. A very short article may still be a valid stub if there is sufficient context to identify the subject. See CSD A3.
If this article does not meet the criteria for speedy deletion, or you intend to fix it, please remove this notice, but do not remove this notice from pages that you have created yourself. If you created this page and you disagree with the given reason for deletion, you can click the button below and leave a message explaining why you believe it should not be deleted. You can also visit the talk page to check if you have received a response to your message. Note that this article may be deleted at any time if it unquestionably meets the speedy deletion criteria, or if an explanation posted to the talk page is found to be insufficient.
Note to administrators: this article has content on its talk page which should be checked before deletion. Administrators: check links, talk, history (last), and logs before deletion. Consider checking Google.This page was last edited by Bruceporteous (contribs | logs) at 07:56, 8 April 2007 (UTC) (18 years ago) |
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)