{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:07:51Z","timestamp":1775146071147,"version":"3.50.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2018YFB1201403"],"award-info":[{"award-number":["2018YFB1201403"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772475"],"award-info":[{"award-number":["61772475"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Henan Science and Technology Research","award":["172102210011"],"award-info":[{"award-number":["172102210011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2937967","type":"journal-article","created":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T19:56:47Z","timestamp":1567022207000},"page":"124217-124232","source":"Crossref","is-referenced-by-count":13,"title":["Loop Closure Detection Via Maximization of Mutual Information"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4694-5221","authenticated-orcid":false,"given":"Ge","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0002-9300","authenticated-orcid":false,"given":"Xiaoqiang","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangdong","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1180639.1180654"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.2296528"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.10.028"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759685"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353986"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2018.11.009"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564401"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2014.08.007"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2895826"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2898427"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-018-9736-3"},{"key":"ref27","first-page":"3051","article-title":"iBoW-LCD: An appearance-based loop-closure detection approach using incremental bags of binary words","volume":"3","author":"garciafidalgo","year":"2018","journal-title":"Proc Int Conf Robot Autom"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593376"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2013.2279412"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-010-0361-7"},{"key":"ref20","first-page":"3","article-title":"Reduced SIFT features for image retrieval and indoor localisation","volume":"322","author":"ledwich","year":"2004","journal-title":"Proc Austral Conf Robot Autom"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1177\/0278364910385483"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908090961"},{"key":"ref24","first-page":"430","article-title":"Machine learning for high-speed corner detection","author":"rosten","year":"2006","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref23","first-page":"778","article-title":"BRIEF: Binary robust independent elementary features","author":"calonder","year":"2010","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-017-9614-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2016.11.046"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.9.11.2642-2647"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.166"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917740639"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.78"},{"key":"ref55","first-page":"1865","author":"hartley","year":"2000","journal-title":"Multiple View Geometry in Computer Vision"},{"key":"ref54","article-title":"The information bottleneck: Theory and applications","author":"slonim","year":"2002"},{"key":"ref53","first-page":"1508","article-title":"The multi-feature information bottleneck with application to unsupervised image categorization","author":"lou","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238663"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408866"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345578"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.03.028"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913491297"},{"key":"ref13","first-page":"93","article-title":"RAWSEEDS: Robotics advancement through Web-publishing of sensorial and elaborated extensive data sets","author":"bonarini","year":"2009","journal-title":"Proc Int Conf Intell Robots Syst Workshop Benchmarks Robot Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915620033"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-009-9138-7"},{"key":"ref16","first-page":"2564","article-title":"ORB: An efficient alternative to SIFT or SURF","author":"rublee","year":"2012","journal-title":"Proc Int Conf Comput Vis"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2015.2496823"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref19","first-page":"404","article-title":"SURF: Speeded up robust features","volume":"110","author":"bay","year":"2006","journal-title":"Comput Vis Image Understand"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1049"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-015-9516-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2012.2197158"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.04.016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.178"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"ref49","first-page":"1","article-title":"Sparse k-means with \n$\\ell_\\infty\/\\ell_{0}$\n penalty for high-dimensional data clustering","volume":"28","author":"chang","year":"2018","journal-title":"Statist Sinica"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IVS.2014.6856457"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238368"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2430329"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006948"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.09.039"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.431"},{"key":"ref41","first-page":"2245","article-title":"Unsupervised human action categorization with consensus information bottleneck method","author":"yan","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1048"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2904554"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08817938.pdf?arnumber=8817938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:32Z","timestamp":1642005092000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8817938\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2937967","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}