research-article

Hashing with Angular Reconstructive Embeddings

Authors:

Heng Tao ShenAuthors Info & Claims

IEEE Transactions on Image Processing, Volume 27, Issue 2

Pages 545 - 555

https://doi.org/10.1109/TIP.2017.2749147

Published: 01 February 2018 Publication History

Abstract

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.

References

[1]

M. Charikar, “Similarity estimation techniques from rounding algorithms,” in Proc. STOC, 2002, pp. 380–388.

[2]

M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, “Locality-sensitive hashing scheme based on p-stable distributions,” in Proc. SoCG, 2004, pp. 253–262.

[3]

R. Datta, D. Joshi, J. Li, and J. Z. Wang, “Image retrieval: Ideas, influences, and trends of the new age,” ACM Comput. Surv., vol. 40, no. 2, pp. 5-1–5-60, 2008.

[4]

T. L. Dean, M. A. Ruzon, M. Segal, J. Shlens, S. Vijayanarasimhan, and J. Yagnik, “Fast, accurate detection of 100,000 object classes on a single machine,” in Proc. CVPR, Jun. 2013, pp. 1814–1821.

[5]

J. Deng, W. Dong, R. Socher, L. Li, K. Li, and F. Li, “ImageNet: A large-scale hierarchical image database,” in Proc. CVPR, Jun. 2009, pp. 248–255.

[6]

L. Gao, J. Song, F. Nie, Y. Yan, N. Sebe, and H. T. Shen, “Optimal graph learning with partial tags and multiple features for image and video annotation,” in Proc. CVPR, Jun. 2015, pp. 4371–4379.

[7]

A. Gionis, P. Indyk, and R. Motwani, “Similarity search in high dimensions via hashing,” in Proc. VLDB, 1999, pp. 518–529.

[8]

Y. Gong, S. Kumar, V. Verma, and S. Lazebnik, “Angular quantization-based binary codes for fast similarity search,” in Proc. NIPS, 2012, pp. 1205–1213.

[9]

Y. Gong and S. Lazebnik, “Iterative quantization: A procrustean approach to learning binary codes,” in Proc. CVPR, Jun. 2011, pp. 817–824.

[10]

K. He, F. Wen, and J. Sun, “K-means hashing: An affinity-preserving quantization method for learning binary compact codes,” in Proc. CVPR, Jun. 2013, pp. 2938–2945.

[11]

J. Heo, Y. Lee, J. He, S. Chang, and S. Yoon, “Spherical hashing,” in Proc. CVPR, Jun. 2012, pp. 2957–2964.

[12]

M. Hu, Y. Yang, F. Shen, L. Zhang, H. T. Shen, and X. Li, “Robust Web image annotation via exploring multi-facet and structural knowledge,” IEEE Trans. Image Process., vol. 26, no. 10, pp. 4871–4884, Oct. 2017.

Digital Library

[13]

M. Hu, Y. Yang, H. Zhang, F. Shen, J. Shao, and F. Zou, “Multi-view semi-supervised learning for Web image annotation,” in Proc. ACM Multimedia, 2015, pp. 947–950.

[14]

D. R. Hunter and K. Lange, “A tutorial on MM algorithms,” Amer. Stat., vol. 58, no. 1, pp. 30–37, 2004.

[15]

H. Jegou, M. Douze, and C. Schmid, “Hamming embedding and weak geometric consistency for large scale image search,” in Proc. ECCV, 2008, pp. 304–317.

[16]

H. Jegou, M. Douze, C. Schmid, and P. Pérez, “Aggregating local descriptors into a compact image representation,” in Proc. CVPR, Jun. 2010, pp. 3304–3311.

[17]

Q. Jiang and W. Li, “Scalable graph hashing with feature transformation,” in Proc. IJCAI, 2015, pp. 2248–2254.

[18]

W. Kang, W. Li, and Z. Zhou, “Column sampling based discrete supervised hashing,” in Proc. AAAI, 2016, pp. 1230–1236.

[19]

W. Kong and W. Li, “Isotropic hashing,” in Proc. NIPS, 2012, pp. 1655–1663.

[20]

B. Kulis and T. Darrell, “Learning to hash with binary reconstructive embeddings,” in Proc. NIPS, 2009, pp. 1042–1050.

[21]

B. Kulis and K. Grauman, “Kernelized locality-sensitive hashing for scalable image search,” in Proc. ICCV, 2009, pp. 2130–2137.

[22]

B. Kulis, P. Jain, and K. Grauman, “Fast similarity search for learned metrics,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 12, pp. 2143–2157, Dec. 2009.

Digital Library

[23]

G. Lin, C. Shen, Q. Shi, A. van den Hengel, and D. Suter, “Fast supervised hashing with decision trees for high-dimensional data,” in Proc. CVPR, Jun. 2014, pp. 1971–1978.

