{"id":"https://openalex.org/W2082467967","doi":"https://doi.org/10.1109/icsmc.2010.5641701","title":"Indexing binary images using quad-tree decomposition","display_name":"Indexing binary images using quad-tree decomposition","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2082467967","doi":"https://doi.org/10.1109/icsmc.2010.5641701","mag":"2082467967"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2010.5641701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2010.5641701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Systems, Man and Cybernetics","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/A5029084257","display_name":"Saliha Aouat","orcid":"https://orcid.org/0000-0002-4022-9075"},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Saliha Aouat","raw_affiliation_strings":["LRIA Laboratory, Computer Science Department, University of Sciences and Technology, Houari-Boumediene, Algiers, Algeria","LRIA Laboratory, Computer Science Department, University of Sciences and Technology Houari, Boumediene, Algiers, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRIA Laboratory, Computer Science Department, University of Sciences and Technology, Houari-Boumediene, Algiers, Algeria","institution_ids":["https://openalex.org/I157169809"]},{"raw_affiliation_string":"LRIA Laboratory, Computer Science Department, University of Sciences and Technology Houari, Boumediene, Algiers, Algeria","institution_ids":["https://openalex.org/I157169809"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068958691","display_name":"Slimane Larabi","orcid":"https://orcid.org/0000-0001-8994-5980"},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Slimane Larabi","raw_affiliation_strings":["LRIA Laboratory, Computer Science Department, University of Sciences and Technology, Houari-Boumediene, Algiers, Algeria","LRIA Laboratory, Computer Science Department, University of Sciences and Technology Houari, Boumediene, Algiers, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRIA Laboratory, Computer Science Department, University of Sciences and Technology, Houari-Boumediene, Algiers, Algeria","institution_ids":["https://openalex.org/I157169809"]},{"raw_affiliation_string":"LRIA Laboratory, Computer Science Department, University of Sciences and Technology Houari, Boumediene, Algiers, Algeria","institution_ids":["https://openalex.org/I157169809"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6145,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85078165,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"5305","issue":null,"first_page":"3074","last_page":"3080"},"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.9995999932289124,"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.9995999932289124,"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.9995999932289124,"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.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.7024810314178467},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6829430460929871},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5600277781486511},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5462195873260498},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5457396507263184},{"id":"https://openalex.org/keywords/database-index","display_name":"Database index","score":0.5368028283119202},{"id":"https://openalex.org/keywords/quadtree","display_name":"Quadtree","score":0.5360987186431885},{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.499758243560791},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.48690903186798096},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.48236483335494995},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.48072531819343567},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.44824182987213135},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.42829224467277527},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.42792171239852905},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4147844910621643},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3692724406719208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2867288887500763},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24949848651885986},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.20891305804252625}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7024810314178467},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6829430460929871},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5600277781486511},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5462195873260498},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5457396507263184},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.5368028283119202},{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.5360987186431885},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.499758243560791},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.48690903186798096},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.48236483335494995},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.48072531819343567},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.44824182987213135},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.42829224467277527},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.42792171239852905},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4147844910621643},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3692724406719208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2867288887500763},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24949848651885986},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.20891305804252625},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2010.5641701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2010.5641701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Systems, Man and Cybernetics","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":45,"referenced_works":["https://openalex.org/W71192834","https://openalex.org/W1499413010","https://openalex.org/W1520757505","https://openalex.org/W1779898155","https://openalex.org/W1982679468","https://openalex.org/W1991947811","https://openalex.org/W2001127164","https://openalex.org/W2021361937","https://openalex.org/W2021512179","https://openalex.org/W2025299767","https://openalex.org/W2048141913","https://openalex.org/W2053179316","https://openalex.org/W2054984937","https://openalex.org/W2057175746","https://openalex.org/W2063551819","https://openalex.org/W2063606189","https://openalex.org/W2065084921","https://openalex.org/W2069727267","https://openalex.org/W2072738093","https://openalex.org/W2075727336","https://openalex.org/W2083016274","https://openalex.org/W2084293828","https://openalex.org/W2089213173","https://openalex.org/W2093028198","https://openalex.org/W2094078373","https://openalex.org/W2101609577","https://openalex.org/W2106002764","https://openalex.org/W2109779101","https://openalex.org/W2112074816","https://openalex.org/W2114766304","https://openalex.org/W2126491576","https://openalex.org/W2152229373","https://openalex.org/W2153952576","https://openalex.org/W2154607350","https://openalex.org/W2157092487","https://openalex.org/W2165702358","https://openalex.org/W2169937647","https://openalex.org/W2170640451","https://openalex.org/W2238624099","https://openalex.org/W4242599275","https://openalex.org/W6631347103","https://openalex.org/W6645919715","https://openalex.org/W6650475480","https://openalex.org/W6675410287","https://openalex.org/W6679167785"],"related_works":["https://openalex.org/W2171099959","https://openalex.org/W2026142253","https://openalex.org/W2029306088","https://openalex.org/W2388874545","https://openalex.org/W2350542925","https://openalex.org/W97492882","https://openalex.org/W2082853656","https://openalex.org/W1770616178","https://openalex.org/W2145355078","https://openalex.org/W2401320555"],"abstract_inverted_index":{"The":[0],"tree":[1],"structure":[2,116],"is":[3,71],"introduced":[4],"to":[5,79,110],"specify":[6],"block-oriented":[7],"decomposition":[8,13,75],"of":[9,43,60,66,85,102,117],"database":[10],"images.":[11],"These":[12],"structures":[14],"offer":[15],"a":[16,33,91],"fundamental":[17],"data":[18],"model":[19],"for":[20,95],"specifying":[21],"image":[22,26],"content":[23],"in":[24,30],"large":[25],"databases.":[27],"We":[28,88],"propose":[29,89],"this":[31],"paper":[32],"new":[34],"indexing":[35],"and":[36,54,106],"classification":[37],"method":[38],"based":[39],"on":[40],"the":[41,44,57,67,83,86,100,103,107,115,118],"use":[42],"quad-tree":[45,68],"structure.":[46],"3D":[47],"objects":[48],"are":[49,77],"represented":[50],"by":[51],"their":[52],"silhouettes":[53],"codified":[55],"following":[56,114],"filling":[58],"rate":[59],"each":[61],"quadrant":[62],"at":[63],"different":[64],"levels":[65,76],"subdivision.":[69],"It":[70],"shown":[72],"that":[73],"three":[74],"sufficient":[78],"efficiently":[80],"index":[81],"all":[82],"images":[84,112],"database.":[87],"also":[90],"modified":[92],"linear":[93],"codification":[94,113],"silhouettes.":[96],"Our":[97],"approach":[98],"allows":[99],"reduction":[101],"processing":[104],"time":[105],"memory":[108],"space":[109],"store":[111],"quad-tree.":[119]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}