{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:16:52Z","timestamp":1760955412081,"version":"3.41.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2013,5]]},"abstract":"<jats:p>Hash-based methods achieve fast similarity search by representing high-dimensional data with compact binary codes. However, both generating binary codes and encoding unseen data effectively and efficiently remain very challenging tasks. In this article, we focus on these tasks to implement approximate similarity search by proposing a novel hash based method named sparse hashing (SH for short). To generate interpretable (or semantically meaningful) binary codes, the proposed SH first converts original data into low-dimensional data through a novel nonnegative sparse coding method. SH then converts the low-dimensional data into Hamming space (i.e., binary encoding low-dimensional data) by a new binarization rule. After this, training data are represented by generated binary codes. To efficiently and effectively encode unseen data, SH learns hash functions by taking a-priori knowledge into account, such as implicit group effect of the features in training data, and the correlations between original space and the learned Hamming space. SH is able to perform fast approximate similarity search by efficient bit XOR operations in the memory of a modern PC with short binary code representations. Experimental results show that the proposed SH significantly outperforms state-of-the-art techniques.<\/jats:p>","DOI":"10.1145\/2457465.2457469","type":"journal-article","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T12:33:56Z","timestamp":1369139636000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":89,"title":["Sparse hashing for fast multimedia search"],"prefix":"10.1145","volume":"31","author":[{"given":"Xiaofeng","family":"Zhu","sequence":"first","affiliation":[{"name":"The University of Queensland, Australia"}]},{"given":"Zi","family":"Huang","sequence":"additional","affiliation":[{"name":"The University of Queensland, Australia"}]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}]},{"given":"Jiangtao","family":"Cui","sequence":"additional","affiliation":[{"name":"Xidian University, China"}]},{"given":"Heng Tao","family":"Shen","sequence":"additional","affiliation":[{"name":"The University of Queensland, Australia"}]}],"member":"320","published-online":{"date-parts":[[2013,5,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.138"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248632"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9868.00054"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_1_6_1","unstructured":"Cormen T. H. Stein C. Rivest R. L. and Leiserson C. E. 2001. Introduction to Algorithms 2nd Ed. McGraw-Hill Higher Education. Cormen T. H. Stein C. Rivest R. L. and Leiserson C. E. 2001. Introduction to Algorithms 2nd Ed. McGraw-Hill Higher Education."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390182"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194916"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053604000000067"},{"volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 3555--3561","author":"Gao S.","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-010-9181-4"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383225"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995518"},{"volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems. 197--204","author":"He X.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Hotelling H. 1936. Relations between two sets of variates. Biometrika 28 3\/4 321--377. Hotelling H. 1936. Relations between two sets of variates. Biometrika 28 3\/4 321--377.","DOI":"10.1093\/biomet\/28.3-4.321"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1044709"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989430"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508850.1508855"},{"volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 1--8.","author":"Jain P.","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems. 1042--1050","author":"Kulis B.","key":"e_1_2_1_22_1"},{"volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems. 801--808","author":"Lee H.","key":"e_1_2_1_23_1"},{"volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 1113--1119","author":"Lee H.","key":"e_1_2_1_24_1"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Liu J. Huang Z. Cai H. Shen H. T. Ngo C.-W. and Wang W. 2013. Near-duplicate video retrieval: Current research and future trends. ACM Comput Surv. To appear. Liu J. Huang Z. Cai H. Shen H. T. Ngo C.-W. and Wang W. 2013. Near-duplicate video retrieval: Current research and future trends. ACM Comput Surv. To appear.","DOI":"10.1145\/2501654.2501658"},{"volume-title":"Proceedings of the International Conference on Machine Learning. 1--8.","author":"Liu W.","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2009.08.002"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756008"},{"volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 3344--3351","author":"Mu Y.","key":"e_1_2_1_29_1"},{"volume-title":"Proceedings of the International Conference on Computer Vision Theory and Applications. 331--340","author":"Muja M.","key":"e_1_2_1_30_1"},{"volume-title":"Proceedings of the International Conference on Machine Learning. 353--360","author":"Norouzi M. E.","key":"e_1_2_1_31_1"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Olshausen B. A. and Field D. J. 1996. Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature 381 6583 607--609. Olshausen B. A. and Field D. J. 1996. Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature 381 6583 607--609.","DOI":"10.1038\/381607a0"},{"volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems. 1509--1517","author":"Raginsky M.","key":"e_1_2_1_33_1"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273592"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1873951.1874021"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2008.2009719"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2072298.2072354"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277832"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559905"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani R.","year":"1994","journal-title":"J. R. Statist. Soc. Series B"},{"volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 1--8.","author":"Torralba A.","key":"e_1_2_1_43_1"},{"volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 3424--3431","author":"Wang J.","key":"e_1_2_1_44_1"},{"volume-title":"Proceedings of the International Conference on Machine Learning. 1127--1134","author":"Wang J.","key":"e_1_2_1_45_1"},{"volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems. 1753--1760","author":"Weiss Y.","key":"e_1_2_1_46_1"},{"key":"e_1_2_1_47_1","first-page":"628","article-title":"Transductive classification via local learning regularization","volume":"2","author":"Wu M.","year":"2007","journal-title":"J. Mach. Learn. Res."},{"volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems. 1561--1568","author":"Zass R.","key":"e_1_2_1_48_1"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009950"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12275-0_51"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835455"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2090535"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457465.2457469","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2457465.2457469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:36Z","timestamp":1750234716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457465.2457469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["10.1145\/2457465.2457469"],"URL":"https:\/\/doi.org\/10.1145\/2457465.2457469","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"type":"print","value":"1046-8188"},{"type":"electronic","value":"1558-2868"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"2012-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}