Query Adaptive Fusion for Graph-Based Visual Reranking

Developing effective fusion schemes for multiple feature types has always been a hot issue in content-based image retrieval. In this paper, we propose a novel method for graph-based visual reranking, which addresses two major limitations in existing methods. First, in the phase of graph construction...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal of selected topics in signal processing 2017-09, Vol.11 (6), p.908-917
Main Authors: Fang, Muyuan, Zhang, Yu-Jin
Format: Article
Language:English
Subjects:
Electronic mail
Feature fusion
Fuses
Image edge detection
image graph
Image retrieval
image search
Reliability
reranking
similarity score
Visualization
Weight measurement
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Developing effective fusion schemes for multiple feature types has always been a hot issue in content-based image retrieval. In this paper, we propose a novel method for graph-based visual reranking, which addresses two major limitations in existing methods. First, in the phase of graph construction, our method introduces fine-grained measurements for image relations, by assigning the edge weights using normalized similarity. Furthermore, in the phase of graph fusion, rather than summing up all the graphs for different single features indiscriminately, we propose to estimate the reliability of each feature through a statistical model, and selectively fuse the single graphs via query-adaptive fusion weights. Fusion methods with either labeled data and unlabeled data are proposed and the performance are evaluated and compared by experiments. Our method is evaluated on five public datasets, by fusing scale-invariant feature transform (SIFT), CNN, and hue, saturation, hue (HSV), three complementary features. Experimental results demonstrate the effectiveness of the proposed method, which yields superior results than the competing methods.
ISSN:1932-4553
1941-0484
DOI:10.1109/JSTSP.2017.2726977