Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2534329.2534354acmconferencesArticle/Chapter ViewAbstractPublication PagessiggraphConference Proceedingsconference-collections
research-article

Interactive segmentation with direct connectivity priors

Published: 17 November 2013 Publication History

Abstract

Graph cut based interactive image segmentation attracts much attention in recent years. Given an image, traditional methods generally need users to indicate parts of foreground and background by drawing strokes, etc. Next, these methods formulate energy functions, which are generally composed of color and gradient constraints. Considering that many objects to be cut out are compact, the paper presents a method that incorporates a simple but effective direct connectivity constraint. The constraint is defined geometrically based on the user input strokes. The centers of those foreground strokes are treated as foreground representing points. Pixels to be labeled, which are not directly connected to the representing points, i.e. blocked by the background strokes from the representing points, are considered to belong to the background. Results show that with the same amount of user interaction, the proposed segmentation method obtains better results than state-of-the-art ones.

References

[1]
Boykov, Y. Y., and Jolly, M. P. 2001. Interactive graph cuts for optimal boundasy & region segmentation of objects in n-d images. In International Conference on Computer Vision, 105--112.
[2]
Boykov, Y. Y., and Vladimir, K. 2004. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 9, 1124--1137.
[3]
Cremers, D., Rousson, M., and Deriche, R. 2007. A review of statistical approaches to level set segmentation: integrating color, texture, motion and shape. International Journal of Computer Vision 72, 2, 195--215.
[4]
Gulshan, V., Rother, C., Criminisi, A., Blake, A., and Zisserman, A. 2010. Geodesic star convexity for interactive image segmentation. In Computer Vision and Pattern Recognition, 3129--3136.
[5]
Kohli, P., Nickisch, H., Rother, C., and Rhemann, C. 2012. User-centric learning and evaluation of interactive segmentation systems. International Journal of Computer Vision 100, 3, 261--274.
[6]
Li, Y., Sun, J., Tang, C.-K., and Shum, H.-Y. 2004. Lazy snapping. ACM Transactions on Graphics 23, 3, 303--308.
[7]
Liu, J., Sun, J., and Shum, H.-Y. 2009. Paint selection. ACM Transactions on Graphics 28, 3.
[8]
Ma, W., Liu, J., Duan, L., and Zhang, X. 2013. Image segmentation with automatically balanced constraints. In The 2nd Asian Conference on Pattern Recognition.
[9]
Martin, D., Fowlkes, C., Tal, D., and Malik, J. 2001. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In International Conference on Computer Vision, 416--423.
[10]
Nowozin, S., and Lampert, C. H. 2009. Global connectivity potentials for random field models. In Computer Vision and Pattern Recognition, 818--825.
[11]
Rother, C., Kolmogorov, V., and Blake, A. 2004. 'grab-cut': Interactive foreground extraction using iterated graph cuts. ACM Transaction on Graphics 23, 3, 309--314.
[12]
Veksler, O. 2008. Star shape prior for graph-cut image segmentation. In European Conference on Computer Vision, 454--467.
[13]
Vicente, S., Kolmogorov, V., and Rother, C. 2008. Graph cut based image segmentation with connectivity priors. In Computer Vision and Pattern Recognition, 1--8.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
VRCAI '13: Proceedings of the 12th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry
November 2013
325 pages
ISBN:9781450325905
DOI:10.1145/2534329
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 November 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. connectivity prior
  2. energy function
  3. graph cut
  4. interactive segmentation

Qualifiers

  • Research-article

Funding Sources

Conference

VRCAI 2013
Sponsor:

Acceptance Rates

VRCAI '13 Paper Acceptance Rate 35 of 75 submissions, 47%;
Overall Acceptance Rate 51 of 107 submissions, 48%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 106
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media