IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7916450.html
   My bibliography  Save this article

Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual Search

Author

Listed:
  • Kaiman Zeng
  • Nansong Wu
  • Arman Sargolzaei
  • Kang Yen

Abstract

In visual search systems, it is important to address the issue of how to leverage the rich contextual information in a visual computational model to build more robust visual search systems and to better satisfy the user’s need and intention. In this paper, we introduced a ranking model by understanding the complex relations within product visual and textual information in visual search systems. To understand their complex relations, we focused on using graph-based paradigms to model the relations among product images, product category labels, and product names and descriptions. We developed a unified probabilistic hypergraph ranking algorithm, which, modeling the correlations among product visual features and textual features, extensively enriches the description of the image. We conducted experiments on the proposed ranking algorithm on a dataset collected from a real e-commerce website. The results of our comparison demonstrate that our proposed algorithm extensively improves the retrieval performance over the visual distance based ranking.

Suggested Citation

  • Kaiman Zeng & Nansong Wu & Arman Sargolzaei & Kang Yen, 2016. "Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual Search," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-7, July.
  • Handle: RePEc:hin:jnlmpe:7916450
    DOI: 10.1155/2016/7916450
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/7916450.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2016/7916450.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/7916450?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:7916450. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.