{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T17:07:05Z","timestamp":1730308025987,"version":"3.28.0"},"reference-count":12,"publisher":"SPIE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,2,12]]},"DOI":"10.1117\/12.2180577","type":"proceedings-article","created":{"date-parts":[[2015,2,12]],"date-time":"2015-02-12T02:31:35Z","timestamp":1423708295000},"page":"944514","source":"Crossref","is-referenced-by-count":0,"title":["SubPatch: random kd-tree on a sub-sampled patch set for nearest neighbor field estimation"],"prefix":"10.1117","volume":"9445","author":[{"given":"Fabrizio","family":"Pedersoli","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Benini","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Adami","sequence":"additional","affiliation":[]},{"given":"Masahiro","family":"Okuda","sequence":"additional","affiliation":[]},{"given":"Riccardo","family":"Leonardi","sequence":"additional","affiliation":[]}],"member":"189","reference":[{"key":"c1","article-title":"Patchmatch: A randomized correspondence algorithm for structural image editing","volume":"24","author":"Barnes","year":"2009"},{"key":"c2","first-page":"2943","article-title":"The generalized patchmatch correspondence algorithm","volume":"2010","author":"Barnes","year":"2010"},{"key":"c3","first-page":"518529","article-title":"Similarity search in high dimensions via hashing","volume":"1999","author":"Gionis","year":"1999"},{"key":"c4","first-page":"16071614","article-title":"Coherency sensitive hashing","volume":"2011","author":"Korman","year":"2011"},{"key":"c5","first-page":"509517","article-title":"Multidimensional binary search trees used for associative searching","author":"Bentley","year":"1975"},{"key":"c6","first-page":"209226","article-title":"An algorithm for finding best matches in logarithmic expected time","author":"Friedman","year":"1977"},{"key":"c7","first-page":"18","article-title":"Optimised KD-trees for fast image descriptor matching","volume":"2008","author":"Silpa-Anan","year":"2008"},{"key":"c8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"c9","first-page":"891923","article-title":"An optimal algorithm for approximate nearest neighbor searching fixed dimensions","author":"Arya","year":"1998"},{"key":"c10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2309436"},{"key":"c11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.62"},{"key":"c12","first-page":"600612","article-title":"Image quality assessment: from error visibility to structural similarity","author":"Wang","year":"2004"}],"event":{"name":"Seventh International Conference on Machine Vision (ICMV 2014)","location":"Milan, Italy"},"container-title":["SPIE Proceedings","Seventh International Conference on Machine Vision (ICMV 2014)"],"original-title":[],"deposited":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T20:07:50Z","timestamp":1538424470000},"score":1,"resource":{"primary":{"URL":"http:\/\/proceedings.spiedigitallibrary.org\/proceeding.aspx?doi=10.1117\/12.2180577"}},"subtitle":[],"editor":[{"given":"Antanas","family":"Verikas","sequence":"first","affiliation":[]},{"given":"Branislav","family":"Vuksanovic","sequence":"additional","affiliation":[]},{"given":"Petia","family":"Radeva","sequence":"additional","affiliation":[]},{"given":"Jianhong","family":"Zhou","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2015,2,12]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1117\/12.2180577","relation":{},"ISSN":["0277-786X"],"issn-type":[{"type":"print","value":"0277-786X"}],"subject":[],"published":{"date-parts":[[2015,2,12]]}}}