Image Segmentation by Iterated Region Merging with Localized Graph Cuts

View Researcher's Other Codes

The software used in the paper: “Image Segmentation by Iterated Region Merging with Localized Graph Cuts”.

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors Bo Peng, Lei Zhang, David Zhang, and Jian Yang
Journal/Conference Name Pattern Recognition
Paper Category
Paper Abstract This paper presents an iterated region merging-based graph cuts algorithm which is a novel extension of the standard graph cuts algorithm. Graph cuts addresses segmentation in an optimization framework and finds a globally optimal solution to a wide class of energy functions. However, the extraction of objects in a complex background often requires a lot of user interaction. The proposed algorithm starts from the user labeled sub-graph and works iteratively to label the surrounding un-segmented regions. In each iteration, only the local neighboring regions to the labeled regions are involved in the optimization so that much interference from the far unknown regions can be significantly reduced. Meanwhile, the data models of the object and back-ground are updated iteratively based on high confident labeled regions. The sub-graph requires less user guidance for segmentation and thus better results can be obtained under the same amount of user interaction. Experiments on benchmark datasets validated that our method yields much better segmentation results than the standard graph cuts and the Grab cut methods in either qualitative or quantitative evaluation.
Date of publication 2011
Code Programming Language C++

Copyright Researcher 2022