{"id":"https://openalex.org/W2788806311","doi":"https://doi.org/10.1109/lra.2018.2856542","title":"HBST: A Hamming Distance Embedding Binary Search Tree for Feature-Based Visual Place Recognition","display_name":"HBST: A Hamming Distance Embedding Binary Search Tree for Feature-Based Visual Place Recognition","publication_year":2018,"publication_date":"2018-07-16","ids":{"openalex":"https://openalex.org/W2788806311","doi":"https://doi.org/10.1109/lra.2018.2856542","mag":"2788806311"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2018.2856542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2018.2856542","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1802.09261","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dominik Schlegel","orcid":"https://orcid.org/0000-0001-7381-8645"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Dominik Schlegel","raw_affiliation_strings":["Department of Computer, Control, and Management Engineering, La Sapienza University of Rome, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer, Control, and Management Engineering, La Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":null,"display_name":"Giorgio Grisetti","orcid":"https://orcid.org/0000-0002-8038-9989"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giorgio Grisetti","raw_affiliation_strings":["Department of Computer, Control, and Management Engineering, La Sapienza University of Rome, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer, Control, and Management Engineering, La Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":2.1274,"has_fulltext":true,"cited_by_count":49,"citation_normalized_percentile":{"value":0.90773996,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"3","issue":"4","first_page":"3741","last_page":"3748"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.8787999749183655,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.8787999749183655,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.08330000191926956,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.01720000058412552,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6496999859809875},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5928999781608582},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5331000089645386},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5302000045776367},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5030999779701233},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.48159998655319214},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.47589999437332153},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4546000063419342},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.44909998774528503},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4316999912261963}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6496999859809875},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5928999781608582},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5335000157356262},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5331000089645386},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5302000045776367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5220000147819519},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5030999779701233},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.48159998655319214},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.47589999437332153},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4546000063419342},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.44909998774528503},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4066999852657318},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.4050999879837036},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.39489999413490295},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.38499999046325684},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3434999883174896},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3416999876499176},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.3327000141143799},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.3278999924659729},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.3131999969482422},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2939000129699707},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.2904999852180481},{"id":"https://openalex.org/C64876066","wikidata":"https://www.wikidata.org/wiki/Q5141226","display_name":"Cognitive neuroscience of visual object recognition","level":3,"score":0.289900004863739},{"id":"https://openalex.org/C2779494224","wikidata":"https://www.wikidata.org/wiki/Q5645799","display_name":"Hamming space","level":5,"score":0.28529998660087585},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.28360000252723694},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.2741999924182892},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C193828747","wikidata":"https://www.wikidata.org/wiki/Q864118","display_name":"Binary image","level":4,"score":0.2646999955177307},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.259799987077713},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/lra.2018.2856542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2018.2856542","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1802.09261","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1802.09261","pdf_url":"https://arxiv.org/pdf/1802.09261","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/1182637","is_oa":true,"landing_page_url":"http://hdl.handle.net/11573/1182637","pdf_url":"http://hdl.handle.net/11573/1182637","source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1802.09261","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1802.09261","pdf_url":"https://arxiv.org/pdf/1802.09261","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1162411702","https://openalex.org/W1566135517","https://openalex.org/W1989484209","https://openalex.org/W2012592962","https://openalex.org/W2095761085","https://openalex.org/W2110405746","https://openalex.org/W2117228865","https://openalex.org/W2119605622","https://openalex.org/W2141584146","https://openalex.org/W2146020873","https://openalex.org/W2150066425","https://openalex.org/W2155695215","https://openalex.org/W2161969291","https://openalex.org/W2165558283","https://openalex.org/W2191707460","https://openalex.org/W2284029970","https://openalex.org/W2535547924","https://openalex.org/W2562131404","https://openalex.org/W2620629206","https://openalex.org/W2782811125","https://openalex.org/W2963295728","https://openalex.org/W2963592726","https://openalex.org/W6629564929","https://openalex.org/W6635734457","https://openalex.org/W6636759986","https://openalex.org/W6685012337"],"related_works":[],"abstract_inverted_index":{"Reliable":[0],"and":[1,38,46,75,80,84,96],"efficient":[2],"visual":[3],"place":[4],"recognition":[5],"is":[6,109],"a":[7,25,67,101,112],"major":[8],"building":[9],"block":[10],"of":[11,55,82,104],"modern":[12],"SLAM":[13],"systems.":[14],"Leveraging":[15],"on":[16,70,78,100],"our":[17,63,88],"prior":[18],"work,":[19],"in":[20,48],"this":[21],"letter,":[22],"we":[23,90],"present":[24],"Hamming":[26],"distance":[27],"embedding":[28],"binary":[29,35,56],"search":[30,45,64,83],"tree":[31],"(HBST)":[32],"approach":[33],"for":[34,43,94],"descriptor":[36,44,73],"matching":[37],"image":[39],"retrieval.":[40],"HBST":[41,95,108],"allows":[42],"insertion":[47],"logarithmic":[49],"time":[50],"by":[51],"exploiting":[52],"particular":[53],"properties":[54,74],"descriptors.":[57],"We":[58],"support":[59],"the":[60,71],"idea":[61],"behind":[62],"structure":[65],"with":[66],"thorough":[68],"analysis":[69],"exploited":[72],"their":[76],"effects":[77],"completeness":[79],"complexity":[81],"insertion.":[85],"To":[86],"validate":[87],"claims,":[89],"conducted":[91],"comparative":[92],"experiments":[93],"several":[97],"state-of-the-art":[98],"methods":[99],"broad":[102],"range":[103],"publicly":[105],"available":[106,110],"datasets.":[107],"as":[111],"compact":[113],"open-source":[114],"C++":[115],"header-only":[116],"library.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4}],"updated_date":"2026-03-28T08:17:26.163206","created_date":"2018-03-06T00:00:00"}