{"id":"https://openalex.org/W2146249262","doi":"https://doi.org/10.1109/cvpr.2012.6247665","title":"Computing nearest-neighbor fields via Propagation-Assisted KD-Trees","display_name":"Computing nearest-neighbor fields via Propagation-Assisted KD-Trees","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2146249262","doi":"https://doi.org/10.1109/cvpr.2012.6247665","mag":"2146249262"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2012.6247665","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2012.6247665","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Conference on Computer Vision and Pattern Recognition","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/A5100700361","display_name":"Kaiming He","orcid":"https://orcid.org/0000-0001-7318-9658"},"institutions":[{"id":"https://openalex.org/I4210113369","display_name":"Microsoft Research Asia (China)","ror":"https://ror.org/0300m5276","country_code":"CN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Kaiming He","raw_affiliation_strings":["Microsoft Research Asia, China","Microsoft Research Asia,"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Asia, China","institution_ids":["https://openalex.org/I4210113369"]},{"raw_affiliation_string":"Microsoft Research Asia,","institution_ids":["https://openalex.org/I4210113369"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101425421","display_name":"Jian Sun","orcid":"https://orcid.org/0000-0001-6270-2698"},"institutions":[{"id":"https://openalex.org/I4210113369","display_name":"Microsoft Research Asia (China)","ror":"https://ror.org/0300m5276","country_code":"CN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jian Sun","raw_affiliation_strings":["Microsoft Research Asia, China","Microsoft Research Asia,"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Asia, China","institution_ids":["https://openalex.org/I4210113369"]},{"raw_affiliation_string":"Microsoft Research Asia,","institution_ids":["https://openalex.org/I4210113369"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100700361"],"corresponding_institution_ids":["https://openalex.org/I4210113369"],"apc_list":null,"apc_paid":null,"fwci":11.6576,"has_fulltext":false,"cited_by_count":114,"citation_normalized_percentile":{"value":0.98927507,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"118"},"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":1.0,"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":1.0,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.9987999796867371,"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/T11019","display_name":"Image Enhancement Techniques","score":0.996999979019165,"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/computer-science","display_name":"Computer science","score":0.7405072450637817},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7053223848342896},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6206534504890442},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5956101417541504},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.589510977268219},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5466211438179016},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5436689853668213},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5242429375648499},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5224524736404419},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.46200865507125854},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.437553346157074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4223315417766571},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.39527323842048645},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3448389172554016},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3147788941860199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15172243118286133},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.10574567317962646}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7405072450637817},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7053223848342896},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6206534504890442},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5956101417541504},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.589510977268219},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5466211438179016},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5436689853668213},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5242429375648499},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5224524736404419},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.46200865507125854},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.437553346157074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4223315417766571},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.39527323842048645},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3448389172554016},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3147788941860199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15172243118286133},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.10574567317962646},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cvpr.2012.6247665","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2012.6247665","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.250.9781","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.250.9781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/%7Ejiansun/papers/CVPR12_NNF.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.660.7731","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.660.7731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/en-us/um/people/kahe/publications/cvpr12nnf.pdf","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":32,"referenced_works":["https://openalex.org/W1627400044","https://openalex.org/W1763426478","https://openalex.org/W1964057156","https://openalex.org/W1968267597","https://openalex.org/W1993120651","https://openalex.org/W2024668293","https://openalex.org/W2056370875","https://openalex.org/W2066941820","https://openalex.org/W2077604257","https://openalex.org/W2088171019","https://openalex.org/W2097073572","https://openalex.org/W2099253838","https://openalex.org/W2106505277","https://openalex.org/W2107034620","https://openalex.org/W2115273023","https://openalex.org/W2116013899","https://openalex.org/W2118123209","https://openalex.org/W2144502914","https://openalex.org/W2145940484","https://openalex.org/W2147647517","https://openalex.org/W2147823818","https://openalex.org/W2162006472","https://openalex.org/W2163384417","https://openalex.org/W2165428671","https://openalex.org/W2232702494","https://openalex.org/W2292976057","https://openalex.org/W2427881153","https://openalex.org/W2534320940","https://openalex.org/W4249710618","https://openalex.org/W6636759986","https://openalex.org/W6637776403","https://openalex.org/W6683751579"],"related_works":["https://openalex.org/W2381195555","https://openalex.org/W2182477562","https://openalex.org/W2148008870","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W1558159560","https://openalex.org/W2902799860","https://openalex.org/W4289129280","https://openalex.org/W1559170227","https://openalex.org/W2145759090"],"abstract_inverted_index":{"Matching":[0],"patches":[1],"between":[2],"two":[3],"images,":[4],"also":[5,133],"known":[6],"as":[7],"computing":[8],"nearest-neighbor":[9,28],"fields,":[10],"has":[11],"been":[12],"proven":[13],"a":[14,25,59,146],"useful":[15],"technique":[16],"in":[17,90],"various":[18],"computer":[19],"vision/graphics":[20],"algorithms.":[21],"But":[22],"this":[23,45,67],"is":[24,95,106,132,138],"computationally":[26],"challenging":[27],"search":[29,62],"task,":[30],"because":[31],"both":[32],"the":[33,37,69,79,87,111,116,126],"query":[34,75],"set":[35,39],"and":[36,137],"candidate":[38],"are":[40,76],"of":[41],"image":[42],"size.":[43],"In":[44,66],"paper,":[46],"we":[47],"propose":[48],"Propagation-Assisted":[49],"KD-Trees":[50],"to":[51],"quickly":[52],"compute":[53],"an":[54],"approximate":[55],"solution.":[56],"We":[57],"develop":[58],"novel":[60],"propagation":[61],"method":[63,68,83,105,113,131],"for":[64],"kd-trees.":[65],"tree":[70,92],"nodes":[71],"checked":[72],"by":[73,123],"each":[74],"propagated":[77],"from":[78],"nearby":[80],"queries.":[81],"This":[82],"not":[84],"only":[85],"avoids":[86],"time-consuming":[88],"backtracking":[89],"traditional":[91],"methods,":[93],"but":[94],"more":[96,139],"accurate.":[97],"Experiments":[98],"on":[99],"public":[100],"data":[101],"show":[102],"that":[103],"our":[104],"10-20":[107],"times":[108,135],"faster":[109,136],"than":[110,141],"PatchMatch":[112],"[4]":[114],"at":[115,125],"same":[117,127],"accuracy,":[118],"or":[119],"reduces":[120],"its":[121],"error":[122],"70%":[124],"running":[128],"time.":[129],"Our":[130],"2-5":[134],"accurate":[140],"Coherency":[142],"Sensitive":[143],"Hashing":[144],"[22],":[145],"latest":[147],"state-of-the-art":[148],"method.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}