{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:32:13Z","timestamp":1760369533430,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP160103490"],"award-info":[{"award-number":["DP160103490"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s11263-019-01207-y","type":"journal-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T16:03:30Z","timestamp":1565366610000},"page":"575-587","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Robust Fitting in Computer Vision: Easy or Hard?"],"prefix":"10.1007","volume":"128","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2423-9342","authenticated-orcid":false,"given":"Tat-Jun","family":"Chin","sequence":"first","affiliation":[]},{"given":"Zhipeng","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"key":"1207_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","volume":"147","author":"E Amaldi","year":"1995","unstructured":"Amaldi, E., & Kann, V. (1995). The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoretical Computer Science, 147, 181\u2013210.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"1207_CR2","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1137\/060669474","volume":"38","author":"B Aronov","year":"2008","unstructured":"Aronov, B., & Har-Peled, S. (2008). On approximating the depth and related problems. SIAM Journal on Computing, 38(3), 899\u2013921.","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"1207_CR3","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1109\/TPAMI.2012.264","volume":"35","author":"JC Bazin","year":"2013","unstructured":"Bazin, J. C., Li, H., Kweon, I. S., Demonceaux, C., Vasseur, P., & Ikeuchi, K. (2013). A branch-and-bound approach to correspondence and grouping problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(7), 1565\u20131576.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"1207_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jcss.2001.1797","volume":"64","author":"S Ben-David","year":"2002","unstructured":"Ben-David, S., Eiron, N., & Simon, H. (2002). The computational complexity of densest region detection. Journal of Computer and System Sciences, 64(1), 22\u201347.","journal-title":"Journal of Computer and System Sciences"},{"key":"1207_CR5","unstructured":"Bernholt, T. (2005). Robust estimators are hard to compute. Technical report 52, Technische Universit\u00e4t."},{"key":"1207_CR6","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-030-01258-8_42","volume-title":"Computer Vision \u2013 ECCV 2018","author":"Zhipeng Cai","year":"2018","unstructured":"Cai, Z., Chin, T. J., Le, H., Suter, D. (2018). Deterministic consensus maximization with biconvex programming. In European conference on computer vision (ECCV)."},{"key":"1207_CR7","doi-asserted-by":"crossref","unstructured":"Campbell, D., Petersson, L., Kneip, L., Li, H. (2017). Globally-optimal inlier set maximisation for simultaneous camera pose and feature correspondence. In IEEE international conference on computer vision (ICCV).","DOI":"10.1109\/ICCV.2017.10"},{"key":"1207_CR8","volume-title":"Introduction to approximation theory","author":"EW Cheney","year":"1966","unstructured":"Cheney, E. W. (1966). Introduction to approximation theory. New York: McGraw-Hill."},{"key":"1207_CR9","doi-asserted-by":"crossref","unstructured":"Chin, T. J., Cai, Z., Neumann, F. (2018). Robust fitting in computer vision: easy or hard? In European conference on computer vision (ECCV).","DOI":"10.1007\/978-3-030-01258-8_43"},{"key":"1207_CR10","doi-asserted-by":"crossref","unstructured":"Chin, T. J., Kee, Y. H., Eriksson, A., Neumann, F. (2016). Guaranteed outlier removal with mixed integer linear programs. In IEEE computer society conference on computer vision and pattern recognition (CVPR).","DOI":"10.1109\/CVPR.2016.631"},{"key":"1207_CR11","doi-asserted-by":"crossref","unstructured":"Chin, T. J., Purkait, P., Eriksson, A., Suter, D. (2015). Efficient globally optimal consensus maximisation with tree search. In IEEE computer society conference on computer vision and pattern recognition (CVPR).","DOI":"10.1109\/CVPR.2015.7298855"},{"key":"1207_CR12","doi-asserted-by":"crossref","unstructured":"Choi, S., Kim, T., Yu, W. (2009). Performance evaluation of RANSAC family. In British machine vision conference (BMVC).","DOI":"10.5244\/C.23.81"},{"key":"1207_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F. V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., et al. (2015). Parameterized algorithms (Vol. 3). Berlin: Springer."},{"key":"1207_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parametrized complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R. G., & Fellows, M. R. (1999). Parametrized complexity. New York: Springer."},{"key":"1207_CR15","doi-asserted-by":"crossref","unstructured":"Enqvist, O., Ask, E., Kahl, F., & \u00c5str\u00f6m, K. (2012). Robust fitting for multiple view geometry. In European conference on computer vision (ECCV).","DOI":"10.1007\/978-3-642-33718-5_53"},{"issue":"1","key":"1207_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11263-014-0760-2","volume":"112","author":"O Enqvist","year":"2015","unstructured":"Enqvist, O., Ask, E., Kahl, F., & \u00c5str\u00f6m, K. (2015). Tractable algorithms for robust model estimation. International Journal of Computer Vision, 112(1), 115\u2013129.","journal-title":"International Journal of Computer Vision"},{"issue":"4","key":"1207_CR17","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00454-006-1267-6","volume":"36","author":"J Erickson","year":"2006","unstructured":"Erickson, J., Har-Peled, S., & Mount, D. M. (2006). On the least median square problem. Discrete & Computational Geometry, 36(4), 593\u2013607.","journal-title":"Discrete & Computational Geometry"},{"issue":"6","key":"1207_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. (1981). Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24(6), 381\u2013395.","journal-title":"Communications of the ACM"},{"key":"1207_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0925-7721(95)00049-6","volume":"8","author":"K Fukuda","year":"1997","unstructured":"Fukuda, K., Liebling, T. M., & Margot, F. (1997). Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. Computational Geometry, 8, 1\u201312.","journal-title":"Computational Geometry"},{"key":"1207_CR20","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M. R., & Johnson, D. S. (1990). Computers and intractability: a guide to the theory of NP-completeness. New York: W H Freeman & Co."},{"key":"1207_CR21","doi-asserted-by":"crossref","unstructured":"Geiger, A., Lenz, P., Urtasun, R. (2012). Are we ready for autonomous driving? the kitti vision benchmark suite. In Conference on computer vision and pattern recognition (CVPR).","DOI":"10.1109\/CVPR.2012.6248074"},{"key":"1207_CR22","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-11269-0_16","volume-title":"Parameterized and Exact Computation","author":"Panos Giannopoulos","year":"2009","unstructured":"Giannopoulos, P., Knauer, C., Rote, G.: The parameterized complexity of some geometric problems in unbounded dimension. In International workshop on parameterized and exact computation (IWPEC) (2009)."},{"issue":"2","key":"1207_CR23","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions Systems Science and Cybernetics, 4(2), 100\u2013107.","journal-title":"IEEE Transactions Systems Science and Cybernetics"},{"key":"1207_CR24","volume-title":"Multiple view geometry in computer vision","author":"R Hartley","year":"2003","unstructured":"Hartley, R., & Zisserman, A. (2003). Multiple view geometry in computer vision. Cambridge: Cambridge University Press."},{"key":"1207_CR25","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D. S. (1974). Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9, 256\u2013278.","journal-title":"Journal of Computer and System Sciences"},{"key":"1207_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(78)90006-3","volume":"6","author":"DS Johnson","year":"1978","unstructured":"Johnson, D. S., & Preparata, F. P. (1978). The densest hemisphere problem. Theoretical Computer Science, 6, 93\u2013107.","journal-title":"Theoretical Computer Science"},{"key":"1207_CR27","doi-asserted-by":"crossref","unstructured":"Le, H., Chin, T. J., Suter, D. (2017). An exact penalty method for locally convergent maximum consensus. In IEEE computer society conference on computer vision and pattern recognition (CVPR).","DOI":"10.1109\/CVPR.2017.48"},{"key":"1207_CR28","unstructured":"Li, H. (2009). Consensus set maximization with guaranteed global optimality for robust geometry estimation. In: IEEE international conference on computer vision (ICCV)."},{"key":"1207_CR29","doi-asserted-by":"crossref","unstructured":"Lowe, D. G. (1999) Object recognition from local scale-invariant features. In The proceedings of the seventh IEEE international conference on computer vision, 1999 (Vol.\u00a02, pp. 1150\u20131157). IEEE","DOI":"10.1109\/ICCV.1999.790410"},{"issue":"4","key":"1207_CR30","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J. (1995). On geometric optimization with few violated constraints. Discrete and Computational Geometry, 14(4), 365\u2013384.","journal-title":"Discrete and Computational Geometry"},{"key":"1207_CR31","volume-title":"Emerging topics in computer vision","author":"P Meer","year":"2004","unstructured":"Meer, P. (2004). Robust techniques for computer vision. In G. Medioni & S. B. Kang (Eds.), Emerging topics in computer vision. New York: Prentice Hall."},{"key":"1207_CR32","doi-asserted-by":"crossref","unstructured":"Parra Bustos, A., Chin, T. J., Suter, D.: Fast rotation search with stereographic projections for 3d registration. In IEEE computer society conference on computer vision and pattern recognition (CVPR) (2014)","DOI":"10.1109\/CVPR.2014.502"},{"key":"1207_CR33","doi-asserted-by":"crossref","unstructured":"Parra Bustos, A., Chin, T. J. (2015). Guaranteed outlier removal for rotation search. In IEEE international conference on computer vision (ICCV).","DOI":"10.1109\/ICCV.2015.250"},{"key":"1207_CR34","doi-asserted-by":"crossref","unstructured":"Purkait, P., Zach, C., Eriksson, A. (2017) Maximum consensus parameter estimation by reweighted L1 methods. In Energy minimization methods in computer vision and pattern recognition (EMMCVPR).","DOI":"10.1007\/978-3-319-78199-0_21"},{"issue":"8","key":"1207_CR35","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. (2013). USAC: A universal framework for random sample consensus. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(8), 2022\u20132038.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1207_CR36","doi-asserted-by":"crossref","unstructured":"Sv\u00e4rm, L., Enqvist, O., Oskarsson, M., Kahl, F. (2014). Accurate localization and pose estimation for large 3d models. In IEEE computer society conference on computer vision and pattern recognition (CVPR)","DOI":"10.1109\/CVPR.2014.75"},{"issue":"1","key":"1207_CR37","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s11263-013-0643-y","volume":"106","author":"QH Tran","year":"2014","unstructured":"Tran, Q. H., Chin, T. J., Chojnacki, W., & Suter, D. (2014). Sampling minimal subsets with large spans for robust estimation. International Journal of Computer Vision (IJCV), 106(1), 93\u2013112.","journal-title":"International Journal of Computer Vision (IJCV)"},{"key":"1207_CR38","volume-title":"Approximation algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani, V. (2001). Approximation algorithms. Berlin: Springer."},{"key":"1207_CR39","doi-asserted-by":"crossref","unstructured":"Vedaldi, A., Fulkerson, B. (2010). Vlfeat: An open and portable library of computer vision algorithms. In Proceedings of the 18th ACM international conference on Multimedia (pp. 1469\u20131472). ACM.","DOI":"10.1145\/1873951.1874249"},{"key":"1207_CR40","unstructured":"Yang, J., Li, H., Jia, Y.: Optimal essential matrix estimation via inlier-set maximization. In European conference on computer vision (ECCV)"},{"key":"1207_CR41","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Sugimoto, S., Okutomi, M.: Deterministically maximizing feasible subsystems for robust model fitting with unit norm constraints. In IEEE computer society conference on computer vision and pattern recognition (CVPR) (2011)","DOI":"10.1109\/CVPR.2011.5995640"}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-019-01207-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-019-01207-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-019-01207-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T23:08:26Z","timestamp":1596841706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-019-01207-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,9]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1207"],"URL":"https:\/\/doi.org\/10.1007\/s11263-019-01207-y","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"type":"print","value":"0920-5691"},{"type":"electronic","value":"1573-1405"}],"subject":[],"published":{"date-parts":[[2019,8,9]]},"assertion":[{"value":"29 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}