Overview

Image retrieval studies how to find relevant images in large collections using images, text, sketches, metadata, or combinations of these. Common approaches learn shared vision-language embeddings with contrastive training, then improve fine-grained matching with regions or patches, reranking, and compact hashes or indexes. Composed and conversational retrieval adds user-described changes or constraints, while applications range from products and people to medical images, geolocation, and scientific data. A central challenge is balancing broad, efficient retrieval with precise semantic and local matching, while benchmarks must distinguish genuine multimodal understanding from shortcuts or noisy relevance labels.

Latest papers

96 papers11 papers in the last four weeks, up 57% on the four weeks before. 0.1% of all new papers.

Dec 20, 2025

Through the PRISm: Importance-Aware Scene Graphs for Semantic Image Retrieval

Web-based visual search increasingly handles queries driven by semantic intent, focusing on what is happening in an image rather than merely what it looks like. While global embeddings from vision-language models capture overall appearance, they often blur fine-grained relational structure. Conversely, scene graphs make these relationships explicit, but generating them automatically for unannotated web images produces dense, noisy graphs that retain every detected entity and relation regardless of relevance. To address this, we introduce PRISm (Pruning-based Image Retrieval via Importance Prediction on Semantic Graphs), an image-to-image retrieval framework that learns to focus on what matters in a scene. PRISm employs an Importance Prediction Module, supervised by caption-derived relevance strictly during training, to score and prune non-essential objects and <subject, relation, object> triplets. An Edge-Aware Contextual GNN then aggregates relation conditioned neighbor messages, fusing the refined graph with global visual features into a single, index-ready embedding per image. On PSG, PRISm outperforms the strongest baseline by points in MAP@1. Furthermore, on Flickr with machine-generated scene graphs and captions, PRISm remains best on top-1 metrics, while adding only 33,ms per query beyond scene graph generation.
Dec 12, 2025

VLM2GeoVec: Toward Universal Multimodal Embeddings for Remote Sensing

Satellite imagery differs from natural images in viewpoint, resolution, scale variation, and the prevalence of small objects -- demanding both region-level spatial reasoning and holistic scene understanding. Existing remote-sensing approaches are fragmented: dual-encoder retrieval models scale well but cannot interleave modalities, whereas generative assistants support grounding, yet are inefficient for retrieval. Benchmarks mirror this split: interleaved evaluations mainly target generative assistants, while cross-modal retrieval benchmarks target dual encoders. To bridge this gap, we introduce RSMEB, a unified remote sensing benchmark that evaluates cross-modal and interleaved retrieval across 21 tasks under a single ranking protocol, enabling comprehensive comparison of retrieval models on region- and geo-aware capabilities as well as conventional retrieval. As a strong reference baseline, we present VLM2GeoVec, an instruction-conditioned, single-encoder interleaving formulation tailored to remote sensing that packs image, text, bounding-box, and geo-coordinate tokens into one sequence and learns a unified embedding via contrastive training. Across RSMEB, VLM2GeoVec achieves 26.6%\textbf{26.6\%} P@1 in region-caption retrieval (+25\textbf{+25} percentage points), 32.5%\textbf{32.5\%} in referring-expression retrieval (+19\textbf{+19}), and 17.8%\textbf{17.8\%} in semantic geo-aware retrieval (\textbf{>3}$$\times prior best), while remaining competitive in conventional scene classification and text--image retrieval in zero-shot settings. Together, the proposed suite and reference baseline standardize evaluation and deliver a unified embedder for scalable retrieval and region-/geo-aware grounding. The code, the model checkpoints, and the data are available at https://github.com/emasa/VLM2GeoVec.
Oct 21, 2025

DualHash: Stochastic Primal-Dual Algorithms for W-Type Regularized Deep Hashing

Deep hashing encodes high-dimensional image features into compact binary codes, enabling efficient similarity search in large-scale content-based image retrieval, a problem akin to semantic-preserving lossy compression under extreme bit-rate constraints. A fundamental challenge in deep hashing stems from the discrete nature of quantization in generating the codes. W-type regularizations, such as z↦∥∣z∣−1∥1z\mapsto\||z|-1\|_1, are widely adopted and empirically effective at pushing network outputs toward binary values. However, existing methods often directly optimize these regularizations without convergence guarantees. While proximal gradient methods offer a promising solution, the coupling between W-type regularizers and neural network outputs results in composite forms that generally lack closed-form proximal solutions. In this paper, using Fenchel duality, we reformulate the nonconvex W-type regularization term through its convex conjugate, yielding a min-max problem with tractable proximal updates. We show that this min-max problem captures the stationarity of the original deep hashing objective up to the quantization error. Building on this problem, we present a stochastic primal-dual hashing algorithm, referred to as DualHash, with oracle complexity guarantees. We derive two algorithm instances: a momentum-based version with O(ε−4)O(\varepsilon^{-4}) oracle complexity and an improved O(ε−3)O(\varepsilon^{-3}) version using variance reduction, both for ε\varepsilon-KKT points of the min-max problem, which yield near-stationarity guarantees for the original objective. Experiments on three standard datasets demonstrate competitive retrieval accuracy and reduced quantization error, validating the practical value of DualHash for image retrieval problems. Our implementation of DualHash is available at https://github.com/RailLee/DualHash.
Aug 27, 2025

