{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:38:26Z","timestamp":1740166706876,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,18]],"date-time":"2017-11-18T00:00:00Z","timestamp":1510963200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["CMUP-ERI\/TIC\/0033\/2014"],"award-info":[{"award-number":["CMUP-ERI\/TIC\/0033\/2014"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010669","name":"H2020 LEIT Information and Communication Technologies","doi-asserted-by":"publisher","award":["687605"],"award-info":[{"award-number":["687605"]}],"id":[{"id":"10.13039\/100010669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/CEC\/04516\/2013","SFRH\/BD\/95064\/2013"],"award-info":[{"award-number":["UID\/CEC\/04516\/2013","SFRH\/BD\/95064\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Multimed Info Retr"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s13735-017-0140-0","type":"journal-article","created":{"date-parts":[[2017,11,18]],"date-time":"2017-11-18T08:33:46Z","timestamp":1510994026000},"page":"57-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Balancing search space partitions by sparse coding for distributed redundant media indexing and retrieval"],"prefix":"10.1007","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9912-4235","authenticated-orcid":false,"given":"Andr\u00e9","family":"Mour\u00e3o","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Magalh\u00e3es","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,18]]},"reference":[{"issue":"11","key":"140_CR1","doi-asserted-by":"crossref","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon M, Elad M, Bruckstein A (2006) K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans Signal Process 54(11):4311\u20134322","journal-title":"IEEE Trans Signal Process"},{"key":"140_CR2","unstructured":"Aly M, Munich M, Perona P (2011) Distributed Kd-trees for retrieval from very large image collections. In: Proceedings of BMVC"},{"issue":"1","key":"140_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. ACM Commun 51(1):117\u2013122","journal-title":"ACM Commun"},{"key":"140_CR4","unstructured":"Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of ACM-SIAM SODA, pp 1027\u20131035"},{"issue":"6","key":"140_CR5","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1109\/TPAMI.2014.2361319","volume":"37","author":"A Babenko","year":"2015","unstructured":"Babenko A, Lempitsky V (2015) The inverted multi-index. IEEE Trans PAMI 37(6):1247\u20131260. https:\/\/doi.org\/10.1109\/TPAMI.2014.2361319","journal-title":"IEEE Trans PAMI"},{"key":"140_CR6","unstructured":"Babenko A, Lempitsky V (2016) Efficient indexing of billion-scale datasets of deep descriptors. In: Proceedings of IEEE CVPR"},{"issue":"3","key":"140_CR7","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/s11042-009-0339-z","volume":"47","author":"M Batko","year":"2010","unstructured":"Batko M, Falchi F, Lucchese C, Novak D, Perego R, Rabitti F, Sedmidubsky J, Zezula P (2010) Building a web-scale image similarity search system. Multimed Tool Appl 47(3):599\u2013629","journal-title":"Multimed Tool Appl"},{"key":"140_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-0450-1","volume-title":"Pattern recognition with fuzzy objective function algorithms","author":"JC Bezdek","year":"1981","unstructured":"Bezdek JC (1981) Pattern recognition with fuzzy objective function algorithms. Kluwer Academic Publishers, Norwell"},{"key":"140_CR9","doi-asserted-by":"crossref","unstructured":"Borges P, Mour\u00e3o A, Magalh\u00e3es J (2015) High-dimensional indexing by sparse approximation. In: ACM ICMR\u201915, ACM","DOI":"10.1145\/2671188.2749371"},{"key":"140_CR10","volume-title":"Information retrieval: implementing and evaluating search engines","author":"S B\u00fcttcher","year":"2010","unstructured":"B\u00fcttcher S, Clarke CL, Cormack GV (2010) Information retrieval: implementing and evaluating search engines. MIT Press, Cambridge"},{"issue":"8","key":"140_CR11","first-page":"3646","volume":"23","author":"A Cherian","year":"2014","unstructured":"Cherian A, Sra S, Morellas V, Papanikolopoulos N (2014) Efficient nearest neighbors via robust sparse hashing. IEEE TIP 23(8):3646\u20133655","journal-title":"IEEE TIP"},{"key":"140_CR12","doi-asserted-by":"crossref","unstructured":"Chum O, Philbin J, Zisserman A (2008) Near duplicate image detection: min-hash and tf-idf weighting. In: Proceedings of BMVC","DOI":"10.5244\/C.22.50"},{"key":"140_CR13","doi-asserted-by":"crossref","unstructured":"Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of SCG, ACM, pp 253\u2013262","DOI":"10.1145\/997817.997857"},{"issue":"1","key":"140_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"140_CR15","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of KDD, pp 226\u2013231"},{"key":"140_CR16","doi-asserted-by":"publisher","unstructured":"Grauman K, Fergus R (2013) Chap: Learning binary hash codes for large-scale image search. In: Machine learning for computer vision. Springer, Berlin, pp 49\u201387. https:\/\/doi.org\/10.1007\/978-3-642-28661-2_3","DOI":"10.1007\/978-3-642-28661-2_3"},{"issue":"5786","key":"140_CR17","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1126\/science.1127647","volume":"313","author":"GE Hinton","year":"2006","unstructured":"Hinton GE, Salakhutdinov RR (2006) Reducing the dimensionality of data with neural networks. Science 313(5786):504\u2013507. https:\/\/doi.org\/10.1126\/science.1127647","journal-title":"Science"},{"key":"140_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/0471667196.ess2280","volume-title":"Ridge regression","author":"AE Hoerl","year":"2004","unstructured":"Hoerl AE, Kennard RW (2004) Ridge regression. Wiley, New York. https:\/\/doi.org\/10.1002\/0471667196.ess2280"},{"issue":"1","key":"140_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou H, Douze M, Schmid C (2011) Product quantization for nearest neighbor search. IEEE Trans PAMI 33(1):117\u2013128. https:\/\/doi.org\/10.1109\/TPAMI.2010.57","journal-title":"IEEE Trans PAMI"},{"key":"140_CR20","doi-asserted-by":"crossref","unstructured":"J\u00e9gou H, Tavenard R, Douze M, Amsaleg L (2011) Searching in one billion vectors: re-rank with source coding. arXiv e-prints arXiv:1102.3828","DOI":"10.1109\/ICASSP.2011.5946540"},{"issue":"1","key":"140_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1109\/TMM.2012.2225035","volume":"15","author":"R Ji","year":"2013","unstructured":"Ji R, Duan LY, Chen J, Xie L, Yao H, Gao W (2013) Learning to distribute vocabulary indexing for scalable visual search. IEEE Trans Multimed 15(1):153\u2013166. https:\/\/doi.org\/10.1109\/TMM.2012.2225035","journal-title":"IEEE Trans Multimed"},{"key":"140_CR22","doi-asserted-by":"publisher","unstructured":"Kalantidis Y, Avrithis Y (2014) Locally optimized product quantization for approximate nearest neighbor search. In: Proceedings of IEEE CVPR, pp 2329\u20132336. https:\/\/doi.org\/10.1109\/CVPR.2014.298","DOI":"10.1109\/CVPR.2014.298"},{"key":"140_CR23","doi-asserted-by":"crossref","unstructured":"Karger D, Lehman E, Leighton T, Panigrahy R, Levine M, Lewin D (1997) Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: Proceedings of ACM STOC, STOC \u201997, pp 654\u2013663","DOI":"10.1145\/258533.258660"},{"key":"140_CR24","doi-asserted-by":"publisher","unstructured":"Kulkarni A, Callan J (2010) Document allocation policies for selective searching of distributed indexes. In: Proceedings of ACM CIKM, CIKM \u201910, pp 449\u2013458. https:\/\/doi.org\/10.1145\/1871437.1871497","DOI":"10.1145\/1871437.1871497"},{"issue":"2","key":"140_CR25","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1162\/089976600300015826","volume":"12","author":"MS Lewicki","year":"2000","unstructured":"Lewicki MS, Sejnowski TJ (2000) Learning overcomplete representations. Neural Comput 12(2):337\u2013365. https:\/\/doi.org\/10.1162\/089976600300015826","journal-title":"Neural Comput"},{"key":"140_CR26","unstructured":"Li Z, Ning H, Cao L, Zhan T, Gong Y, Huang TS (2011) Learning to search efficiently in high dimensions. In: Neural information processing systems"},{"issue":"2","key":"140_CR27","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137","journal-title":"IEEE Trans Inf Theory"},{"key":"140_CR28","doi-asserted-by":"publisher","unstructured":"Magalhaes J, Rueger S (2007) High-dimensional visual vocabularies for image retrieval. In: ACM SIGIR\u201907, ACM, New York, NY, USA, pp 815\u2013816. https:\/\/doi.org\/10.1145\/1277741.1277923","DOI":"10.1145\/1277741.1277923"},{"key":"140_CR29","doi-asserted-by":"publisher","unstructured":"Moise D, Shestakov D, Gudmundsson G, Amsaleg L (2013) Indexing and searching 100m images with map-reduce. In: ICMR\u201913, pp 17\u201324. https:\/\/doi.org\/10.1145\/2461466.2461470","DOI":"10.1145\/2461466.2461470"},{"key":"140_CR30","doi-asserted-by":"publisher","unstructured":"Mour\u00e3o A, Magalh\u00e3es Ja (2015) Scalable multimodal search with distributed indexing by sparse hashing. In: ACM ICMR\u201915, ACM, New York, NY, USA, pp 283\u2013290. https:\/\/doi.org\/10.1145\/2671188.2749310","DOI":"10.1145\/2671188.2749310"},{"key":"140_CR31","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja M, Lowe DG (2014) Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans PAMI 36:2227\u20132240","journal-title":"IEEE Trans PAMI"},{"issue":"6583","key":"140_CR32","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1038\/381607a0","volume":"381","author":"BA Olshausen","year":"1996","unstructured":"Olshausen BA, Field DJ (1996) Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature 381(6583):607\u2013609","journal-title":"Nature"},{"key":"140_CR33","doi-asserted-by":"crossref","unstructured":"Pati Y, Rezaiifar R, Krishnaprasad P (1993) Orthogonal Matching Pursuit : recursive function approximation with application to wavelet decomposition. In: Asilomar Conference on Signals, Systems and Computer","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"140_CR34","unstructured":"Raginsky M, Lazebnik S (2009) Locality-sensitive binary codes from shift-invariant kernels. In: NIPS, pp 1509\u20131517"},{"key":"140_CR35","doi-asserted-by":"crossref","unstructured":"Tavenard R, J\u00e9gou H, Amsaleg L (2011) Balancing clusters to reduce response time variability in large scale image search. In: International workshop on content-based multimedia indexing (CBMI 2011), Madrid, Spain. http:\/\/hal.inria.fr\/inria-00576886,qUAERO","DOI":"10.1109\/CBMI.2011.5972514"},{"issue":"1","key":"140_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/90.663936","volume":"6","author":"DG Thaler","year":"1998","unstructured":"Thaler DG, Ravishankar CV (1998) Using name-based mappings to increase hit rates. Trans Netw 6(1):1\u201314. https:\/\/doi.org\/10.1109\/90.663936","journal-title":"Trans Netw"},{"key":"140_CR37","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1994","unstructured":"Tibshirani R (1994) Regression shrinkage and selection via the lasso. J R Stat Soc B 58:267\u2013288","journal-title":"J R Stat Soc B"},{"issue":"11","key":"140_CR38","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1109\/TPAMI.2008.128","volume":"30","author":"A Torralba","year":"2008","unstructured":"Torralba A, Fergus R, Freeman W (2008) 80 million tiny images: a large data set for nonparametric object and scene recognition. IEEE Trans PAMI 30(11):1958\u20131970. https:\/\/doi.org\/10.1109\/TPAMI.2008.128","journal-title":"IEEE Trans PAMI"},{"key":"140_CR39","unstructured":"Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of VLDB, pp 194\u2013205"},{"issue":"1","key":"140_CR40","first-page":"6","volume":"9","author":"Y Weiss","year":"2008","unstructured":"Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. NIPS 9(1):6","journal-title":"NIPS"},{"key":"140_CR41","first-page":"556","volume":"3","author":"Z Yang","year":"2009","unstructured":"Yang Z, Kamata SI, Ahrary A (2009) NIR: content based image retrieval on cloud computing. Proc ICIS 3:556\u2013559","journal-title":"Proc ICIS"},{"key":"140_CR42","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou H, Hastie T (2005) Regularization and variable selection via the elastic net. J R Stat Soc B 67:301\u2013320","journal-title":"J R Stat Soc B"}],"container-title":["International Journal of Multimedia Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13735-017-0140-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13735-017-0140-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13735-017-0140-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T19:36:33Z","timestamp":1719603393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13735-017-0140-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,18]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s13735-017-0140-0","relation":{},"ISSN":["2192-6611","2192-662X"],"issn-type":[{"type":"print","value":"2192-6611"},{"type":"electronic","value":"2192-662X"}],"subject":[],"published":{"date-parts":[[2017,11,18]]}}}