By Topic

Use Minimum Graph Cut Based On Hybrid Algorithm For Motion Segmentation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yuzhen Li ; Graduate Sch. of Sci. & Technol., Chiba Univ. ; Jianming Lu ; Mohamed, G. ; Yahagi, T.
more authors

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

Published in:

Intelligent Signal Processing and Communications, 2006. ISPACS '06. International Symposium on

Date of Conference:

12-15 Dec. 2006