{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T23:01:17Z","timestamp":1785279677309,"version":"3.55.0"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/tmm.2013.2247989","type":"journal-article","created":{"date-parts":[[2013,2,20]],"date-time":"2013-02-20T21:53:30Z","timestamp":1361397210000},"page":"1415-1430","source":"Crossref","is-referenced-by-count":23,"title":["MSIDX: Multi-Sort Indexing for Efficient Content-Based Image Search and Retrieval"],"prefix":"10.1109","volume":"15","author":[{"given":"Eleftherios","family":"Tiakas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitrios","family":"Rafailidis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anastasios","family":"Dimou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petros","family":"Daras","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000027790.02288.f2"},{"key":"ref38","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc Int Conf Very Large Data Bases (VLDB)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995709"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459388"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref30","first-page":"304","article-title":"Hamming embedding and weak geometric consistency for large scale image search","volume":"i","author":"jegou","year":"2008","journal-title":"Proc Eur Conf Computer Vision"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Contemp Math"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2004.1418846"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/1290082.1290111"},{"key":"ref62","year":"2012"},{"key":"ref61","year":"2010","journal-title":"The ImageCLEF 2010 Wikipedia Image Collection"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989430"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459389"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1126\/science.295.5552.7a","article-title":"The ISOMAP algorithm and topological stability","volume":"295","author":"balasubramanian","year":"2002","journal-title":"Science"},{"key":"ref1","author":"amsaleg","year":"2010","journal-title":"TEXMEX Datasets for Approximate Nearest Neighbor Search"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995518"},{"key":"ref23","article-title":"Locality preserving projections","author":"he","year":"2003","journal-title":"Proc NIPS"},{"key":"ref26","author":"heo","year":"2012","journal-title":"Spherical Hashing Source Codes"},{"key":"ref25","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"Proc CVPR"},{"key":"ref50","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4908.001.0001","author":"shakhnarovich","year":"2006","journal-title":"Nearest Neighbor Methods in Learning and Vision Theory and Practice"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0167-3"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376639"},{"key":"ref58","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc NIPS"},{"key":"ref57","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","author":"weber","year":"1998","journal-title":"Proc Int Conf Very Large Data Bases (VLDB)"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(86)90013-9"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584812"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2072298.2072354"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/11957959_7","author":"sivic","year":"2006","journal-title":"Toward Category-Level Object Recognition"},{"key":"ref10","first-page":"57","article-title":"Overcoming the curse of dimensionality","author":"chavez","year":"1999","journal-title":"Proc Eur Workshop Content-Based Multimedia Indexing (CBMI 99)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200060"},{"key":"ref12","first-page":"582","article-title":"Content-based image indexing","author":"chiueh","year":"1994","journal-title":"Proc Int Conf Very Large Databases (VLDB)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.5244\/C.22.50"},{"key":"ref14","first-page":"426","article-title":"M-tree: An efficient access method for similarity search in metric spaces","author":"ciaccia","year":"1997","journal-title":"Proc Int Conf Very Large Databases (VLDB)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(87)90041-X"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728174"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref19","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc Int Conf Very Large Data Bases (VLDB)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780317"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2007.09.014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234200"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"ref7","first-page":"217","article-title":"When is nearest neighbor meaningful?","author":"beyer","year":"1999","journal-title":"Proc ICDT"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.154"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79547-6_30"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","article-title":"Nonlinear dimensionality reduction by locally linear embedding","volume":"290","author":"roweis","year":"2000","journal-title":"Science"},{"key":"ref45","first-page":"1509","article-title":"Locality-sensitive binary codes from shift-invariant kernels","author":"raginsky","year":"2009","journal-title":"Proc NIPS"},{"key":"ref48","author":"samet","year":"2006","journal-title":"Foundations of Multidimensional and Metric Data Structures"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356930"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2010.04.004"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1282280.1282334"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109688"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6046\/6599014\/06466386.pdf?arnumber=6466386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:49:52Z","timestamp":1638218992000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6466386\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":62,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tmm.2013.2247989","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"value":"1520-9210","type":"print"},{"value":"1941-0077","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]}}}