Fast graph cuts: a weak shape assumption provides a fast exact method for graph cuts segmentation

摘要

Traditional graph cuts provides a powerful method for producing semi-automatic image/volume segmentation, but often exceed available computer power. Multi-level methods for coarsening images/volumes are disclosed that allow for faster processing and creation of graph cuts segmentation without sacrificing quality of image. The disclosed graph cuts methods can be used at interactive speeds.