[24]

H. Liu, R. Ji, Y. Wu, and F. Huang, “Ordinal constrained binary code learning for nearest neighbor search,” in Proc. AAAI, 2017, pp. 2238–2244.

[25]

L. Liu and L. Shao, “Sequential compact code learning for unsupervised image hashing,” IEEE Trans. Neural Netw. Learn. Syst., vol. 27, no. 12, pp. 2526–2536, Dec. 2016.

[26]

L. Liu, F. Shen, Y. Shen, X. Liu, and L. Shao, “Deep sketch hashing: Fast free-hand sketch-based image retrieval,” in Proc. CVPR, 2017, pp. 2862–2871.

[27]

L. Liu, M. Yu, and L. Shao, “Learning short binary codes for large-scale image retrieval,” IEEE Trans. Image Process., vol. 26, no. 3, pp. 1289–1299, Mar. 2017.

Digital Library

[28]

W. Liu, C. Mu, S. Kumar, and S. Chang, “Discrete graph hashing,” in Proc. NIPS, 2014, pp. 3419–3427.

[29]

W. Liu, J. Wang, R. Ji, Y. Jiang, and S. Chang, “Supervised hashing with kernels,” in Proc. CVPR, Jun. 2012, pp. 2074–2081.

[30]

W. Liu, J. Wang, S. Kumar, and S. Chang, “Hashing with graphs,” in Proc. ICML, 2011, pp. 1–8.

[31]

J. Lu, V. E. Liong, and J. Zhou, “Deep hashing for scalable image search,” IEEE Trans. Image Process., vol. 26, no. 5, pp. 2352–2367, May 2017.

Digital Library

[32]

Y. Luo, Y. Yang, F. Shen, Z. Huang, P. Zhou, and H. T. Shen, “Robust discrete code modeling for supervised hashing,” Pattern Recognit., to be published. 10.1016/j.patcog.2017.02.034.

Digital Library

[33]

M. Norouzi and D. J. Fleet, “Minimal loss hashing for compact binary codes,” in Proc. ICML, 2011, pp. 353–360.

[34]

M. Norouzi, D. J. Fleet, and R. Salakhutdinov, “Hamming distance metric learning,” in Proc. NIPS, pp. 1070–1078, 2012.

[35]

A. Oliva and A. Torralba, “Modeling the shape of the scene: A holistic representation of the spatial envelope,” Int. J. Comput. Vis., vol. 42, no. 3, pp. 145–175, 2001.

Digital Library

[36]

M. Raginsky and S. Lazebnik, “Locality-sensitive binary codes from shift-invariant kernels,” in Proc. NIPS, 2009, pp. 1509–1517.

[37]

Y. Rui, T. S. Huang, and S. Chang, “Image retrieval: Current techniques, promising directions, and open issues,” J. Vis. Commun. Image Rep., vol. 10, no. 1, pp. 39–62, 1999.

[38]

R. Salakhutdinov and G. Hinton, “Semantic hashing,” Int. J. Approx. Reasoning, vol. 50, no. 7, pp. 969–978, Jul. 2009.

Digital Library

[39]

P. H. Schönemann, “A generalized solution of the orthogonal procrustes problem,” Psychometrika, vol. 31, no. 1, pp. 1–10, 1966.

[40]

F. Shen, W. Liu, S. Zhang, Y. Yang, and H. T. Shen, “Learning binary codes for maximum inner product search,” in Proc. ICCV, 2015, pp. 4148–4156.

[41]

F. Shen, C. Shen, W. Liu, and H. T. Shen, “Supervised discrete hashing,” in Proc. CVPR, Jun. 2015, pp. 37–45.

[42]

F. Shen, C. Shen, Q. Shi, A. V. D. Hengel, Z. Tang, and H. T. Shen, “Hashing on nonlinear manifolds,” IEEE Trans. Image Process., vol. 24, no. 6, pp. 1839–1851, Jun. 2015.

Digital Library

[43]

F. Shen, Y. Yang, L. Liu, W. Liu, D. Tao, and H. T. Shen, “Asymmetric binary coding for image search,” IEEE Trans. Multimedia, vol. 19, no. 9, pp. 2022–2032, 2017.

Digital Library

[44]

F. Shen, X. Zhou, Y. Yang, J. Song, H. T. Shen, and D. Tao, “A fast optimization method for general binary code learning,” IEEE Trans. Image Process., vol. 25, no. 12, pp. 5610–5621, Dec. 2016.

Digital Library

[45]

A. W. M. Smeulders, M. Worring, S. Santini, A. Gupta, and R. Jain, “Content-based image retrieval at the end of the early years,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 12, pp. 1349–1380, Dec. 2000.

Digital Library

