Auto-segmentation based on graphcut and template

In this paper, the main idea is to use the prior knowledge to guide the segmentation. Firstly the continuity among adjacent frames is used to create a motion template according to the Displaced Frame Difference's (DFD) higher character([1]). And then the color template is established by using the k-means clustering. Based upon the information derived from the previous two templates, the segmentation image is defined as foreground, background and boundary regions. Then, the segmentation problem is formulated as an energy minimization problem. The hard edge of foreground is then obtained by implementing graph-cut algorithm. Experimental results demonstrate the effectiveness of proposed algorithm.