{"id":"https://openalex.org/W1571317019","doi":"https://doi.org/10.1109/iscas.2015.7169256","title":"Massively parallel KD-tree construction and nearest neighbor search algorithms","display_name":"Massively parallel KD-tree construction and nearest neighbor search algorithms","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1571317019","doi":"https://doi.org/10.1109/iscas.2015.7169256","mag":"1571317019"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2015.7169256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2015.7169256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Circuits and Systems (ISCAS)","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/A5086619427","display_name":"Linjia Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I11957088","display_name":"Michigan Technological University","ror":"https://ror.org/0036rpn28","country_code":"US","type":"education","lineage":["https://openalex.org/I11957088"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Linjia Hu","raw_affiliation_strings":["Department of Computer Science Michigan Tech, Houghton, MI, USA","Department of Computer Science, Michigan Tech, Houghton, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Michigan Tech, Houghton, MI, USA","institution_ids":["https://openalex.org/I11957088"]},{"raw_affiliation_string":"Department of Computer Science, Michigan Tech, Houghton, MI, USA","institution_ids":["https://openalex.org/I11957088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004862330","display_name":"Saeid Nooshabadi","orcid":"https://orcid.org/0000-0001-8596-1350"},"institutions":[{"id":"https://openalex.org/I11957088","display_name":"Michigan Technological University","ror":"https://ror.org/0036rpn28","country_code":"US","type":"education","lineage":["https://openalex.org/I11957088"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saeid Nooshabadi","raw_affiliation_strings":["Department of Computer Science Michigan Tech, Houghton, MI, USA","Department of Computer Science, Michigan Tech, Houghton, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Michigan Tech, Houghton, MI, USA","institution_ids":["https://openalex.org/I11957088"]},{"raw_affiliation_string":"Department of Computer Science, Michigan Tech, Houghton, MI, USA","institution_ids":["https://openalex.org/I11957088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035412745","display_name":"Majid Ahmadi","orcid":"https://orcid.org/0000-0001-5781-6754"},"institutions":[{"id":"https://openalex.org/I74413500","display_name":"University of Windsor","ror":"https://ror.org/01gw3d370","country_code":"CA","type":"education","lineage":["https://openalex.org/I74413500"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Majid Ahmadi","raw_affiliation_strings":["Department of Electrical and Computer Engineering University of Windsor, Windsor, ON, Canada","[Department of Electrical and Computer Engineering, University of Windsor, Windsor, ON, CANADA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering University of Windsor, Windsor, ON, Canada","institution_ids":["https://openalex.org/I74413500"]},{"raw_affiliation_string":"[Department of Electrical and Computer Engineering, University of Windsor, Windsor, ON, CANADA]","institution_ids":["https://openalex.org/I74413500"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0594,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.91039903,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2752","last_page":"2755"},"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.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9958000183105469,"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/speedup","display_name":"Speedup","score":0.868245005607605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8139589428901672},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.8036034107208252},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6971350908279419},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.6709532141685486},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6458616852760315},{"id":"https://openalex.org/keywords/graphics-processing-unit","display_name":"Graphics processing unit","score":0.6392043828964233},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5317320227622986},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5036813616752625},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.4839044511318207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45333796739578247},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4281593859195709},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.41176605224609375},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3449738025665283},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3058001697063446},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.2993119955062866},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19798433780670166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10763895511627197}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.868245005607605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8139589428901672},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.8036034107208252},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6971350908279419},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.6709532141685486},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6458616852760315},{"id":"https://openalex.org/C2779851693","wikidata":"https://www.wikidata.org/wiki/Q183484","display_name":"Graphics processing unit","level":2,"score":0.6392043828964233},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5317320227622986},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5036813616752625},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.4839044511318207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45333796739578247},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4281593859195709},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.41176605224609375},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3449738025665283},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3058001697063446},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.2993119955062866},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19798433780670166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10763895511627197},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscas.2015.7169256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2015.7169256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"},{"id":"pmh:oai:digitalcommons.mtu.edu:michigantech-p-2160","is_oa":false,"landing_page_url":"https://digitalcommons.mtu.edu/michigantech-p/1165","pdf_url":null,"source":{"id":"https://openalex.org/S4377196391","display_name":"Digital Commons - Michigan Tech (Michigan Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11957088","host_organization_name":"Michigan Technological University","host_organization_lineage":["https://openalex.org/I11957088"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Michigan Tech Publications, Part 1","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1848593906","https://openalex.org/W2124592110","https://openalex.org/W2151103935","https://openalex.org/W2152864241","https://openalex.org/W2153226019","https://openalex.org/W2160643963","https://openalex.org/W2165558283","https://openalex.org/W6683253545"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2026697457","https://openalex.org/W2095570436","https://openalex.org/W2280371997","https://openalex.org/W2592919442","https://openalex.org/W2359095153","https://openalex.org/W2811139923","https://openalex.org/W780552203","https://openalex.org/W2143929634","https://openalex.org/W2370413535"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"parallel":[3,20,30,39,55],"algorithms":[4,31,40,56],"for":[5,32,34],"the":[6,35,109],"construction":[7,45,82],"of":[8,23,58,98],"k":[9],"dimensional":[10,43,77,80,107,134],"tree":[11],"(KD-tree)":[12],"and":[13,46,75,83,102,118,132],"nearest":[14],"neighbor":[15],"search":[16],"(NNS)":[17],"on":[18,48,65,72],"massively":[19,54],"architecture":[21],"(MPA)":[22],"graphics":[24],"processing":[25],"unit":[26],"(GPU).":[27],"Unlike":[28],"previous":[29],"KD-tree,":[33,108],"first":[36],"time,":[37],"our":[38],"integrate":[41],"high":[42,69,76,106,133],"KD-tree":[44,81],"NNS":[47,84],"an":[49],"MPA":[50],"platform.":[51],"The":[52],"proposed":[53],"are":[57,112],"comparable":[59],"quality":[60],"as":[61],"traditional":[62],"sequential":[63],"counterparts":[64,94],"CPU,":[66],"while":[67],"achieve":[68],"speedup":[70,110],"performance":[71],"both":[73],"low":[74],"KD-tree.":[78],"Low":[79],"algorithms,":[85],"presented":[86],"in":[87],"this":[88],"paper,":[89],"outperform":[90],"their":[91],"serial":[92],"CPU":[93],"by":[95],"a":[96],"factor":[97],"up":[99],"to":[100,116],"24":[101],"218,":[103],"respectively.":[104,120],"For":[105],"factors":[111],"even":[113],"higher,":[114],"raising":[115],"30":[117],"242,":[119],"Our":[121],"implementations":[122],"will":[123],"potentially":[124],"benefit":[125],"real":[126],"time":[127],"three-dimensional":[128],"(3D)":[129],"image":[130],"registration":[131],"descriptor":[135],"matching.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}