Ordinal Measures for Image Correspondence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Content-Based Image Retrieval at the End of the Early Years
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linear Neighborhood Propagation and Its Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Leveraging loosely-tagged images and inter-object correlations for tag recommendation
Proceedings of the international conference on Multimedia
Unified tag analysis with multi-edge graph
Proceedings of the international conference on Multimedia
Efficient large-scale image annotation by probabilistic collaborative multi-label propagation
Proceedings of the international conference on Multimedia
Proceedings of the international conference on Multimedia
Automatic image tagging via category label and web data
Proceedings of the international conference on Multimedia
Multimedia information retrieval on the social web
Proceedings of the 22nd international conference on World Wide Web companion
Hi-index | 0.00 |
Annotating or tagging multimedia objects is an important task for enhancing multimedia information retrieval processes. In the context of the Web, automatic tagging deals with many issues, such as loosely tagged images and huge collections of images with no textual data at all. Recently, graph representations have been shown useful for modeling relationships between images and their associated semantics. Using these types of graphs, it is possible to represent images and their textual labels as nodes, and the relationship between them as edges, under the assumption that visual similarity implies semantic similarity. In this work, we present an algorithm for automatic tag propagation in such a graph structure, called the visual-semantic graph. This graph has been used in prior work only for the task of image retrieval re-ranking. The goal of our work, is to show how the visual-semantic graph can be used for efficient tag propagation to unlabeled images. More specifically, our contributions are: (1) An algorithm to propagate tags automatically based on the breadth-first traversal and (2) A set of heuristics for pruning this approach for large size collections.