Image segmentation is critical for image processing. Among several algorithms, GrabCut is well known by its little user interaction and desirable segmentation result. However, it needs to take a lot of time to adjust the Gaussian Mixture Model (GMM) and to cut the weighted graph with Max-Flow/Min-Cut Algorithm iteratively. To solve this problem, we first build a common algorithmic framework which can be shared by the class of GrabCut-like segmentation algorithms, and then propose KM_GrabCut algorithm based on this framework. The KM_GrabCut first uses K-means clustering algorithm to cluster pixels in foreground and background respectively, and then constructs a GMM based on each clustering result and cuts the corresponding weighted graph only once. Experimental results demonstrate that KM_GrabCut outperforms GrabCut with higher performance, comparable segmentation result and user interaction.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.