Embedding Based On Function Approximation For Large Scale Image Search

Abstract

The objective of this paper is to design an embedding method that maps local features describing an image (e.g. SIFT) to a higher dimensional representation useful for the image retrieval problem. First, motivated by the relationship between the linear approximation of a nonlinear function in high dimensional space and the stateof-the-art feature representation used in image retrieval, i.e., VLAD, we propose a new approach for the approximation. The embedded vectors resulted by the function approximation process are then aggregated to form a single representation for image retrieval. Second, in order to make the proposed embedding method applicable to large scale problem, we further derive its fast version in which the embedded vectors can be efficiently computed, i.e., in the closed-form. We compare the proposed embedding methods with the state of the art in the context of image search under various settings: when the images are represented by medium length vectors, short vectors, or

Stats

• citations23
• S2 citations—
• github stars0
• HF likes0
• heat score10.35
• arxiv keydo2016embedding

Related papers

• Simultaneous Feature Aggregating And Hashing For Large-scale Image Search (2017)10.61
• Scaling Laws For Embedding Dimension In Information Retrieval (2026)0.00
• Gleanvec: Accelerating Vector Search With Minimalist Nonlinear Dimensionality Reduction (2024)0.00
• Aggregated Deep Local Features For Remote Sensing Image Retrieval (2019)14.11
• Deep Image Retrieval: Learning Global Representations For Image Search (2016)19.67
• Stochastic Attraction-repulsion Embedding For Large Scale Image Localization (2018)17.57
• Local Feature Detectors, Descriptors, And Image Representations: A Survey (2016)0.00
• Exploiting Local Indexing And Deep Feature Confidence Scores For Fast Image-to-video Search (2018)2.26