Hashing with binary autoencoders

An attractive approach for fast search in image databases is binary hashing, where each high-dimensional, real-valued image is mapped onto a low-dimensional, binary vector and the search is done in this binary space. Finding the optimal hash function is difficult because it involves binary constraints, and most approaches approximate the optimization by relaxing the constraints and then binarizing the result. Here, we focus on the binary autoencoder model, which seeks to reconstruct an image from the binary code produced by the hash function. We show that the optimization can be simplified with the method of auxiliary coordinates. This reformulates the optimization as alternating two easier steps: one that learns the encoder and decoder separately, and one that optimizes the code for each image. Image retrieval experiments, using precision/recall and a measure of code utilization, show the resulting hash function outperforms or is competitive with state-of-the-art methods for binary hashing.

READ FULL TEXT
research
04/24/2019

Simultaneous Feature Aggregating and Hashing for Compact Binary Code Learning

Representing images by compact hash codes is an attractive approach for ...
research
01/21/2015

Optimizing affinity-based binary hashing using auxiliary coordinates

In supervised binary hashing, one wants to learn a function that maps a ...
research
11/29/2022

HashEncoding: Autoencoding with Multiscale Coordinate Hashing

We present HashEncoding, a novel autoencoding architecture that leverage...
research
08/24/2014

Supervised Hashing Using Graph Cuts and Boosted Decision Trees

Embedding image features into a binary Hamming space can improve both th...
research
08/26/2019

Embarrassingly Simple Binary Representation Learning

Recent binary representation learning models usually require sophisticat...
research
11/20/2020

Shuffle and Learn: Minimizing Mutual Information for Unsupervised Hashing

Unsupervised binary representation allows fast data retrieval without an...
research
06/10/2017

On Hash-Based Work Distribution Methods for Parallel Best-First Search

Parallel best-first search algorithms such as Hash Distributed A* (HDA*)...

Please sign up or login with your details

Forgot password? Click here to reset