Built independently by an author, for readers. Read the story and support ChapterPal

keyword

global descriptor

A global descriptor is a compact numerical vector that summarizes the visual content of an entire image as a single unified representation. Unlike local descriptors, which focus on distinct keypoints, patches, or objects within a scene, a global descriptor captures holistic visual characteristics such as overall composition, color distributions, textures, and high-level semantics. Commonly extracted through deep neural network pooling mechanisms or the statistical aggregation of local features, global descriptors are widely used in computer vision tasks like content-based image retrieval and visual place recognition. Their compact format allows for fast indexing, low memory storage, and efficient similarity comparisons across large-scale databases, often serving as an initial step for coarse retrieval before more computationally intensive spatial verification is applied.

1 item

Global-to-Local or Local-to-Global? Enhancing Image Retrieval with Efficient Local Search and Effective Global Re-ranking

Global-to-Local or Local-to-Global? Enhancing Image Retrieval with Efficient Local Search and Effective Global Re-ranking

Dror Aiger, Bingyi Cao, Andre Araujo, Kaifeng Chen

OrganizationsGoogle

Why you should read this

Inverts the standard image retrieval workflow by using scalable local feature search for initial candidate retrieval and multidimensional scaling to build query-time global embeddings for fast, highly accurate re-ranking on benchmark datasets.

The dominant paradigm in image retrieval systems today is to search large databases using global image features, and re-rank those initial results with local image feature matching techniques. This design, dubbed global-to-local, stems from the computational cost of local matching approaches, which can only be afforded for a small number of retrieved images. However, emerging efficient local feature search approaches have opened up new possibilities, in particular enabling detailed retrieval at large scale, to find partial matches which are often missed by global feature search. In parallel, global feature-based re-ranking has shown promising results with high computational efficiency. In this work, we leverage these building blocks to introduce a local-to-global retrieval paradigm, where efficient local feature search meets effective global feature re-ranking. Critically, we propose a re-ranking method where global features are computed on-the-fly, based on the local feature retrieval similarities. Such re-ranking-only global features leverage multidimensional scaling techniques to create embeddings which respect the local similarities obtained during search, enabling a significant re-ranking boost. Experimentally, we demonstrate solid retrieval performance, setting new state-of-the-art results on the Revisited Oxford and Paris datasets.

Added

2026-09-29