[46]

A. Torralba, R. Fergus, and W. T. Freeman, “80 million tiny images: A large data set for nonparametric object and scene recognition,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 11, pp. 1958–1970, Nov. 2008.

Digital Library

[47]

A. Torralba, R. Fergus, and Y. Weiss, “Small codes and large image databases for recognition,” in Proc. CVPR, Jun. 2008, pp. 1–8.

[48]

J. Wang, O. Kumar, and S. Chang, “Semi-supervised hashing for scalable image retrieval,” in Proc. CVPR, Jun. 2010, pp. 3424–3431.

[49]

J. Wang, S. Kumar, and S.-F. Chang, “Semi-supervised hashing for large-scale search,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 12, pp. 2393–2406, Dec. 2012.

Digital Library

[50]

J. Wang, W. Liu, S. Kumar, and S.-F. Chang, “Learning to hash for indexing big data—A survey,” Proc. IEEE, vol. 104, no. 1, pp. 34–57, Jan. 2016.

[51]

J. Wang, T. Zhang, J. Song, N. Sebe, and H. T. Shen, “A survey on learning to hash,” IEEE Trans. Pattern Anal. Mach. Intell., to be published. 10.1109/TPAMI.2017.2699960.

[52]

Y. Wang, X. Lin, L. Wu, and W. Zhang, “Effective multi-query expansions: Collaborative deep networks for robust landmark retrieval,” IEEE Trans. Image Process., vol. 26, no. 3, pp. 1393–1404, Mar. 2017.

Digital Library

[53]

Y. Wang, X. Lin, L. Wu, W. Zhang, and Q. Zhang, “LBMCH: learning bridging mapping for cross-modal hashing,” in Proc. SIGIR, 2015, pp. 999–1002.

[54]

Y. Wang, X. Lin, L. Wu, W. Zhang, Q. Zhang, and X. Huang, “Robust subspace clustering for multi-view data by exploiting correlation consensus,” IEEE Trans. Image Process., vol. 24, no. 11, pp. 3939–3949, Nov. 2015.

Digital Library

[55]

Y. Weiss, A. Torralba, and R. Fergus, “Spectral hashing,” in Proc. NIPS, 2008, pp. 1753–1760.

[56]

X. Xu, F. Shen, Y. Yang, H. T. Shen, and X. Li, “Learning discriminative binary codes for large-scale cross-modal retrieval,” IEEE Trans. Image Process., vol. 26, no. 5, pp. 2494–2507, May 2017.

Digital Library

[57]

Y. Yang, Y. Luo, W. Chen, F. Shen, J. Shao, and H. T. Shen, “Zero-shot hashing via transferring supervised knowledge,” in Proc. ACM Multimedia, 2016, pp. 1286–1295.

[58]

Y. Yang, Z. Ma, Y. Yang, F. Nie, and H. T. Shen, “Multitask spectral clustering by exploring intertask correlation,” IEEE Trans. Cybern., vol. 45, no. 5, pp. 1083–1094, May 2015.

[59]

Y. Yang, F. Shen, Z. Huang, H. T. Shen, and X. Li, “Discrete nonnegative spectral clustering,” IEEE Trans. Knowl. Data Eng., vol. 29, no. 9, pp. 1834–1845, Sep. 2017. 10.1109/TKDE.2017.2701825.

Digital Library

[60]

Y. Yang, F. Shen, H. T. Shen, H. Li, and X. Li, “Robust discrete spectral hashing for large-scale image semantic indexing,” IEEE Trans. Big Data, vol. 1, no. 4, pp. 162–171, Dec. 2015.

[61]

Y. Yang, Z.-J. Zha, Y. Gao, X. Zhu, and T.-S. Chua, “Exploiting Web images for semantic video indexing via robust sample-specific loss,” IEEE Trans. Multimedia, vol. 16, no. 6, pp. 1677–1689, Oct. 2014.

[62]

D. Zhang, J. Wang, D. Cai, and J. Lu, “Self-taught hashing for fast similarity search,” in Proc. SIGIR, 2010, pp. 18–25.

[63]

H. Zhang, F. Shen, W. Liu, X. He, H. Luan, and T. Chua, “Discrete collaborative filtering,” in Proc. SIGIR, 2016, pp. 325–334.

[64]

H. Zhang, M. Wang, R. Hong, and T. Chua, “Play and rewind: Optimizing binary representations of videos by self-supervised temporal hashing,” in Proc. ACM Multimedia, 2016, pp. 781–790s.

[65]

X. Zhu, X. Li, S. Zhang, Z. Xu, L. Yu, and C. Wang, “Graph PCA hashing for similarity search,” IEEE Trans. Multimedia, vol. 19, no. 9, pp. 2033–2044, Sep. 2017. 10.1109/TMM.2017.2703636.

