{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:33:28Z","timestamp":1768314808030,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319168074","type":"print"},{"value":"9783319168081","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16808-1_33","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T09:14:46Z","timestamp":1429089286000},"page":"488-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Singly-Bordered Block-Diagonal Form for Minimal Problem Solvers"],"prefix":"10.1007","author":[{"given":"Zuzana","family":"Kukelova","sequence":"first","affiliation":[]},{"given":"Martin","family":"Bujnak","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Heller","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Pajdla","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"33_CR1","unstructured":"Aykanat, C., Pinar, A., Catalyurek, U.V.: Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Scientific Comput. 12\/2002 (2002)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Bujnak, M., Kukelova, Z., Pajdla, T.: A general solution to the P4P problem for camera with unknown focal length. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587793"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-19315-6_2","volume-title":"Computer Vision \u2013 ACCV 2010","author":"M Bujnak","year":"2011","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: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part I. LNCS, vol. 6492, pp. 11\u201324. Springer, Heidelberg (2011)"},{"key":"33_CR4","unstructured":"Bujnak, M., Kukelova, Z., Pajdla, T.: Making minimal solvers fast. In: CVPR (2008)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Byr\u00f6d, M., Josephson, K., \u00c5str\u00f6m, K.: Improving numerical accuracy of Gr\u00f6bner basis polynomial equation solver. In: ICCV (2007)","DOI":"10.1109\/ICCV.2007.4408885"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-88693-8_10","volume-title":"Computer Vision \u2013 ECCV 2008","author":"M Byr\u00f6d","year":"2008","unstructured":"Byr\u00f6d, M., Josephson, K., \u00c5str\u00f6m, K.: A column-pivoting based strategy for monomial ordering in numerical Gr\u00f6bner basis calculations. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part IV. LNCS, vol. 5305, pp. 130\u2013143. Springer, Heidelberg (2008)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Byr\u00f6d, M., Brown, M., \u00c5str\u00f6m, K.: Minimal solutions for panoramic stitching with radial distortion. In: BMVC (2009)","DOI":"10.5244\/C.23.41"},{"key":"33_CR8","unstructured":"Byr\u00f6d, M.: Numerical methods for geometric vision: From minimal to large scale problems. Ph.D. Thesis, Centre for Mathematical Sciences, Lund University (2010)"},{"key":"33_CR9","unstructured":"Catalyurek, U.V., Aykanat, C.: PaToH: Partitioning Tool for Hypergraphs, Version 3.1 (2011)"},{"key":"33_CR10","volume-title":"Using Algebraic Geometry","author":"D Cox","year":"2005","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Using Algebraic Geometry, vol. 185, 2nd edn. Springer, Berlin, Heidelberg, New York (2005)","edition":"2"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th ACM\/IEEE Design Automation Conference (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"6","key":"33_CR12","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. Comm. ACM 24(6), 381\u2013395 (1981)","journal-title":"Comm. ACM"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Hook, D., McAree, P.: Using sturm sequences to bracket real roots of polynomial equations. In: Graphic Gems I, pp. 416\u2013423. Academic Press (1990)","DOI":"10.1016\/B978-0-08-050753-8.50089-9"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Josephson, K., Byr\u00f6d, M.: Pose estimation with radial distortion and unknown focal length. In: CVPR 2009 (2009)","DOI":"10.1109\/CVPR.2009.5206756"},{"key":"33_CR16","unstructured":"http:\/\/cmp.felk.cvut.cz\/minimal\/"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Kuehnle, K., Mayr, E.: Exponential space computation of Groebner bases. In: Proceedings of ISSAC. ACM (1996)","DOI":"10.1145\/236869.236900"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-88690-7_23","volume-title":"Computer Vision \u2013 ECCV 2008","author":"Z Kukelova","year":"2008","unstructured":"Kukelova, Z., Bujnak, M., Pajdla, T.: Automatic generator of minimal problem solvers. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part III. LNCS, vol. 5304, pp. 302\u2013315. Springer, Heidelberg (2008)"},{"issue":"2","key":"33_CR19","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cviu.2008.11.008","volume":"114","author":"Z Kukelova","year":"2010","unstructured":"Kukelova, Z., Byr\u00f6d, M., Josephson, K., Pajdla, T., \u00c5str\u00f6m, K.: Fast and robust numerical solutions to minimal problems for cameras with radial distortion. Comput. Vis. Image Underst. 114(2), 234\u2013244 (2010)","journal-title":"Comput. Vis. Image Underst."},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Kushal, A., Agarwal, S.: Visibility based preconditioning for bundle adjustment. In: CVPR 2012","DOI":"10.1109\/CVPR.2012.6247832"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Naroditsky, O., Daniilidis, K.: Optimizing polynomial solvers for minimal geometry problems. In: ICCV 2011","DOI":"10.1109\/ICCV.2011.6126341"},{"issue":"6","key":"33_CR22","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1109\/TPAMI.2004.17","volume":"26","author":"D Nister","year":"2004","unstructured":"Nister, D.: An efficient solution to the five-point relative pose. IEEE PAMI 26(6), 756\u2013770 (2004)","journal-title":"IEEE PAMI"},{"key":"33_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717976","volume-title":"Numerical Polynomial Algebra","author":"HJ Stetter","year":"2004","unstructured":"Stetter, H.J.: Numerical Polynomial Algebra. SIAM, Philadelphia (2004)"},{"key":"33_CR24","unstructured":"Stewenius, H., Nister, D., Kahl, F., Schaffalitzky, F.: A minimal solution for relative pose with unknown focal length. In: CVPR 2005"},{"key":"33_CR25","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., Nister, D.: Recent developments on direct relative orientation. ISPRS J. Photogrammetry Remote Sens. 60, 284\u2013294 (2006)","journal-title":"ISPRS J. Photogrammetry Remote Sens."},{"key":"33_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-44480-7_21","volume-title":"Vision Algorithms: Theory and Practice","author":"B Triggs","year":"2000","unstructured":"Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle adjustment \u2013 A modern synthesis. In: Triggs, B., Zisserman, A., Szeliski, R. (eds.) ICCV-WS 1999. LNCS, vol. 1883, pp. 298\u2013375. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Computer Vision -- ACCV 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16808-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:20:21Z","timestamp":1676938821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16808-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319168074","9783319168081"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16808-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}