Hashing with angular reconstructive embeddings
- Publication Type:
- Journal Article
- Citation:
- IEEE Transactions on Image Processing, 2018, 27 (2), pp. 545 - 555
- Issue Date:
- 2018-02-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 08025599.pdf | Published Version | 2.02 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 1992-2012 IEEE. 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.
Please use this identifier to cite or link to this item: