Abstract: Video cutout is a fundamental yet frontier hot topic in video processing area, which
plays an important role in video supervision, video editing, video composition and so on. Traditional
methods mostly cut out the regions depending on the local similarity between the successive frames
and the continuity of motion which are not able to accomplish a satisfying cutout results when the
object regions are moving quickly or under occlusion. In this situation, lots of interaction may be
needed. Based on the spatio-temporal similarity neighborhood, this paper presents a new model for
efficient video cutout, which can be solved by max-flow/min-cut algorithm quickly. This method
only needs very little interaction from the users, and more importantly, it is robust to the situations
with foreground objects have fast motion or occlusion.

Key words: video cutout, graph cut, spatio-temporal domain, max-flow/min-cut