{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T15:07:53Z","timestamp":1780931273993,"version":"3.54.1"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.patcog.2026.114028","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T06:53:18Z","timestamp":1779432798000},"page":"114028","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Task Memory Sinkhorn Neuralization under varying measure distributions"],"prefix":"10.1016","volume":"180","author":[{"given":"Yupeng","family":"Wei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0611-0636","authenticated-orcid":false,"given":"Xiaopeng","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuangxiu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3330-783X","authenticated-orcid":false,"given":"Wangmeng","family":"Zuo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaopeng","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2026.114028_b1","first-page":"1595","article-title":"Distribution matching for crowd counting","volume":"33","author":"Wang","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.114028_b2","series-title":"International Conference on Machine Learning","first-page":"214","article-title":"Wasserstein generative adversarial networks","author":"Arjovsky","year":"2017"},{"key":"10.1016\/j.patcog.2026.114028_b3","doi-asserted-by":"crossref","unstructured":"M. Shang, X. Hong, 2d gaussians spatial transport for point-supervised density regression, in: Proceedings of the AAAI Conference on Artificial Intelligence, AAAI, 2026.","DOI":"10.1609\/aaai.v40i11.37836"},{"key":"10.1016\/j.patcog.2026.114028_b4","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume":"26","author":"Cuturi","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.114028_b5","unstructured":"B. Amos, S. Cohen, G. Luise, I. Redko, Meta optimal transport, in: International Conference on Machine Learning, 2022."},{"key":"10.1016\/j.patcog.2026.114028_b6","series-title":"Advances in Neural Information Processing Systems","article-title":"Attention is all you need","author":"Vaswani","year":"2017"},{"key":"10.1016\/j.patcog.2026.114028_b7","series-title":"International Conference on Machine Learning","first-page":"146","article-title":"Input convex neural networks","author":"Amos","year":"2017"},{"issue":"3","key":"10.1016\/j.patcog.2026.114028_b8","doi-asserted-by":"crossref","first-page":"A1443","DOI":"10.1137\/16M1106018","article-title":"Stabilized sparse scaling algorithms for entropy regularized transport problems","volume":"41","author":"Schmitzer","year":"2019","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"10.1016\/j.patcog.2026.114028_b9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2766963","article-title":"Convolutional wasserstein distances: Efficient optimal transportation on geometric domains","volume":"34","author":"Solomon","year":"2015","journal-title":"ACM Trans. Graph. (ToG)"},{"key":"10.1016\/j.patcog.2026.114028_b10","series-title":"Low-rank optimal transport: Approximation, statistics and debiasing","first-page":"6802","volume":"Vol. 35","author":"Scetbon","year":"2022"},{"key":"10.1016\/j.patcog.2026.114028_b11","series-title":"International Conference on Machine Learning","article-title":"Low-rank sinkhorn factorization","author":"Scetbon","year":"2021"},{"key":"10.1016\/j.patcog.2026.114028_b12","series-title":"International Conference on Artificial Intelligence and Statistics","first-page":"8682","article-title":"Rethinking initialization of the sinkhorn algorithm","author":"Thornton","year":"2023"},{"key":"10.1016\/j.patcog.2026.114028_b13","unstructured":"J. Geuter, G. Kornhardt, I. Tomasson, V. Laschos, Universal neural optimal transport, in: Forty-Second International Conference on Machine Learning, 2025."},{"issue":"1","key":"10.1016\/j.patcog.2026.114028_b14","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MSP.2024.3358284","article-title":"An introduction to bilevel optimization: Foundations and applications in signal processing and machine learning","volume":"41","author":"Zhang","year":"2024","journal-title":"IEEE Signal Process. Mag."},{"key":"10.1016\/j.patcog.2026.114028_b15","series-title":"Advances in Neural Information Processing Systems","first-page":"2053","article-title":"Learning with a wasserstein loss","author":"Frogner","year":"2015"},{"issue":"5","key":"10.1016\/j.patcog.2026.114028_b16","first-page":"5632","article-title":"Deepemd: Differentiable earth mover\u2019s distance for few-shot learning","volume":"45","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.114028_b17","doi-asserted-by":"crossref","unstructured":"M. Eisenberger, A. Toker, L. Leal-Taix\u00e9, F. Bernard, D. Cremers, A unified framework for implicit sinkhorn differentiation, in: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, 2022, pp. 509\u2013518.","DOI":"10.1109\/CVPR52688.2022.00059"},{"key":"10.1016\/j.patcog.2026.114028_b18","series-title":"Neural optimal transport","author":"Korotin","year":"2022"},{"key":"10.1016\/j.patcog.2026.114028_b19","unstructured":"B. Amos, On amortizing convex conjugates for optimal transport, in: The Eleventh International Conference on Learning Representations, 2022."},{"key":"10.1016\/j.patcog.2026.114028_b20","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.patcog.2015.09.019","article-title":"A continuous linear optimal transport approach for pattern analysis in image datasets","volume":"51","author":"Kolouri","year":"2016","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.114028_b21","unstructured":"M. Cuturi G. Peyr\u00e9, et al., Computational Optimal Transport, Center for Research in Economics and Statistics Working Papers (2017-86), 2017."},{"issue":"314","key":"10.1016\/j.patcog.2026.114028_b22","doi-asserted-by":"crossref","first-page":"2563","DOI":"10.1090\/mcom\/3303","article-title":"Scaling algorithms for unbalanced optimal transport problems","volume":"87","author":"Chizat","year":"2018","journal-title":"Math. Comp."},{"key":"10.1016\/j.patcog.2026.114028_b23","series-title":"The Theory of Max\u2013Min and Its Application to Weapons Allocation Problems","author":"Danskin","year":"2012"},{"key":"10.1016\/j.patcog.2026.114028_b24","series-title":"Advances in Neural Information Processing Systems","article-title":"Wasserstein distance rivals kullback-leibler divergence for knowledge distillation","author":"Lv","year":"2024"},{"key":"10.1016\/j.patcog.2026.114028_b25","doi-asserted-by":"crossref","unstructured":"J. Wan, Z. Liu, A.B. Chan, A generalized loss function for crowd counting and localization, in: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, 2021, pp. 1974\u20131983.","DOI":"10.1109\/CVPR46437.2021.00201"},{"issue":"2","key":"10.1016\/j.patcog.2026.114028_b26","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/2812802","article-title":"Yfcc100m: The new data in multimedia research","volume":"59","author":"Thomee","year":"2016","journal-title":"Commun. ACM"},{"key":"10.1016\/j.patcog.2026.114028_b27","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1162\/tacl_a_00051","article-title":"Enriching word vectors with subword information","volume":"5","author":"Bojanowski","year":"2017","journal-title":"Trans. Assoc. Comput. Linguist."},{"key":"10.1016\/j.patcog.2026.114028_b28","doi-asserted-by":"crossref","unstructured":"H. Lin, X. Hong, Z. Ma, X. Wei, Y. Qiu, Y. Wang, Y. Gong, Direct measure matching for crowd counting, in: 30th International Joint Conference on Artificial Intelligence (IJCAI 2021), 2021.","DOI":"10.24963\/ijcai.2021\/116"},{"issue":"5","key":"10.1016\/j.patcog.2026.114028_b29","doi-asserted-by":"crossref","first-page":"9112","DOI":"10.1109\/TNNLS.2024.3435854","article-title":"Multidimensional measure matching for crowd counting","volume":"36","author":"Lin","year":"2025","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"5","key":"10.1016\/j.patcog.2026.114028_b30","doi-asserted-by":"crossref","first-page":"3625","DOI":"10.1109\/TPAMI.2025.3532512","article-title":"Semi-supervised counting via pixel-by-pixel density distribution modeling","volume":"47","author":"Lin","year":"2025","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.114028_b31","doi-asserted-by":"crossref","unstructured":"H. Idrees, M. Tayyab, K. Athrey, D. Zhang, S. Al-Maadeed, N. Rajpoot, M. Shah, Composition loss for counting, density map estimation and localization in dense crowds, in: Proceedings of the European Conference on Computer Vision, ECCV, 2018, pp. 532\u2013546.","DOI":"10.1007\/978-3-030-01216-8_33"},{"key":"10.1016\/j.patcog.2026.114028_b32","doi-asserted-by":"crossref","unstructured":"I. Chalkidis, E. Fergadiotis, P. Malakasiotis, I. Androutsopoulos, Large-scale multi-label text classification on eu legislation, in: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, 2019, pp. 6314\u20136322.","DOI":"10.18653\/v1\/P19-1636"},{"key":"10.1016\/j.patcog.2026.114028_b33","series-title":"Optimal transport tools (ott): A jax toolbox for all things wasserstein","author":"Cuturi","year":"2022"},{"key":"10.1016\/j.patcog.2026.114028_b34","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1214\/aoms\/1177730491","article-title":"On a test of whether one of two random variables is stochastically larger than the other","author":"Mann","year":"1947","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.patcog.2026.114028_b35","article-title":"Joint distribution optimal transportation for domain adaptation","volume":"30","author":"Courty","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.114028_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2021.107945","article-title":"2D wasserstein loss for robust facial landmark detection","volume":"116","author":"Yan","year":"2021","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.114028_b37","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2024.110656","article-title":"Dual feature disentanglement for face anti-spoofing","volume":"155","author":"Ma","year":"2024","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.114028_b38","article-title":"Generalized ordered wasserstein distance for sequential data","author":"Doan","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.114028_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2024.110971","article-title":"Semantic-constraint matching for transformer-based weakly supervised object localization","volume":"158","author":"Cao","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.114028_b40","doi-asserted-by":"crossref","unstructured":"Z. Ge, S. Liu, Z. Li, O. Yoshie, J. Sun, Ota: Optimal transport assignment for object detection, in: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, 2021, pp. 303\u2013312.","DOI":"10.1109\/CVPR46437.2021.00037"},{"key":"10.1016\/j.patcog.2026.114028_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2023.110147","article-title":"From patch, sample to domain: Capture geometric structures for few-shot learning","volume":"148","author":"Li","year":"2024","journal-title":"Pattern Recognit."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326009933?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326009933?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T14:56:12Z","timestamp":1780930572000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320326009933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":41,"alternative-id":["S0031320326009933"],"URL":"https:\/\/doi.org\/10.1016\/j.patcog.2026.114028","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Task Memory Sinkhorn Neuralization under varying measure distributions","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patcog.2026.114028","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"114028"}}