{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:23:44Z","timestamp":1780392224671,"version":"3.54.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005637","name":"Tekniikan Edist\u00e4miss\u00e4\u00e4ti\u00f6","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005637","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018240","name":"Research Center for Informatics, Czech Technical University in Prague","doi-asserted-by":"publisher","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"]}],"id":[{"id":"10.13039\/100018240","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":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many computer vision applications require robust and efficient estimation of camera geometry from a minimal number of input data measurements. Minimal problems are usually formulated as complex systems of sparse polynomial equations. The systems usually are overdetermined and consist of polynomials with algebraically constrained coefficients. Most state-of-the-art efficient polynomial solvers are based on the action matrix method that has been automated and highly optimized in recent years. On the other hand, the alternative theory of sparse resultants based on the Newton polytopes has not been used so often for generating efficient solvers, primarily because the polytopes do not respect the constraints amongst the coefficients. In an attempt to tackle this challenge, here we propose a simple iterative scheme to test various subsets of the Newton polytopes and search for the most efficient solver. Moreover, we propose to use an extra polynomial with a special form to further improve the solver efficiency via Schur complement computation. We show that for some camera geometry problems our resultant-based method leads to smaller and more stable solvers than the state-of-the-art Gr\u00f6bner basis-based solvers, while being significantly smaller than the state-of-the-art resultant-based methods. The proposed method can be fully automated and incorporated into existing tools for the automatic generation of efficient polynomial solvers. It provides a competitive alternative to popular Gr\u00f6bner basis-based methods for minimal problems in computer vision. Additionally, we study the conditions under which the minimal solvers generated by the state-of-the-art action matrix-based methods and the proposed extra polynomial resultant-based method, are equivalent. Specifically, we consider a step-by-step comparison between the approaches based on the action matrix and the sparse resultant, followed by a set of substitutions, which would lead to equivalent minimal solvers.<\/jats:p>","DOI":"10.1007\/s10851-024-01182-1","type":"journal-article","created":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T15:01:51Z","timestamp":1711206111000},"page":"335-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Sparse Resultant-Based Minimal Solvers in Computer Vision and Their Connection with the Action Matrix"],"prefix":"10.1007","volume":"66","author":[{"given":"Snehal","family":"Bhayani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Janne","family":"Heikkil\u00e4","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zuzana","family":"Kukelova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,23]]},"reference":[{"key":"1182_CR1","doi-asserted-by":"crossref","unstructured":"Albl, C., Kukelova, Z., Fitzgibbon, A.W., Heller, J., Sm\u00edd, M., Pajdla, T.: On the two-view geometry of unsynchronized cameras. CoRR arXiv:1704.06843 (2017)","DOI":"10.1109\/CVPR.2017.593"},{"key":"1182_CR2","unstructured":"Bhayani, S., Kukelova, Z., Heikkil\u00e4, J.: Automatic generator for sparse resultant solvers. https:\/\/github.com\/snehalbhayani\/aut_gen_sparse_res_solver (2020)"},{"key":"1182_CR3","doi-asserted-by":"crossref","unstructured":"Bhayani, S., Kukelova, Z., Heikkil\u00e4, J.: A sparse resultant based method for efficient minimal solvers. In: 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1767\u20131776 (2020)","DOI":"10.1109\/CVPR42600.2020.00184"},{"key":"1182_CR4","doi-asserted-by":"crossref","unstructured":"Bhayani, S., Kukelova, Z., Heikkil\u00e4, J.: Computing stable resultant-based minimal solvers by hiding a variable. In: 2020 25th International Conference on Pattern Recognition (ICPR), pp. 6104\u20136111 (2021)","DOI":"10.1109\/ICPR48806.2021.9411957"},{"key":"1182_CR5","doi-asserted-by":"crossref","unstructured":"Bujnak, M., Kukelova, Z., Pajdla, T.: Making minimal solvers fast. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2012), pp. 1506\u20131513 (2012)","DOI":"10.1109\/CVPR.2012.6247840"},{"key":"1182_CR6","doi-asserted-by":"crossref","unstructured":"Bujnak, M., Kukelova, Z., Pajdla, T.: 3D reconstruction from image collections with a single known focal length. In: International Conference on Computer Vision (ICCV), pp. 1803\u20131810. IEEE (2009)","DOI":"10.1109\/ICCV.2009.5459402"},{"key":"1182_CR7","doi-asserted-by":"crossref","unstructured":"Bujnak, M., Kukelova, Z., Pajdla, T.: New efficient solution to the absolute pose problem for camera with unknown focal length and radial distortion. In: Asian Conference on Computer Vision (ACCV), pp. 11\u201324. Springer (2010)","DOI":"10.1007\/978-3-642-19315-6_2"},{"key":"1182_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s11263-009-0235-z","volume":"84","author":"M Byr\u00f6d","year":"2009","unstructured":"Byr\u00f6d, M., Josephson, K., \u00c5str\u00f6m, K.: Fast and stable polynomial equation solving and its application to computer vision. Int. J. Comput. Vis. 84, 237\u2013256 (2009)","journal-title":"Int. J. Comput. Vis."},{"key":"1182_CR9","doi-asserted-by":"crossref","unstructured":"Byr\u00f6d, M., Josephson, K., \u00c5str\u00f6m, K.: Improving numerical accuracy of Gr\u00f6bner basis polynomial equation solvers. In: International Conference on Computer Vision (ICCV). IEEE (2007)","DOI":"10.1109\/ICCV.2007.4408885"},{"key":"1182_CR10","doi-asserted-by":"crossref","unstructured":"Byr\u00f6d, M., Josephson, K., \u00c5str\u00f6m, K.: A column-pivoting based strategy for monomial ordering in numerical Gr\u00f6bner basis calculations. In: European Conference on Computer Vision (ECCV). Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-88693-8_10"},{"issue":"3","key":"1182_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/337244.337247","volume":"47","author":"JF Canny","year":"2000","unstructured":"Canny, J.F., Emiris, I.Z.: A subdivision-based algorithm for the sparse resultant. J. ACM 47(3), 417\u2013451 (2000)","journal-title":"J. ACM"},{"key":"1182_CR12","first-page":"1","volume":"18","author":"C Checa","year":"2022","unstructured":"Checa, C., Emiris, I.Z.: Mixed subdivisions suitable for the Canny\u2013Emiris formula. Math. Comput. Sci. 18, 1\u201318 (2022)","journal-title":"Math. Comput. Sci."},{"key":"1182_CR13","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-540-45243-0_31","volume-title":"Pattern Recognition","author":"O Chum","year":"2003","unstructured":"Chum, O., Matas, J., Kittler, J.: Locally optimized RANSAC. In: Michaelis, B., Krell, G. (eds.) Pattern Recognition, pp. 236\u2013243. Springer, Berlin (2003)"},{"key":"1182_CR14","volume-title":"Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"D Cox","year":"2007","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, New York (2007)"},{"key":"1182_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6911-1","volume-title":"Using Algebraic Geometry. Graduate Texts in Mathematics","author":"DA Cox","year":"1998","unstructured":"Cox, D.A., Little, J.B., O\u2019Shea, D.: Using Algebraic Geometry. Graduate Texts in Mathematics, vol. 185, 1st edn. Springer, Berlin (1998)","edition":"1"},{"key":"1182_CR16","unstructured":"Emiris, I.Z.: A general solver based on sparse resultants. CoRR arXiv:1201.5810 (2012)"},{"key":"1182_CR17","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Canny, J.F.: A practical method for the sparse resultant. In: Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, ISSAC \u201993, Kiev, Ukraine, July 6\u20138, 1993, pp. 183\u2013192 (1993)","DOI":"10.1145\/164081.164122"},{"issue":"6","key":"1182_CR18","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"MA Fischler","year":"1981","unstructured":"Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24(6), 381\u2013395 (1981)","journal-title":"Commun. ACM"},{"key":"1182_CR19","doi-asserted-by":"crossref","unstructured":"Haner, S., \u00c5str\u00f6m, K.: Absolute pose for cameras under flat refractive interfaces. In: Computer Vision and Pattern Recognition (CVPR), pp. 1428\u20131436 (2015)","DOI":"10.1109\/CVPR.2015.7298749"},{"key":"1182_CR20","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1109\/TPAMI.2012.43","volume":"34","author":"RI Hartley","year":"2012","unstructured":"Hartley, R.I., Li, H.: An efficient hidden variable approach to minimal-case camera motion estimation. IEEE Trans. Pattern Anal. Mach. Intell. 34, 2303\u20132314 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1182_CR21","doi-asserted-by":"crossref","unstructured":"Heikkil\u00e4, J.: Using sparse elimination for solving minimal problems in computer vision. In: IEEE International Conference on Computer Vision, ICCV 2017, Venice, Italy, October 22\u201329, 2017, pp. 76\u201384 (2017)","DOI":"10.1109\/ICCV.2017.18"},{"key":"1182_CR22","doi-asserted-by":"crossref","unstructured":"Hesch, J.A., Roumeliotis, S.I.: A direct least-squares (dls) method for pnp. In: 2011 International Conference on Computer Vision, pp. 383\u2013390 (2011)","DOI":"10.1109\/ICCV.2011.6126266"},{"key":"1182_CR23","doi-asserted-by":"crossref","unstructured":"Kasten, Y., Galun, M., Basri, R.: Resultant based incremental recovery of camera pose from pairwise matches. In: IEEE Winter Conference on Applications of Computer Vision, WACV 2019, Waikoloa Village, HI, USA, January 7\u201311, 2019, pp. 1080\u20131088 (2019)","DOI":"10.1109\/WACV.2019.00120"},{"key":"1182_CR24","doi-asserted-by":"crossref","unstructured":"Kuang, Y., \u00c5str\u00f6m, K.: Pose estimation with unknown focal length using points, directions and lines. In: International Conference on Computer Vision (ICCV), pp. 529\u2013536 (2013)","DOI":"10.1109\/ICCV.2013.71"},{"key":"1182_CR25","doi-asserted-by":"crossref","unstructured":"Kuang, Y., Solem, J.E., Kahl, F., \u00c5str\u00f6m, K.: Minimal solvers for relative pose with a single unknown radial distortion. In: Computer Vision and Pattern Recognition (CVPR), pp. 33\u201340. IEEE (2014)","DOI":"10.1109\/CVPR.2014.12"},{"key":"1182_CR26","unstructured":"Kukelova, Z.: Algebraic methods in computer vision. Ph.D. thesis, Czech Technical University in Prague (2013)"},{"key":"1182_CR27","doi-asserted-by":"crossref","unstructured":"Kukelova, Z., Bujnak, M., Pajdla, T.: Automatic generator of minimal problem solvers. In: European Conference on Computer Vision (ECCV 2008), Proceedings, Part III, volume 5304 of Lecture Notes in Computer Science (2008)","DOI":"10.1007\/978-3-540-88690-7_23"},{"key":"1182_CR28","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1109\/TPAMI.2011.230","volume":"34","author":"Z Kukelova","year":"2012","unstructured":"Kukelova, Z., Bujnak, M., Pajdla, T.: Polynomial eigenvalue solutions to minimal problems in computer vision. IEEE Trans. Pattern Anal. Mach. Intell. 34, 1381\u20131393 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1182_CR29","doi-asserted-by":"crossref","unstructured":"Kukelova, Z., Heller, J., Bujnak, M., Fitzgibbon, A., Pajdla, T.: Efficient solution to the epipolar geometry for radially distorted cameras. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 2309\u20132317 (2015)","DOI":"10.1109\/ICCV.2015.266"},{"key":"1182_CR30","doi-asserted-by":"crossref","unstructured":"Kukelova, Z., Kileel, J., Sturmfels, B., Pajdla, T.: A clever elimination strategy for efficient minimal solvers. In: Computer Vision and Pattern Recognition (CVPR). IEEE (2017)","DOI":"10.1109\/CVPR.2017.384"},{"key":"1182_CR31","doi-asserted-by":"crossref","unstructured":"Larsson, V., \u00c5str\u00f6m, K.: Uncovering symmetries in polynomial systems. In: European Conference on Computer Vision (ECCV). Springer (2016)","DOI":"10.1007\/978-3-319-46487-9_16"},{"key":"1182_CR32","doi-asserted-by":"crossref","unstructured":"Larsson, V., \u00c5str\u00f6m, K., Oskarsson, M.: Efficient solvers for minimal problems by syzygy-based reduction. In: Computer Vision and Pattern Recognition (CVPR) (2017)","DOI":"10.1109\/CVPR.2017.256"},{"key":"1182_CR33","doi-asserted-by":"crossref","unstructured":"Larsson, V., \u00c5str\u00f6m, K., Oskarsson, M.: Polynomial solvers for saturated ideals. In: International Conference on Computer Vision (ICCV) (2017)","DOI":"10.1109\/ICCV.2017.251"},{"key":"1182_CR34","doi-asserted-by":"crossref","unstructured":"Larsson, V., Kukelova, Z., Zheng, Y.: Making minimal solvers for absolute pose estimation compact and robust. In: International Conference on Computer Vision (ICCV) (2017)","DOI":"10.1109\/ICCV.2017.254"},{"key":"1182_CR35","doi-asserted-by":"crossref","unstructured":"Larsson, V., Oskarsson, M., \u00c5str\u00f6m, K., Wallis, A., Kukelova, Z., Pajdla, T.: Beyond grobner bases: Basis selection for minimal solvers. In: 2018 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2018, Salt Lake City, UT, USA, June 18\u201322, 2018, pp. 3945\u20133954 (2018)","DOI":"10.1109\/CVPR.2018.00415"},{"key":"1182_CR36","doi-asserted-by":"crossref","unstructured":"Li, B., Heng, L., Lee, G.H., Pollefeys, M.: A 4-point algorithm for relative pose estimation of a calibrated camera with a known relative rotation angle. In: 2013 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 1595\u20131601. IEEE (2013)","DOI":"10.1109\/IROS.2013.6696562"},{"key":"1182_CR37","unstructured":"Martyushev, E., Bhayani, S., Pajdla, T.: Automatic solver generator for systems of Laurent polynomial equations (2023)"},{"key":"1182_CR38","doi-asserted-by":"crossref","unstructured":"Martyushev, E., Vrablikova, J., Pajdla, T.: Optimizing elimination templates by greedy parameter search (2022)","DOI":"10.1109\/CVPR52688.2022.01530"},{"key":"1182_CR39","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.jsc.2019.10.009","volume":"102","author":"B Mourrain","year":"2021","unstructured":"Mourrain, B., Telen, S., Van Barel, M.: Truncated normal forms for solving polynomial systems: generalized and efficient algorithms. J. Symb. Comput. 102, 63\u201385 (2021)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"1182_CR40","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.tcs.2008.09.004","volume":"409","author":"B Mourrain","year":"2008","unstructured":"Mourrain, B., Tr\u00e9buchet, P.: Stable normal forms for polynomial system solving. Theor. Comput. Sci. 409(2), 229\u2013240 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"1182_CR41","doi-asserted-by":"crossref","unstructured":"Nakano, G.: Globally optimal DLS method for pnp problem with Cayley parameterization. In: Proceedings of the British Machine Vision Conference 2015, BMVC 2015, Swansea, UK, September 7\u201310, 2015, pp. 78.1\u201378.11 (2015)","DOI":"10.5244\/C.29.78"},{"key":"1182_CR42","doi-asserted-by":"crossref","unstructured":"Naroditsky, O., Daniilidis, K.: Optimizing polynomial solvers for minimal geometry problems. In: International Conference on Computer Vision (ICCV). IEEE (2011)","DOI":"10.1109\/ICCV.2011.6126341"},{"issue":"6","key":"1182_CR43","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1109\/TPAMI.2004.17","volume":"26","author":"D Nist\u00e9r","year":"2004","unstructured":"Nist\u00e9r, D.: An efficient solution to the five-point relative pose problem. IEEE Trans. Pattern Anal. Mach. Intell. 26(6), 756\u2013770 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1182_CR44","unstructured":"RealityCapture. www.capturingreality.com (2016)"},{"issue":"8","key":"1182_CR45","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1109\/TPAMI.2012.257","volume":"35","author":"R Raguram","year":"2013","unstructured":"Raguram, R., Chum, O., Pollefeys, M., Matas, J., Frahm, J.-M.: USAC: a universal framework for random sample consensus. IEEE Trans. Pattern Recognit. Mach. Intell. 35(8), 2022\u20132038 (2013)","journal-title":"IEEE Trans. Pattern Recognit. Mach. Intell."},{"key":"1182_CR46","doi-asserted-by":"crossref","unstructured":"Saurer, O., Pollefeys, M., Lee, G.H.: A minimal solution to the rolling shutter pose estimation problem. In: 2015 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 1328\u20131334. IEEE (2015)","DOI":"10.1109\/IROS.2015.7353540"},{"issue":"4","key":"1182_CR47","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/242961.242966","volume":"30","author":"HJ Stetter","year":"1996","unstructured":"Stetter, H.J.: Matrix eigenproblems are at the heart of polynomial system solving. SIGSAM Bull. 30(4), 22\u201325 (1996)","journal-title":"SIGSAM Bull."},{"key":"1182_CR48","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.isprsjprs.2006.03.005","volume":"60","author":"H Stewenius","year":"2006","unstructured":"Stewenius, H., Engels, C., Nist\u00e9r, D.: Recent developments on direct relative orientation. ISPRS J. Photogramm. Remote Sens. 60, 284\u2013294 (2006)","journal-title":"ISPRS J. Photogramm. Remote Sens."},{"key":"1182_CR49","unstructured":"Stewenius, H., Nister, D., Kahl, F., Schaffalitzky, F.: A minimal solution for relative pose with unknown focal length. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2005) (2005)"},{"key":"1182_CR50","unstructured":"Stewenius, H.: Gr\u00f6bner basis methods for minimal problems in computer vision. Ph.D. thesis, Lund University, Sweden (2005)"},{"key":"1182_CR51","doi-asserted-by":"crossref","unstructured":"Stewenius, H., Schaffalitzky, F., Nister, D.: How hard is 3-view triangulation really? In: International Conference on Computer Vision (ICCV). IEEE (2005)","DOI":"10.1109\/ICCV.2005.115"},{"key":"1182_CR52","doi-asserted-by":"crossref","unstructured":"Sturmfels, B.: Solving systems of polynomial equations. In: American Mathematical Society, CBMS Regional Conferences Series, No. 97 (2002)","DOI":"10.1090\/cbms\/097"},{"key":"1182_CR53","doi-asserted-by":"crossref","unstructured":"Sv\u00e4rm, L., Enqvist, O., Kahl, F., Oskarsson, M.: City-scale localization for cameras with known vertical direction. IEEE Trans. Pattern Anal. Mach. Intell. 39(7), 1455\u20131461 (2017)","DOI":"10.1109\/TPAMI.2016.2598331"},{"issue":"3","key":"1182_CR54","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1137\/17M1162433","volume":"39","author":"S Telen","year":"2018","unstructured":"Telen, S., Mourrain, B., Van Barel, M.: Solving polynomial systems via truncated normal forms. SIAM J. Matrix Anal. Appl. 39(3), 1421\u20131447 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1182_CR55","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cam.2018.04.021","volume":"342","author":"S Telen","year":"2018","unstructured":"Telen, S., Van Barel, M.: A stabilized normal form algorithm for generic systems of polynomial equations. J. Comput. Appl. Math. 342, 119\u2013132 (2018)","journal-title":"J. Comput. Appl. Math."},{"key":"1182_CR56","volume-title":"Modern Algebra","author":"BL van der Waerden","year":"1950","unstructured":"van der Waerden, B.L., Artin, E., Noether, E., Benac, T.J.: Modern Algebra, vol. II. F. Ungar, New York (1950)"},{"key":"1182_CR57","doi-asserted-by":"crossref","unstructured":"Zheng, E., Wang, K., Dunn, E., Frahm, J.: Minimal solvers for 3D geometry from satellite imagery. In: 2015 IEEE International Conference on Computer Vision (ICCV), pp. 738\u2013746 (2015)","DOI":"10.1109\/ICCV.2015.91"}],"updated-by":[{"DOI":"10.1007\/s10851-024-01189-8","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T00:00:00Z","timestamp":1714003200000}}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-024-01182-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10851-024-01182-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-024-01182-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T22:53:51Z","timestamp":1731624831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10851-024-01182-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,23]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1182"],"URL":"https:\/\/doi.org\/10.1007\/s10851-024-01182-1","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10851-024-01189-8","asserted-by":"object"}]},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"value":"0924-9907","type":"print"},{"value":"1573-7683","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,23]]},"assertion":[{"value":"28 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10851-024-01189-8","URL":"https:\/\/doi.org\/10.1007\/s10851-024-01189-8","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}