{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T09:09:32Z","timestamp":1760346572304,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["DP130102524","DE130101775","DP160103490"],"award-info":[{"award-number":["DP130102524","DE130101775","DP160103490"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2017,4,1]]},"DOI":"10.1109\/tpami.2016.2631531","type":"journal-article","created":{"date-parts":[[2016,11,23]],"date-time":"2016-11-23T20:24:31Z","timestamp":1479932671000},"page":"758-772","source":"Crossref","is-referenced-by-count":20,"title":["Efficient Globally Optimal Consensus Maximisation with Tree Search"],"prefix":"10.1109","volume":"39","author":[{"given":"Tat-Jun","family":"Chin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pulak","family":"Purkait","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Eriksson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Suter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2016","key":"ref39"},{"year":"2016","key":"ref38"},{"journal-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving","year":"1984","author":"pearl","key":"ref33"},{"year":"2016","key":"ref32"},{"key":"ref31","first-page":"528","article-title":"Optimal\n point placement for mesh smoothing","author":"amenta","year":"1997","journal-title":"Proc 8th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940877"},{"journal-title":"Introduction to Approximation Theory","year":"1966","author":"cheney","key":"ref37"},{"key":"ref36","first-page":"1","article-title":"Fast\n algorithms for $l_\\infty$\n problems in multiview geometry","author":"agarwal","year":"2008","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref35","first-page":"1","article-title":"A fast method to minimize $l_\\infty$\n error norm for\n geometric vision problems","author":"seo","year":"2007","journal-title":"Proc IEEE 11th Int Conf Comput Vis"},{"key":"ref34","first-page":"281","article-title":"On linear-time deterministic algorithms for optimization problems in fixed\n dimensions","author":"chazelle","year":"1993","journal-title":"Proc 9th Annual ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref10","first-page":"738","article-title":"Robust fitting for multiple\n view geometry","author":"enqvist","year":"2012","journal-title":"Proc 12th Eur Conf Comput Vis"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539800"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-014-0760-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55210-3_213"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02570713"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70824"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.197"},{"key":"ref17","first-page":"287","article-title":"Quasiconvex programming","volume":"25","author":"eppstein","year":"2005","journal-title":"Combinatorial and Computational Geometry"},{"key":"ref18","first-page":"485","article-title":"Removing outliers using the $l_\\infty$\n norm","author":"sim","year":"2006","journal-title":"Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit"},{"key":"ref19","first-page":"399","article-title":"An adversarial optimization approach to efficient\n outlier removal","author":"yu","year":"2011","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90006-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995640"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/060669474"},{"key":"ref3","first-page":"1074","article-title":"Consensus set maximization with guaranteed global optimality for robust geometry\n estimation","author":"li","year":"2009","journal-title":"Proc IEEE 12th Int Conf Comput Vis"},{"key":"ref6","first-page":"803","article-title":"Globally optimal inlier set\n maximization with unknown rotation and focal length","author":"bazin","year":"2014","journal-title":"Proc 13th Eur Conf Comput Vis"},{"key":"ref29","article-title":"On the\n difficulty of approximating maximum agreement","author":"ben-david","year":"2000","journal-title":"Proc Annu Conf Comput Learn Theory"},{"key":"ref5","first-page":"3930","article-title":"Fast\n rotation search with stereographic projections for 3D registration","author":"parrabustos","year":"2014","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0914076"},{"key":"ref7","first-page":"111","article-title":"Optimal\n essential matrix estimation via inlier-set maximization","author":"yang","year":"2014","journal-title":"Proc 13th Eur Conf Comput Vis"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1992.223152"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587757"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"ref20","first-page":"1","article-title":"A practical algorithm for \n$l_\\infty$\n triangulation with outliers","author":"li","year":"2007","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"year":"2016","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298855"},{"year":"2016","key":"ref42"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90127-X"},{"year":"2016","key":"ref41"},{"key":"ref23","first-page":"1","article-title":"Efficient\n optimization for $l_\\infty$\n-problems using pseudoconvexity","author":"olsson","year":"2007","journal-title":"Proc IEEE 11th Int Conf Comput Vis"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25592-3_3"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811685"},{"key":"ref25","first-page":"255","article-title":"The\n complexity of densest region detection","author":"ben-david","year":"2000","journal-title":"Proc 13th Annu Conf Comput Learn Theory"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7870775\/07755788.pdf?arnumber=7755788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:08:21Z","timestamp":1642003701000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7755788\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,1]]},"references-count":43,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2016.2631531","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"}],"subject":[],"published":{"date-parts":[[2017,4,1]]}}}