Hypergraph-based multi-example ranking with sparse representation for transductive learning image retrieval

doi:10.1016/j.neucom.2012.09.001

Return

Hypergraph-based multi-example ranking with sparse representation for transductive learning image retrieval

2013-02-01

PRE

洪朝群 (Chaoqun Hong) *

朱

朱建科 (Jianke Zhu)

DOI：10.1016/j.neucom.2012.09.001

Original

Original request for help

Save

Abstract

En 中文

Content-based image retrieval (CBIR) always suffers from the so-called semantic gap. Query-By-Multiple-Examples (QBME) is introduced to bridge it and applied in a lot of CBIR systems. However, current QBME methods usually query with each example separately and combine the query results. In this way, the computational time will increase linearly with the growing number of query examples. In this paper, we propose a novel QBME method for fast image retrieval based on transductive learning framework. To improve the speed of QBME, we introduce two improvements. First, we explore the semantic correlations of image data in the training process. These correlations are learned using sparse representation. With the semantic correlations, semantic correlation hypergraph (SCHG) is constructed to model the images and their correlations. The construction of SCHG is free of any parameter. After constructing SCHG, we predict the ranking values of images by using the pre-learned semantic correlations. Second, we propose a multiple probing strategy to rank the images with multiple query examples. Different from traditional QBME methods which accept one input example at a time, all the input examples are processed at the same time in this strategy. The experimental results demonstrate the effectiveness of the proposed method on both retrieval performance and speed. (C) 2012 Elsevier B.V. All rights reserved.

Keywords:

Content-based image retrieval

Hypergraph

Sparse representation

Query by multiple examples

Ranking algorithm