{"id":"https://openalex.org/W2003187482","doi":"https://doi.org/10.1109/tpami.2014.2339821","title":"Extremely Low Bit-Rate Nearest Neighbor Search Using a Set Compression Tree","display_name":"Extremely Low Bit-Rate Nearest Neighbor Search Using a Set Compression Tree","alternate_titles":[],"publication_year":2014,"publication_date":"2014-07-17","ids":{"openalex":"https://openalex.org/W2003187482","doi":"https://doi.org/10.1109/tpami.2014.2339821","mag":"2003187482","pmid":"https://pubmed.ncbi.nlm.nih.gov/26353147"},"language":"en","primary_location":{"id":"doi:10.1109/tpami.2014.2339821","doi":"https://doi.org/10.1109/tpami.2014.2339821","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2014.2339821","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","doyens","jufo-3","medline","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2003187482"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ora.ox.ac.uk/objects/uuid:8f4155ac-164b-4152-a143-a6bda768c754/files/s8s45qb85n","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015666723","display_name":"Relja Arandjelovi\u0107","orcid":"https://orcid.org/0000-0002-9232-4023","observed_orcids":["https://orcid.org/0000-0002-9232-4023"]},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Relja Arandjelovic","raw_affiliation_strings":["Department of Engineering Science, University of Oxford, Oxford, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Engineering Science, University of Oxford, Oxford, U.K","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057678172","display_name":"Andrew Zisserman","orcid":"https://orcid.org/0000-0002-8945-8573","observed_orcids":["https://orcid.org/0000-0002-8945-8573"]},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrew Zisserman","raw_affiliation_strings":["Department of Engineering Science, University of Oxford, Oxford, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Engineering Science, University of Oxford, Oxford, U.K","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":2.7146,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.90422083,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"36","issue":"12","first_page":"2396","last_page":"2406"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximate-nearest-neighbor-search","display_name":"approximate nearest neighbor search","score":0.8980000019073486},{"id":"https://openalex.org/keywords/space-efficient-data-structures","display_name":"space-efficient data structures","score":0.5889999866485596},{"id":"https://openalex.org/keywords/sift-descriptors","display_name":"SIFT descriptors","score":0.6570000052452087},{"id":"https://openalex.org/keywords/product-quantization","display_name":"product quantization","score":0.7429999709129333},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"locality-sensitive hashing","score":0.968999981880188},{"id":"https://openalex.org/keywords/spectral-hashing","display_name":"spectral hashing","score":0.8619999885559082},{"id":"https://openalex.org/keywords/iterative-quantization","display_name":"iterative quantization","score":0.9150000214576721},{"id":"https://openalex.org/keywords/image-retrieval","display_name":"image retrieval","score":0.5230000019073486}],"concepts":[{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.7881253957748413},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7050069570541382},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5910509824752808},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.5540119409561157},{"id":"https://openalex.org/C199833920","wikidata":"https://www.wikidata.org/wiki/Q612536","display_name":"Vector quantization","level":2,"score":0.551540732383728},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5193482637405396},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5137856602668762},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4940369725227356},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.48978471755981445},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.47683945298194885},{"id":"https://openalex.org/C74912251","wikidata":"https://www.wikidata.org/wiki/Q6815727","display_name":"Memory footprint","level":2,"score":0.44389986991882324},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43590715527534485},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3876509666442871},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.36568784713745117},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tpami.2014.2339821","doi":"https://doi.org/10.1109/tpami.2014.2339821","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2014.2339821","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","doyens","jufo-3","medline","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},{"id":"pmid:26353147","doi":null,"is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/26353147","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on pattern analysis and machine intelligence","raw_type":"Journal Article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:8f4155ac-164b-4152-a143-a6bda768c754","doi":null,"is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:8f4155ac-164b-4152-a143-a6bda768c754/files/s8s45qb85n","pdf_url":"https://ora.ox.ac.uk/objects/uuid:8f4155ac-164b-4152-a143-a6bda768c754/files/s8s45qb85n","source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Journal article"}],"best_oa_location":{"id":"pmh:oai:ora.ox.ac.uk:uuid:8f4155ac-164b-4152-a143-a6bda768c754","doi":null,"is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:8f4155ac-164b-4152-a143-a6bda768c754/files/s8s45qb85n","pdf_url":"https://ora.ox.ac.uk/objects/uuid:8f4155ac-164b-4152-a143-a6bda768c754/files/s8s45qb85n","source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Journal article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2003187482.pdf","grobid_xml":"https://content.openalex.org/works/W2003187482.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W165232734","https://openalex.org/W189214596","https://openalex.org/W1556531089","https://openalex.org/W1566135517","https://openalex.org/W1627400044","https://openalex.org/W1679894842","https://openalex.org/W1881649694","https://openalex.org/W2006493005","https://openalex.org/W2012592962","https://openalex.org/W2038276547","https://openalex.org/W2039742379","https://openalex.org/W2039743183","https://openalex.org/W2053229256","https://openalex.org/W2084363474","https://openalex.org/W2111006384","https://openalex.org/W2120240539","https://openalex.org/W2124509324","https://openalex.org/W2125378448","https://openalex.org/W2131846894","https://openalex.org/W2136451880","https://openalex.org/W2145607950","https://openalex.org/W2148554573","https://openalex.org/W2148596671","https://openalex.org/W2151103935","https://openalex.org/W2171700594","https://openalex.org/W2293597654","https://openalex.org/W2752885492","https://openalex.org/W3070706509","https://openalex.org/W3106512200","https://openalex.org/W3145128584","https://openalex.org/W4235505545","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2591839778","https://openalex.org/W2124509324","https://openalex.org/W630138847","https://openalex.org/W2778749674","https://openalex.org/W7204903144","https://openalex.org/W2133995768","https://openalex.org/W2110527478","https://openalex.org/W2997668267","https://openalex.org/W7099935914","https://openalex.org/W7096969480"],"abstract_inverted_index":{"The":[0,23,93,134],"goal":[1],"of":[2,20,35,54,112,127,152,178,197],"this":[3],"work":[4],"is":[5,78,97],"a":[6,63,68,88,103,150,170,195],"data":[7],"structure":[8],"to":[9,27,80,132,149],"support":[10],"approximate":[11],"nearest":[12,123],"neighbor":[13,124],"search":[14],"on":[15,102,137,202],"very":[16,40],"large":[17,94],"scale":[18],"sets":[19],"vector":[21],"descriptors.":[22],"criteria":[24],"we":[25],"wish":[26],"optimize":[28],"are:":[29],"(i)":[30],"that":[31,43,51,73],"the":[32,36,52,55,110,117,179,199,203],"memory":[33],"footprint":[34],"representation":[37],"should":[38,58],"be":[39,59],"small":[41],"(so":[42],"it":[44],"fits":[45],"into":[46],"main":[47],"memory);":[48],"and":[49,120,141,163],"(ii)":[50],"approximation":[53],"original":[56],"vectors":[57],"accurate.":[60],"We":[61,115,192],"introduce":[62],"novel":[64],"encoding":[65],"method,":[66,135],"named":[67],"Set":[69],"Compression":[70],"Tree":[71],"(SCT),":[72],"satisfies":[74],"these":[75],"criteria.":[76],"It":[77],"able":[79],"accurately":[81],"compress":[82],"1":[83],"million":[84],"descriptors":[85,113],"using":[86,173],"only":[87],"few":[89],"bits":[90,175,189],"per":[91,190],"descriptor.":[92,191],"compression":[95],"rate":[96],"achieved":[98],"by":[99,108],"not":[100],"compressing":[101,109],"per-descriptor":[104],"basis,":[105],"but":[106],"instead":[107],"set":[111],"jointly.":[114],"describe":[116],"encoding,":[118],"decoding":[119],"use":[121,185],"for":[122],"search,":[125],"all":[126,198],"which":[128],"are":[129],"quite":[130],"straightforward":[131],"implement.":[133],"tested":[136],"standard":[138,204],"benchmarks":[139],"(SIFT1M":[140],"80":[142],"Million":[143],"Tiny":[144],"Images),":[145],"achieves":[146],"superior":[147],"performance":[148],"number":[151],"state-of-the-art":[153],"approaches,":[154,181],"including":[155],"Product":[156],"Quantization,":[157],"Locality":[158],"Sensitive":[159],"Hashing,":[160,162],"Spectral":[161],"Iterative":[164],"Quantization.":[165],"For":[166],"example,":[167],"SCT":[168],"has":[169],"lower":[171],"error":[172],"5":[174],"than":[176],"any":[177],"other":[180],"even":[182],"when":[183],"they":[184],"16":[186],"or":[187],"more":[188],"also":[193],"include":[194],"comparison":[196],"above":[200],"methods":[201],"benchmarks.":[205]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2003187482","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
