An improved interactive color image segmentation using region-based graph cuts

Authors:
Yuan Tian;Cheng Wang;Tao Guan;Lijun Li
Affiliations:
Digital Engineering & Simulation Research Center, Huazhong University of Science and Technology, Wuhan, P.R. China;Digital Engineering & Simulation Research Center, Huazhong University of Science and Technology, Wuhan, P.R. China;Digital Engineering & Simulation Research Center, Huazhong University of Science and Technology, Wuhan, P.R. China;Digital Engineering & Simulation Research Center, Huazhong University of Science and Technology, Wuhan, P.R. China
Venue:
Machine Graphics & Vision International Journal
Year:
2009

Citing 8
Cited 0

Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift: A Robust Approach Toward Feature Space Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift, Mode Seeking, and Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Data-Driven Bandwidth Selection

IEEE Transactions on Pattern Analysis and Machine Intelligence
Lazy snapping

ACM SIGGRAPH 2004 Papers
"GrabCut": interactive foreground extraction using iterated graph cuts

ACM SIGGRAPH 2004 Papers
Active Graph Cuts

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Image segmentation with ratio cut

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of efficient interactive extraction of a foreground object in a complex environment is the primary one in image processing and computer vision. The segmentation method based on graph cuts has been studied over the recent years. There are two main drawbacks of these studies: decrease in performance when the foreground and the background have similar colors, and long computing time when the image is large. In this paper, we present a new foreground objects extraction method using a region-based graph cuts algorithm. The image is pre-segmented into a large number of small partitions using the mean shift (MS) method. We use the partitions to represent the nodes in the graph instead of pixels. This approach can reduce the optimization time, which is closely related to the number of nodes and edges in the graph. Compared with the pixel-based method, our method can yield an excellent performance and exhibit a faster speed.