Hashing with Angular Reconstructive Embeddings

doi:10.1109/TIP.2017.2749147

Hashing with Angular Reconstructive Embeddings

2018-02-01

81

PRE

AI

DOI：10.1109/TIP.2017.2749147

Original

Original request for help

Save

Abstract

En 中文

Large-scale search methods are increasingly critical for many content-based visual analysis applications, among which hashing-based approximate nearest neighbor search techniques have attracted broad interests due to their high efficiency in storage and retrieval. However, existing hashing works are commonly designed for measuring data similarity by the Euclidean distances. In this paper, we focus on the problem of learning compact binary codes using the cosine similarity. Specifically, we proposed novel angular reconstructive embeddings (ARE) method, which aims at learning binary codes by minimizing the reconstruction error between the cosine similarities computed by original features and the resulting binary embeddings. Furthermore, we devise two efficient algorithms for optimizing our ARE in continuous and discrete manners, respectively. We extensively evaluate the proposed ARE on several large-scale image benchmarks. The results demonstrate that ARE outperforms several state-of-the-art methods.

Keywords:

Binary code learning

hashing

binary reconstructive embeddings

Hashing with Angular Reconstructive Embeddings

Abstract

AI Summary

Journal

Organization