Format

Send to

Choose Destination
IEEE Trans Image Process. 2015 Feb;24(2):583-94. doi: 10.1109/TIP.2014.2378057. Epub 2014 Dec 4.

Pareto-depth for multiple-query image retrieval.

Abstract

Most content-based image retrieval systems consider either one single query, or multiple queries that include the same object or represent the same semantic information. In this paper, we consider the content-based image retrieval problem for multiple query images corresponding to different image semantics. We propose a novel multiple-query information retrieval algorithm that combines the Pareto front method with efficient manifold ranking. We show that our proposed algorithm outperforms state of the art multiple-query retrieval algorithms on real-world image databases. We attribute this performance improvement to concavity properties of the Pareto fronts, and prove a theoretical result that characterizes the asymptotic concavity of the fronts.

PMID:
25494509
DOI:
10.1109/TIP.2014.2378057

Supplemental Content

Full text links

Icon for IEEE Engineering in Medicine and Biology Society
Loading ...
Support Center