{"id":"https://openalex.org/W2099859758","doi":"https://doi.org/10.1109/cbmi.2008.4564970","title":"Fast indexing method for image retrieval using tree-structured lattices","display_name":"Fast indexing method for image retrieval using tree-structured lattices","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2099859758","doi":"https://doi.org/10.1109/cbmi.2008.4564970","mag":"2099859758"},"language":"en","primary_location":{"id":"doi:10.1109/cbmi.2008.4564970","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cbmi.2008.4564970","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Workshop on Content-Based Multimedia Indexing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087327160","display_name":"Mahmoud Mejdoub","orcid":"https://orcid.org/0000-0002-9442-5784"},"institutions":[{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mahmoud Mejdoub","raw_affiliation_strings":["Universite de Nice Sophia Antipolis, Nice, Provence-Alpes-Cote d'Azu, FR","I3S Lab., Univ. of Nice-Sophia Antipolis, Nice"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universite de Nice Sophia Antipolis, Nice, Provence-Alpes-Cote d'Azu, FR","institution_ids":["https://openalex.org/I201841394"]},{"raw_affiliation_string":"I3S Lab., Univ. of Nice-Sophia Antipolis, Nice","institution_ids":["https://openalex.org/I201841394"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108198704","display_name":"Leonardo Hidd Fonteles","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Leonardo Fonteles","raw_affiliation_strings":["I3S Laboratory, CNRS and University of Nice-Sophia Antipolis, France","I3S Lab., Univ. of Nice-Sophia Antipolis, Nice"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"I3S Laboratory, CNRS and University of Nice-Sophia Antipolis, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"I3S Lab., Univ. of Nice-Sophia Antipolis, Nice","institution_ids":["https://openalex.org/I201841394"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109375544","display_name":"Chokri Ben-Amar","orcid":null},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Chokri BenAmar","raw_affiliation_strings":["Engineering National school of Sfax, Research Group on Intelligent Machines, Sfax, Tunisia","REGIM: Research Group on Intelligent Machines Engineering National school of Sfax (ENIS), BP W, 3038, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Engineering National school of Sfax, Research Group on Intelligent Machines, Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]},{"raw_affiliation_string":"REGIM: Research Group on Intelligent Machines Engineering National school of Sfax (ENIS), BP W, 3038, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038777297","display_name":"Marc Antonini","orcid":"https://orcid.org/0000-0002-7012-1735"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marc Antonini","raw_affiliation_strings":["I3S Laboratory, CNRS and University of Nice-Sophia Antipolis, France","I3S laboratory, UMR 6070 CNRS and University of Nice-Sophia Antipolis, Frensh, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"I3S Laboratory, CNRS and University of Nice-Sophia Antipolis, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"I3S laboratory, UMR 6070 CNRS and University of Nice-Sophia Antipolis, Frensh, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.065,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.79786025,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"365","last_page":"372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9993000030517578,"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/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9993000030517578,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9991000294685364,"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/T11106","display_name":"Data Management and Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/search-engine-indexing","display_name":"Search engine indexing","score":0.7656891942024231},{"id":"https://openalex.org/keywords/feature-vector","display_name":"Feature vector","score":0.6714143753051758},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.6250081658363342},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5874887704849243},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5860030651092529},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.5391941070556641},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5281534194946289},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.4835386276245117},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4811652600765228},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.46762117743492126},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.46523040533065796},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"Dimensionality reduction","score":0.45726263523101807},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43294376134872437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39239755272865295},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38421809673309326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36901772022247314},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3368206322193146},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2607812285423279},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.13970762491226196},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11349174380302429}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7656891942024231},{"id":"https://openalex.org/C83665646","wikidata":"https://www.wikidata.org/wiki/Q42139305","display_name":"Feature vector","level":2,"score":0.6714143753051758},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.6250081658363342},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5874887704849243},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5860030651092529},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.5391941070556641},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5281534194946289},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.4835386276245117},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4811652600765228},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.46762117743492126},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.46523040533065796},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.45726263523101807},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43294376134872437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39239755272865295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38421809673309326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36901772022247314},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3368206322193146},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2607812285423279},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.13970762491226196},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11349174380302429},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cbmi.2008.4564970","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cbmi.2008.4564970","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Workshop on Content-Based Multimedia Indexing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1527405406","https://openalex.org/W1541459201","https://openalex.org/W1554944419","https://openalex.org/W1999636242","https://openalex.org/W2040482685","https://openalex.org/W2070988824","https://openalex.org/W2080557335","https://openalex.org/W2091503252","https://openalex.org/W2109868644","https://openalex.org/W2125838758","https://openalex.org/W2163777369","https://openalex.org/W2171033594","https://openalex.org/W6632397832","https://openalex.org/W6633435507","https://openalex.org/W6668185170","https://openalex.org/W6683986991"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W1558159560","https://openalex.org/W3096071782","https://openalex.org/W4289129280","https://openalex.org/W2902799860","https://openalex.org/W2145759090","https://openalex.org/W2349743712"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,86],"present":[4],"a":[5,10,22,40,52,98],"new":[6],"method":[7,24],"for":[8,122],"indexing":[9,138,152],"large":[11],"amounts":[12],"of":[13,58,78,101,107,135,148],"feature":[14,33,90,111],"vectors":[15,34,91,112],"in":[16],"high":[17,123],"dimensional":[18],"space.":[19],"We":[20,125],"introduce":[21],"partitioning":[23],"based":[25],"on":[26,88,117],"lattice":[27],"vector":[28],"quantization":[29],"that":[30,85,131,142],"divides":[31],"the":[32,56,59,68,72,79,82,89,102,105,115,127,133,136,143,149,154],"progressively":[35],"into":[36],"smaller":[37],"partitions":[38],"using":[39],"finer":[41],"scaling":[42],"factor.":[43],"The":[44],"resulting":[45],"hierarchical":[46],"structure":[47,139],"is":[48,62],"then":[49],"represented":[50],"as":[51],"tree-structured":[53,144],"lattices":[54,145],"and":[55,70,75,113,140],"efficiency":[57],"similarity":[60,109],"queries":[61,120],"significantly":[63],"improved":[64],"by":[65],"utilizing":[66],"firstly":[67],"hierarchy":[69],"secondly":[71],"good":[73],"algebraic":[74],"geometry":[76],"properties":[77],"lattice.":[80],"Moreover,":[81],"dimensionality":[83],"reduction":[84],"perform":[87],"translating":[92],"from":[93],"one":[94,147],"upper":[95],"level":[96,100],"to":[97],"lower":[99],"tree":[103],"reduces":[104],"complexity":[106],"measuring":[108],"between":[110],"enhances":[114],"performance":[116,128],"nearest":[118],"neighbor":[119],"especially":[121],"dimensions.":[124],"include":[126],"test":[129],"results":[130],"verify":[132],"advantage":[134],"proposed":[137],"show":[141],"outperforms":[146],"best":[150],"standard":[151],"structure:":[153],"SR-tree.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}