Learning Binary Hash Codes for Large-Scale Image Search

DOI10.1007/978-3-642-28661-2_3MaRDI QIDQ4649217zbMATH OpenOpenAlexFDO

Authors Kristen Grauman, Rob Fergus

Publication date 21 November 2012

Published in Machine Learning for Computer Vision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28661-2_3

zbMATH Keywords

supervised learningunsupervised learningspectral analysisvisual searchcontent-based retrievalimage searchbinary hash codes

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20) Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Recommendations

• Learning Short Binary Codes for Large-scale Image Retrieval
• Deep Hashing for Scalable Image Search
• Contextual Hashing for Large-Scale Image Search
• Bit selection hashing for large scale image retrieval
• Learning multifunctional binary codes for personalized image retrieval
• Coupled Binary Embedding for Large-Scale Image Retrieval
• Deep supervised hashing for fast image retrieval

Cites work

• scientific article; zbMATH DE number 5957283 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• An introduction to support vector machines and other kernel-based learning methods.
• Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
• Efficient algorithms for substring near neighbor problem
• Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Learning Theory
• Locality-sensitive hashing scheme based on p-stable distributions
• Modeling the shape of the scene: A holistic representation of the spatial envelope
• Multidimensional divide-and-conquer
• Reducing the Dimensionality of Data with Neural Networks
• Satisfying general proximity/similarity queries with metric trees
• Similarity estimation techniques from rounding algorithms
• The pyramid match kernel: efficient learning with sets of features
• Visualizing data using t-SNE

Cited in

(19)

• Latent Semantic Minimal Hashing for Image Retrieval
• Location discriminative vocabulary coding for mobile landmark search
• Global Hashing System for Fast Image Search
• Learning Short Binary Codes for Large-scale Image Retrieval
• Approximately nearest neighborhood image search using unsupervised hashing via homogeneous kernels
• Iterated local search optimized hashing for image copy detection
• Maximum variance hashing via column generation
• BSIFT: Toward Data-Independent Codebook for Large Scale Image Search
• Multiple feature kernel hashing for large-scale visual search
• Semantic hashing with image subspace learning
• Large scale online learning of image similarity through ranking
• A general framework for deep supervised discrete hashing
• Learning multifunctional binary codes for personalized image retrieval
• Unified binary generative adversarial network for image retrieval and compression
• Deep supervised hashing for fast image retrieval
• Unsupervised binary representation learning with deep variational networks
• Learning big (image) data via coresets for dictionaries
• Privacy-preserving outsourcing of image feature extraction in cloud computing
• Structured learning of binary codes with column generation for optimizing ranking measures

This page was built for publication: Learning Binary Hash Codes for Large-Scale Image Search

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