Use Minimum Graph Cut Based On Hybrid Algorithm For Motion Segmentation

Motion segmentation is important in many computer vision application, which aims to detect motion regions such as moving vehicles and people in natural scenes. Detecting moving blobs provides a focus of attention for later processes such as tracking and activity analysis. However, changes from weather, illumination, shadow and repetitive motion from clutter make motion segmentation difficult to process quickly and reliably. In this paper we proposed a method using minimum graph cuts based on hybrid algorithm approach for moving object segmentation. Experiments are carried out to examine the efficiency of the proposed approach