基於擴展式賽局的區域比對影像共分割方法

An Extensive Form Game Based Matching Method for Image Co-segmentation

劉琦韻(Chi-Yun Liu)

指導教授 ： 張隆紋

國立清華大學/電機資訊學院/資訊工程學系/碩士(2012年)

摘要

影像共分割在近年來被廣泛討論著，其定義是同步的將一組影像中相同或相似的區域切割出來。有別於過去的一些方法，在本篇論文中，我們試圖以不同角度去思考並解決此問題。由於影像共分割的重點在於如何去判斷出影像所共同具有的區域，我們提出一個基於擴展式賽局的區域比對演算法來解決這個問題。
在這個比對賽局中，每張影像被視為理性的玩家，玩家的策略集被定義為他們所具有的區域，每位玩家意圖去找出一些具有較高比對分數的配對以得到較高的收益。我粉所提出的方法首先抽取顏色和材質特徵，以所提出的比對賽局來找出那些具有較高比對分數的區域配對，透過區域比對的方式，來定義出影像所共同具有的前景。在此我們假設那些共同前景的配對相較於其他配對有著較高的比對分數，因此透過適當的選取門檻值，我們可以將各張影像中的共同前景定位出來。接著我們應用Graph Cut的方式來完成分割，將分割結果收斂到一個令人滿意的程度。實驗結果顯示，相較於其他現有的方法，我們所提出方法在主觀及客觀方面皆展現出較高的效能。

關鍵字

賽局理論 ； 影像共分割 ； 比對

並列摘要

Co-segmentation is widely discussed in recent years. The main goal of co-segmentation is simultaneously segmenting the same or similar objects from a set of images. Unlike previous methods, in this paper, we think about this problem from different angles. Due to the central part of co-segmentation is to find the common regions among images, we propose an extensive-form game based matching algorithm to solve this problem.
In the proposed matching game, each image represents a rational player, and their strategies are their superpixels. Players purpose to find some matched pairs with higher matching score in order to get higher payoff. In our method, according to the color and texture feature, we utilize the proposed matching game to find matched pairs with higher matching score. Here we assume that the matched pairs between common regions usually have higher score than others. So we can locate the common foreground in each image by choosing a proper threshold. Then we apply graph cut to segment the foreground regions of each images independently. We show the superior performance of our method in comparison with other state-of-the-art techniques on some realistic dataset.

並列關鍵字

Game theory ； Image co-segmentation ； Matching

參考文獻

[1]. C. Rother, V. Kolmogorov, T. Minka, and A. Blake, "Cosegmentation of Image Pairs by Histogram Matching - incorporating a global constraint into MRFs,” IEEE Conf. Computer Vision and Pattern Recognition, pp. 993-1000, 2006.

[2]. L. Mukherjee, V. Singh, and C.R. Dyer, "Half-integrality based Algorithms for Cosegmentation of Images,” IEEE Conf. Computer Vision and Pattern Recognition, pp. 2028-2035, 2009.

[3]. D.S. Hochbaum, and V. Singh "An Efficient Algorithm for Co-segmentation,” IEEE Int’l Conf. Computer Vision, pp. 269-276, 2010.

[5]. H. Li and K. N. Ngan, “A co-saliency model of image pairs,” IEEE Trans. Image Process., vol. 20, no. 12, pp. 3365–3375, Dec. 2011.

[7]. G. Kim, E. P. Xing, L. Fei-Fei, and T. Kanade , "Distributed Cosegmentation via Submodular Optimization on Anisotropic Diffusion," IEEE Int’l Conf. Computer Vision, 2011.