{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T08:48:11Z","timestamp":1776415691255,"version":"3.51.2"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T00:00:00Z","timestamp":1672012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T00:00:00Z","timestamp":1672012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872170, 62076052, 61873117"],"award-info":[{"award-number":["61872170, 62076052, 61873117"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102186"],"award-info":[{"award-number":["62102186"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20200725"],"award-info":[{"award-number":["BK20200725"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently, matrix factorization-based hashing has gained wide attention because of its strong subspace learning ability and high search efficiency. However, some problems need to be further addressed. First, uniform hash codes can be generated by collective matrix factorization, but they often cause serious loss, degrading the quality of hash codes. Second, most of them preserve the absolute similarity simply in hash codes, failing to capture the inherent semantic affinity among training data. To overcome these obstacles, we propose a Discrete Multi-similarity Consistent Matrix Factorization Hashing (DMCMFH). Specifically, an individual subspace is first learned by matrix factorization and multi-similarity consistency for each modality. Then, the subspaces are aligned by a shared semantic space to generate homogenous hash codes. Finally, an iterative-based discrete optimization scheme is presented to reduce the quantization loss. We conduct quantitative experiments on three datasets, MSCOCO, Mirflickr25K and NUS-WIDE. Compared with supervised baseline methods, DMCMFH achieves increases of <jats:inline-formula><jats:alternatives><jats:tex-math>$$0.22\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>0.22<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$3.00\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>3.00<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$0.79\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>0.79<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on the image-query-text tasks for three datasets respectively, and achieves increases of <jats:inline-formula><jats:alternatives><jats:tex-math>$$0.21\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>0.21<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$1.62\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>1.62<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$0.50\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>0.50<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on the text-query-image tasks for three datasets respectively.<\/jats:p>","DOI":"10.1007\/s40747-022-00950-z","type":"journal-article","created":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T14:06:42Z","timestamp":1672063602000},"page":"4195-4212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Discrete matrix factorization cross-modal hashing with multi-similarity consistency"],"prefix":"10.1007","volume":"9","author":[{"given":"Yiru","family":"Li","sequence":"first","affiliation":[]},{"given":"Peiwen","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shouyong","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,26]]},"reference":[{"issue":"10","key":"950_CR1","doi-asserted-by":"publisher","first-page":"3351","DOI":"10.1109\/TKDE.2020.2970050","volume":"33","author":"HT Shen","year":"2020","unstructured":"Shen HT, Liu L, Yang Y et al (2020) Exploiting subspace relation in semantic labels for cross-modal hashing[J]. IEEE Trans Knowl Data Eng 33(10):3351\u20133365","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"950_CR2","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TIP.2018.2890144","volume":"28","author":"M Hu","year":"2018","unstructured":"Hu M, Yang Y, Shen F et al (2018) Collective reconstructive embeddings for cross-modal hashing[J]. IEEE Trans Image Process 28(6):2770\u20132784","journal-title":"IEEE Trans Image Process"},{"key":"950_CR3","doi-asserted-by":"publisher","first-page":"4667","DOI":"10.1109\/TIP.2021.3073867","volume":"30","author":"Y Hu","year":"2021","unstructured":"Hu Y, Liu M, Su X et al (2021) Video moment localization via deep cross-modal hashing[J]. IEEE Trans Image Process 30:4667\u20134677","journal-title":"IEEE Trans Image Process"},{"key":"950_CR4","unstructured":"Wang Y , Chen Z D , Luo X , et al. Fast Cross-Modal Hashing With Global and Local Similarity Embedding[J]. IEEE Transactions on Cybernetics, 2021, PP(99):1-14"},{"key":"950_CR5","doi-asserted-by":"crossref","unstructured":"Liu X, Nie X, Zeng W, et al. Fast discrete cross-modal hashing with regressing from semantic labels[C].Proceedings of the 26th ACM international conference on Multimedia. 2018: 1662-1669","DOI":"10.1145\/3240508.3240683"},{"key":"950_CR6","doi-asserted-by":"crossref","unstructured":"Zou X, Wang X, Bakker EM et al (2021) Multi-label semantics preserving based deep cross-modal hashing[J]. Signal Processing: Image Communication 93:116131","DOI":"10.1016\/j.image.2020.116131"},{"key":"950_CR7","doi-asserted-by":"crossref","unstructured":"Zhan YW, Wang Y, Sun Y et al (2022) Discrete online cross-modal hashing[J]. Pattern Recognition 122:108262","DOI":"10.1016\/j.patcog.2021.108262"},{"issue":"5","key":"950_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.3390\/w14050707","volume":"14","author":"S Gadamsetty","year":"2022","unstructured":"Gadamsetty S, Ch R, Ch A et al (2022) Hash-based deep learning approach for remote sensing satellite imagery detection[J]. Water 14(5):707","journal-title":"Water"},{"key":"950_CR9","doi-asserted-by":"crossref","unstructured":"Shen Y, Gadekallu T R. Resource Search Method of Mobile Intelligent Education System Based on Distributed Hash Table[J]. Mobile Networks and Applications, 2022: 1-10","DOI":"10.1007\/s11036-022-01940-8"},{"key":"950_CR10","doi-asserted-by":"crossref","unstructured":"Wang W, Xu H, Alazab M, et al. Blockchain-based reliable and efficient certificateless signature for IIoT devices[J]. IEEE transactions on industrial informatics, 2021","DOI":"10.1109\/TII.2021.3084753"},{"key":"950_CR11","doi-asserted-by":"crossref","unstructured":"Deebak B D, Memon F H, Dev K, et al. TAB-SAPP: a trust-aware blockchain-based seamless authentication for massive IoT-enabled industrial applications[J]. IEEE Transactions on Industrial Informatics, 2022","DOI":"10.1109\/TII.2022.3159164"},{"key":"950_CR12","doi-asserted-by":"crossref","unstructured":"Deebak B D, Memon F H, Khowaja S A, et al. Lightweight blockchain based remote mutual authentication for AI-empowered IoT sustainable computing systems[J]. IEEE Internet of Things Journal, 2022","DOI":"10.1109\/JIOT.2022.3152546"},{"key":"950_CR13","doi-asserted-by":"crossref","unstructured":"Hu H, Xie L, Hong R, et al. Creating something from nothing: Unsupervised knowledge distillation for cross-modal hashing[C].Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition. 2020: 3123-3132","DOI":"10.1109\/CVPR42600.2020.00319"},{"key":"950_CR14","doi-asserted-by":"crossref","unstructured":"Fang Y, Li B, Li X et al (2021) Unsupervised cross-modal similarity via latent structure discrete hashing factorization[J]. Knowledge-Based Systems 218:106857","DOI":"10.1016\/j.knosys.2021.106857"},{"key":"950_CR15","doi-asserted-by":"crossref","unstructured":"Luo X, Yin X Y, Nie L, et al. SDMCH: supervised discrete manifold-embedded cross-modal hashing[C].Proceedings of the 27th International Joint Conference on Artificial Intelligence. 2018: 2518-2524","DOI":"10.24963\/ijcai.2018\/349"},{"issue":"3","key":"950_CR16","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1007\/s10489-020-01930-x","volume":"51","author":"H Liu","year":"2021","unstructured":"Liu H, Feng Y, Zhou M et al (2021) Semantic ranking structure preserving for cross-modal retrieval[J]. Appl Intell 51(3):1802\u20131812","journal-title":"Appl Intell"},{"key":"950_CR17","doi-asserted-by":"crossref","unstructured":"Fang Y, Ren Y, Park JH (2020) Semantic-enhanced discrete matrix factorization hashing for heterogeneous modal matching[J]. Knowledge-Based Systems 192:105381","DOI":"10.1016\/j.knosys.2019.105381"},{"key":"950_CR18","doi-asserted-by":"crossref","unstructured":"Fang Y, Ren Y (2020) Supervised discrete cross-modal hashing based on kernel discriminant analysis[J]. Pattern Recognition 98:107062","DOI":"10.1016\/j.patcog.2019.107062"},{"key":"950_CR19","doi-asserted-by":"crossref","unstructured":"Li C X, Chen Z D, Zhang P F, et al. SCRATCH: A scalable discrete matrix factorization hashing for cross-modal retrieval[C].Proceedings of the 26th ACM international conference on Multimedia. 2018: 1-9","DOI":"10.1145\/3240508.3240547"},{"issue":"3","key":"950_CR20","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/TPAMI.2019.2940446","volume":"43","author":"X Liu","year":"2021","unstructured":"Liu X, Hu Z, Ling H et al (2021) MTFH: A Matrix Tri-Factorization Hashing Framework for Efficient Cross-Modal Retrieval[J]. IEEE Trans Pattern Anal Mach Intell 43(3):964\u2013981","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"950_CR21","doi-asserted-by":"crossref","unstructured":"Ding G, Guo Y, Zhou J. Collective matrix factorization hashing for multimodal data[C].Proceedings of the IEEE conference on computer vision and pattern recognition. 2014: 2075-2082","DOI":"10.1109\/CVPR.2014.267"},{"key":"950_CR22","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.neucom.2019.12.086","volume":"385","author":"T Yao","year":"2020","unstructured":"Yao T, Han Y, Wang R et al (2020) Efficient discrete supervised hashing for large-scale cross-modal retrieval[J]. Neurocomputing 385:358\u2013367","journal-title":"Neurocomputing"},{"key":"950_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2021.3107489","volume":"01","author":"T Yao","year":"2021","unstructured":"Yao T, Li Y, Guan W et al (2021) Discrete Robust Matrix Factorization Hashing for Large-scale Cross-media Retrieval[J]. IEEE Transactions on Knowledge & Data Engineering 01:1\u20131","journal-title":"IEEE Transactions on Knowledge & Data Engineering"},{"key":"950_CR24","doi-asserted-by":"crossref","unstructured":"Zou X, Wu S, Zhang N et al (2022) Multi-label modality enhanced attention based self-supervised deep cross-modal hashing[J]. Knowledge-Based Systems 239:107927","DOI":"10.1016\/j.knosys.2021.107927"},{"issue":"12","key":"950_CR25","doi-asserted-by":"publisher","first-page":"4896","DOI":"10.1109\/TCYB.2019.2912644","volume":"50","author":"T Yao","year":"2019","unstructured":"Yao T, Kong X, Fu H et al (2019) Discrete semantic alignment hashing for cross-media retrieval[J]. IEEE transactions on cybernetics 50(12):4896\u20134907","journal-title":"IEEE transactions on cybernetics"},{"key":"950_CR26","unstructured":"Liu H, Ji R, Wu Y, et al. Supervised matrix factorization for cross-modality hashing[C].Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. 2016: 1767-1773"},{"key":"950_CR27","doi-asserted-by":"crossref","unstructured":"Wang D, Wang Q, He L et al (2020) Joint and individual matrix factorization hashing for large-scale cross-modal retrieval[J]. Pattern Recognition 107:107479","DOI":"10.1016\/j.patcog.2020.107479"},{"key":"950_CR28","doi-asserted-by":"crossref","unstructured":"Wang D, Wang Q, An Y, et al. Online collective matrix factorization hashing for large-scale cross-media retrieval[C].Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval. 2020: 1409-1418","DOI":"10.1145\/3397271.3401132"},{"key":"950_CR29","doi-asserted-by":"crossref","unstructured":"Su S, Zhong Z, Zhang C. Deep joint-semantics reconstructing hashing for large-scale unsupervised cross-modal retrieval[C].Proceedings of the IEEE\/CVF international conference on computer vision. 2019: 3027-3035","DOI":"10.1109\/ICCV.2019.00312"},{"key":"950_CR30","doi-asserted-by":"crossref","unstructured":"Zhang D, Li W J. Large-scale supervised multimodal hashing with semantic correlation maximization[C].Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence. 2014: 2177-2183","DOI":"10.1609\/aaai.v28i1.8995"},{"issue":"10","key":"950_CR31","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1109\/TPAMI.2018.2861000","volume":"41","author":"D Wang","year":"2018","unstructured":"Wang D, Gao X, Wang X et al (2018) Label consistent matrix factorization hashing for large-scale cross-modal similarity search[J]. IEEE Trans Pattern Anal Mach Intell 41(10):2466\u20132479","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"11","key":"950_CR32","doi-asserted-by":"publisher","first-page":"3507","DOI":"10.1109\/TKDE.2020.2974825","volume":"33","author":"Y Wang","year":"2020","unstructured":"Wang Y, Luo X, Nie L et al (2020) BATCH: A scalable asymmetric discrete cross-modal hashing[J]. IEEE Trans Knowl Data Eng 33(11):3507\u20133519","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"950_CR33","doi-asserted-by":"crossref","unstructured":"Yang Z, Yang L, Raymond OI et al (2021) NSDH: A Nonlinear Supervised Discrete Hashing framework for large-scale cross-modal retrieval[J]. Knowledge-Based Systems 217:106818","DOI":"10.1016\/j.knosys.2021.106818"},{"key":"950_CR34","doi-asserted-by":"crossref","unstructured":"Deng C, Yang E, Liu T et al (2019) Two-stream deep hashing with class-specific centers for supervised image search[J]. IEEE transactions on neural networks and learning systems 31(6):2189\u20132201","DOI":"10.1109\/TNNLS.2019.2929068"},{"key":"950_CR35","doi-asserted-by":"crossref","unstructured":"Tang C, Zhu X, Liu X, et al. Cross-view local structure preserved diversity and consensus learning for multi-view unsupervised feature selection[C].Proceedings of the AAAI Conference on artificial intelligence. 2019, 33(01): 5101-5108","DOI":"10.1609\/aaai.v33i01.33015101"},{"key":"950_CR36","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1109\/TIP.2019.2940693","volume":"29","author":"H Cui","year":"2019","unstructured":"Cui H, Zhu L, Li J et al (2019) Scalable deep hashing for large-scale social image retrieval[J]. IEEE Trans Image Process 29:1271\u20131284","journal-title":"IEEE Trans Image Process"},{"key":"950_CR37","doi-asserted-by":"crossref","unstructured":"Jiang Q Y, Li W J. Deep cross-modal hashing[C].Proceedings of the IEEE conference on computer vision and pattern recognition. 2017: 3232-3240","DOI":"10.1109\/CVPR.2017.348"},{"key":"950_CR38","doi-asserted-by":"crossref","unstructured":"Zhu L, Song J, Yang Z, et al. DAP$$^2$$CMH: Deep Adversarial Privacy-Preserving Cross-Modal Hashing[J]. Neural Processing Letters, 2021: 1-21","DOI":"10.1007\/s11063-021-10447-4"},{"key":"950_CR39","doi-asserted-by":"crossref","unstructured":"Yu E, Ma J, Sun J et al (2022) Deep Discrete Cross-Modal Hashing with Multiple Supervision[J]. Neurocomputing 486:215\u2013224","DOI":"10.1016\/j.neucom.2021.11.035"},{"key":"950_CR40","doi-asserted-by":"crossref","unstructured":"Li M, Li Q, Ma Y et al (2022) Semantic-guided autoencoder adversarial hashing for large-scale cross-modal retrieval[J]. Complex & Intelligent Systems 8(2):1603\u20131617","DOI":"10.1007\/s40747-021-00615-3"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00950-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00950-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00950-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T13:21:53Z","timestamp":1690464113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00950-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,26]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["950"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00950-z","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,26]]},"assertion":[{"value":"29 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}