DeepAI AI Chat
Log In Sign Up

Scalable Gaussian Processes for Supervised Hashing

by   Bahadir Ozdemir, et al.
University of Maryland

We propose a flexible procedure for large-scale image search by hash functions with kernels. Our method treats binary codes and pairwise semantic similarity as latent and observed variables, respectively, in a probabilistic model based on Gaussian processes for binary classification. We present an efficient inference algorithm with the sparse pseudo-input Gaussian process (SPGP) model and parallelization. Experiments on three large-scale image dataset demonstrate the effectiveness of the proposed hashing method, Gaussian Process Hashing (GPH), for short binary codes and the datasets without predefined classes in comparison to the state-of-the-art supervised hashing methods.


page 1

page 2

page 3

page 4


Supervised Incremental Hashing

We propose an incremental strategy for learning hash functions with kern...

Unsupervised Semantic Hashing with Pairwise Reconstruction

Semantic Hashing is a popular family of methods for efficient similarity...

Supervised Learning of Semantics-Preserving Hash via Deep Convolutional Neural Networks

This paper presents a simple yet effective supervised deep hash approach...

NASH: Toward End-to-End Neural Architecture for Generative Semantic Hashing

Semantic hashing has become a powerful paradigm for fast similarity sear...

Short Text Hashing Improved by Integrating Multi-Granularity Topics and Tags

Due to computational and storage efficiencies of compact binary codes, h...

Hashed Binary Search Sampling for Convolutional Network Training with Large Overhead Image Patches

Very large overhead imagery associated with ground truth maps has the po...

Hashing on Nonlinear Manifolds

Learning based hashing methods have attracted considerable attention due...