The Application and Study of Graph Cut in Motion Segmentation

How to segment moving objects accurately and rapidly is one of the most important problems in computer vision. In this paper, we discuss two methods studied previously for segmenting moving objects based on graph cut. One method employs graph cut to segment objects automatically, and the other uses the graph cut and the C-V model (simplified Mumford-Shah model) to segment objects. As well, we present a fast segmentation algorithm based on graph cut. The proposed algorithm is trying to reduce the number of the nodes in constructing network graph. By mapping the invariable pixels of the difference image into one or several nodes and mapping the variable pixels into other nodes, the number of the nodes and the edges is decreased and the speed of graph cut is increased. In the end of the paper, we compare the characteristics of three methods. Experimental results show that we can get effective and fast results in motion segmentation by using graph cut technology.