{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:15:49Z","timestamp":1767140149110,"version":"build-2238731810"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Vision and Applications"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00138-021-01212-7","type":"journal-article","created":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T08:06:12Z","timestamp":1621497972000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A compressed matrix sequence method for solving normal equations of bundle adjustment"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7559-0477","authenticated-orcid":false,"given":"Jiaxin","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,20]]},"reference":[{"key":"1212_CR1","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.: Chapter 21: Bundle Adjustment-A Modern Synthesis. In: Triggs, B., Zisserman, A., Szeliski, R. (eds.) Vision Algorithms: Theory and Practice, vol. 1883, pp. 298\u2013372. Springer, Berlin (2000)"},{"key":"1212_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811685","volume-title":"Multiple View Geometry in Computer Vision","author":"R Hartley","year":"2004","unstructured":"Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2004)"},{"key":"1212_CR3","doi-asserted-by":"crossref","unstructured":"Jeong, Y., Nister, D., Steedly, D., Szeliski, R., Kweon, I.: Pushing the envelope of modern methods for bundle adjustment. In: CVPR10, pp. 1474-1481 (2010)","DOI":"10.1109\/CVPR.2010.5539795"},{"key":"1212_CR4","unstructured":"Atkinson, K.B. (ed.): Close Range Photogrammetry and Machine Vision. Whittles Publishing, Roseleigh House, Latheronwheel, Caithness, Scotland (1996)"},{"issue":"56","key":"1212_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1111\/j.1477-9730.1980.tb00020.x","volume":"10","author":"S Granshaw","year":"1980","unstructured":"Granshaw, S.: Bundle adjustment methods in engineering photogrammetry. Photogramm. Record 10(56), 181\u2013207 (1980)","journal-title":"Photogramm. Record"},{"key":"1212_CR6","doi-asserted-by":"crossref","unstructured":"Heinly, J., Schonberger, J. L., Dunn, E., Frahm, J. M.: Reconstructing the world* in six days*(as captured by the yahoo 100 million image dataset). In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3287-3295 (2015)","DOI":"10.1109\/CVPR.2015.7298949"},{"issue":"5","key":"1212_CR7","doi-asserted-by":"publisher","first-page":"479","DOI":"10.17706\/jcp.12.5.479-485","volume":"12","author":"A \u00c7al\u0131\u015fkan","year":"2017","unstructured":"\u00c7al\u0131\u015fkan, A., \u00c7evik, U.: Three-dimensional modeling in medical image processing by using fractal geometry. J. Comput. 12(5), 479\u2013485 (2017)","journal-title":"J. Comput."},{"key":"1212_CR8","doi-asserted-by":"crossref","unstructured":"Dellaert, F., Kaess, M.: Square Root SAM: Simultaneous localization and mappingvia square root information smoothing. Int. J. Robot. Res. 25(12), 1181\u20131203 (2006)","DOI":"10.1177\/0278364906072768"},{"key":"1212_CR9","doi-asserted-by":"crossref","unstructured":"Kaess, M., Ranganathan, A., Dellaert F.: iSAM: Incremental Smoothing and Mapping, IEEE Trans Robot (TRO), 24(6), 1365\u20131378 (2008)","DOI":"10.1109\/TRO.2008.2006706"},{"key":"1212_CR10","doi-asserted-by":"crossref","unstructured":"Kaess, M., Johannsson, H., Roberts, R. et al.: iSAM2: Incremental smoothing and mapping using the Bayes tree. Int. J. Robot. Res. 31(2), 216\u2013235 (2012)","DOI":"10.1177\/0278364911430419"},{"key":"1212_CR11","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2000","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Berlin (2000)"},{"key":"1212_CR12","doi-asserted-by":"crossref","unstructured":"Mor\u00e9, J. J.: The levenberg-marquardt algorithm: implementation and theory. In: Numerical analysis, pp. 105-116. Springer (1978)","DOI":"10.1007\/BFb0067700"},{"key":"1212_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"A Bj\u00f6rck","year":"1996","unstructured":"Bj\u00f6rck, A.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)"},{"key":"1212_CR14","unstructured":"Madsen, K., Nielsen, H., Tingleff, O.: Methods for non-linear least squares problems (2004)"},{"key":"1212_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1486525.1486527","volume":"36","author":"M Lourakis","year":"2009","unstructured":"Lourakis, M., Argyros, A.A.: SBA: A software package for generic sparse bundle adjustment. TOMS 36, 2 (2009)","journal-title":"TOMS"},{"key":"1212_CR16","doi-asserted-by":"crossref","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Croz, J. Du, Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide, Third Edition. SIAM Press, Philadelphia, (1999). LAPACK home page: http:\/\/www.netlib.org\/lapack","DOI":"10.1137\/1.9780898719604"},{"key":"1212_CR17","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1145\/355841.355847","volume":"5","author":"CL Lawson","year":"1979","unstructured":"Lawson, C.L., Hanson, R.J., Kincaid, D., Krogh, F.T.: Subprograms, basic linear algebra., for Fortran Usage, ACM Trans. Math Soft 5, 308\u2013323 (1979)","journal-title":"ACM Trans. Math Soft"},{"key":"1212_CR18","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Snavely, N., Seitz, S. M., Szeliski, R.: \u201cBundle adjustment in the large,\u201d In: Proceedings of the European Conference on Computer Vision (ECCV), pp. 29-42 (2010)","DOI":"10.1007\/978-3-642-15552-9_3"},{"key":"1212_CR19","doi-asserted-by":"crossref","unstructured":"Byr\u00f6d, M., \u00c5str\u00f6m, K.: Conjugate Gradient Bundle Adjustment. In: ECCV10, pp. II: 114\u2013127 (2010)","DOI":"10.1007\/978-3-642-15552-9_9"},{"key":"1212_CR20","doi-asserted-by":"crossref","unstructured":"Bell, N., Garland, M.: Implementing sparse matrix-vector multiplication on throughput-oriented processors. In: SC \u201309, pp. 1-11 (2009)","DOI":"10.1145\/1654059.1654078"},{"key":"1212_CR21","unstructured":"Li, R., Saad, Y.: GPU-accelerated preconditioned iterative linear solvers. Technical Report UMSI-2010-xx3, Minnesota Supercomputer Institute, University of Minnesota (2010)"},{"key":"1212_CR22","doi-asserted-by":"crossref","unstructured":"Frahm, J., Georgel, P. Fite, Gallup, D., Johnson, T., Raguram, R., Wu, C., Jen, Y., Dunn, E., Clipp, B., Lazebnik, S., Pollefeys, M.: Building rome on a cloudless day. In: ECCV10, pp. IV: 368-381 (2010)","DOI":"10.1007\/978-3-642-15561-1_27"},{"key":"1212_CR23","unstructured":"Gupta, S., Choudhary, S., Narayanan, P.J.: Practical time bundle adjustment for 3d reconstruction on gpu. In: ECCV Workshop on Computer Vision on GPUs (2010)"},{"key":"1212_CR24","doi-asserted-by":"crossref","unstructured":"Wu, C., Agarwal, S., Curless, B., Seitz, S. M.: Multicore bundle adjustment. In: Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on, pp. 3057-3064. IEEE (2011)","DOI":"10.1109\/CVPR.2011.5995552"},{"key":"1212_CR25","doi-asserted-by":"crossref","unstructured":"Li, Y., Xie, P., Chen, X., Liu, J., Yang, B., Li, S., Gong, C., Gan, X., Xu, H.: VBSF: a new storage format for SIMD sparse matrixvector multiplication on modern processors. J. Supercomput. 76, 2063\u20132081 (2020)","DOI":"10.1007\/s11227-019-02835-4"},{"issue":"1","key":"1212_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ipl.2004.01.014","volume":"90","author":"E Montagne","year":"2004","unstructured":"Montagne, E., Ekambaram, A.: An optimal storage format for sparse matrices. Inf. Process. Lett. 90(1), 87\u201392 (2004)","journal-title":"Inf. Process. Lett."},{"key":"1212_CR27","unstructured":"Vassiliadis, S., Cotofana, S. D., Stathis, P.: Block based compression storage expected performance. In: Proceedings of 14th International Conference on High Performance Computing Systems and Applications (HPCS 2000) June (2000)"},{"key":"1212_CR28","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative methods forsparse linear systems. 2nd edn. Society for Industrial and Applied Mathematics, pp. 95\u2013226 (2003)","DOI":"10.1137\/1.9780898718003"},{"key":"1212_CR29","doi-asserted-by":"publisher","unstructured":"Chen, Y., Davis, T.,Hager, W., Rajamanickam, S.: Algorithm 887: CHOLMOD, Supernodal sparse Cholesky factorization and update\/downdate. ACM Trans. Math. Softw. 35(3), 22(2008). https:\/\/doi.org\/10.1145\/1391989.1391995","DOI":"10.1145\/1391989.1391995"},{"key":"1212_CR30","doi-asserted-by":"crossref","unstructured":"Davis, T., Hager, W.: Dynamic supernodes in sparse Cholesky update\/downdate and triangular solves. ACM Trans. Math. Softw. 35(4) (2009)","DOI":"10.1145\/1462173.1462176"},{"issue":"1","key":"1212_CR31","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/974781.974783","volume":"30","author":"V Rotkin","year":"2004","unstructured":"Rotkin, V., Toledo, S.: The design and implementation of a new out-of-core sparse Cholesky factorization method. ACM Trans. Math. Softw. 30(1), 19\u201346 (2004)","journal-title":"ACM Trans. Math. Softw."}],"updated-by":[{"DOI":"10.1007\/s00138-021-01222-5","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T00:00:00Z","timestamp":1623542400000}}],"container-title":["Machine Vision and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-021-01212-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00138-021-01212-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-021-01212-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T13:04:57Z","timestamp":1627131897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00138-021-01212-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,20]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1212"],"URL":"https:\/\/doi.org\/10.1007\/s00138-021-01212-7","relation":{},"ISSN":["0932-8092","1432-1769"],"issn-type":[{"value":"0932-8092","type":"print"},{"value":"1432-1769","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,20]]},"assertion":[{"value":"2 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2021","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00138-021-01222-5","URL":"https:\/\/doi.org\/10.1007\/s00138-021-01222-5","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"81"}}