{"id":"https://openalex.org/W2115520728","doi":null,"title":"An efficient implementation of max tree with linked list and hash table","display_name":"An efficient implementation of max tree with linked list and hash table","publication_year":2003,"publication_date":"2003-12-01","ids":{"openalex":"https://openalex.org/W2115520728","mag":"2115520728"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.8718","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.8718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cmis.csiro.au/Hugues.Talbot/dicta2003/cdrom/pdf/0299.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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/A5072178740","display_name":"Xiaoqiang Huang","orcid":"https://orcid.org/0000-0002-1005-848X","observed_orcids":["https://orcid.org/0000-0002-1005-848X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaoqiang Huang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088765304","display_name":"Mark H. Fisher","orcid":"https://orcid.org/0000-0002-8651-543X","observed_orcids":["https://orcid.org/0000-0002-8651-543X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark Fisher","raw_affiliation_strings":["School of Computing Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Sciences","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103073192","display_name":"Dan J. Smith","orcid":"https://orcid.org/0000-0001-7492-0246","observed_orcids":["https://orcid.org/0000-0001-7492-0246"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dan Smith","raw_affiliation_strings":["School of Computing Sciences"],"raw_orcid":"https://orcid.org/0000-0001-7492-0246","affiliations":[{"raw_affiliation_string":"School of Computing Sciences","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4476,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85662272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"299","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9320999979972839,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9320999979972839,"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.04149999842047691,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.009399999864399433,"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/max-tree","display_name":"max-tree","score":0.9980000257492065},{"id":"https://openalex.org/keywords/multiscale-image-representation","display_name":"multiscale image representation","score":0.8479999899864197},{"id":"https://openalex.org/keywords/mathematical-morphology","display_name":"mathematical morphology","score":0.8009999990463257},{"id":"https://openalex.org/keywords/linked-lists","display_name":"linked lists","score":0.7549999952316284},{"id":"https://openalex.org/keywords/hash-tables","display_name":"hash tables","score":1.0},{"id":"https://openalex.org/keywords/memory-efficiency","display_name":"memory efficiency","score":0.7549999952316284},{"id":"https://openalex.org/keywords/image-segmentation","display_name":"image segmentation","score":0.6710000038146973},{"id":"https://openalex.org/keywords/image-retrieval","display_name":"image retrieval","score":0.4699999988079071}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7637461423873901},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6509393453598022},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6333208084106445},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.6155641674995422},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.6129601001739502},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5943377017974854},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.5789431929588318},{"id":"https://openalex.org/C27353603","wikidata":"https://www.wikidata.org/wiki/Q16948622","display_name":"Hash tree","level":4,"score":0.5764837265014648},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5701700448989868},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5330352187156677},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.5200045704841614},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.48976874351501465},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.4861464202404022},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4657037854194641},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.45037922263145447},{"id":"https://openalex.org/C70000936","wikidata":"https://www.wikidata.org/wiki/Q4672467","display_name":"Access method","level":2,"score":0.44529256224632263},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43972620368003845},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.424062579870224},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.41929009556770325},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.41117045283317566},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.34310826659202576},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.31735479831695557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2855791449546814},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21689286828041077},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.18219009041786194},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16626238822937012},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.12943783402442932},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.08287951350212097},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.07977572083473206},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.8718","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.8718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cmis.csiro.au/Hugues.Talbot/dicta2003/cdrom/pdf/0299.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.375.7719","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.7719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aprs.org.au/dicta2003/pdf/0299.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.95.2863","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.2863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cmis.csiro.au/Hugues.Talbot/dicta2003/cdrom/pdf/0299.pdf","raw_type":"text"},{"id":"pmh:oai:ueaeprints.uea.ac.uk:23500","doi":null,"is_oa":false,"landing_page_url":"https://ueaeprints.uea.ac.uk/id/eprint/23500/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400384","display_name":"UEA Digital Repository (University of East Anglia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1118541","host_organization_name":"University of East Anglia","host_organization_lineage":["https://openalex.org/I1118541"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference or Workshop Item"},{"id":"mag:2115520728","doi":null,"is_oa":false,"landing_page_url":"https://staff.itee.uq.edu.au/lovell/aprs/dicta2003/pdf/0299.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418200","display_name":"Digital Image Computing: Techniques and Applications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Digital Image Computing: Techniques and Applications","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W11385458","https://openalex.org/W1969627771","https://openalex.org/W1970356720","https://openalex.org/W1995766089","https://openalex.org/W1997466511","https://openalex.org/W2091487275","https://openalex.org/W2115334998","https://openalex.org/W2134188917","https://openalex.org/W2146037576","https://openalex.org/W2146842130"],"related_works":["https://openalex.org/W2574209618","https://openalex.org/W2295766016","https://openalex.org/W2566235561","https://openalex.org/W6885133181","https://openalex.org/W3205563779","https://openalex.org/W2892054235","https://openalex.org/W2945883246","https://openalex.org/W2601359817","https://openalex.org/W2469505884","https://openalex.org/W1007481102"],"abstract_inverted_index":{"Abstract.":[0],"The":[1],"max":[2,33,59,121,134],"tree":[3,34,60,69,94,107,122,136],"is":[4,45],"a":[5,71,77,98],"multi-scale":[6,140],"image":[7,18,123,138,141],"representation":[8],"based":[9,137],"in":[10,128],"mathematical":[11],"morphology":[12],"which":[13,82],"has":[14],"been":[15],"applied":[16],"to":[17,46,57,70,101,105],"filtering,":[19],"segmentation,":[20],"tracking":[21],"and":[22,38,90],"information":[23,40],"retrieval.":[24],"This":[25],"paper":[26],"considers":[27],"the":[28,58,64,68,110],"problem":[29],"of":[30,87,93],"efficiently":[31],"building":[32],"structures":[35],"from":[36,41],"images":[37],"retrieving":[39],"them.":[42],"Our":[43],"aim":[44],"find":[47],"an":[48],"economical":[49],"data":[50,80,112],"structure":[51,81],"that":[52,117],"provides":[53],"fast":[54],"direct":[55,103],"access":[56,104],"nodes":[61,95],"while":[62],"keeping":[63],"memory":[65,89],"usage":[66],"for":[67,84],"minimum.":[72],"For":[73],"this":[74,119],"we":[75],"combine":[76],"linked":[78],"list":[79],"allows":[83],"dynamic":[85],"allocation":[86],"computer":[88],"flexible":[91],"management":[92],"together":[96],"with":[97],"hash":[99],"table":[100],"give":[102],"each":[106],"node":[108],"as":[109],"underlying":[111],"structure.":[113],"Experimental":[114],"results":[115],"confirm":[116],"using":[118],"approach":[120],"descriptions":[124],"can":[125],"be":[126],"built":[127],"linear":[129],"time":[130],"O(n).":[131],"Indexing":[132],"terms:":[133],"tree,":[135],"representation,":[139],"decomposition.":[142],"1":[143]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}