{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:17:55Z","timestamp":1742966275073,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030585419"},{"type":"electronic","value":"9783030585426"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-58542-6_28","type":"book-chapter","created":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T17:06:34Z","timestamp":1605546394000},"page":"462-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Geometric Estimation via Robust Subspace Recovery"],"prefix":"10.1007","author":[{"given":"Aoxiang","family":"Fan","sequence":"first","affiliation":[]},{"given":"Xingyu","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Junjun","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Jiayi","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,17]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Barath, D., Matas, J.: Graph-cut RANSAC. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 6733\u20136741 (2018)","DOI":"10.1109\/CVPR.2018.00704"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Barath, D., Matas, J., Noskova, J.: MAGSAC: marginalizing sample consensus. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 10197\u201310205 (2019)","DOI":"10.1109\/CVPR.2019.01044"},{"issue":"7","key":"28_CR3","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1109\/TPAMI.2012.264","volume":"35","author":"JC Bazin","year":"2012","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 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/978-3-319-10605-2_52","volume-title":"Computer Vision \u2013 ECCV 2014","author":"J-C Bazin","year":"2014","unstructured":"Bazin, J.-C., Seo, Y., Hartley, R., Pollefeys, M.: Globally optimal inlier set maximization with unknown rotation and focal length. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8690, pp. 803\u2013817. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10605-2_52"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s11263-006-0002-3","volume":"74","author":"M Brown","year":"2007","unstructured":"Brown, M., Lowe, D.G.: Automatic panoramic image stitching using invariant features. Int. J. Comput. Vis. 74(1), 59\u201373 (2007)","journal-title":"Int. J. Comput. Vis."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Cai, Z., Chin, T.J., Koltun, V.: Consensus maximization tree search revisited. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 1637\u20131645 (2019)","DOI":"10.1109\/ICCV.2019.00172"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Cai, Z., Chin, T.J., Le, H., Suter, D.: Deterministic consensus maximization with biconvex programming. In: Proceedings of the European Conference on Computer Vision, pp. 685\u2013700 (2018)","DOI":"10.1007\/978-3-030-01258-8_42"},{"key":"28_CR8","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: Proceedings of the IEEE International Conference on Computer Vision, pp. 1\u201310 (2017)","DOI":"10.1109\/ICCV.2017.10"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Chum, O., Matas, J.: Matching with PROSAC-progressive sample consensus. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 220\u2013226 (2005)","DOI":"10.1109\/CVPR.2005.221"},{"issue":"8","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/TPAMI.2007.70787","volume":"30","author":"O Chum","year":"2008","unstructured":"Chum, O., Matas, J.: Optimal randomized RANSAC. IEEE Trans. Pattern Anal. Mach. Intell. 30(8), 1472\u20131482 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-540-45243-0_31","volume-title":"Pattern Recognition","author":"O Chum","year":"2003","unstructured":"Chum, O., Matas, J., Kittler, J.: Locally optimized RANSAC. In: Michaelis, B., Krell, G. (eds.) DAGM 2003. LNCS, vol. 2781, pp. 236\u2013243. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45243-0_31"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Chum, O., Werner, T., Matas, J.: Two-view geometry estimation unaffected by a dominant plane. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 772\u2013779 (2005)","DOI":"10.1109\/CVPR.2005.354"},{"key":"28_CR13","unstructured":"Ding, T., et al.: Noisy dual principal component pursuit. In: Proceedings of the International Conference on Machine Learning, pp. 1617\u20131625 (2019)"},{"issue":"1","key":"28_CR14","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."},{"issue":"6","key":"28_CR15","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":"28_CR16","doi-asserted-by":"crossref","unstructured":"Fragoso, V., Sen, P., Rodriguez, S., Turk, M.: EVSAC: accelerating hypotheses generation by modeling matching scores with extreme value theory. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 2472\u20132479 (2013)","DOI":"10.1109\/ICCV.2013.307"},{"key":"28_CR17","volume-title":"Multiple View Geometry in Computer Vision","author":"R Hartley","year":"2003","unstructured":"Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)"},{"key":"28_CR18","unstructured":"Le, H.M., Chin, T.J., Eriksson, A., Do, T.T., Suter, D.: Deterministic approximate methods for maximum consensus robust fitting. IEEE Trans. Pattern Anal. Mach. Intell. (2019)"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Lebeda, K., Matas, J., Chum, O.: Fixing the locally optimized RANSAC-full experimental evaluation. In: Proceedings of the British Machine Vision Conference, pp. 1\u201311 (2012)","DOI":"10.5244\/C.26.95"},{"issue":"8","key":"28_CR20","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1109\/JPROC.2018.2853141","volume":"106","author":"G Lerman","year":"2018","unstructured":"Lerman, G., Maunu, T.: An overview of robust subspace recovery. Proc. IEEE 106(8), 1380\u20131410 (2018)","journal-title":"Proc. IEEE"},{"issue":"2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10208-014-9221-0","volume":"15","author":"G Lerman","year":"2015","unstructured":"Lerman, G., McCoy, M.B., Tropp, J.A., Zhang, T.: Robust computation of linear models by convex relaxation. Found. Comput. Math. 15(2), 363\u2013410 (2015)","journal-title":"Found. Comput. Math."},{"key":"28_CR22","unstructured":"Li, H.: Consensus set maximization with guaranteed global optimality for robust geometry estimation. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 1074\u20131080 (2009)"},{"issue":"5","key":"28_CR23","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s11263-018-1117-z","volume":"127","author":"J Ma","year":"2019","unstructured":"Ma, J., Zhao, J., Jiang, J., Zhou, H., Guo, X.: Locality preserving matching. Int. J. Comput. Vis. 127(5), 512\u2013531 (2019)","journal-title":"Int. J. Comput. Vis."},{"issue":"4","key":"28_CR24","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1109\/TIP.2014.2307478","volume":"23","author":"J Ma","year":"2014","unstructured":"Ma, J., Zhao, J., Tian, J., Yuille, A.L., Tu, Z.: Robust point matching via vector field consensus. IEEE Trans. Image Process. 23(4), 1706\u20131721 (2014)","journal-title":"IEEE Trans. Image Process."},{"issue":"10","key":"28_CR25","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.imavis.2004.02.009","volume":"22","author":"J Matas","year":"2004","unstructured":"Matas, J., Chum, O.: Randomized RANSAC with Td, d test. Image Vis. Comput. 22(10), 837\u2013842 (2004)","journal-title":"Image Vis. Comput."},{"issue":"5","key":"28_CR26","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/TRO.2015.2463671","volume":"31","author":"R Mur-Artal","year":"2015","unstructured":"Mur-Artal, R., Montiel, J.M.M., Tardos, J.D.: ORB-SLAM: a versatile and accurate monocular slam system. IEEE Trans. Rob. 31(5), 1147\u20131163 (2015)","journal-title":"IEEE Trans. Rob."},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Ni, K., Jin, H., Dellaert, F.: GroupSAC: efficient consensus in the presence of groupings. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 2193\u20132200 (2009)","DOI":"10.1109\/ICCV.2009.5459241"},{"key":"28_CR28","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"},{"issue":"8","key":"28_CR29","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1109\/TPAMI.2012.257","volume":"35","author":"R Raguram","year":"2012","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 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"28_CR30","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1020224303087","volume":"50","author":"PHS Torr","year":"2002","unstructured":"Torr, P.H.S.: Bayesian model estimation and selection for epipolar geometry and generic manifold fitting. Int. J. Comput. Vis. 50(1), 35\u201361 (2002)","journal-title":"Int. J. Comput. Vis."},{"key":"28_CR31","unstructured":"Torr, P.H., Nasuto, S.J., Bishop, J.M.: NAPSAC: high noise, high dimensional robust estimation-it\u2019s in the bag. In: British Machine Vision Conference (BMVC) (2002)"},{"issue":"1","key":"28_CR32","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/cviu.1999.0832","volume":"78","author":"PH Torr","year":"2000","unstructured":"Torr, P.H., Zisserman, A.: MLESAC: a new robust estimator with application to estimating image geometry. Comput. Vis. Image Underst. 78(1), 138\u2013156 (2000)","journal-title":"Comput. Vis. Image Underst."},{"issue":"1","key":"28_CR33","first-page":"684","volume":"19","author":"MC Tsakiris","year":"2018","unstructured":"Tsakiris, M.C., Vidal, R.: Dual principal component pursuit. J. Mach. Learn. Res. 19(1), 684\u2013732 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"Vincent, E., Lagani\u00e9re, R.: Detecting planar homographies in an image pair. In: Proceedings of the International Symposium on Image and Signal Processing and Analysis, pp. 182\u2013187 (2001)","DOI":"10.1109\/ISPA.2001.938625"},{"key":"28_CR35","unstructured":"Zhu, Z., Wang, Y., Robinson, D., Naiman, D., Vidal, R., Tsakiris, M.: Dual principal component pursuit: improved analysis and efficient algorithms. In: Advances in Neural Information Processing Systems, pp. 2171\u20132181 (2018)"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58542-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T00:10:13Z","timestamp":1731715813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58542-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030585419","9783030585426"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58542-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 November 2020","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":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"23 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eccv2020.eu\/","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":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5025","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":"1360","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":"27% - 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":"7","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 due to the COVID-19 pandemic. From the ECCV Workshops 249 full papers, 18 short papers, and 21 further contributions were published out of a total of 467 submissions.","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)"}}]}}