{"id":"https://openalex.org/W1921592875","doi":"https://doi.org/10.5220/0004738405790587","title":"Non-rigid Surface Registration using Cover Tree based Clustering and Nearest Neighbor Search","display_name":"Non-rigid Surface Registration using Cover Tree based Clustering and Nearest Neighbor Search","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1921592875","doi":"https://doi.org/10.5220/0004738405790587","mag":"1921592875"},"language":"en","primary_location":{"id":"doi:10.5220/0004738405790587","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0004738405790587","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th International Conference on Computer Vision Theory and Applications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0004738405790587","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081954464","display_name":"Manal H. Alassaf","orcid":null},"institutions":[{"id":"https://openalex.org/I193531525","display_name":"George Washington University","ror":"https://ror.org/00y4zzh67","country_code":"US","type":"education","lineage":["https://openalex.org/I193531525"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manal H. Alassaf","raw_affiliation_strings":["Department of Computer Science, George Washington University, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, George Washington University, U.S.A","institution_ids":["https://openalex.org/I193531525"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109001465","display_name":"Yeny Yim","orcid":null},"institutions":[{"id":"https://openalex.org/I2250650973","display_name":"Samsung (South Korea)","ror":"https://ror.org/04w3jy968","country_code":"KR","type":"company","lineage":["https://openalex.org/I2250650973"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yeny Yim","raw_affiliation_strings":["Samsung Electronics, Suwon, Geonggi-Do, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Samsung Electronics, Suwon, Geonggi-Do, Republic of Korea","institution_ids":["https://openalex.org/I2250650973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009074303","display_name":"James K. Hahn","orcid":"https://orcid.org/0000-0001-6535-8175"},"institutions":[{"id":"https://openalex.org/I193531525","display_name":"George Washington University","ror":"https://ror.org/00y4zzh67","country_code":"US","type":"education","lineage":["https://openalex.org/I193531525"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James K. Hahn","raw_affiliation_strings":["Department of Computer Science, George Washington University, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, George Washington University, U.S.A","institution_ids":["https://openalex.org/I193531525"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":19.8101,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.9860207,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"579","last_page":"587"},"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.9994000196456909,"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.9994000196456909,"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/cover-tree","display_name":"Cover tree","score":0.6387454867362976},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6363356709480286},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6131365299224854},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6106317043304443},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.602121889591217},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.547879159450531},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.523841142654419},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5198824405670166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5195487141609192},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.49809980392456055},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.44336527585983276},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4344113767147064},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.43016675114631653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4263416528701782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37747928500175476},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.21017375588417053},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19751733541488647},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"Fuzzy clustering","score":0.15428835153579712},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.09850141406059265}],"concepts":[{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.6387454867362976},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6363356709480286},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6131365299224854},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6106317043304443},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.602121889591217},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.547879159450531},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.523841142654419},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5198824405670166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5195487141609192},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.49809980392456055},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.44336527585983276},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4344113767147064},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.43016675114631653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4263416528701782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37747928500175476},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.21017375588417053},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19751733541488647},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.15428835153579712},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.09850141406059265},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0004738405790587","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0004738405790587","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th International Conference on Computer Vision Theory and Applications","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0004738405790587","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0004738405790587","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th International Conference on Computer Vision Theory and Applications","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1553528672","https://openalex.org/W1621379055","https://openalex.org/W1888801276","https://openalex.org/W2042246564","https://openalex.org/W2047947369","https://openalex.org/W2049981393","https://openalex.org/W2073459066","https://openalex.org/W2087070363","https://openalex.org/W2098466221","https://openalex.org/W2099011563","https://openalex.org/W2103857226","https://openalex.org/W2115298906","https://openalex.org/W2118104180","https://openalex.org/W2123487031","https://openalex.org/W2128409098","https://openalex.org/W2133296809","https://openalex.org/W2150593711","https://openalex.org/W2153487529","https://openalex.org/W2165428671","https://openalex.org/W2165558283","https://openalex.org/W2168722300","https://openalex.org/W2169866651","https://openalex.org/W2229412420","https://openalex.org/W3089669417"],"related_works":["https://openalex.org/W1558159560","https://openalex.org/W2182477562","https://openalex.org/W2375128115","https://openalex.org/W325985789","https://openalex.org/W4246757943","https://openalex.org/W1595303882","https://openalex.org/W2085998272","https://openalex.org/W2902799860","https://openalex.org/W4289129280","https://openalex.org/W3096071782"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,50,151],"novel":[3],"non-rigid":[4],"registration":[5],"method":[6],"that":[7],"computes":[8],"the":[9,16,24,33,44,54,68,74,91,99,106,116,123,127,134,140,144,163,168,181],"correspondences":[10,26],"of":[11,73,150],"two":[12,92],"deformable":[13],"surfaces":[14,93],"using":[15],"cover":[17,51,60,86,124],"tree.":[18],"The":[19,36,59,85,118,147,172],"aim":[20],"is":[21,40,62,109,137,155],"to":[22,31,43,48,111,139],"find":[23],"correct":[25,148],"without":[27],"landmark":[28],"selection":[29],"and":[30,70,76,81,102,133,184],"reduce":[32],"computational":[34],"complexity.":[35],"source":[37,107,135,153],"surface":[38,46,57,108,136,182],"S":[39],"initially":[41],"aligned":[42],"target":[45,141,160],"T":[47],"generate":[49],"tree":[52,61,87,125],"from":[53,122,167],"densely":[55],"distributed":[56],"points.":[58],"constructed":[63],"by":[64,142,157],"taking":[65],"into":[66,94],"account":[67],"positions":[69],"normal":[71],"vectors":[72],"points":[75],"used":[77],"for":[78,130],"hierarchical":[79],"clustering":[80,89],"nearest":[82,119,170],"neighbor":[83,120],"search.":[84],"based":[88,97],"divides":[90],"several":[95],"clusters":[96],"on":[98,105,115],"geometric":[100],"features,":[101],"each":[103],"cluster":[104,114],"transformed":[110],"its":[112],"corresponding":[113],"target.":[117],"search":[121,128],"reduces":[126],"space":[129],"correspondence":[131,149,165],"computation,":[132],"deformed":[138],"optimizing":[143],"point":[145,154,161],"pairs.":[146],"given":[152],"determined":[156],"choosing":[158],"one":[159],"with":[162,176,185],"best":[164],"measure":[166],"k":[169],"neighbors.":[171],"proposed":[173],"energy":[174],"function":[175],"Jacobian":[177],"penalty":[178],"allows":[179],"deforming":[180],"accurately":[183],"less":[186],"deformation":[187],"folding.":[188]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}