The DOI matches its Crossref record; 145 of the 145 references it cites were found in a registry or an index.
Learning to Hash for Indexing Big Data—A Survey
Open accessAbstract
The explosive growth in Big Data has attracted much attention in designing efficient indexing and search methods recently. In many critical applications such as large-scale search and pattern matching, finding the nearest neighbors to a query is a fundamental research problem. However, the straightforward solution using exhaustive comparison is infeasible due to the prohibitive computational complexity and memory requirement. In response, approximate nearest neighbor (ANN) search based on hashing techniques has become popular due to its promising performance in both efficiency and accuracy. Prior randomized hashing methods, e.g., locality-sensitive hashing (LSH), explore data-independent hash functions with random projections or permutations. Although having elegant theoretic guarantees on the search quality in certain metric spaces, performance of randomized hashing has been shown insufficient in many real-world applications. As a remedy, new approaches incorporating data-driven learning methods in development of advanced hash functions have emerged. Such learning-to-hash methods exploit information such as data distributions or class labels when optimizing the hash codes or functions. Importantly, the learned hash codes are able to preserve the proximity of neighboring data in the original feature spaces in the hash code spaces. The goal of this paper is to provide readers with systematic understanding of insights, pros, and cons of the emerging techniques. We provide a comprehensive survey of the learning-to-hash framework and representative techniques of various types, including unsupervised, semisupervised, and supervised. In addition, we also summarize recent hashing approaches utilizing the deep learning models. Finally, we discuss the future direction and trends of research in this area.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Content-based image retrieval at the end of the early years
Smeulders, A. W. M., Worring, M., Santini, S., Gupta, A., & Jain, R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.895972 · Cited by 6,056
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
(1999) · Cited by 3,186
Image retrieval: Ideas, influences, and trends of the new age
Datta, R., Joshi, D., Li, J., & Wang, J. Z. (2008) · ACM Computing Surveys · doi:10.1145/1348246.1348248 · Cited by 3,040
Self-citationProduct Quantization for Nearest Neighbor Search
Jégou, H., Douze, M., & Schmid, C. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.57 · Cited by 2,956 · cited 1×
“Unlike the recursive partitioning used by tree-based indexing methods, hashing methods repeatedly partition the entire dataset and derive a single hash ’bit’2 from each par- 2 Depending on the type of the hash function used, each hash may return either an integer or simply a binary bit.”
MethodLocality-sensitive hashing scheme based on p-stable distributions
Datar, M., Immorlica, N., Indyk, P., & Mirrokni, V. S. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997857 · Cited by 2,936
Aggregating local descriptors into a compact image representation
Jegou, H., Douze, M., Schmid, C., & Perez, P. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540039 · Cited by 2,692
Weiss, Y., Torralba, A. B., & Fergus, R. (2008) · neural information processing systems · Cited by 2,389
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
A desicion-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-59119-2_166 · Cited by 2,252
Similarity estimation techniques from rounding algorithms
Charikar, M. S. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509965 · Cited by 2,220
Information-theoretic metric learning
Davis, J. V., Kulis, B., Jain, P., Sra, S., & Dhillon, I. S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273523 · Cited by 2,006
80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition
Torralba, A., Fergus, R., & Freeman, W. T. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.128 · Cited by 1,921
Gong, Y., Lazebnik, S., Gordo, A., & Perronnin, F. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.193 · Cited by 1,834
On the resemblance and containment of documents
Broder, A. Z. (2002) · Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) · doi:10.1109/sequen.1997.666900 · Cited by 1,698
Google news personalization: scalable online collaborative filtering
Das, A. S., Datar, M., Garg, A., & Rajaram, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242610 · Cited by 1,511
Learning Fast Approximations of Sparse Coding
Gregor, K., & LeCun, Y. (2010) · International Conference on Machine Learning · Cited by 1,413
Supervised hashing with kernels
Liu, W., Wang, J., Ji, R., Jiang, Y.-G., & Chang, S.-F. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247912 · Cited by 1,351
Self-citationSpectral grouping using the nystrom method
Fowlkes, C., Belongie, S., Chung, F., & Malik, J. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262185 · Cited by 1,328
Salakhutdinov, R., & Hinton, G. (2009) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2008.11.006 · Cited by 1,246
Shen, F., Shen, C., Liu, W., & Shen, H. T. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298598 · Cited by 1,231
Self-citationIterative quantization: A procrustean approach to learning binary codes
Gong, Y., & Lazebnik, S. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995432 · Cited by 1,038
(1993) · doi:10.5555/313559.313789 · Cited by 998
Compressing Neural Networks with the Hashing Trick
Chen, W., Wilson, J. T., Tyree, S., Weinberger, K. Q., & Chen, Y. (2015) · arXiv · doi:10.48550/arxiv.1504.04788 · Cited by 974
Supervised Hashing for Image Retrieval via Image Representation Learning
Xia, R., Pan, Y., Lai, H., Liu, C., & Yan, S. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8952 · Cited by 952
Kernelized locality-sensitive hashing for scalable image search
Kulis, B., & Grauman, K. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459466 · Cited by 890
Simultaneous feature learning and hash coding with deep neural networks
Lai, H., Pan, Y., Liu, Y., & Yan, S. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298947 · Cited by 884
Semi-Supervised Hashing for Large-Scale Search
Wang, J., Kumar, S., & Chang, S.-F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.48 · Cited by 810
Self-citationLearning to Hash with Binary Reconstructive Embeddings
Kulis, B., & Darrell, T. (2009) · Cited by 806
Min-Wise Independent Permutations
Broder, A. Z., Charikar, M., Frieze, A. M., & Mitzenmacher, M. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1690 · Cited by 802
Toeplitz and Circulant Matrices: A Review
Gray, R. M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019680 · Cited by 759
Fast pose estimation with parameter-sensitive hashing
Shakhnarovich, Viola, & Darrell (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238424 · Cited by 758
Small codes and large image databases for recognition
Torralba, A., Fergus, R., & Weiss, Y. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587633 · Cited by 727
The Art of Computer Programming, Volume 3, Sorting and Searching
Wilkes, M. V. (1974) · The Computer Journal · doi:10.1093/comjnl/17.4.324 · Cited by 707
Minimal Loss Hashing for Compact Binary Codes
Norouzi, M., & Blei, D. M. (2011) · Cited by 694
Satisfying general proximity / similarity queries with metric trees
Uhlmann, J. K. (1991) · Information Processing Letters · doi:10.1016/0020-0190(91)90074-r · Cited by 690
Similarity estimation techniques from rounding algorithms
Charikar, M. (2002) · doi:10.1145/509961.509965 · Cited by 659
Multi-probe LSH: efficient indexing for high-dimensional similarity search
Lv, Q., Josephson, W. K., Wang, Z., Charikar, M., & Li, K. (2007) · Very Large Data Bases · Cited by 634
Detecting near-duplicates for web crawling
Manku, G. S., Jain, A., & Das Sarma, A. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242592 · Cited by 617
LDAHash: Improved Matching with Smaller Descriptors
Strecha, C., Bronstein, A. M., Bronstein, M. M., & Fua, P. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.103 · Cited by 605
Semi-supervised hashing for scalable image retrieval
Wang, J., Kumar, S., & Chang, S.-F. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539994 · Cited by 601
Self-citationLocality-sensitive binary codes from shift-invariant kernels
Raginsky, M., & Lazebnik, S. (2009) · Cited by 600
Deep semantic ranking based hashing for multi-label image retrieval
Zhao, F., Huang, Y., Wang, L., & Tan, T. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298763 · Cited by 564
Hamming Distance Metric Learning
Norouzi, M., Fleet, D. J., & Salakhutdinov, R. (2012) · neural information processing systems · Cited by 562
Large Graph Construction for Scalable Semi-Supervised Learning
Liu, W., He, J., & Chang, S. (2010) · Cited by 554
Self-citationDeep hashing for compact binary codes learning
Liong, V. E., Lu, J., Wang, G., Moulin, P., & Zhou, J. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298862 · Cited by 545
Liu, W., Mu, C., Kumar, S., & Chang, S. (2014) · Cited by 525
Self-citationNear Duplicate Image Detection: min-Hash and tf-idf Weighting
Chum, O., Philbin, J., & Zisserman, A. (2008) · Procedings of the British Machine Vision Conference 2008 · doi:10.5244/c.22.50 · Cited by 460
Data fusion through cross-modality metric learning using similarity-sensitive hashing
Bronstein, M. M., Bronstein, A. M., Michel, F., & Paragios, N. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539928 · Cited by 455
Learning a Nonlinear Embedding by Preserving Class Neighbourhood Structure
Salakhutdinov, R., & Hinton, G. E. (2007) · International Conference on Artificial Intelligence and Statistics · Cited by 440
Nearest-Neighbor Methods in Learning and Vision: Theory and Practice
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/4908.001.0001 · Cited by 440
Finding near-duplicate web pages: a large-scale evaluation of algorithms
Henzinger, M. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148222 · Cited by 421
Nearest-neighbor methods in learning and vision : theory and practice
Shakhnarovich, G., Indyk, P., & Darrell, T. (2005) · Cited by 399
K-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes
He, K., Wen, F., & Sun, J. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.378 · Cited by 395
Optimized Product Quantization for Approximate Nearest Neighbor Search
Ge, T., He, K., Ke, Q., & Sun, J. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.379 · Cited by 384
Heo, J.-P., Lee, Y., He, J., Chang, S.-F., & Yoon, S.-E. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248024 · Cited by 362
Self-citationLSH forest: self-tuning indexes for similarity search
Bawa, M., Condie, T., & Ganesan, P. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060840 · Cited by 353
Self-taught hashing for fast similarity search
Zhang, D., Wang, J., Cai, D., & Lu, J. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835455 · Cited by 347
Self-citationMultiple feature hashing for real-time large scale near-duplicate video retrieval
Song, J., Yang, Y., Huang, Z., Shen, H. T., & Hong, R. (2011) · Proceedings of the 19th ACM international conference on Multimedia · doi:10.1145/2072298.2072354 · Cited by 334
Kernelized Locality-Sensitive Hashing
Kulis, B., & Grauman, K. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.219 · Cited by 331
Sequential Projection Learning for Hashing with Compact Codes
Wang, J., Kumar, S., & Chang, S. (2010) · International Conference on Machine Learning · Cited by 307
Self-citationFast image search for learned metrics
Jain, P., Kulis, B., & Grauman, K. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587841 · Cited by 279
Kong, W., & Li, W.-J. (2012) · neural information processing systems · Cited by 277
Fast search in Hamming space with multi-index hashing
Norouzi, M., Punjani, A., & Fleet, D. J. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248043 · Cited by 263
Fast Similarity Search for Learned Metrics
Kulis, B., Jain, P., & Grauman, K. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.151 · Cited by 256
Geometric min-Hashing: Finding a (thick) needle in a haystack
Chum, O., Perd'och, M., & Matas, J. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206531 · Cited by 230
Composite hashing with multiple information sources
Zhang, D., Wang, F., & Si, L. (2011) · Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval · doi:10.1145/2009916.2009950 · Cited by 211
Nearest Neighbors in High-Dimensional Spaces
Indyk, P. (2004) · Discrete Mathematics and Its Applications · doi:10.1201/9781420035315.ch39 · Cited by 207
Improved Consistent Sampling, Weighted Minhash and L1 Sketching
Ioffe, S. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.80 · Cited by 198
Inductive Hashing on Manifolds
Shen, F., Shen, C., Shi, Q., van den Hengel, A., & Tang, Z. (2013) · Cited by 198
A probabilistic model for multimodal hash function learning
Zhen, Y., & Yeung, D.-Y. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339678 · Cited by 197
Hash Kernels for Structured Data
Shi, Q., PettersonJames, Dror, G., Langford, J. C., & Smola, A. J. (2009) · ANU Open Research (Australian National University) · doi:10.5555/1577069.1755873 · Cited by 194
Online Metric Learning and Fast Similarity Search
Jain, P., Kulis, B., Dhillon, I. S., et al. (2008) · Cited by 193
Co-Regularized Hashing for Multimodal Data
Zhen, Y., & Yeung, D. (2012) · Cited by 190
Inductive Hashing on Manifolds
Shen, F., Shen, C., Shi, Q., van den Hengel, A., & Tang, Z. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.205 · Cited by 186
Mobile product search with Bag of Hash Bits and boundary reranking
He, J., Feng, J., Liu, X., Cheng, T., Lin, T.-H., Chung, H., & Chang, S.-F. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248030 · Cited by 174
Self-citationAttribute Discovery via Predictable Discriminative Binary Codes
Rastegari, M., Farhadi, A., & Forsyth, D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33783-3_63 · Cited by 171
Li, P., & König, C. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772759 · Cited by 170
Korman, S., & Avidan, S. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126421 · Cited by 166
Learning Binary Codes for High-Dimensional Data Using Bilinear Projections
Gong, Y., Kumar, S., Rowley, H. A., & Lazebnik, S. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.69 · Cited by 164
Self-citationComplementary hashing for approximate nearest neighbor search
Xu, H., Wang, J., Li, Z., Zeng, G., Li, S., & Yu, N. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126424 · Cited by 162
Self-citationMultidimensional Spectral Hashing
Weiss, Y., Fergus, R., & Torralba, A. B. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33715-4_25 · Cited by 157
Weakly-supervised hashing in kernel space
Mu, Y., Shen, J., & Yan, S. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5540024 · Cited by 157
Efficient Algorithms with Neural Network Behavior.
Omohundro, S. M. (1987) · Complex Systems · Cited by 153
Circulant Binary EmbeddingPreprint
Yu, F., Kumar, S., Gong, Y., & Chang, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.3162 · Cited by 153
Self-citationScalable similarity search with optimized kernel hashing
He, J., Liu, W., & Chang, S. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835946 · Cited by 151
Self-citationJoly, A., & Buisson, O. (2011) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2011.5995709 · Cited by 150
Learning Hash Codes with Listwise Supervision
Wang, J., Liu, W., Sun, X. A., & Jiang, Y. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.377 · Cited by 146
Self-citationBayesian locality sensitive hashing for fast similarity search
Satuluri, V., & Parthasarathy, S. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2140436.2140440 · Cited by 144
Fast locality-sensitive hashing
Dasgupta, A., Kumar, R., & Sarlós, T. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020578 · Cited by 141
Modeling LSH for performance tuning
Dong, W., Wang, Z., Josephson, W. K., Charikar, M., & Li, K. (2008) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1458082.1458172 · Cited by 140
Hashing Algorithms for Large-Scale LearningPreprint
Li, P., Shrivastava, A., Moore, J. L., & König, A. C. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.0967 · Cited by 137
Learning Hash Functions Using Column GenerationPreprint
Li, X., Lin, G., Shen, C., van den Hengel, A., & Dick, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1303.0339 · Cited by 129
Learning task-specific similarity
Shakhnarovich, G. (2005) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 125
Order preserving hashing for approximate nearest neighbor search
Wang, J., Wang, J., Yu, N., & Li, S. (2013) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/2502081.2502100 · Cited by 120
Self-citationEfficient Discriminative Projections for Compact Binary Descriptors
Trzcinski, T. P., & Lepetit, V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33718-5_17 · Cited by 118
Super-Bit Locality-Sensitive Hashing
Ji, J., Li, J., Yan, S., Zhang, B., & Tian, Q. (2012) · National University of Singapore · Cited by 116
Rastegari, M., Choi, J., Fakhraei, S., Daumé, H., & Davis, L. S. (2013) · Cited by 109
Compact hashing with joint optimization of search accuracy and time
He, J., Chang, S., Radhakrishnan, R., & Bauer, C. (2011) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2011.5995518 · Cited by 108
Self-citationManhattan hashing for large-scale image retrieval
Kong, W., Li, W.-J., & Guo, M. (2012) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2348283.2348293 · Cited by 106
Learning binary codes for collaborative filtering
Zhou, K., & Hongyuan Zha, B. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339611 · Cited by 101
Li, P., Owen, A. B., & Zhang, C. (2013) · Cited by 101
Angular Quantization-based Binary Codes for Fast Similarity Search
Gong, Y., Kumar, S., Verma, V., & Lazebnik, S. (2012) · Cited by 98
Self-citationBinary Code Ranking with Weighted Hamming Distance
Zhang, L., Zhang, Y., Tang, J., Lü, K., & Tian, Q. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.208 · Cited by 98
Learning Binary Hash Codes for Large-Scale Image Search
Grauman, K. L., & Fergus, R. (2012) · Studies in computational intelligence · doi:10.1007/978-3-642-28661-2_3 · Cited by 92
Hash Bit Selection: A Unified Solution for Selection Problems in Hashing
Liu, X., He, J., Lang, B., & Chang, S. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.206 · Cited by 89
Self-citationBoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
Athitsos, V., Alon, J., Sclaroff, S., & Kollios, G. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1140 · Cited by 84
Large-Scale Video Hashing via Structure Learning
Ye, G., Liu, D., Wang, J., & Chang, S. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.282 · Cited by 80
Self-citationQuery-Adaptive Image Search With Hash Codes
Jiang, Y., Wang, J., Xue, X., & Chang, S. (2012) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2012.2231061 · Cited by 78
Self-citationApproximate Nearest Subspace Search
Basri, R., Hassner, T., & Zelnik‐Manor, L. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.110 · Cited by 78
Learning Compact Binary Codes for Visual Tracking
Li, X., Shen, C., Dick, A., & van den Hengel, A. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.313 · Cited by 78
Non-Metric Locality-Sensitive Hashing
Mu, Y., & Yan, S. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7683 · Cited by 72
SPEC hashing: Similarity preserving algorithm for entropy-based coding
Lin, R.-S., Ross, D. A., & Yagnik, J. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5540129 · Cited by 72
Compact Hyperplane Hashing with Bilinear FunctionsPreprint
Liu, W., Wang, J., Mu, Y., Kumar, S., & Chang, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.4618 · Cited by 69
Self-citationHashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning
Jain, P., Vijayanarasimhan, S., & Grauman, K. L. (2010) · Cited by 66
Rapid face recognition using hashing
Shi, Q., Li, H., & Shen, C. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5540001 · Cited by 59
Lin, Y., Jin, R., Cai, D., Yan, S., & Li, X. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.64 · Cited by 57
Partition Min-Hash for Partial Duplicate Image Discovery
Lee, D. C., Ke, Q., & Isard, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15549-9_47 · Cited by 55
Ou, M., Cui, P., Wang, F., Wang, J., Zhu, W., & Yang, S. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487668 · Cited by 55
Self-citationComplementary Projection Hashing
Jin, Z., Hu, Y., Lin, Y., Zhang, D., Lin, S., Cai, D., & Li, X. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.39 · Cited by 55
Submodular video hashing: a unified framework towards video pooling and indexing
Cao, L., Li, Z., Mu, Y., & Chang, S.-F. (2012) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/2393347.2393393 · Cited by 50
Self-citationSemantic hashing using tags and topic modeling
Wang, Q., Zhang, D., & Si, L. (2013) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2484028.2484037 · Cited by 49
Asymmetric distances for binary embeddings
Gordo, A., & Perronnin, F. (2011) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2011.5995505 · Cited by 49
Sequential Spectral Learning to Hash with Multiple Representations
Kim, S., Kang, Y., & Choi, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33715-4_39 · Cited by 48
On the Difficulty of Nearest Neighbor SearchPreprint
He, J., Kumar, S., & Chang, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.6411 · Cited by 47
Self-citationHash-SVM: Scalable Kernel Machines for Large-Scale Visual Classification
Mu, Y., Hua, G., Fan, W., & Chang, S. (2014) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2014.130 · Cited by 45
Self-citationJiang, Y., Wang, J., & Chang, S. (2011) · International Conference on Multimedia Retrieval · doi:10.1145/1991996.1992012 · Cited by 44
Self-citationQsRank: Query-sensitive hash code ranking for efficient ∊-neighbor search
Zhang, X., Zhang, L., & Shum, H. (2012) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2012.6247910 · Cited by 43
Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning
Vijayanarasimhan, S., Jain, P., & Grauman, K. L. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.121 · Cited by 43
b-bit minwise hashing for estimating three-way similarities
Li, P., König, A. C., & Gui, W. (2010) · Cited by 30
Efficiently searching for similar images
Grauman, K. L. (2010) · Communications of the ACM · doi:10.1145/1743546.1743570 · Cited by 28
Non-transitive Hashing with Latent Similarity Components
Ou, M., Cui, P., Wang, F., et al. (2015) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783283 · Cited by 25
A Learning Framework for Nearest Neighbor Search
Cayton, L., & Dasgupta, S. (2008) · Cited by 25
Fast computation of min-Hash signatures for image collections
Chum, O., & Matas, J. (2012) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2012.6248039 · Cited by 23
Two-Stage Hashing for Fast Document Retrieval
Li, H., Liu, W., & Ji, H. (2014) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/v1/p14-2081 · Cited by 20
Self-citationSparse similarity-preserving hashingPreprint
Masci, J., Bronstein, A. M., Bronstein, M. M., Sprechmann, P., & Sapiro, G. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.5479 · Cited by 18
Fast Pairwise Query Selection for Large-Scale Active Learning to Rank
Qian, B., Wang, X., Wang, J., Li, H., Cao, N., Zhi, W., & Davidson, I. A. K. (2013) · Proceedings · doi:10.1109/icdm.2013.54 · Cited by 16
Self-citationFast Subspace Search via Grassmannian Based Hashing
Wang, X., Atev, S., Wright, J. N., & Lerman, G. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.345 · Cited by 14
Probabilistic Attributed Hashing
Ou, M., Cui, P., Wang, J., Wang, F., & Zhu, W. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9543 · Cited by 9
Self-citation
Cited by
Digital twin: values, challenges and enablers from a modeling perspective
Rasheed, A., San, O., & Kvamsdal, T. (2020) · IEEE Access · doi:10.1109/access.2020.2970143 · Cited by 1,952
Sketch-based manga retrieval using manga109 dataset
Matsui, Y., Ito, K., Aramaki, Y., Fujimoto, A., Ogawa, T., Yamasaki, T., & Aizawa, K. (2017) · Multimedia Tools and Applications · doi:10.1007/s11042-016-4020-z · Cited by 1,432
Wang, J., Zhang, T., Song, J., Sebe, N., & Shen, H. T. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2699960 · Cited by 971
Self-citationThe Case for Learned Index Structures
Kraska, T., Beutel, A., Chi, E. H., Dean, J., & Polyzotis, N. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196909 · Cited by 956
FastText.zip: Compressing text classification models
Joulin, A., Grave, E., Bojanowski, P., Douze, M., Jégou, H., & Mikolov, T. (2016) · arXiv · doi:10.48550/arxiv.1612.03651 · Cited by 887
Metadata
- Authors
- Wang, J., Liu, W., Kumar, S., & Chang, S.-F.
- Venue
- Proceedings of the IEEE
- Published
- 2016-01
- Volume
- 104
- Issue
- 1
- Pages
- 34-57
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2963213486
- Cited by
- 519
- References
- 145
- FWCI
- 53.72
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.