Graph-cut based tag enrichment

Authors:
Xueming Qian;Xian-Sheng Hua
Affiliations:
School of Information and Communication Engineering, Xi'an, SD, China;Microsoft Research Asia, Beijing, RI, USA
Venue:
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Year:
2011

Citing 4
Cited 1

An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Tag ranking

Proceedings of the 18th international conference on World wide web
Object Categorization Using Hierarchical Wavelet Packet Texture Descriptors

ISM '09 Proceedings of the 2009 11th IEEE International Symposium on Multimedia
Learning social tag relevance by neighbor voting

IEEE Transactions on Multimedia

Tagging photos using users' vocabularies

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a graph cut based tag enrichment approach is proposed. We build a graph for each image with its initial tags. The graph is with two terminals. Nodes of the graph are full connected with each other. Min-cut/max-flow algorithm is utilized to find the relevant tags for the image. Experiments on Flickr dataset demonstrate the effectiveness of the proposed graph-cut based tag enrichment approach.