• Corpus ID: 15936803

Locality Sensitive Hashing with p-stable Distribution for Large Scale Image Search

@inproceedings{Cynthia2015LocalitySH,
  title={Locality Sensitive Hashing with p-stable Distribution for Large Scale Image Search},
  author={C. Cynthia and K. Sundareshwari},
  year={2015}
}
Rapid and accurate retrieval techniques are vital for large scale database applications. However, developing a rapid solution to index high dimensional image contents is challenging in CBIR (Content Based Image Retrieval) systems. Thus, in this paper a flexible content based image retrieval system with LSH (Locality Sensitive Hashing) has been proposed.Hashing has been widely utilized for similarity search in large scale database because of its fast query speed and computational efficiency. In… 

Figures from this paper

References

SHOWING 1-10 OF 19 REFERENCES
A Comprehensive Survey on Image Search Using Binary Hash Codes
TLDR
This paper presents a survey of various states-of-the-art- hashing techniques that allows faster visual similarity search in hamming space and discussed concept of weighted Hamming distance, which improve ranking performance of binary hash code so that result images can be ranked at fined grained level.
A Comprehensive Survey on Image Search Using Binary Hash Codes
TLDR
This paper presents a survey of various states-of-the-arthashing techniques that allows faster visual similarity search in hamming space and discussed concept of weighted Hamming distance, which improve ranking performance of binary hash code so that result images can be ranked at fined grained level.
Hierarchical semantic indexing for large scale image retrieval
TLDR
This paper addresses the problem of similar image retrieval, especially in the setting of large-scale datasets with millions to billions of images, and proposes an approach that can exploit prior knowledge of a semantic hierarchy.
Visual information retrieval system via content-based approach
A descriptor for large scale image retrieval based on sketched feature lines
TLDR
This work addresses the problem of large scale sketch based image retrieval, searching in a database of over a million images using a descriptor constructed such that both the full color image and the sketch undergo exactly the same preprocessing steps.
Semi-Supervised Hashing for Large-Scale Search
TLDR
This work proposes a semi-supervised hashing (SSH) framework that minimizes empirical error over the labeled set and an information theoretic regularizer over both labeled and unlabeled sets and presents three different semi- supervised hashing methods, including orthogonal hashing, nonorthogonal hash, and sequential hashing.
Large scale image search with geometric coding
TLDR
This paper proposes a novel geometric coding algorithm to encode the spatial context among local features of an image for large scale partial duplicate image retrieval and shows the promising results.
Content based Image Retrieval using Color and Texture
TLDR
This paper presents retrieval of images based on color and texture using various proposed algorithms in Content Based Image Retrieval (CBIR).
Improving Large-Scale Image Retrieval using Geometric Weighting
TLDR
Experimental results show that the proposed method outperforms the baseline BOF, and achieves similar performance as RANSAC based spatial verification, despite the major difference in complexity.
Distributed Kd-Trees for Retrieval from Very Large Image Collections
TLDR
This work employs the MapReduce architecture to efficiently build and distribute the Kd-Tree for millions of images, and provides orders of magnitude more throughput than the state-of-the-art, with better recognition performance.
...
...