{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:29:10Z","timestamp":1694636950233},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"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. on Image Process."],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1109\/tip.2009.2028929","type":"journal-article","created":{"date-parts":[[2009,8,5]],"date-time":"2009-08-05T13:05:09Z","timestamp":1249477509000},"page":"2780-2789","source":"Crossref","is-referenced-by-count":12,"title":["Towards Optimal Indexing for Relevance Feedback in Large Image Databases$^+$"],"prefix":"10.1109","volume":"18","author":[{"given":"S.","family":"Ramaswamy","sequence":"first","affiliation":[]},{"given":"K.","family":"Rose","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"duda","year":"1996","journal-title":"Pattern Classification and Scene Analysis"},{"key":"ref38","first-page":"181","article-title":"fast adaptive mahalanobis-distance basedsearch and retrieval in image databases","author":"ramaswamy","year":"2008","journal-title":"Proc Int Conf Image Processing"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2000.855825"},{"key":"ref32","first-page":"218","article-title":"mindreader: queryingdatabases through multiple examples","author":"ishikawa","year":"1998","journal-title":"VLDB"},{"key":"ref31","first-page":"34","article-title":"one-class svm for learning in image retrieval","volume":"1","author":"chen","year":"2001","journal-title":"Proc Int Conf Image Processing"},{"key":"ref30","first-page":"937","article-title":"learning amahalanobis metric from equivalence constraints","volume":"6","author":"bar-hillel","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"ref36","first-page":"231","article-title":"similaritysearch for adaptive ellipsoid queries using spatial transformation","author":"sakurai","year":"2001","journal-title":"VLDB"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587841"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.1997.638621"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/235968.233324","article-title":"birch: an efficient dataclustering method for very large databases","author":"zhang","year":"1996","journal-title":"SIGMOD"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/34.993558"},{"key":"ref12","author":"ramakrishnan","year":"2001","journal-title":"Database Management Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1996.492202"},{"key":"ref15","first-page":"194","article-title":"a quantitative analysis and performancestudy for similarity-search methods in high-dimensional spaces","author":"weber","year":"1998","journal-title":"VLDB"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874668","author":"bellman","year":"1961","journal-title":"Adaptive Control Processes A Guided Tour"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/354756.354820"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/83.826781"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.1997.638624"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273523"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/76.927426"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2001.958036"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.790410"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/76.927424"},{"key":"ref29","first-page":"505","article-title":"distance metric learning, with application to clustering with side-information","volume":"15","author":"xing","year":"2003","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.220"},{"key":"ref8","first-page":"iii-513","article-title":"histogram intersection kernel forimage classification","volume":"3","author":"barla","year":"2003","journal-title":"Proc Int Conf Image Processing"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1990.139558"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/76.927422"},{"key":"ref9","article-title":"the pyramid match kernel: discriminativeclassification with sets of image features","volume":"2","author":"grauman","year":"2005","journal-title":"ICCV"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/2.410146"},{"key":"ref20","first-page":"381","article-title":"adaptive cluster-distance bounding forsimilarity search in image databases","volume":"6","author":"ramaswamy","year":"2007","journal-title":"Proc Int Conf Image Processing"},{"key":"ref22","first-page":"6","article-title":"ldc: enablingsearch by partial distance in a hyper-dimensional space","author":"koudas","year":"2004","journal-title":"ICDE"},{"key":"ref21","first-page":"421","article-title":"indexing the distance: an efficient method to knn processing","author":"yu","year":"2001","journal-title":"VLDB"},{"key":"ref42","first-page":"497","article-title":"towards optimal clustering for approximatesimilarity searching","volume":"2","author":"tuncel","year":"2002","journal-title":"ICME"},{"key":"ref24","first-page":"518","article-title":"similarity search in highdimensions via hashing","author":"gionis","year":"1999","journal-title":"VLDB"},{"key":"ref41","year":"0","journal-title":"CalTech 101 Data-Set"},{"key":"ref23","first-page":"21","article-title":"trading quality for time with nearest neighborsearch","author":"weber","year":"2000","journal-title":"EDBT"},{"key":"ref26","first-page":"503","article-title":"approximatenearest neighbor searching in multimedia databases","author":"ferhatosmanoglu","year":"2001","journal-title":"ICDE"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/641007.641117"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/83\/5306041\/05184910.pdf?arnumber=5184910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:59:21Z","timestamp":1633910361000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5184910\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":42,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tip.2009.2028929","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"value":"1057-7149","type":"print"},{"value":"1941-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}