Interactive image segmentation based on hierarchical graph-cut optimization with generic shape prior

4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new algorithm for interactive image segmentation is proposed. Besides the traditional appearance and gradient information, a new Generic Shape Prior (GSP) knowledge which implies the location and the shape information of the object is combined into the framework. The GSP can be further categorized into the Regional and the Contour GSP to fit the interactive application, where a hierarchical graph-cut based optimization procedure is established, for its global optimization using the regional GSP to obtain good global segmentation results, and the local one using the Contour GSP to refine boundaries of global results. Moreover, the global optimization is based on superpixels which significantly reduce the computational complexity but preserve necessary image structures; the local one only considers a subset pixels around a contour segment, they both speed up the system. Results show our method performs better on both speed and accuracy. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Liu, C., Li, F., Zhang, Y., & Gu, H. (2009). Interactive image segmentation based on hierarchical graph-cut optimization with generic shape prior. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5627 LNCS, pp. 201–210). https://doi.org/10.1007/978-3-642-02611-9_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free