Close category search window
 

Adaptive graph-cuts algorithm based on higher-order MRF for video moving object detection

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 $31
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

2 Author(s)
Chunsheng Guo ; Coll. of Commun. Eng., Hangzhou Dianzi Univ., Hangzhou, China ; Haiyan Gao

A new graph-cuts algorithm for video moving object detection is presented. Using the area, perimeter and shape of the moving objects, the energy function from the low-order Markov random field (LMRF) model is extended to the HMRF model, and the approximate graph-cuts algorithm based on this HMRF model is derived. Experimental results show that the proposed method is more effective than the traditional graph-cuts algorithm for video moving object detection.

Published in:
Electronics Letters  (Volume:48 ,  Issue: 7 )

Date of Publication: March 29 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.