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

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 understand...

Full description

Bibliographic Details
Main Authors: Kaiman Zeng, Nansong Wu, Arman Sargolzaei, Kang Yen
Format: Article
Language:English
Published: Hindawi Limited 2016-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2016/7916450
id doaj-ac49980995564f6f97347984f8b42237
record_format Article
spelling doaj-ac49980995564f6f97347984f8b422372020-11-24T23:56:46ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472016-01-01201610.1155/2016/79164507916450Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual SearchKaiman Zeng0Nansong Wu1Arman Sargolzaei2Kang Yen3Department of Electrical and Computer Engineering, Florida International University, 10555 West Flagler Street, Miami, FL 33174, USADepartment of Electrical and Computer Engineering, Florida International University, 10555 West Flagler Street, Miami, FL 33174, USADepartment of Electrical and Computer Engineering, Florida International University, 10555 West Flagler Street, Miami, FL 33174, USADepartment of Electrical and Computer Engineering, Florida International University, 10555 West Flagler Street, Miami, FL 33174, USAIn 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.http://dx.doi.org/10.1155/2016/7916450
collection DOAJ
language English
format Article
sources DOAJ
author Kaiman Zeng
Nansong Wu
Arman Sargolzaei
Kang Yen
spellingShingle Kaiman Zeng
Nansong Wu
Arman Sargolzaei
Kang Yen
Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual Search
Mathematical Problems in Engineering
author_facet Kaiman Zeng
Nansong Wu
Arman Sargolzaei
Kang Yen
author_sort Kaiman Zeng
title Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual Search
title_short Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual Search
title_full Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual Search
title_fullStr Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual Search
title_full_unstemmed Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual Search
title_sort learn to rank images: a unified probabilistic hypergraph model for visual search
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2016-01-01
description 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.
url http://dx.doi.org/10.1155/2016/7916450
work_keys_str_mv AT kaimanzeng learntorankimagesaunifiedprobabilistichypergraphmodelforvisualsearch
AT nansongwu learntorankimagesaunifiedprobabilistichypergraphmodelforvisualsearch
AT armansargolzaei learntorankimagesaunifiedprobabilistichypergraphmodelforvisualsearch
AT kangyen learntorankimagesaunifiedprobabilistichypergraphmodelforvisualsearch
_version_ 1725456638209425408