{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T16:22:05Z","timestamp":1771950125330,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030695248","type":"print"},{"value":"9783030695255","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-69525-5_29","type":"book-chapter","created":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T16:21:16Z","timestamp":1614356476000},"page":"485-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum Robust Fitting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2423-9342","authenticated-orcid":false,"given":"Tat-Jun","family":"Chin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6306-3023","authenticated-orcid":false,"given":"David","family":"Suter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1092-8921","authenticated-orcid":false,"given":"Shin-Fang","family":"Ch\u2019ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3619-2505","authenticated-orcid":false,"given":"James","family":"Quach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,27]]},"reference":[{"key":"29_CR1","unstructured":"Hartnett, K.: Q&A with Judea Pearl: to build truly intelligent machines, teach them cause and effect. (https:\/\/www.quantamagazine.org\/to-build-truly-intelligent-machines-teach-them-cause-and-effect-20180515\/. Accessed 30 May 2020"},{"issue":"1","key":"29_CR2","first-page":"1","volume":"6","author":"K Kanatani","year":"2016","unstructured":"Kanatani, K., Sugaya, Y., Kanazawa, Y.: Ellipse fitting for computer vision: implementation and applications. Synth. Lect. Comput. Vis. 6(1), 1\u2013141 (2016)","journal-title":"Synth. Lect. Comput. Vis."},{"issue":"2","key":"29_CR3","first-page":"1","volume":"7","author":"TJ Chin","year":"2017","unstructured":"Chin, T.J., Suter, D.: The maximum consensus problem: recent algorithmic advances. Synth. Lect. Comput. Vis. 7(2), 1\u2013194 (2017)","journal-title":"Synth. Lect. Comput. Vis."},{"key":"29_CR4","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, 381\u2013395 (1981)","journal-title":"Commun. ACM"},{"key":"29_CR5","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, 2022\u20132038 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Chin, T.J., Cai, Z., Neumann, F.: Robust fitting in computer vision: easy or hard? In: European Conference on Computer Vision (ECCV) (2018)","DOI":"10.1007\/978-3-030-01258-8_43"},{"key":"29_CR7","unstructured":"Bernholt, T.: Robust estimators are hard to compute. Technical Report 52, Technische Universit\u00e4t Dortmund (2005)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Touzmas, V., Antonante, P., Carlone, L.: Outlier-robust spatial perception: hardness, general-purpose algorithms, and guarantees. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS) (2019)","DOI":"10.1109\/IROS40897.2019.8968174"},{"key":"29_CR9","unstructured":"Suter, D., Tennakoon, R., Zhang, E., Chin, T.J., Bab-Hadiashar, A.: Monotone boolean functions, feasibility\/infeasibility, LP-type problems and MaxCon (2020)"},{"key":"29_CR10","unstructured":"Neven, H., Rose, G., Macready, W.G.: Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization. arXiv:0804.4457 (2008)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen, N.T.T., Kenyon, G.T.: Image classification using quantum inference on the D-Wave 2X. arXiv:1905.13215 (2019)","DOI":"10.1109\/ICRC.2018.8638596"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Golyanik, V., Theobalt, C.: A quantum computational approach to correspondence problems on point sets. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR) (2020)","DOI":"10.1109\/CVPR42600.2020.00920"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1109\/TPAMI.2007.70824","volume":"30","author":"F Kahl","year":"2008","unstructured":"Kahl, F., Hartley, R.: Multiple-view geometry under the l$$_\\infty $$-norm. IEEE Trans. Pattern Anal. Mach. Intell. 30, 1603\u20131617 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"29_CR14","unstructured":"Eppstein, D.: Quasiconvex programming. Comb. Comput. Geom. 25 (2005)"},{"key":"29_CR15","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":"29_CR16","volume-title":"Introduction to Approximation Theory","author":"EW Cheney","year":"1966","unstructured":"Cheney, E.W.: Introduction to Approximation Theory. McGraw-Hill, United States (1966)"},{"key":"29_CR17","unstructured":"Chum, O., Matas, J.: Matching with PROSAC - progressive sample consensus. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR) (2005)"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jagm.1998.0984","volume":"30","author":"N Amenta","year":"1999","unstructured":"Amenta, N., Bern, M., Eppstein, D.: Optimal point placement for mesh smoothing. J. Algorithms 30, 302\u2013322 (1999)","journal-title":"J. Algorithms"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16, 498\u2013516 (1996)","journal-title":"Algorithmica"},{"key":"29_CR20","unstructured":"(https:\/\/en.wikipedia.org\/wiki\/Hoeffding%27s_inequality)"},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26, 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"key":"29_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"key":"29_CR23","first-page":"3283","volume":"4","author":"A Ambainis","year":"2018","unstructured":"Ambainis, A.: Understanding quantum algorithms via query complexity. Int. Congr. Math. 4, 3283\u20133304 (2018)","journal-title":"Int. Congr. Math."},{"key":"29_CR24","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1017\/S0960129512000151","volume":"23","author":"DF Floess","year":"2013","unstructured":"Floess, D.F., Andersson, E., Hillery, M.: Quantum algorithms for testing Boolean functions. Math. Struc. Comput. Sci. 23, 386\u2013398 (2013)","journal-title":"Math. Struc. Comput. Sci."},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s11128-015-0954-8","volume":"14","author":"H Li","year":"2015","unstructured":"Li, H., Yang, L.: A quantum algorithm for approximating the influences of boolean functions and its applications. Quantum Inf. Process. 14, 1787\u20131797 (2015)","journal-title":"Quantum Inf. Process."},{"key":"29_CR26","volume-title":"Quantum Computing: A Gentle Introduction","author":"E Rieffel","year":"2014","unstructured":"Rieffel, E., Polak, W.: Quantum Computing: A Gentle Introduction. The MIT Press, United States (2014)"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69525-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T17:02:50Z","timestamp":1614358970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69525-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030695248","9783030695255"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69525-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","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":"accv2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/accv2020.kyoto\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"768","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"254","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}