Cart (Loading....) | Create Account
Close category search window
 

Progressive Cut: An Image Cutout Algorithm that Models User Intentions

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)
Qiong Yang ; Microsoft Res. Asia, Beijing ; Xiaoou Tang ; Chao Wang ; Zhongfu Ye
more authors

In this article, we presented a progressive-cut algorithm for background and foreground segmentation. We first analyzed the user intention behind the additional user-specified stroke, and then incorporated the user intention into the graph-cut framework: we derived an eroded graph to prevent overshrinkage, and added a user attention term to the energy function to compress overexpansion in low-interest areas. Experiments showed that the new algorithm outperforms existing graph-cut methods in both accuracy and speed, and it effectively removes the fluctuation effect, making results more controllable with fewer strokes.

Published in:

MultiMedia, IEEE  (Volume:14 ,  Issue: 3 )

Date of Publication:

July-Sept. 2007

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.