{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:39:18Z","timestamp":1729636758352,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/iccvw.2011.6130219","type":"proceedings-article","created":{"date-parts":[[2012,1,18]],"date-time":"2012-01-18T20:02:42Z","timestamp":1326916962000},"page":"32-39","source":"Crossref","is-referenced-by-count":7,"title":["Compressing Feature Sets with Digital Search Trees"],"prefix":"10.1109","author":[{"given":"Vijay","family":"Chandrasekhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuriy","family":"Reznik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Takacs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David M.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam S.","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radek","family":"Grzeszczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Girod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","volume":"1","author":"knuth","year":"1968","journal-title":"The Art (If Computer Programming Fundamental Algorithms"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1109\/TPAMI.2010.57"},{"key":"18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-16761-7_67","article-title":"Some further results on digital search trees","volume":"229","author":"kirschenhofer","year":"1986","journal-title":"Lec Notes Comput Sci"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1145\/1358628.1358681"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/ICAT.2007.49"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1137\/0215054"},{"year":"2009","journal-title":"Google Goggles","key":"14"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1145\/362686.362693"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1145\/1459359.1459413"},{"year":"2007","journal-title":"Kooaba","key":"21"},{"year":"1973","author":"knuth","journal-title":"The Art (If Computer Programming Sorting and Searching","key":"20"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1109\/CVPR.2006.264"},{"year":"2006","journal-title":"Nokia Point and Find","key":"23"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1214\/aop\/1176993000"},{"doi-asserted-by":"publisher","key":"25","DOI":"10.1109\/DCC.2011.12"},{"year":"1998","author":"sedgewick","journal-title":"Algorithms in C Parts 1-4 Fundamentals Data Structures Sorting Searching","key":"26"},{"doi-asserted-by":"publisher","key":"27","DOI":"10.1016\/0304-3975(91)90050-C"},{"doi-asserted-by":"publisher","key":"28","DOI":"10.1002\/9781118032770"},{"doi-asserted-by":"publisher","key":"29","DOI":"10.4108\/ICST.MOBIMEDIA2009.7406"},{"year":"2011","journal-title":"ISO\/IEC FTC SC29 WGll OlltPllt Document NI2202","article-title":"Compact descriptors for visual search: Evaluation framework","key":"3"},{"year":"2011","journal-title":"ISO\/IEC F TCI SC29 WGll Output Document N1220l","article-title":"Compact descriptors for visual search: Call for proposals","key":"2"},{"year":"2006","author":"cover","journal-title":"ElemeniS OIIn\/brmalhm Theory (Wiley Series in Telecommunications and Signal Processing)","key":"10"},{"year":"2010","journal-title":"Compressed Histogram Oj' GradienfS Binary Release","key":"1"},{"doi-asserted-by":"publisher","key":"30","DOI":"10.1016\/0304-3975(80)90073-0"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/CVPR.2009.5206733"},{"year":"2010","author":"chandrasekhar","journal-title":"Stanford Mobile Visual Search Data Set","key":"6"},{"key":"5","article-title":"Brief: Binary robust independent elementary features","author":"calonder","year":"2010","journal-title":"Pmc Oj' European conj'Erence on Computer Vision (ECCV)"},{"year":"2007","journal-title":"SnapTell","key":"4"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/DCC.2009.33"},{"key":"8","article-title":"Compressed Histogram of Gradients: A Low Bitrate Descriptor","author":"chandrasekhar","year":"2010","journal-title":"Internalional Journal of Compuler Vision s'Pecial Issue on Mobile Vision"}],"event":{"name":"2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)","start":{"date-parts":[[2011,11,6]]},"location":"Barcelona, Spain","end":{"date-parts":[[2011,11,13]]}},"container-title":["2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6114268\/6130192\/06130219.pdf?arnumber=6130219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T08:56:46Z","timestamp":1497949006000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6130219\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/iccvw.2011.6130219","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}