{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T06:21:12Z","timestamp":1772173272283,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030012571","type":"print"},{"value":"9783030012588","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01258-8_43","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T20:35:31Z","timestamp":1538771731000},"page":"715-730","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Robust Fitting in Computer Vision: Easy or Hard?"],"prefix":"10.1007","author":[{"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":[[2018,10,6]]},"reference":[{"key":"43_CR1","volume-title":"Emerging Topics in Computer Vision","author":"P Meer","year":"2004","unstructured":"Meer, P.: Robust techniques for computer vision. In: Medioni, G., Kang, S.B. (eds.) Emerging Topics in Computer Vision. Prentice Hall, Upper Saddle River (2004)"},{"issue":"6","key":"43_CR2","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":"43_CR3","doi-asserted-by":"crossref","unstructured":"Choi, S., Kim, T., Yu, W.: Performance evaluation of RANSAC family. In: British Machine Vision Conference (BMVC) (2009)","DOI":"10.5244\/C.23.81"},{"issue":"8","key":"43_CR4","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 Anal. Mach. Intell. 35(8), 2022\u20132038 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"43_CR5","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.: Sampling minimal subsets with large spans for robust estimation. Int. J. Comput. Vis. (IJCV) 106(1), 93\u2013112 (2014)","journal-title":"Int. J. Comput. Vis. (IJCV)"},{"key":"43_CR6","unstructured":"Li, H.: Consensus set maximization with guaranteed global optimality for robust geometry estimation. In: IEEE International Conference on Computer Vision (ICCV) (2009)"},{"key":"43_CR7","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"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-33718-5_53","volume-title":"Computer Vision \u2013 ECCV 2012","author":"O Enqvist","year":"2012","unstructured":"Enqvist, O., Ask, E., Kahl, F., \u00c5str\u00f6m, K.: Robust fitting for multiple view geometry. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7572, pp. 738\u2013751. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33718-5_53"},{"issue":"7","key":"43_CR9","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.: A branch-and-bound approach to correspondence and grouping problems. IEEE Trans. Pattern Anal. Mach. Intell. 35(7), 1565\u20131576 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"43_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-10590-1_8","volume-title":"Computer Vision \u2013 ECCV 2014","author":"J Yang","year":"2014","unstructured":"Yang, J., Li, H., Jia, Y.: Optimal essential matrix estimation via inlier-set maximization. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8689, pp. 111\u2013126. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10590-1_8"},{"key":"43_CR11","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"},{"issue":"1","key":"43_CR12","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.: Tractable algorithms for robust model estimation. Int. J. Comput. Vis. 112(1), 115\u2013129 (2015)","journal-title":"Int. J. Comput. Vis."},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Chin, T.J., Purkait, P., Eriksson, A., Suter, D.: Efficient globally optimal consensus maximisation with tree search. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR) (2015)","DOI":"10.1109\/CVPR.2015.7298855"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Campbell, D., Petersson, L., Kneip, L., Li, H.: Globally-optimal inlier set maximisation for simultaneous camera pose and feature correspondence. In: IEEE International Conference on Computer Vision (ICCV) (2017)","DOI":"10.1109\/ICCV.2017.10"},{"key":"43_CR15","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W H Freeman & Co, New York (1990)"},{"key":"43_CR16","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.: Parametrized Complexity. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"issue":"4","key":"43_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.: On the least median square problem. Discret. Comput. Geom. 36(4), 593\u2013607 (2006)","journal-title":"Discret. Comput. Geom."},{"key":"43_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Berlin (2001). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Le, H., Chin, T.J., Suter, D.: An exact penalty method for locally convergent maximum consensus. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR) (2017)","DOI":"10.1109\/CVPR.2017.48"},{"key":"43_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-319-78199-0_21","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"P Purkait","year":"2018","unstructured":"Purkait, P., Zach, C., Eriksson, A.: Maximum consensus parameter estimation by reweighted $$\\ell _1$$ methods. In: Pelillo, M., Hancock, E. (eds.) EMMCVPR 2017. LNCS, vol. 10746, pp. 312\u2013327. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78199-0_21"},{"key":"43_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/978-3-030-01258-8_42","volume-title":"Computer Vision \u2013 ECCV 2018","author":"Z Cai","year":"2018","unstructured":"Cai, Z., Chin, T.J., Le, H., Suter, D.: Deterministic consensus maximization with biconvex programming. In: Ferrari, V. (ed.) ECCV 2018, Part XII. LNCS, vol. 11216, pp. 699\u2013714. Springer, Cham (2018)"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Sv\u00e4rm, L., Enqvist, O., Oskarsson, M., Kahl, F.: Accurate localization and pose estimation for large 3D models. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR) (2014)","DOI":"10.1109\/CVPR.2014.75"},{"key":"43_CR23","doi-asserted-by":"crossref","unstructured":"Parra Bustos, A., Chin, T.J.: Guaranteed outlier removal for rotation search. In: IEEE International Conference on Computer Vision (ICCV) (2015)","DOI":"10.1109\/ICCV.2015.250"},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Chin, T.J., Kee, Y.H., Eriksson, A., Neumann, F.: Guaranteed outlier removal with mixed integer linear programs. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR) (2016)","DOI":"10.1109\/CVPR.2016.631"},{"key":"43_CR25","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.: The densest hemisphere problem. Theor. Comput. Sci. 6, 93\u2013107 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"43_CR26","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.: The computational complexity of densest region detection. J. Comput. Syst. Sci. 64(1), 22\u201347 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"43_CR27","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1137\/060669474","volume":"38","author":"B Aronov","year":"2008","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SIAM J. Comput. 38(3), 899\u2013921 (2008)","journal-title":"SIAM J. Comput."},{"key":"43_CR28","unstructured":"Bernholt, T.: Robust estimators are hard to compute. Technical report 52, Technische Universit\u00e4t Dortmund (2005)"},{"key":"43_CR29","volume-title":"Introduction to Approximation Theory","author":"EW Cheney","year":"1966","unstructured":"Cheney, E.W.: Introduction to Approximation Theory. McGraw-Hill, New York (1966)"},{"key":"43_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-11269-0_16","volume-title":"Parameterized and Exact Computation","author":"P Giannopoulos","year":"2009","unstructured":"Giannopoulos, P., Knauer, C., Rote, G.: The parameterized complexity of some geometric problems in unbounded dimension. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 198\u2013209. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11269-0_16"},{"key":"43_CR31","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Parameterized_complexity"},{"issue":"4","key":"43_CR32","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On geometric optimization with few violated constraints. Discret. Comput. Geom. 14(4), 365\u2013384 (1995)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"43_CR33","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1109\/TPAMI.2016.2631531","volume":"39","author":"TJ Chin","year":"2017","unstructured":"Chin, T.J., Purkait, P., Eriksson, A., Suter, D.: Efficient globally optimal consensus maximisation with tree search. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 39(4), 758\u2013772 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI)"},{"key":"43_CR34","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.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theor. Comput. Sci. 147, 181\u2013210 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR35","unstructured":"https:\/\/en.wikipedia.org\/wiki\/2-satisfiability"},{"key":"43_CR36","unstructured":"https:\/\/en.wikipedia.org\/wiki\/L-reduction"},{"key":"43_CR37","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.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01258-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T00:46:37Z","timestamp":1664930797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-01258-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030012571","9783030012588"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01258-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eccv2018.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}