Disentangling Latent Embeddings with Sparse Linear Concept Cones (SLiCC)

Pretrained vision models encode semantic information in latent embedding spaces that are useful for downstream tasks. We hypothesize that this information can be disentangled to separate the content of complex scenes by decomposing each embedding into multiple concept-specific components. We propose Sparse Linear Concept Cones (SLiCC), a supervised dictionary learning approach that estimates a linear synthesis model consisting of sparse, non-negative combinations of groups of dictionary atoms, whose group-wise activity is guided by multi-label information. Each concept-specific component is a non-negative combination of atoms associated with a label and lies in a corresponding concept cone. We introduce an alternating optimization algorithm and an autoencoder formulation of SLiCC. We apply SLiCC to three types of CLIP and DINOv2 embeddings across five datasets. For CLIP, we additionally exploit image-text alignment to enable a self-supervised SLiCC. We also introduce a fully unsupervised autoencoder that enforces group sparsity based on the norm of neuron activations. Quantitative results show that supervised SLiCC improves concept-filtered image retrieval over unfiltered embeddings, including retrieval of finer-grained information not provided during training. Beyond retrieval of individual concepts, the disentangled components enable concept deletion and recombination across images. We further explore conditional image generation using Image-to-Prompt, with qualitative results illustrating retrieval and generation from manipulated concept representations.
Aug 2, 2025

Open-Attribute Person Retrieval: Finding People Through Distinctive and Novel Attributes

Person retrieval in surveillance videos often depends on attributes described by witnesses or operators. However, the most useful cues in practice are not always common appearance descriptions (e.g., gender, clothing color), but rare and distinctive attributes that can sharply reduce the search space (e.g., holding a weapon, lying on the ground). Existing text-based person retrieval benchmarks and methods largely focus on identity-centric retrieval with common pedestrian descriptions, leaving such retrieval-critical attributes underexplored. In this paper, we introduce Open-Attribute Person Retrieval (OAPR), a practical retrieval setting that aims to retrieve all pedestrian instances matching a given attribute query, including rare or previously unseen visual concepts, regardless of identity. To support this task, we construct EPAD, an Expanded Pedestrian Attribute Dataset with 267,885 pedestrian images and a unified vocabulary of 65 attributes, including safety-critical actions, assistive devices, and object interactions that are rarely covered in prior benchmarks. We further propose GAP-CLIP, a lightweight CLIP-based framework that learns gated attribute-aware body-part representations for OAPR. Extensive experiments on EPAD demonstrate that GAP-CLIP achieves the strongest top-K retrieval performance on the full attribute space and on out-of-distribution attributes. The code and dataset are available at https://github.com/mlnjeongpark/Open-Attribute-Person-Retrieval.
Jun 23, 2025

Latent Space Analysis for Interpretable Uncertainty in Melanoma Classification

Melanoma is a highly aggressive skin cancer, making early and accurate diagnosis critical. While deep learning excels in skin lesion classification, standard ``black-box" models struggle to explain diagnostic uncertainty, limiting clinical trust. This work introduces a hybrid framework combining a class-aware adversarial Variational Autoencoder and an XGBoost classifier, transcending simple binary classification by leveraging a generative latent space for interpretable decision support. Guided by adversarial training, the model learns the visual characteristics of skin lesions and projects them into a continuous latent space, ensuring that similar images are grouped closely together. Trained on this latent space, the XGBoost classifier achieves a robust AUC of 0.868, competing closely with state-of-the-art models. For borderline cases, the framework enables clinicians to leverage the latent topology through Content-Based Image Retrieval. This provides a dual benefit: it allows the clinician to visually compare an ambiguous lesion against biopsy-confirmed precedents and acts as an early warning sign since a borderline classification can indicate that a lesion shares features of both nevi and melanomas, potentially requiring close monitoring. Our approach translates algorithmic hesitation into transparent, evidence-based visual support, bridging the gap between predictive performance and clinical trust.