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 yearly expenses of the existing religious system ... exceed in these United States twenty millions of dollars. Twenty millions! For teaching what? Things unseen and causes unknown!... Twenty millions would more than suffice to make us wise; and alas! do they not more than suffice to make us foolish?”
—Frances Wright (1795–1852)
“The philosopher is in advance of his age even in the outward form of his life. He is not fed, sheltered, clothed, warmed, like his contemporaries. How can a man be a philosopher and not maintain his vital heat by better methods than other men?”
—Henry David Thoreau (1817–1862)