An image segmentation method for Chinese paintings by combining deformable models with graph cuts

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In recent years researchers have developed many graph theory based algorithms for image setmentation. However, previous approaches usually require trimaps as input, or consume intolerably long time to get the final results, and most of them just consider the color information. In this paper we proposed a fast object extraction method. First it combines deformable models information with explicit edge information in a graph cuts optimization framework. we segment the input image roughly into two regions: foreground and background. After that, we estimate the opacity values for the pixels nearby the foreground/background border using belief propagation (BP). Third, we introduce the texture information by building TCP images' co-occurrence matrices. Experiments show that our method is efficient especially for TCP images. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

He, N., & Lu, K. (2011). An image segmentation method for Chinese paintings by combining deformable models with graph cuts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6761 LNCS, pp. 571–579). https://doi.org/10.1007/978-3-642-21602-2_62

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