Digital Library

[66]

X. Zhu, L. Zhang, and Z. Huang, “A sparse embedding and least variance encoding approach to hashing,” IEEE Trans. Image Process., vol. 23, no. 9, pp. 3737–3750, Sep. 2014.

Cited By

Tan JYang XYang ZChen RLu YLin L(2024)Extensible Max-Min Collaborative Retention for Online Mini-Batch Learning Hash RetrievalIEEE Transactions on Multimedia10.1109/TMM.2024.335564626(6743-6758)Online publication date: 2-Feb-2024
https://dl.acm.org/doi/10.1109/TMM.2024.3355646
Cui HLi FZhu LLi JZhang Z(2024)Online Query Expansion Hashing for Efficient Image RetrievalIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2023.329641234:3(1941-1953)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1109/TCSVT.2023.3296412
Yang FHan MMa FLiu YDing XTong D(2024)Disperse Asymmetric Subspace Relation Hashing for Cross-Modal RetrievalIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2023.328730134:1(603-617)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TCSVT.2023.3287301
Show More Cited By

Index Terms

Hashing with Angular Reconstructive Embeddings
1. Information systems
  1. Information retrieval

Index terms have been assigned to the content through auto-classification.

Recommendations

Adaptive Object Retrieval with Kernel Reconstructive Hashing
CVPR '14: Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition

Hashing is very useful for fast approximate similarity search on large database. In the unsupervised settings, most hashing methods aim at preserving the similarity defined by Euclidean distance. Hash codes generated by these approaches only keep their ...
Hashing, searching, sketching
Fast Cosine Similarity Search in Binary Space with Angular Multi-Index Hashing

Given a large dataset of binary codes and a binary query point, we address how to efficiently find $K$ codes in the dataset that yield the largest cosine similarities to the query. The straightforward answer to this problem is to compare the query with all ...

Comments

Information & Contributors

Information

Published In

1057-7149 © 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.

Publisher

IEEE Press

Publication History

Published: 01 February 2018

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tan JYang XYang ZChen RLu YLin L(2024)Extensible Max-Min Collaborative Retention for Online Mini-Batch Learning Hash RetrievalIEEE Transactions on Multimedia10.1109/TMM.2024.335564626(6743-6758)Online publication date: 2-Feb-2024
https://dl.acm.org/doi/10.1109/TMM.2024.3355646
Cui HLi FZhu LLi JZhang Z(2024)Online Query Expansion Hashing for Efficient Image RetrievalIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2023.329641234:3(1941-1953)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1109/TCSVT.2023.3296412
Yang FHan MMa FLiu YDing XTong D(2024)Disperse Asymmetric Subspace Relation Hashing for Cross-Modal RetrievalIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2023.328730134:1(603-617)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TCSVT.2023.3287301
Yang FHan MMa FDing XZhang Q(2023)Label embedding asymmetric discrete hashing for efficient cross-modal retrievalEngineering Applications of Artificial Intelligence10.1016/j.engappai.2023.106473123:PCOnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.engappai.2023.106473
Prayoonwong AZeng KChiu C(2022)Improving Nearest Neighbor Indexing by Multitask LearningProceedings of the 19th International Conference on Content-based Multimedia Indexing10.1145/3549555.3549579(71-76)Online publication date: 14-Sep-2022
https://dl.acm.org/doi/10.1145/3549555.3549579
Zhang WYang XTeng SWu N(2022)Semantic-guided hashing learning for domain adaptive retrievalWorld Wide Web10.1007/s11280-022-01072-926:3(1093-1112)Online publication date: 8-Jul-2022
https://dl.acm.org/doi/10.1007/s11280-022-01072-9
Xu YBin YWang GYang Y(2021)Hierarchical Composition Learning for Composed Query Image RetrievalProceedings of the 3rd ACM International Conference on Multimedia in Asia10.1145/3469877.3490601(1-7)Online publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1145/3469877.3490601
Wang ZZhang ZLuo YHuang ZShen H(2021)Deep Collaborative Discrete Hashing With Semantic-Invariant Structure ConstructionIEEE Transactions on Multimedia10.1109/TMM.2020.299526723(1274-1286)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1109/TMM.2020.2995267
Chiu CPrayoonwong ALiao Y(2020)Learning to Index for Nearest Neighbor SearchIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2019.290708642:8(1942-1956)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.1109/TPAMI.2019.2907086
Bai JLi ZNi BWang MYang XHu CGao W(2020)Loopy Residual Hashing: Filling the Quantization Gap for Image RetrievalIEEE Transactions on Multimedia10.1109/TMM.2019.292213022:1(215-228)Online publication date: 3-Jan-2020
https://dl.acm.org/doi/10.1109/TMM.2019.2922130
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents