Pareto-Depth for Multiple-Query Image Retrieval

DOI10.1109/TIP.2014.2378057MaRDI QIDQ4612660zbMATH OpenOpenAlexWikidataFDO

Authors Ko-Jen Hsiao, Jeff Calder, Alfred O. III Hero

Publication date 31 January 2019

Published in IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.5176

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

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 (PFM) with efficient manifold ranking (EMR). 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.

Cited in

(4)

• Numerical schemes and rates of convergence for the Hamilton-Jacobi equation continuum limit of nondominated sorting
• A direct verification argument for the Hamilton-Jacobi equation continuum limit of nondominated sorting
• Anomaly Detection and Classification for Streaming Data using PDEs
• Rates of convergence for the continuum limit of nondominated sorting

This page was built for publication: Pareto-Depth for Multiple-Query Image Retrieval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612660)