{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T05:07:58Z","timestamp":1774674478845,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"CONACYT"},{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/S026045\/1"],"award-info":[{"award-number":["EP\/S026045\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/S026045\/1"],"award-info":[{"award-number":["EP\/S026045\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100017146","name":"Faraday Institution","doi-asserted-by":"publisher","award":["P\/T007745\/1"],"award-info":[{"award-number":["P\/T007745\/1"]}],"id":[{"id":"10.13039\/100017146","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["ECF-2019-478"],"award-info":[{"award-number":["ECF-2019-478"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Stochastic Primal-Dual Hybrid Gradient (SPDHG) is an algorithm proposed by Chambolle et al. (SIAM J Optim 28:2783\u20132808) to efficiently solve a wide class of nonsmooth large-scale optimization problems. Alacaoglu et al. (SIAM J Optim 32:1288\u20131318, 2022) filled an important gap and proved its almost sure convergence for serial sampling. In this paper, we study the performance of SPDHG with arbitrary sampling (not necessarily serial sampling) and its applications to parallel magnetic resonance imaging (MRI), where data from different coils are randomly selected at each iteration. In order to do this, we extend the convergence result of Alacaoglu et al. and prove the almost sure convergence of SPDHG for any arbitrary sampling. We then apply SPDHG on real MRI data using a wide range of random sampling methods and compare its performance across a range of settings, including mini-batch size and step size parameters. We show that the sampling can significantly affect the convergence speed of SPDHG and that for many cases an optimal sampling can be identified.\n<\/jats:p>","DOI":"10.1007\/s10851-025-01231-3","type":"journal-article","created":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T03:41:17Z","timestamp":1744861277000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Randomized Primal-Dual Algorithm with Arbitrary Sampling: Convergence Theory and Applications to Parallel MRI"],"prefix":"10.1007","volume":"67","author":[{"given":"Eric B.","family":"Gutierrez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claire","family":"Delplancke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias J.","family":"Ehrhardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"1231_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492918000016","volume":"27","author":"M Benning","year":"2018","unstructured":"Benning, M., Burger, M.: Modern regularization methods for inverse problems. Acta Numer. 27, 1\u2013111 (2018)","journal-title":"Acta Numer."},{"key":"1231_CR2","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I.M., Vapnik, V.N.: A training algorithm for optimal margin classifiers. In: Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pp. 144\u2013152 (1992)","DOI":"10.1145\/130385.130401"},{"issue":"5","key":"1231_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MSP.2014.2329397","volume":"31","author":"V Cevher","year":"2014","unstructured":"Cevher, V., Becker, S., Schmidt, M.: Convex optimization for big data: scalable, randomized, and parallel algorithms for big data analytics. IEEE Signal Process. Mag. 31(5), 32\u201343 (2014)","journal-title":"IEEE Signal Process. Mag."},{"key":"1231_CR4","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14, 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1231_CR5","first-page":"2939","volume":"18","author":"Y Zhang","year":"2017","unstructured":"Zhang, Y., Xiao, L.: Stochastic primal-dual coordinate method for regularized empirical risk minimization. J. Mach. Learn. Res. 18(1), 2939\u20132980 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"1231_CR6","unstructured":"Fercoq, O., Alacaoglu, A., Necoara, I., Cevher, V.: Almost surely constrained convex optimization. In: International Conference on Machine Learning, pp. 1910\u20131919 (2019). PMLR"},{"issue":"1","key":"1231_CR7","first-page":"7204","volume":"18","author":"A Patrascu","year":"2017","unstructured":"Patrascu, A., Necoara, I.: Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization. J. Mach. Learn. Res. 18(1), 7204\u20137245 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20134","key":"1231_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D 60(1\u20134), 259\u2013268 (1992)","journal-title":"Physica D"},{"key":"1231_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numer. 25, 161\u2013319 (2016)","journal-title":"Acta Numer."},{"issue":"22","key":"1231_CR10","doi-asserted-by":"publisher","first-page":"225019","DOI":"10.1088\/1361-6560\/ab3d07","volume":"64","author":"MJ Ehrhardt","year":"2019","unstructured":"Ehrhardt, M.J., Markiewicz, P., Sch\u00f6nlieb, C.-B.: Faster PET reconstruction with non-smooth priors by randomization and preconditioning. Phys. Med. Biol. 64(22), 225019 (2019)","journal-title":"Phys. Med. Biol."},{"issue":"1","key":"1231_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MSP.2019.2943645","volume":"37","author":"JA Fessler","year":"2020","unstructured":"Fessler, J.A.: Optimization methods for magnetic resonance image reconstruction: key models and optimization algorithms. IEEE Signal Process. Mag. 37(1), 33\u201340 (2020)","journal-title":"IEEE Signal Process. Mag."},{"issue":"2","key":"1231_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s40305-015-0078-y","volume":"3","author":"W Hager","year":"2015","unstructured":"Hager, W., Ngo, C., Yashtini, M., Zhang, H.-C.: An alternating direction approximate newton algorithm for ill-conditioned inverse problems with application to parallel MRI. J. Oper. Res. Soc. China 3(2), 139\u2013162 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"3","key":"1231_CR13","first-page":"288","volume":"19","author":"KP Pruessmann","year":"2006","unstructured":"Pruessmann, K.P.: Encoding and reconstruction in parallel MRI. NMR Biomed. Int. J. Devot. Dev. Appl. Magn. Reson. Vivo 19(3), 288\u2013299 (2006)","journal-title":"NMR Biomed. Int. J. Devot. Dev. Appl. Magn. Reson. Vivo"},{"issue":"1","key":"1231_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vision 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vision"},{"issue":"4","key":"1231_CR15","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E Esser","year":"2010","unstructured":"Esser, E., Zhang, X., Chan, T.F.: A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science. SIAM J. Imaging Sci. 3(4), 1015\u20131046 (2010)","journal-title":"SIAM J. Imaging Sci."},{"key":"1231_CR16","doi-asserted-by":"crossref","unstructured":"Pock, T., Cremers, D., Bischof, H., Chambolle, A.: A algorithm for minimizing the Mumford-Shah functional. In: 2009 IEEE 12th International Conference on Computer Vision, pp. 1133\u20131140 (2009)","DOI":"10.1109\/ICCV.2009.5459348"},{"issue":"1","key":"1231_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-018-1321-1","volume":"179","author":"D O\u2019Connor","year":"2020","unstructured":"O\u2019Connor, D., Vandenberghe, L.: On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting. Math. Program. 179(1), 85\u2013108 (2020)","journal-title":"Math. Program."},{"key":"1231_CR18","doi-asserted-by":"publisher","first-page":"776825","DOI":"10.3389\/frsip.2021.776825","volume":"1","author":"L Condat","year":"2022","unstructured":"Condat, L., Malinovsky, G., Richt\u00e1rik, P.: Distributed proximal splitting algorithms with rates and acceleration. Front. Signal Process. 1, 776825 (2022)","journal-title":"Front. Signal Process."},{"key":"1231_CR19","unstructured":"Condat, L., Richt\u00e1rik, P.: Randprox: Primal-dual optimization algorithms with randomized proximal updates. arXiv preprint arXiv:2207.12891 (2022)"},{"issue":"4","key":"1231_CR20","doi-asserted-by":"publisher","first-page":"2783","DOI":"10.1137\/17M1134834","volume":"28","author":"A Chambolle","year":"2018","unstructured":"Chambolle, A., Ehrhardt, M.J., Richt\u00e1rik, P., Sch\u00c3nlieb, C.-B.: Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications. SIAM J. Optim. 28(4), 2783\u20132808 (2018)","journal-title":"SIAM J. Optim."},{"key":"1231_CR21","first-page":"1","volume":"63","author":"A Chambolle","year":"2024","unstructured":"Chambolle, A., Delplancke, C., Ehrhardt, M.J., Sch\u00f6nlieb, C.-B., Tang, J.: Stochastic primal-dual hybrid gradient algorithm with adaptive step sizes. J. Math. Imaging Vision 63, 1\u201320 (2024)","journal-title":"J. Math. Imaging Vision"},{"key":"1231_CR22","doi-asserted-by":"publisher","first-page":"155020","DOI":"10.1088\/1361-6560\/ac71f1","volume":"67","author":"G Schramm","year":"2022","unstructured":"Schramm, G., Holler, M.: Fast and memory-efficient reconstruction of sparse poisson data in listmode with non-smooth priors with application to time-of-flight PET. Phys. Med. Biol. 67, 155020 (2022)","journal-title":"Phys. Med. Biol."},{"issue":"1","key":"1231_CR23","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/18M1168480","volume":"29","author":"O Fercoq","year":"2019","unstructured":"Fercoq, O., Bianchi, P.: A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions. SIAM J. Optim. 29(1), 100\u2013134 (2019)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1231_CR24","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s40305-018-0232-4","volume":"7","author":"X Gao","year":"2019","unstructured":"Gao, X., Xu, Y.-Y., Zhang, S.-Z.: Randomized primal-dual proximal block coordinate updates. J. Oper. Res. Soc. China 7(2), 205\u2013250 (2019)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"10","key":"1231_CR25","doi-asserted-by":"publisher","first-page":"4050","DOI":"10.1109\/TAC.2019.2906924","volume":"64","author":"P Latafat","year":"2019","unstructured":"Latafat, P., Freris, N.M., Patrinos, P.: A new randomized block-coordinate primal-dual proximal algorithm for distributed optimization. IEEE Trans. Autom. Control 64(10), 4050\u20134065 (2019)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1231_CR26","unstructured":"Pedregosa, F., Fatras, K., Casotto, M.: Proximal splitting meets variance reduction. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 1\u201310 (2019). PMLR"},{"issue":"1","key":"1231_CR27","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s10957-022-02061-8","volume":"195","author":"A Salim","year":"2022","unstructured":"Salim, A., Condat, L., Mishchenko, K., Richt\u00e1rik, P.: Dualize, split, randomize: toward fast nonsmooth optimization algorithms. J. Optim. Theory Appl. 195(1), 102\u2013130 (2022)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1231_CR28","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1137\/19M1296252","volume":"32","author":"A Alacaoglu","year":"2022","unstructured":"Alacaoglu, A., Fercoq, O., Cevher, V.: On the convergence of stochastic primal-dual hybrid gradient. SIAM J. Optim. 32(2), 1288\u20131318 (2022)","journal-title":"SIAM J. Optim."},{"key":"1231_CR29","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez, E.B., Delplancke, C., Ehrhardt, M.J.: Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI. In: International Conference on Scale Space and Variational Methods in Computer Vision, pp. 254\u2013266 (2021). Springer","DOI":"10.1007\/978-3-030-75549-2_21"},{"key":"1231_CR30","doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A.: Diagonal preconditioning for first order primal-dual algorithms in convex optimization. In: 2011 International Conference on Computer Vision, pp. 1762\u20131769 (2011). IEEE","DOI":"10.1109\/ICCV.2011.6126441"},{"key":"1231_CR31","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in hilbert spaces. In: CMS Books in Mathematics, Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-48311-5"},{"issue":"2","key":"1231_CR32","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158(2), 460\u2013479 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1231_CR33","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/20M1379344","volume":"65","author":"L Condat","year":"2023","unstructured":"Condat, L., Kitahara, D., Contreras, A., Hirabayashi, A.: Proximal splitting algorithms for convex optimization: a tour of recent advances, with new twists. SIAM Rev. 65(2), 375\u2013435 (2023)","journal-title":"SIAM Rev."},{"key":"1231_CR34","unstructured":"Banert, S., Upadhyaya, M., Giselsson, P.: The Chambolle\u2013Pock method converges weakly with $$\\theta > 1\/2$$ and $$\\tau \\sigma \\Vert {L}\\Vert ^{2} < 4\/(1+ 2\\theta ) $$. arXiv preprint arXiv:2309.03998 (2023)"},{"issue":"3","key":"1231_CR35","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s10915-023-02105-9","volume":"94","author":"Y Ma","year":"2023","unstructured":"Ma, Y., Cai, X., Jiang, B., Han, D.: Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM. J. Sci. Comput. 94(3), 60 (2023)","journal-title":"J. Sci. Comput."},{"key":"1231_CR36","doi-asserted-by":"crossref","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non negative almost supermartingales and some applications. In: Optimizing Methods in Statistics, pp. 233\u2013257. Elsevier, (1971)","DOI":"10.1016\/B978-0-12-604550-5.50015-8"},{"issue":"2","key":"1231_CR37","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1137\/140971233","volume":"25","author":"PL Combettes","year":"2015","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic quasi-Fej\u00e9r block-coordinate fixed point iterations. SIAM J. Optim. 25(2), 1221\u20131248 (2015)","journal-title":"SIAM J. Optim."},{"key":"1231_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01458-2","volume-title":"Mathematical Image Processing","author":"K Bredies","year":"2018","unstructured":"Bredies, K., Lorenz, D.: Mathematical Image Processing. Springer, Berlin (2018)"},{"key":"1231_CR39","unstructured":"Qu, Z., Richt\u00e1rik, P., Zhang, T.: Quartz: randomized dual coordinate ascent with arbitrary sampling. Adv. Neural Inf. Process. Syst. 28 (2015)"},{"key":"1231_CR40","doi-asserted-by":"publisher","unstructured":"Ong, F., Martin, J., Grissom, W., Srinivasan, S., Johnson, K.M., Huynh, C., Desai, A., Li, Z., Tamir, J., Sandino, C., Shimron, E., Zeng, D., Mickevicius, N.: Mikgroup\/sigpy: minor release to trigger Zenodo for DOI. (v0.1.24). Zenodo (2022) https:\/\/doi.org\/10.5281\/zenodo.5893788","DOI":"10.5281\/zenodo.5893788"},{"issue":"5","key":"1231_CR41","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1002\/(SICI)1522-2594(199911)42:5<952::AID-MRM16>3.0.CO;2-S","volume":"42","author":"KP Pruessmann","year":"1999","unstructured":"Pruessmann, K.P., Weiger, M., Scheidegger, M.B., Boesiger, P.: Sense: sensitivity encoding for fast MRI. Magn. Reson. Med. Off. J. Int. Soc. Magn. Reson. Med. 42(5), 952\u2013962 (1999)","journal-title":"Magn. Reson. Med. Off. J. Int. Soc. Magn. Reson. Med."},{"issue":"1","key":"1231_CR42","doi-asserted-by":"publisher","first-page":"015001","DOI":"10.1088\/0266-5611\/31\/1\/015001","volume":"31","author":"MJ Ehrhardt","year":"2014","unstructured":"Ehrhardt, M.J., Thielemans, K., Pizarro, L., Atkinson, D., Ourselin, S., Hutton, B.F., Arridge, S.R.: Joint reconstruction of PET-MRI by exploiting structural similarity. Inverse Prob. 31(1), 015001 (2014)","journal-title":"Inverse Prob."},{"key":"1231_CR43","doi-asserted-by":"crossref","unstructured":"Ong, F., Zhu, X., Cheng, J.Y., Johnson, K.M., Larson, P.E., Vasanawala, S.S., Lustig, M.: Extreme MRI: large-scale volumetric dynamic imaging from continuous non-gated acquisitions. Magn. Reson. Med. 84(4), 1763\u20131780 (2020)","DOI":"10.1002\/mrm.28235"},{"key":"1231_CR44","doi-asserted-by":"crossref","unstructured":"Oscanoa, J.A., Ong, F., Iyer, S.S., Li, Z., Sandino, C.M., Ozturkler, B., Ennis, D.B., Pilanci, M., Vasanawala, S.S.: Coil sketching for computationally-efficient mr iterative reconstruction. arXiv preprint arXiv:2305.06482 (2023)","DOI":"10.1002\/mrm.29883"},{"issue":"1","key":"1231_CR45","doi-asserted-by":"publisher","first-page":"e190007","DOI":"10.1148\/ryai.2020190007","volume":"2","author":"F Knoll","year":"2020","unstructured":"Knoll, F., Zbontar, J., Sriram, A., Muckley, M.J., Bruno, M., Defazio, A., Parente, M., Geras, K.J., Katsnelson, J., Chandarana, H., et al.: fastMRI: a publicly available raw k-space and DICOM dataset of knee images for accelerated MR image reconstruction using machine learning. Radiol. Artif. Intell. 2(1), e190007 (2020)","journal-title":"Radiol. Artif. Intell."},{"key":"1231_CR46","unstructured":"Zbontar, J., Knoll, F., Sriram, A., Murrell, T., Huang, Z., Muckley, M.J., Defazio, A., Stern, R., Johnson, P., Bruno, M., et al.: fastMRI: an open dataset and benchmarks for accelerated MRI. arXiv preprint arXiv:1811.08839 (2018)"},{"key":"1231_CR47","unstructured":"Pruessmann, K.P., Weiger, M., Scheidegger, M.B., Boesiger, P.: Coil sensitivity encoding for fast MRI. In: Proceedings of the ISMRM 6th Annual Meeting, Sydney, vol. 1998 (1998)"},{"key":"1231_CR48","doi-asserted-by":"publisher","unstructured":"Adler, J., Kohr, H., Ringh, A., Moosmann, J., Sbanert, Ehrhardt, M.J., Lee, G.R., Niinimaki, B., Verdier, O., Karlsson, J., Zickert, Palenstijn, W.J., \u00d6ktem, O., Chen, C., Loarca, H.A., Lohmann, M.: odlgroup\/odl: ODL 0.7.0. Zenodo (2018). https:\/\/doi.org\/10.5281\/zenodo.1442734","DOI":"10.5281\/zenodo.1442734"},{"issue":"1","key":"1231_CR49","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-025-01231-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10851-025-01231-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-025-01231-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T09:44:27Z","timestamp":1751535867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10851-025-01231-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,17]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1231"],"URL":"https:\/\/doi.org\/10.1007\/s10851-025-01231-3","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"value":"0924-9907","type":"print"},{"value":"1573-7683","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,17]]},"assertion":[{"value":"24 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"25"}}