{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T22:08:17Z","timestamp":1761170897109,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030022235"},{"type":"electronic","value":"9783030022242"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02224-2_12","type":"book-chapter","created":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T06:34:07Z","timestamp":1538548447000},"page":"151-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Applying Compression to Hierarchical Clustering"],"prefix":"10.1007","author":[{"given":"Gilad","family":"Baruch","sequence":"first","affiliation":[]},{"given":"Shmuel Tomi","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,4]]},"reference":[{"key":"12_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7\u20139, 2007, pp. 1027\u20131035, 2007"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/11744023_32","volume-title":"Computer Vision \u2013 ECCV 2006","author":"H Bay","year":"2006","unstructured":"Bay, H., Tuytelaars, T., Van Gool, L.: SURF: speeded up robust features. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3951, pp. 404\u2013417. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11744023_32"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0306-4379(91)90030-D","volume":"16","author":"A Bookstein","year":"1991","unstructured":"Bookstein, A., Klein, S.T.: Compression of correlated bit-vectors. Inf. Syst. 16(4), 387\u2013400 (1991)","journal-title":"Inf. Syst."},{"key":"12_CR4","unstructured":"Burrows, M. and Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical report, Digital Equipment Corporation, SRC-RR-124:1\u201318 (1994)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/978-3-642-15561-1_56","volume-title":"Computer Vision \u2013 ECCV 2010","author":"M Calonder","year":"2010","unstructured":"Calonder, M., Lepetit, V., Strecha, C., Fua, P.: BRIEF: binary robust independent elementary features. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6314, pp. 778\u2013792. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15561-1_56"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Choueka, Y., Fraenkel, A.S., Klein, S.T., Segal, E.: Improved hierarchical bit-vector compression in document retrieval systems. In: SIGIR 1986, Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Pisa, Italy, 8\u201310 September 1986, pp. 88\u201396 (1986)","DOI":"10.1145\/253168.253190"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Claude, F., Nicholson, P.K., Seco, D.: Differentially encoded search trees. In: 2012 Data Compression Conference, pp. 357\u2013366 (2012)","DOI":"10.1109\/DCC.2012.42"},{"key":"12_CR8","series-title":"NATO ASI Series (Series F: Computer and Systems Sciences)","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-82456-2_12","volume-title":"Combinatorial Algorithms on Words","author":"AS Fraenkel","year":"1985","unstructured":"Fraenkel, A.S., Klein, S.T.: Novel compression of sparse bit-strings \u2013 preliminary report. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO ASI Series (Series F: Computer and Systems Sciences), vol. 12, pp. 169\u2013183. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-82456-2_12"},{"issue":"7","key":"12_CR9","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.M.: A branch and bound algorithms for computing $$k$$-nearest neighbors. IEEE Trans. Comput. 24(7), 750\u2013753 (1975)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1109\/TRO.2012.2197158","volume":"28","author":"D G\u00e1lvez-L\u00f3pez","year":"2012","unstructured":"G\u00e1lvez-L\u00f3pez, D., Tard\u00f3s, J.D.: Bags of binary words for fast place recognition in image sequences. IEEE Trans. Robot. 28(5), 1188\u20131197 (2012)","journal-title":"IEEE Trans. Robot."},{"issue":"6","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1142\/S012905410600442X","volume":"17","author":"ST Klein","year":"2006","unstructured":"Klein, S.T., Shapira, D.: Compressed pattern matching in JPEG images. Int. J. Found. Comput. Sci. 17(6), 1297\u20131306 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tcs.2015.12.021","volume":"638","author":"ST Klein","year":"2016","unstructured":"Klein, S.T., Shapira, D.: Compressed matching for feature vectors. Theor. Comput. Sci. 638, 52\u201362 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Leutenegger, S., Chli, M., Siegwart, R.Y.: BRISK: binary robust invariant scalable keypoints. In: 2011 IEEE International Conference on Computer Vision (ICCV), pp. 2548\u20132555. IEEE (2011)","DOI":"10.1109\/ICCV.2011.6126542"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91\u2013110 (2004)","journal-title":"Int. J. Comput. Vis."},{"key":"12_CR15","unstructured":"Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: VISAPP International Conference on Computer Vision Theory and Applications, pp. 331\u2013340 (2009)"},{"issue":"5","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/TRO.2015.2463671","volume":"31","author":"R Mur-Artal","year":"2015","unstructured":"Mur-Artal, R., Montiel, J.M.M., Tardos, J.D.: ORB-SLAM: a versatile and accurate monocular slam system. IEEE Trans. Robot. 31(5), 1147\u20131163 (2015)","journal-title":"IEEE Trans. Robot."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Nist\u00e9r, D., Stew\u00e9nius, H.: Scalable recognition with a vocabulary tree. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2006, New York, NY, USA, 17\u201322 June 2006, pp. 2161\u20132168 (2006)","DOI":"10.1109\/CVPR.2006.264"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/0-387-25465-X_15","volume-title":"Data Mining and Knowledge Discovery Handbook","author":"L Rokach","year":"2005","unstructured":"Rokach, L., Maimon, O.: Clustering methods. In: Maimon, O., Rokach, L. (eds.) Data Mining and Knowledge Discovery Handbook, pp. 321\u2013352. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/0-387-25465-X_15"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Rublee, E., Rabaud, V., Konolige, K., Bradski, G.: ORB: an efficient alternative to SIFT or SURF. In: IEEE International Conference on Computer Vision, ICCV 2011, Barcelona, Spain, 6\u201313 November 2011, pp. 2564\u20132571 (2011)","DOI":"10.1109\/ICCV.2011.6126544"},{"issue":"16","key":"12_CR20","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1016\/j.patrec.2012.08.006","volume":"33","author":"T Trzcinski","year":"2012","unstructured":"Trzcinski, T., Lepetit, V., Fua, P.: Thick boundaries in binary space and their influence on nearest-neighbor search. Pattern Recogn. Lett. 33(16), 2173\u20132180 (2012)","journal-title":"Pattern Recogn. Lett."}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02224-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T03:26:56Z","timestamp":1761103616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-02224-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030022235","9783030022242"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02224-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"4 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}