The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Large-Scale Supervised Multimodal Hashing with Semantic Correlation Maximization
Open accessAbstract
Due to its low storage cost and fast query speed, hashing has been widely adopted for similarity search in multimedia data. In particular, more and more attentions have been payed to multimodal hashing for search in multimedia data with multiple modalities, such as images with tags. Typically, supervised information of semantic labels is also available for the data points in many real applications. Hence, many supervised multimodal hashing~(SMH) methods have been proposed to utilize such semantic labels to further improve the search accuracy. However, the training time complexity of most existing SMH methods is too high, which makes them unscalable to large-scale datasets. In this paper, a novel SMH method, called semantic correlation maximization~(SCM), is proposed to seamlessly integrate semantic labels into the hashing learning procedure for large-scale data modeling. Experimental results on two real-world datasets show that SCM can significantly outperform the state-of-the-art SMH methods, in terms of both accuracy and scalability.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Blei, D. M., Ng, A. Y., & Jordan, M. I. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0082 · Cited by 12,223
RELATIONS BETWEEN TWO SETS OF VARIATES
HOTELLING, H. (1936) · Biometrika · doi:10.1093/biomet/28.3-4.321 · Cited by 5,263
NUS-WIDE: a real-world web image database from National University of Singapore
Chua, T.-S., Tang, J., Hong, R., Li, H., Luo, Z., & Zheng, Y. (2009) · Proceedings of the ACM International Conference on Image and Video Retrieval · doi:10.1145/1646396.1646452 · Cited by 3,025 · cited 7×
“Figure 1 reports the MAP results on NUS-WIDE dataset by varying the size of training set.”
BackgroundInfluentialWeiss, Y., Torralba, A. B., & Fergus, R. (2008) · neural information processing systems · Cited by 2,767
Relations Between Two Sets of Variates
Hotelling, H. (1936) · Biometrika · doi:10.2307/2333955 · Cited by 1,645
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437 · cited 2×
“That is to say, most existing hashing methods are unimodal (Weiss, Torralba, and Fergus 2008; Andoni and Indyk 2008; Kulis and Darrell 2009; Lin, Ross, and Yagnik 2010; Wang, Kumar, and Chang 2010; Norouzi and Fleet 2011; Kong, Li, and Guo 2012; Heo et al. 2012; Liu et al. 2012a; Kong and Li 2012b; Norouzi, Fleet, and…”
BackgroundMethodSupervised 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
A new approach to cross-modal multimedia retrieval
Rasiwasia, N., Costa Pereira, J., Coviello, E., Doyle, G., Lanckriet, G. R. G., Levy, R., & Vasconcelos, N. (2010) · Proceedings of the 18th ACM international conference on Multimedia · doi:10.1145/1873951.1873987 · Cited by 1,334
Salakhutdinov, R., & Hinton, G. (2009) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2008.11.006 · Cited by 1,246 · cited 1×
“Recent years have witnessed the great success of hashing techniques for scalable similarity search in many real applications (Torralba, Fergus, and Weiss 2008; Salakhutdinov and Hinton 2009; Kong and Li 2012a; He et al. 2012; Tseng et al. 2012; Dean et al. 2013; Wang et al. 2013; Xu et al. 2013; Zhang et al. 2014).”
BackgroundIterative 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
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
Learning to Hash with Binary Reconstructive Embeddings
Kulis, B., & Darrell, T. (2009) · Cited by 806
Minimal Loss Hashing for Compact Binary Codes
Norouzi, M., & Blei, D. M. (2011) · International Conference on Machine Learning · Cited by 765
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
Generalized Multiview Analysis: A discriminative latent space
Sharma, A., Kumar, A., Daume, H., & Jacobs, D. W. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247923 · Cited by 714
Hamming Distance Metric Learning
Norouzi, M., Fleet, D. J., & Salakhutdinov, R. (2012) · neural information processing systems · Cited by 701
Inter-media hashing for large-scale retrieval from heterogeneous data sources
Song, J., Yang, Y., Yang, Y., Huang, Z., & Shen, H. T. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2465274 · Cited by 620
Learning Hash Functions for Cross-View Similarity Search
Kumar, S., & Udupa, R. (2012) · Cited by 614
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
A Multi-View Embedding Space for Modeling Internet Images, Tags, and Their Semantics
Gong, Y., Ke, Q., Isard, M., & Lazebnik, S. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-013-0658-4 · Cited by 540
Learning the semantics of words and pictures
Barnard, K., & Forsyth, D. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937654 · Cited by 524
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
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
Multiple 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 · cited 5×
“MSH is also called multiple feature hashing (Song et al. 2011) or composite hashing (Zhang, Wang, and Si 2011), which aims at learning better codes by leveraging auxiliary views than unimodal hashing.”
BackgroundMethodInfluentialSequential Projection Learning for Hashing with Compact Codes
Wang, J., Kumar, S., & Chang, S. (2010) · International Conference on Machine Learning · Cited by 307
Kong, W., & Li, W.-J. (2012) · neural information processing systems · Cited by 306
Self-citationFast, Accurate Detection of 100,000 Object Classes on a Single Machine
Dean, T., Ruzon, M. A., Segal, M., Shlens, J., Vijayanarasimhan, S., & Yagnik, J. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.237 · Cited by 305
Supervised hashing with latent factor models
Zhang, P., Zhang, W., Li, W.-J., & Guo, M. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609600 · Cited by 271
Self-citationComposite 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
Self-citationCo-Regularized Hashing for Multimodal Data
Zhen, Y., & Yeung, D. (2012) · neural information processing systems · Cited by 202
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
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
Wu, F. Q., Zhou, Y., Yang, Y., Tang, S., Zhang, Y., & Zhuang, Y. (2013) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2013.2291214 · Cited by 139
Learning the Relative Importance of Objects from Tagged Images for Retrieval and Cross-Modal Search
Hwang, S. J., & Grauman, K. L. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-011-0494-3 · Cited by 128
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 126
Rastegari, M., Choi, J., Fakhraei, S., Daumé, H., & Davis, L. S. (2013) · Seoul National University Open Repository (Seoul National University) · Cited by 115
Large-Margin Predictive Latent Subspace Learning for Multiview Data Analysis
Chen, N., Zhu, J., Sun, F., & Xing, E. P. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.64 · Cited by 113
Manhattan 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 110
Self-citationDouble-Bit Quantization for Hashing
Kong, W., & Li, W.-J. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8208 · Cited by 87
Self-citationCompact kernel hashing with multiple features
Liu, X., He, J., Liu, D., & Lang, B. (2012) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/2393347.2396337 · Cited by 78
The Power of Asymmetry in Binary HashingPreprint
Neyshabur, B., Yadollahpour, P., Makarychev, Y., Salakhutdinov, R., & Srebro, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.7662 · Cited by 77
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 74
Comparing apples to oranges: a scalable solution with heterogeneous hashing
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 62
Parametric local multimodal hashing for cross-view similarity search
Zhai, D., Chang, H., Zhen, Y., Liu, X., Chen, X., & Gao, W. (2013) · International Joint Conference on Artificial Intelligence · Cited by 56
Cited by
Multimodal Machine Learning: A Survey and Taxonomy
Baltrusaitis, T., Ahuja, C., & Morency, L.-P. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2798607 · Cited by 5,018
Jiang, Q.-Y., & Li, W.-J. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.348 · Cited by 880
Self-citationRGB-Infrared Cross-Modality Person Re-identification
Wu, A., Zheng, W.-S., Yu, H.-X., Gong, S., & Lai, J. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.575 · Cited by 862
Semantics-preserving hashing for cross-view retrieval
Lin, Z., Ding, G., Hu, M., & Wang, J. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299011 · Cited by 542
Self-Supervised Adversarial Hashing Networks for Cross-Modal Retrieval
Li, C., Deng, C., Li, N., Liu, W., Gao, X., & Tao, D. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00446 · Cited by 511
Metadata
- Authors
- Zhang, D., & Li, W.-J.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2014-06-21
- Volume
- 28
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2203543769
- Cited by
- 616
- References
- 45
- FWCI
- 18.74
- Type
- conference paper
- Language
- en
- Open access
- diamond
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.