{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:55:29Z","timestamp":1752231329671,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,2,15]],"date-time":"2021-02-15T00:00:00Z","timestamp":1613347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,2,15]],"date-time":"2021-02-15T00:00:00Z","timestamp":1613347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P28858"],"award-info":[{"award-number":["P28858"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["STE571\/16-1"],"award-info":[{"award-number":["STE571\/16-1"]}],"id":[{"id":"10.13039\/501100001659","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":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Principal component analysis (PCA) is known to be sensitive to outliers, so that various robust PCA variants were proposed in the literature. A recent model, called<jats:sc>reaper<\/jats:sc>, aims to find the principal components by solving a convex optimization problem. Usually the number of principal components must be determined in advance and the minimization is performed over symmetric positive semi-definite matrices having the size of the data, although the number of principal components is substantially smaller. This prohibits its use if the dimension of the data is large which is often the case in image processing. In this paper, we propose a regularized version of<jats:sc>reaper<\/jats:sc>which enforces the sparsity of the number of principal components by penalizing the nuclear norm of the corresponding orthogonal projector. If only an upper bound on the number of principal components is available, our approach can be combined with the<jats:italic>L<\/jats:italic>-curve method to reconstruct the appropriate subspace. Our second contribution is a matrix-free algorithm to find a minimizer of the regularized<jats:sc>reaper<\/jats:sc>which is also suited for high-dimensional data. The algorithm couples a primal-dual minimization approach with a thick-restarted Lanczos process. This appears to be the first efficient convex variational method for robust PCA that can handle high-dimensional data. As a side result, we discuss the topic of the bias in robust PCA. Numerical examples demonstrate the performance of our algorithm.<\/jats:p>","DOI":"10.1007\/s10851-021-01019-1","type":"journal-article","created":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T20:00:31Z","timestamp":1613678431000},"page":"626-649","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robust PCA via Regularized Reaper with a Matrix-Free Proximal Algorithm"],"prefix":"10.1007","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7813-2762","authenticated-orcid":false,"given":"Robert","family":"Beinert","sequence":"first","affiliation":[]},{"given":"Gabriele","family":"Steidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,15]]},"reference":[{"key":"1019_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. Society for Industrial and Applied Mathematics (SIAM), Mathematical Optimization Society, Philadelphia (2017)"},{"issue":"1","key":"1019_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-014-0586-7","volume":"164","author":"A Beck","year":"2015","unstructured":"Beck, A., Sabach, S.: Weiszfeld\u2019s method: old and new results. J. Optim. Theory Appl. 164(1), 1\u201340 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"1019_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-41589-5_10","volume-title":"Splitting Methods in Communication, Imaging, Science, and Engineering","author":"M Burger","year":"2016","unstructured":"Burger, M., Sawatzky, A., Steidl, G.: First order algorithms in variational image processing. In: Glowinski, R., Osher, S.J., Yin, W. (eds.) Splitting Methods in Communication, Imaging, Science, and Engineering, pp. 345\u2013407. Springer, Cham (2016)"},{"issue":"3","key":"1019_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Candes","year":"2011","unstructured":"Candes, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3), 11 (2011)","journal-title":"J. ACM"},{"issue":"1","key":"1019_CR5","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 Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"1019_CR6","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 Numerica 25, 161\u2013319 (2016)","journal-title":"Acta Numerica"},{"key":"1019_CR7","first-page":"1","volume":"65","author":"Y Cherapanamjeri","year":"2017","unstructured":"Cherapanamjeri, Y., Jain, P., Netrapalli, P.: Thresholding based efficient outlier robust PCA. Proc. Mach. Learn. Res. 65, 1\u201336 (2017)","journal-title":"Proc. Mach. Learn. Res."},{"issue":"3","key":"1019_CR8","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10851-012-0392-5","volume":"47","author":"R Ciak","year":"2013","unstructured":"Ciak, R., Shafei, B., Steidl, G.: Homogeneous penalizers and constraints in convex image restoration. J. Math. Imaging Vis. 47(3), 210\u2013230 (2013)","journal-title":"J. Math. Imaging Vis."},{"doi-asserted-by":"crossref","unstructured":"Ding, C., Zhou, D., He, X., Zha, H.: $${R}_1$$-PCA: rotational invariant $${L}_1$$-norm principal component analysis for robust subspace factorization. In: Proceedings of the 23rd International Conference on Machine Learning, pp. 281\u2013288. ACM, New York (2006)","key":"1019_CR9","DOI":"10.1145\/1143844.1143880"},{"unstructured":"Epstein, R., Hallinan, P.W., Yuille, A.L.: $$5\\pm 2$$ eigenimages suffice: an empirical investigation of low-dimensional lighting models. In: Proceedings of the Workshop on Physics-Based Modeling in Computer Vision, 18\u201319 June 1995, Cambridge, USA, pp. 108\u2013116 (1995)","key":"1019_CR10"},{"doi-asserted-by":"crossref","unstructured":"Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. In: Readings in Computer Vision, pp. 726\u2013740. Elsevier, Amsterdam (1987)","key":"1019_CR11","DOI":"10.1016\/B978-0-08-051581-6.50070-2"},{"issue":"6","key":"1019_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/34.927464","volume":"23","author":"A Georghiades","year":"2001","unstructured":"Georghiades, A., Belhumeur, P., Kriegman, D.: From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intell. 23(6), 643\u2013660 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1019_CR13","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. The John Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"1019_CR14","first-page":"253","volume":"3","author":"M Hanke","year":"1993","unstructured":"Hanke, M., Hansen, P.C.: Regularization methods for large scale problems. Surv. Ind. Math. 3, 253\u2013264 (1993)","journal-title":"Surv. Ind. Math."},{"key":"1019_CR15","first-page":"119","volume-title":"Computational Inverse Problems in Electrocardiology, Advances in Computational Bioengineering","author":"PC Hansen","year":"2000","unstructured":"Hansen, P.C.: The $$L$$-curve and its use in the numerical treatment of inverse problems. In: Johnston, P. (ed.) Computational Inverse Problems in Electrocardiology, Advances in Computational Bioengineering, pp. 119\u2013142. WIT Press, Southampton (2000)"},{"key":"1019_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Matrix Analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1991)"},{"key":"1019_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9780470434697","volume-title":"Robust Statistics","author":"PJ Huber","year":"2009","unstructured":"Huber, P.J., Ronchetti, E.M.: Robust Statistics, 2nd edn. Wiley, New York (2009)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Ke, Q., Kanade, T.: Robust $$\\ell _1$$ norm factorization in the presence of outliers and missing data by alternative convex programming. In: Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on, vol.\u00a01, pp. 739\u2013746. IEEE (2005)","key":"1019_CR18","DOI":"10.1109\/CVPR.2005.309"},{"issue":"2","key":"1019_CR19","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1080\/03610919408813180","volume":"23","author":"JT Kent","year":"1994","unstructured":"Kent, J.T., Tyler, D.E., Vard, Y.: A curious likelihood identity for the multivariate $$t$$-distribution. Commun. Stat. Simul. Comput. 23(2), 441\u2013453 (1994)","journal-title":"Commun. Stat. Simul. Comput."},{"doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Schubert, E., Zimek, A.: A general framework for increasing the robustness of PCA-based correlation clustering algorithms. In: Scientific and Statistical Database Management. Lecture Notes in Computer Science, vol. 5069, pp. 418\u2013435 (2008)","key":"1019_CR20","DOI":"10.1007\/978-3-540-69497-7_27"},{"issue":"9","key":"1019_CR21","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1109\/TPAMI.2008.114","volume":"30","author":"N Kwak","year":"2008","unstructured":"Kwak, N.: Principal component analysis based on L1-norm maximation. IEEE Trans. Pattern Anal. Mach. Intell. 30(9), 1672\u20131680 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"1019_CR22","doi-asserted-by":"publisher","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bur. Stand. 45(4), 255\u2013282 (1950)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"5","key":"1019_CR23","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1109\/TPAMI.2005.92","volume":"27","author":"K Lee","year":"2005","unstructured":"Lee, K., Ho, J., Kriegman, D.: Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans. Pattern Anal. Mach. Intell. 27(5), 684\u2013698 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"doi-asserted-by":"crossref","unstructured":"Lellmann, J., Neumayer, S., Nimmer, M., Steidl, G.: Methods for finding the offset in robust subspace fitting. PAMM 19(1) (2019)","key":"1019_CR24","DOI":"10.1002\/pamm.201900323"},{"issue":"2","key":"1019_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1093\/imaiai\/iax012","volume":"7","author":"G Lerman","year":"2018","unstructured":"Lerman, G., Maunu, T.: Fast, robust and non-convex subspace recovery. Inf. Inference J. IMA 7(2), 277\u2013336 (2018). https:\/\/doi.org\/10.1093\/imaiai\/iax012","journal-title":"Inf. Inference J. IMA"},{"issue":"8","key":"1019_CR26","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1109\/JPROC.2018.2853141","volume":"106","author":"G Lerman","year":"2018","unstructured":"Lerman, G., Maunu, T.: An overview of robust subspace recovery. Proc. IEEE 106(8), 1380\u20131410 (2018)","journal-title":"Proc. IEEE"},{"issue":"1","key":"1019_CR27","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10208-014-9221-0","volume":"15","author":"G Lerman","year":"2015","unstructured":"Lerman, G., McCoy, M., Tropp, J.A., Zhang, T.: Robust computation of linear models by convex relaxation. Found. Comput. Math. 15(1), 363\u2013410 (2015)","journal-title":"Found. Comput. Math."},{"doi-asserted-by":"crossref","unstructured":"Leroy, A.M., Rousseeuw, P.J.: Robust regression and outlier detection. Wiley Series in Probability and Mathematical Statistics (1987)","key":"1019_CR28","DOI":"10.1002\/0471725382"},{"key":"1019_CR29","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s002110050397","volume":"81","author":"CK Li","year":"1999","unstructured":"Li, C.K., Mathias, R.: The Lidskii\u2013Mirsky\u2013Wielandt theorem\u2014additive and multiplicative versions. Numer. Math. 81, 377\u2013413 (1999)","journal-title":"Numer. Math."},{"key":"1019_CR30","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.orl.2013.01.014","volume":"41","author":"Y Liu","year":"1993","unstructured":"Liu, Y., Wang, S., Juhe, S.: Finding the projection onto the intersection of a closed half-space and a variable box. Oper Res Lett 41, 259\u2013315 (1993). https:\/\/doi.org\/10.1016\/j.orl.2013.01.014","journal-title":"Oper Res Lett"},{"issue":"37","key":"1019_CR31","first-page":"1","volume":"20","author":"T Maunu","year":"2019","unstructured":"Maunu, T., Zhang, T., Lerman, G.: A well-tempered landscape for non-convex robust subspace recovery. J. Mach. Learn. Res. 20(37), 1\u201359 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"1019_CR32","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1214\/11-EJS636","volume":"5","author":"M McCoy","year":"2011","unstructured":"McCoy, M., Tropp, J.A.: Two proposals for robust PCA using semidefinite programming. Electron. J. Stat. 5, 1123\u20131160 (2011)","journal-title":"Electron. J. Stat."},{"issue":"3","key":"1019_CR33","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1111\/1467-9868.00082","volume":"59","author":"XL Meng","year":"1997","unstructured":"Meng, X.L., Van Dyk, D.: The EM algorithm\u2014an old folk-song sung to a fast new tune. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 59(3), 511\u2013567 (1997)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"1019_CR34","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.laa.2019.10.030","volume":"587","author":"S Neumayer","year":"2020","unstructured":"Neumayer, S., Nimmer, M., Setzer, S., Steidl, G.: On the rotational invariant $$l_1$$-norm PCA. Linear Algebra Appl. 587, 243\u2013270 (2020)","journal-title":"Linear Algebra Appl."},{"unstructured":"Neumayer, S., Nimmer, M., Setzer, S., Steidl, G.: On the robust PCA and Weiszfeld\u2019s algorithm. Appl. Math. Optim. (To appear)","key":"1019_CR35"},{"issue":"4","key":"1019_CR36","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1287\/opre.26.4.597","volume":"26","author":"LM Ostresh Jr","year":"1978","unstructured":"Ostresh Jr., L.M.: On the convergence of a class of iterative methods for solving the Weber location problem. Oper. Res. 26(4), 597\u2013609 (1978)","journal-title":"Oper. Res."},{"issue":"11","key":"1019_CR37","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"2","author":"K Pearson","year":"1901","unstructured":"Pearson, K.: On lines and planes of closest fit to systems of points in space. Phil. Mag. 2(11), 559\u2013572 (1901)","journal-title":"Phil. Mag."},{"doi-asserted-by":"crossref","unstructured":"Podosinnikova, A., Setzer, S., Hein, M.: Robust PCA: optimization of the robust reconstruction error over the Stiefel manifold. In: German Conference on Pattern Recognition, pp. 121\u2013131. Springer, Berlin (2014)","key":"1019_CR38","DOI":"10.1007\/978-3-319-11752-2_10"},{"issue":"2","key":"1019_CR39","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10589-020-00186-y","volume":"76","author":"J Rasch","year":"2020","unstructured":"Rasch, J., Chambolle, A.: Inexact first-order primal-dual algorithms. Comput. Optim. Appl. 76(2), 381\u2013430 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"1019_CR40","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1019_CR41","volume-title":"Robust regression and outlier detection","author":"PJ Rousseeuw","year":"2005","unstructured":"Rousseeuw, P.J., Leroy, A.M.: Robust regression and outlier detection, vol. 589. John Wiley & Sons, New York (2005)"},{"issue":"8","key":"1019_CR42","doi-asserted-by":"publisher","first-page":"2200","DOI":"10.1016\/j.cam.2011.09.042","volume":"236","author":"S Setzer","year":"2012","unstructured":"Setzer, S., Steidl, G., Teuber, T.: On vector and matrix median computation. J. Comput. Appl. Math. 236(8), 2200\u20132222 (2012)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"1019_CR43","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/BF02165413","volume":"13","author":"GW Stewart","year":"1969","unstructured":"Stewart, G.W.: Accelerating the orthogonal iteration for the eigenvectors of a Hermitian matrix. Numer. Math. 13(4), 362\u2013376 (1969)","journal-title":"Numer. Math."},{"key":"1019_CR44","first-page":"684","volume":"19","author":"MC Tsakiris","year":"2018","unstructured":"Tsakiris, M.C., Vidal, R.: Dual principal component pursuit. J. Mach. Learn. Res. (JMLR) 19, 684\u2013732 (2018)","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"issue":"1","key":"1019_CR45","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1162\/jocn.1991.3.1.71","volume":"3","author":"M Turk","year":"1991","unstructured":"Turk, M., Pentland, A.: Eigenfaces for recognition. J. Cogn. Neurosci. 3(1), 71\u201386 (1991)","journal-title":"J. Cogn. Neurosci."},{"issue":"1","key":"1019_CR46","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1214\/aos\/1176350263","volume":"15","author":"DE Tyler","year":"1987","unstructured":"Tyler, D.E.: A distribution-free $${M}$$-estimator of multivariate scatter. Ann. Stat. 15(1), 234\u2013251 (1987)","journal-title":"Ann. Stat."},{"issue":"1","key":"1019_CR47","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1214\/aos\/1176350263","volume":"15","author":"DE Tyler","year":"1987","unstructured":"Tyler, D.E.: A distribution-free $$M$$-estimator of multivariate scatter. Ann. Stat. 15(1), 234\u2013251 (1987)","journal-title":"Ann. Stat."},{"issue":"2","key":"1019_CR48","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E van den Berg","year":"2008","unstructured":"van den Berg, E., Friedlander, M.P.: Probing the pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31(2), 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"1019_CR49","first-page":"355","volume":"43","author":"E Weiszfeld","year":"1937","unstructured":"Weiszfeld, E.: Sur le point pour lequel les sommes des distances de $$n$$ points donn\u00e9s et minimum. T\u00f4hoku Math. J. 43, 355\u2013386 (1937)","journal-title":"T\u00f4hoku Math. J."},{"issue":"2","key":"1019_CR50","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1137\/S0895479898334605","volume":"22","author":"K Wu","year":"2000","unstructured":"Wu, K., Simon, H.: Thick-restart Lanczos method for large symmetric eigenvalue problems. SIAM J. Matrix Anal. Appl. 22(2), 602\u2013616 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1019_CR51","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1109\/TIT.2011.2173156","volume":"58","author":"H Xu","year":"2012","unstructured":"Xu, H., Caramanis, C., Sanghavi, S.: Robust PCA via outlier pursuit. IEEE Trans. Inf. Theory 58(3), 3047\u20133064 (2012)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-021-01019-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10851-021-01019-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-021-01019-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T12:13:57Z","timestamp":1724501637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10851-021-01019-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,15]]},"references-count":51,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1019"],"URL":"https:\/\/doi.org\/10.1007\/s10851-021-01019-1","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"type":"print","value":"0924-9907"},{"type":"electronic","value":"1573-7683"}],"subject":[],"published":{"date-parts":[[2021,2,15]]},"assertion":[{"value":"12 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}