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.
Chapter PDF
Similar content being viewed by others
Keywords
References
Jiang, S., Gao, W., Wang, W.: Classifying Traditional Chinese Painting Images. ICICS-PCM 2003, Singapore, December 15-18 (2003)
Criminisi, A., Sharp, T., Rother, C., Perez, P.: Geodesic Image And Video Editing. ACM Transactions on Graphics (2010)
Ding, L., Yilmaz, A.: Interactive Image Segmentation Using Probabilistic Hypergraphs. Pattern Recognition 43(5), 1863–11873 (2010)
Xu, N., Bansal, R., Ahuja, N.: Object Segmentation Using Graph Cuts Based Active Contours. In: CVPR, Los Alamitos, CA, USA, vol. 2, pp. 46–53 (2003)
Sun, J., Li, Y., Kang, S.B., Shum, H.-Y.: Flash Matting. ACM Trans. Graph 25(3), 772–778 (2006)
Liu, P., Jia, K., Wang, Z., Lv, Z.: A New and Effective Image Retrieval Method Based on Combined Features. In: Proc. IEEE Int. Conf. on Image and Graphics, pp. 786–790 (2007)
Oraintara, S., Nguyen, T.T.: Using Phase and Magnitude Information of the Complex directional Filter Bank for Texture Image Retrieval. In: Proc. IEEE Int. Conf. on Image Processing, vol. 4, pp. 61–64 (2007)
Boykov, Y., Jolly, M.P.: Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images. In: International Conference on Computer Vision (ICCV), vol. I, pp. 105–112 (2001)
Kolmogorov, V., Zabih, R.: What Energy Functions Can Be Minimizedvia Graph Cuts? IEEE TPAMI 26, 147–159 (2004)
Lombaert, H., Sun, Y., Grady, L., Xu, C.: A Multilevel Banded Graph Cuts Method for Fast Image Segmentation. In: Proceedings of International Conference on Computer Vision, Beijing, China, pp. 1259–265 (2005)
McGuinness, K., O’Connor, N.E.: A comparative evaluation of interactive segmentation algorithms. Pattern Recognition 43, 434–444 (2010)
Felzenszwalb, P.F., Huttenlocher, D.R.: Efficient Belief Propagation for Early Vision. In: CVPR, IEEE Int. Conf. on Computer society, vol. 1, pp. 261–268 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, N., Lu, K. (2011). An Image Segmentation Method for Chinese Paintings by Combining Deformable Models with Graph Cuts. In: Jacko, J.A. (eds) Human-Computer Interaction. Design and Development Approaches. HCI 2011. Lecture Notes in Computer Science, vol 6761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21602-2_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-21602-2_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21601-5
Online ISBN: 978-3-642-21602-2
eBook Packages: Computer ScienceComputer Science (R0)