{"id":"https://openalex.org/W2111946975","doi":"https://doi.org/10.1109/im.2003.1240235","title":"Effective nearest neighbor search for aligning and merging range images","display_name":"Effective nearest neighbor search for aligning and merging range images","publication_year":2004,"publication_date":"2004-06-22","ids":{"openalex":"https://openalex.org/W2111946975","doi":"https://doi.org/10.1109/im.2003.1240235","mag":"2111946975"},"language":"en","primary_location":{"id":"doi:10.1109/im.2003.1240235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/im.2003.1240235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth International Conference on 3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076890403","display_name":"Ryusuke Sagawa","orcid":"https://orcid.org/0000-0002-6778-8838"},"institutions":[{"id":"https://openalex.org/I4210138169","display_name":"Osaka Research Institute of Industrial Science and Technology","ror":"https://ror.org/03r38cy24","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210138169"]},{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"R. Sagawa","raw_affiliation_strings":["Institute of Scientific and Industrial Research, Osaka University, Osaka, Japan","[Inst. of Sci. & Ind. Res., Osaka Univ., Japan]"],"affiliations":[{"raw_affiliation_string":"Institute of Scientific and Industrial Research, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I4210138169","https://openalex.org/I98285908"]},{"raw_affiliation_string":"[Inst. of Sci. & Ind. Res., Osaka Univ., Japan]","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090999155","display_name":"Takeshi Masuda","orcid":"https://orcid.org/0000-0003-3449-3424"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Masuda","raw_affiliation_strings":["Institute of Industrial Science, University of Tokyo, Tokyo, Japan","university of Tokyo;"],"affiliations":[{"raw_affiliation_string":"Institute of Industrial Science, University of Tokyo, Tokyo, Japan","institution_ids":[]},{"raw_affiliation_string":"university of Tokyo;","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016258462","display_name":"Katsushi Ikeuchi","orcid":"https://orcid.org/0000-0001-9758-9357"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. Ikeuchi","raw_affiliation_strings":["Institute of Industrial Science, University of Tokyo, Tokyo, Japan","university of Tokyo;"],"affiliations":[{"raw_affiliation_string":"Institute of Industrial Science, University of Tokyo, Tokyo, Japan","institution_ids":[]},{"raw_affiliation_string":"university of Tokyo;","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076890403"],"corresponding_institution_ids":["https://openalex.org/I4210138169","https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":97.6355,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.99799561,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"79","last_page":"86"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9997000098228455,"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/T11106","display_name":"Data Management and Algorithms","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9980999827384949,"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/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.8253310918807983},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.7936237454414368},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7422208786010742},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7148275375366211},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.6736964583396912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6713215708732605},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.6467698812484741},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.6281532645225525},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6201021075248718},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5426552295684814},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.5249150395393372},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5230692028999329},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5194191932678223},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5072898268699646},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.4952069818973541},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4704400897026062},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.4623281955718994},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.41387200355529785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29299694299697876},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.1852521002292633},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.09693863987922668},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0959060788154602},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.06921988725662231}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.8253310918807983},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.7936237454414368},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7422208786010742},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7148275375366211},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.6736964583396912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6713215708732605},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.6467698812484741},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.6281532645225525},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6201021075248718},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5426552295684814},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.5249150395393372},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5230692028999329},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5194191932678223},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5072898268699646},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.4952069818973541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4704400897026062},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.4623281955718994},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41387200355529785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29299694299697876},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.1852521002292633},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.09693863987922668},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0959060788154602},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.06921988725662231},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/im.2003.1240235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/im.2003.1240235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth International Conference on 3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.411.5905","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.5905","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.am.sanken.osaka-u.ac.jp/~sagawa/pdf/3dim03_kdtree.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1502986479","https://openalex.org/W1603720607","https://openalex.org/W2009422376","https://openalex.org/W2011549544","https://openalex.org/W2024668293","https://openalex.org/W2035985308","https://openalex.org/W2049981393","https://openalex.org/W2050576295","https://openalex.org/W2066799613","https://openalex.org/W2106642566","https://openalex.org/W2108908993","https://openalex.org/W2118269922","https://openalex.org/W2120733615","https://openalex.org/W2129287653","https://openalex.org/W2144071905","https://openalex.org/W2154186675","https://openalex.org/W2165558283","https://openalex.org/W2169866651","https://openalex.org/W2229412420","https://openalex.org/W2783839609","https://openalex.org/W3034386065","https://openalex.org/W6659506054","https://openalex.org/W6678197422","https://openalex.org/W6748074329"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W4246757943","https://openalex.org/W1595303882","https://openalex.org/W1558159560","https://openalex.org/W2375128115","https://openalex.org/W2085998272","https://openalex.org/W2351157934","https://openalex.org/W325985789","https://openalex.org/W2969538544","https://openalex.org/W2795392346"],"abstract_inverted_index":{"We":[0,115],"describe":[1,141],"a":[2,11,28,51,94,112],"novel":[3],"method,":[4],"which":[5,41],"extends":[6],"the":[7,21,32,39,59,72,106,117,119,131,135,160],"search":[8,100],"algorithm":[9,96],"of":[10,31],"k-d":[12,132],"tree":[13,133],"for":[14,74],"aligning":[15,67],"and":[16,68],"merging":[17,69],"range":[18,70],"images.":[19],"If":[20],"nearest":[22,60,107],"neighbor":[23,61,108],"point":[24,53,109],"is":[25,54,76,80],"far":[26],"from":[27],"query,":[29],"many":[30,63],"leaf":[33],"nodes":[34],"must":[35],"be":[36,127],"examined":[37],"during":[38],"search,":[40],"actually":[42],"will":[43],"not":[44,55,81,99],"finish":[45],"in":[46,62,151],"logarithmic":[47],"time.":[48],"However,":[49],"such":[50,65],"distant":[52],"as":[56,58,66],"important":[57],"applications,":[64],"images;":[71],"reason":[73],"this":[75],"either":[77],"because":[78,85],"it":[79],"consequently":[82],"used":[83],"or":[84],"its":[86,155],"weight":[87],"becomes":[88],"very":[89],"small.":[90],"Thus,":[91],"we":[92,140,143,158],"propose":[93],"new":[95,146],"that":[97],"does":[98],"strictly":[101],"by":[102],"pruning":[103],"branches":[104],"if":[105,134],"lies":[110],"beyond":[111],"certain":[113],"threshold.":[114],"call":[116],"technique":[118],"bounds-overlap-threshold":[120],"(BOT)":[121],"test.":[122],"The":[123],"BOT":[124],"test":[125],"can":[126],"applied":[128,144],"without":[129],"recreating":[130],"threshold":[136],"value":[137],"changes.":[138],"Then,":[139],"how":[142],"our":[145],"method":[147],"to":[148,153],"three":[149],"applications":[150],"order":[152],"analyze":[154],"performance.":[156],"Finally,":[157],"discuss":[159],"method's":[161],"effectiveness.":[162]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}