History
The theory of graph cuts was first applied in computer vision in the paper by Greig, Porteous and Seheult of Durham University. In the Bayesian statistical context of smoothing noisy (or corrupted) images, they showed how the maximum a posteriori estimate of a binary image can be obtained exactly by maximizing the flow through an associated image network, involving the introduction of a source and sink. The problem was therefore shown to be efficiently solvable. Prior to this result, approximate techniques such as simulated annealing (as proposed by the Geman brothers), or iterated conditional modes (a type of greedy algorithm as suggested by Julian Besag)) were used to solve such image smoothing problems.
Although the general -colour problem remains unsolved for the approach of Greig, Porteous and Seheult has turned out to have wide applicability in general computer vision problems. Greig, Porteous and Seheult approaches are often applied iteratively to a sequence of binary problems, usually yielding near optimal solutions; see the article by Funka-Lea et al. for a recent application.
Read more about this topic: Graph Cuts In Computer Vision
Famous quotes containing the word history:
“History ... is, indeed, little more than the register of the crimes, follies, and misfortunes of mankind.
But what experience and history teach is this—that peoples and governments have never learned anything from history, or acted on principles deduced from it.”
—Georg Wilhelm Friedrich Hegel (1770–1831)
“Like their personal lives, women’s history is fragmented, interrupted; a shadow history of human beings whose existence has been shaped by the efforts and the demands of others.”
—Elizabeth Janeway (b. 1913)
“False history gets made all day, any day,
the truth of the new is never on the news
False history gets written every day
...
the lesbian archaeologist watches herself
sifting her own life out from the shards she’s piecing,
asking the clay all questions but her own.”
—Adrienne Rich (b. 1929)