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 history of all hitherto existing society is the history of class struggles.”
—Karl Marx (1818–1883)
“I believe in women; and in their right to their own best possibilities in every department of life. I believe that the methods of dress practiced among women are a marked hindrance to the realization of these possibilities, and should be scorned or persuaded out of society.”
—Elizabeth Stuart Phelps (1844–1911)