|Table of Contents|

Interactive Image Cut Method Based on Graph Cuts(PDF)

南京师范大学学报（工程技术版）[ISSN:1006-6977/CN:61-1281/TN]

Issue:
2014年04期
Page:
62-
Research Field:
Publishing date:

Info

Title:
Interactive Image Cut Method Based on Graph Cuts
Author(s):
Hu Juxin; Ding Bin; Shao Xiaogen
Department of Information and Electrical Engineering,Xuzhou Institute of Technology,Xuzhou 221111,China
Keywords:
graph cuts; image segmentation; max-flow/min-cut; energy function
PACS:
TP391.41
DOI:
-
Abstract:
Graph cut is a kind of image segmentation method based on graph theory.Graph cut realizes the minimization of energy based on max-flow/min-cut theorem.In order to make the method more suitable to various images,the energy function and the work flow of the method can be improved.This paper presents an image segmentation method based on graph cuts.In this method,users can present information about foreground and background through hand drawing closed or unclosed curves,and the image segmentation can be further realized based on the information.Watersheds method is first used to pre-segment the input image,and the image is segmented into many small regions based on the color of the pixels.An appropriate energy function is set.The energy function incorporates the color similarity between different regions and smoothness of segmentation result.The label set which makes the energy function minimized is achieved through max-flow method.Thus the image segmentation is completed.The experimental results show that this method can realize interactive image segmentation quickly and effectively.

References:

[1] Li Y,Sun J,Tang C K,et al.Lazy snapping[C]//International Conference on Computer Graphics and Interactive Techniques.New York,2004:303-308.
[2]Rother C,Kolmogorov V,Blake A.“GrabCut”:interactive foreground extraction using iterated graph cuts[J].ACM Transactions on Graphics(TOG),2004,23(3):309-314.
[3]Wu Xiaoyu,Wang Yangsheng.Interactive foreground/background segmentation based on graph cut[C]//International Congress on Image and Signal Processing.Sanya,2008.
[4]Boykov Y,Kolmogorov V.An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2004,26(9):1 124-1 137.
[5]Boykov Y,Jolly Pi M.Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images[J].ICCV,2001(7):105-112.
[6]Vincent L,Soille P.Watersheds in digital spaces an efficient algorithm based on immersion simulation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1991,13(6):585-598.

Memo

Memo:
-
Last Update: 2014-12-31