File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: MultiVCRank with Applications to Image Retrieval

TitleMultiVCRank with Applications to Image Retrieval
Authors
KeywordsImage Retrieval
Markov Chains
Ranking
Tensors
Hypergraph
Feedback
Issue Date2016
Citation
IEEE Transactions on Image Processing, 2016, v. 25, n. 3, p. 1396-1409 How to Cite?
Abstract© 1992-2012 IEEE. In this paper, we propose and develop a multi-visual-concept ranking (MultiVCRank) scheme for image retrieval. The key idea is that an image can be represented by several visual concepts, and a hypergraph is built based on visual concepts as hyperedges, where each edge contains images as vertices to share a specific visual concept. In the constructed hypergraph, the weight between two vertices in a hyperedge is incorporated, and it can be measured by their affinity in the corresponding visual concept. A ranking scheme is designed to compute the association scores of images and the relevance scores of visual concepts by employing input query vectors to handle image retrieval. In the scheme, the association and relevance scores are determined by an iterative method to solve limiting probabilities of a multi-dimensional Markov chain arising from the constructed hypergraph. The convergence analysis of the iteration method is studied and analyzed. Moreover, a learning algorithm is also proposed to set the parameters in the scheme, which makes it simple to use. Experimental results on the MSRC, Corel, and Caltech256 data sets have demonstrated the effectiveness of the proposed method. In the comparison, we find that the retrieval performance of MultiVCRank is substantially better than those of HypergraphRank, ManifoldRank, TOPHITS, and RankSVM.
Persistent Identifierhttp://hdl.handle.net/10722/276755
ISSN
2017 Impact Factor: 5.072
2015 SCImago Journal Rankings: 2.727

 

DC FieldValueLanguage
dc.contributor.authorLi, Xutao-
dc.contributor.authorYe, Yunming-
dc.contributor.authorNg, Michael K.-
dc.date.accessioned2019-09-18T08:34:34Z-
dc.date.available2019-09-18T08:34:34Z-
dc.date.issued2016-
dc.identifier.citationIEEE Transactions on Image Processing, 2016, v. 25, n. 3, p. 1396-1409-
dc.identifier.issn1057-7149-
dc.identifier.urihttp://hdl.handle.net/10722/276755-
dc.description.abstract© 1992-2012 IEEE. In this paper, we propose and develop a multi-visual-concept ranking (MultiVCRank) scheme for image retrieval. The key idea is that an image can be represented by several visual concepts, and a hypergraph is built based on visual concepts as hyperedges, where each edge contains images as vertices to share a specific visual concept. In the constructed hypergraph, the weight between two vertices in a hyperedge is incorporated, and it can be measured by their affinity in the corresponding visual concept. A ranking scheme is designed to compute the association scores of images and the relevance scores of visual concepts by employing input query vectors to handle image retrieval. In the scheme, the association and relevance scores are determined by an iterative method to solve limiting probabilities of a multi-dimensional Markov chain arising from the constructed hypergraph. The convergence analysis of the iteration method is studied and analyzed. Moreover, a learning algorithm is also proposed to set the parameters in the scheme, which makes it simple to use. Experimental results on the MSRC, Corel, and Caltech256 data sets have demonstrated the effectiveness of the proposed method. In the comparison, we find that the retrieval performance of MultiVCRank is substantially better than those of HypergraphRank, ManifoldRank, TOPHITS, and RankSVM.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Image Processing-
dc.subjectImage Retrieval-
dc.subjectMarkov Chains-
dc.subjectRanking-
dc.subjectTensors-
dc.subjectHypergraph-
dc.subjectFeedback-
dc.titleMultiVCRank with Applications to Image Retrieval-
dc.typeArticle-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TIP.2016.2522298-
dc.identifier.scopuseid_2-s2.0-84962736080-
dc.identifier.volume25-
dc.identifier.issue3-
dc.identifier.spage1396-
dc.identifier.epage1409-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats