Incremental Hashing with Dynamic Semantic Pool

Most of the existing hashing methods for image retrieval are based on the assumption the image database is stationary. However, in the real world data environments are always changing or non-stationary, therefore the underlying data distribution may change from time to time which will result in the problem of concept drift. Incremental Hashing (ICH) is the only existing method to handle image retrieval with concept drift in non-stationary data environments. It builds hash codes for the database through increments. At each increment, a set of new hash functions is built with the new chunk of data, which is utilized to update the multi-hashing system to generate multiple sets of hash codes for all data. However, only the newest data chunk is used to train individual hash functions, while the semantic similarity information of previous data is missed. In this paper, we present a new hashing method based on ICH for image retrieval with concept drift, Incremental Hashing with Dynamic Semantic Pool (ICH-DSP). It builds a semantic pool to collect representative labeled data for each existing class. The semantic pool is updated incrementally and is used as the supervisory information for the training of hash functions. Experimental results on three real world image databases show that ICH-DSP outperforms the original ICH and other state-of-the-art hashing methods.

• Publication year

  2018

• Venue

  IEEE International Conference on Systems, Man and Cybernetics

• Publication date

  2018-10-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/SMC.2018.00081
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Bagging-boosting-based semi-supervised multi-hashing with query-adaptive re-ranking

  2018cited by this paper
• Incremental Hashing for Semantic Image Retrieval in Nonstationary Environments

  2017influential reference
• MIHash: Online Hashing with Mutual Information

  2017cited by this paper
• Nonlinear Discrete Hashing

  2017cited by this paper
• Spectral Multimodal Hashing and Its Application to Multimedia Retrieval

  2016cited by this paper
• Supervised Matrix Factorization Hashing for Cross-Modal Retrieval

  2016cited by this paper
• Compact Structure Hashing via Sparse and Similarity Preserving Embedding

  2016cited by this paper
• Projection selection hashing

  2015cited by this paper
• Spherical Hashing: Binary Code Embedding with Hyperspheres

  2015cited by this paper
• Online supervised hashing

  2015cited by this paper
• Adaptive Hashing for Fast Similarity Search

  2015cited by this paper
• Online sketching hashing

  2015cited by this paper
• Asymmetric Cyclical Hashing for Large Scale Image Retrieval

  2015cited by this paper
• Hashing with dual complementary projection learning for fast image retrieval

  2013cited by this paper
• Online Hashing

  2013influential reference
• Semi-Supervised Nonlinear Hashing Using Bootstrap Sequential Projection Learning

  2013influential reference
• Spectral Hashing With Semantically Consistent Graph for Image Indexing

  2013cited by this paper
• LDAHash: Improved Matching with Smaller Descriptors

  2012cited by this paper
• Semi-Supervised Hashing for Large-Scale Search

  2012cited by this paper
• Iterative quantization: A procrustean approach to learning binary codes

  2011cited by this paper
• Complementary hashing for approximate nearest neighbor search

  2011cited by this paper
• Kernelized locality-sensitive hashing for scalable image search

  2009cited by this paper
• Locality-sensitive binary codes from shift-invariant kernels

  2009cited by this paper
• Locality-sensitive hashing scheme based on p-stable distributions

  2004influential reference

• No citing papers are available for this paper.