A novel graph-based image annotation refinement algorithm

Authors:
Liu Zheng
Affiliations:
School of Computer Science and Technology, Shandong Economic University, Ji'nan, Shandong, China
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Year:
2009

Citing 9
Cited 0

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

SIAM Journal on Optimization
Image annotations by combining multiple evidence & wordNet

Proceedings of the 13th annual ACM international conference on Multimedia
Image annotation refinement using random walk with restarts

MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
The Google Similarity Distance

IEEE Transactions on Knowledge and Data Engineering
Image retrieval: Ideas, influences, and trends of the new age

ACM Computing Surveys (CSUR)
Real-Time Computerized Annotation of Pictures

IEEE Transactions on Pattern Analysis and Machine Intelligence
Annotating Images by Mining Image Search Results

IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic Semantic Annotation of Real-World Web Images

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel graph-based approach to automatically refine image annotation is presented in this paper. Given an unannotated image, a set of candidate annotations is extracted by the existing image annotation method. Then, each candidate annotation is converted to vertex of a graph and the semantic similarity between two candidate annotations is used as edge weight. Next, a heuristics graph algorithm solving weighted MAX-CUT problem is used to prune the noisy annotations. Experimental results demonstrate the effectiveness of our image annotation refinement algorithm.