Existing Methods
- Standard Graph cuts: optimize energy function over the segmentation (unknown S value).
- Iterated Graph cuts:
- First step optimizes over the color parameters using K-means.
- Second step performs the usual graph cuts algorithm.
- These 2 steps are repeated recursively until convergence.
- Dynamic graph cuts:
Allows to re-run the algorithm much faster after modifying the problem (e.g. after new seeds have been added by a user).
Read more about this topic: Graph Cuts In Computer Vision
Famous quotes containing the words existing and/or methods:
“The mere idea of marriage, as a strong possibility, if not always nowadays a reasonable likelihood, existing to weaken the will by distracting its straight aim in the life of practically every young girl, is the simple secret of their confessed inferiority in men’s pursuits and professions to-day.”
—William Bolitho (1890–1930)
“All men are equally proud. The only difference is that not all take the same methods of showing it.”
—François, Duc De La Rochefoucauld (1613–1680)