Abstract
Given an image that is loosely tagged by a few tags, we would like to accurately localize these tags into appropriate image regions, and at the same time suggest new tags for regions if necessary. In this paper, this task is formulated on a bipartite graph, and is solved by finding the best matching between two disjoint sets of nodes. One set of nodes represents regions segmented from an image, and another set represents a combination of existing tags and new candidate tags retrieved from photo sharing platforms. In graph construction, visual characteristics in the representation of the bag of word model and users' tagging behaviors are jointly considered. By finding the best matching with the Hungarian algorithm, the region-tag correspondence is determined, and tag suggestion and tag localization are accomplished simultaneously. Experimental results show that the proposed unified framework achieves promising image tagging performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
