¹Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China
²Institute of Computer Graphics and Image Processing, Dalian Nationalities University, Dalian, China
³State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou, China

---

Abstract—Automatic image annotation is a promising solution to narrow the semantic gap between low-level content and high-level semantic concept, which has been an active research area in the fields of image retrieval, pattern recognition, and machine learning. However, even the most dedicated annotation algorithms are often unsatisfactory. Image annotation refinement has attracted much more attention recently. In this paper, a novel refinement algorithm using dynamic voting based on mutual information is proposed. Unlike the traditional refinement algorithm, the proposed algorithm adopts dynamic weighted voting to measure the dependence between the candidate annotations, which not only permits that the annotations with higher probabilities deny the annotations with lower probabilities, but also permits that the annotations with lower probabilities deny the annotations with higher probabilities. The proposed refinement algorithm adopts progressive method instead of iterative, which can significantly decrease the time cost of refining annotations. In order to further improve efficiency without sacrificing precision, we propose the block-based normalized cut algorithm to segment image. Experiments conducted on standard Washington Ground Truth Image Database demonstrate the effectiveness and efficiency of our proposed approach for refining image annotations.

Index Terms—image annotation refinement, image retrieval, mutual information, normalized cut, relevance model

[PDF]

Cite: Haiyu Song, Xiongfei Li, Pengjie Wang, "Image Annotation Refinement Using Dynamic Weighted Voting Based on Mutual Information," Journal of Software vol. 6, no. 11, pp. 2239-2246, 2011.