{"id":"https://openalex.org/W2018210230","doi":"https://doi.org/10.1117/12.477575","title":"Adaptable recursive binary entropy coding technique","display_name":"Adaptable recursive binary entropy coding technique","publication_year":2002,"publication_date":"2002-07-31","ids":{"openalex":"https://openalex.org/W2018210230","doi":"https://doi.org/10.1117/12.477575","mag":"2018210230"},"language":"en","primary_location":{"id":"doi:10.1117/12.477575","doi":"https://doi.org/10.1117/12.477575","is_oa":false,"landing_page_url":"https://doi.org/10.1117/12.477575","pdf_url":null,"source":{"id":"https://openalex.org/S183492911","display_name":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","issn_l":"0277-786X","issn":["0277-786X","1996-756X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310315543","host_organization_name":"SPIE","host_organization_lineage":["https://openalex.org/P4310315543"],"host_organization_lineage_names":["SPIE"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SPIE Proceedings","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2018210230"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5028494392","display_name":"Aaron B. Kiely","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron B. Kiely","raw_affiliation_strings":["Jet Propulsion Lab. (United States)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jet Propulsion Lab. (United States)","institution_ids":["https://openalex.org/I1334627681"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113499779","display_name":"M. Klimesh","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew A. Klimesh","raw_affiliation_strings":["Jet Propulsion Lab. (United States)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jet Propulsion Lab. (United States)","institution_ids":["https://openalex.org/I1334627681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1334627681"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4736","issue":null,"first_page":"151","last_page":"165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.019999999552965164,"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/T10741","display_name":"Video Coding and Compression Technologies","score":9.999999747378752e-05,"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/adaptive-data-compression","display_name":"adaptive compression","score":0.5360000133514404},{"id":"https://openalex.org/keywords/arithmetic-coding","display_name":"arithmetic coding","score":0.722000002861023},{"id":"https://openalex.org/keywords/low-complexity-decoder","display_name":"low-complexity decoder","score":0.6840000152587891},{"id":"https://openalex.org/keywords/redundancy","display_name":"redundancy","score":0.30300000309944153}],"concepts":[{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.7049009799957275},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.6734442114830017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.664340615272522},{"id":"https://openalex.org/C153338461","wikidata":"https://www.wikidata.org/wiki/Q2651","display_name":"Arithmetic coding","level":4,"score":0.6342418193817139},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.6310157775878906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6164705157279968},{"id":"https://openalex.org/C1769480","wikidata":"https://www.wikidata.org/wiki/Q1345239","display_name":"Entropy encoding","level":3,"score":0.5807898044586182},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5772298574447632},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.5163673162460327},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4805631935596466},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4600079357624054},{"id":"https://openalex.org/C57890076","wikidata":"https://www.wikidata.org/wiki/Q4680725","display_name":"Adaptive coding","level":4,"score":0.4539496898651123},{"id":"https://openalex.org/C135534801","wikidata":"https://www.wikidata.org/wiki/Q1128721","display_name":"Context-adaptive variable-length coding","level":4,"score":0.44881245493888855},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.44590675830841064},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4273656904697418},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.418249249458313},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38347578048706055},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.29934337735176086},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.26218917965888977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2312188446521759},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1117/12.477575","doi":"https://doi.org/10.1117/12.477575","is_oa":false,"landing_page_url":"https://doi.org/10.1117/12.477575","pdf_url":null,"source":{"id":"https://openalex.org/S183492911","display_name":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","issn_l":"0277-786X","issn":["0277-786X","1996-756X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310315543","host_organization_name":"SPIE","host_organization_lineage":["https://openalex.org/P4310315543"],"host_organization_lineage_names":["SPIE"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SPIE Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W77457130","https://openalex.org/W788498898","https://openalex.org/W1482847149","https://openalex.org/W1860214409","https://openalex.org/W2072210981","https://openalex.org/W2107927941","https://openalex.org/W2113112672","https://openalex.org/W2129652681","https://openalex.org/W2135083501","https://openalex.org/W2151638213","https://openalex.org/W2911940095"],"related_works":["https://openalex.org/W7100148972","https://openalex.org/W146706211","https://openalex.org/W2126701846","https://openalex.org/W77457130","https://openalex.org/W2102274374","https://openalex.org/W1971684295","https://openalex.org/W1604927173","https://openalex.org/W2274789144","https://openalex.org/W2041118088","https://openalex.org/W4301785195"],"abstract_inverted_index":{"We":[0,175,183],"present":[1,184],"a":[2,53,71,80,136],"novel":[3],"data":[4,47],"compression":[5,26,48,163],"technique,":[6],"called":[7],"recursive":[8,16],"interleaved":[9,121],"entropy":[10,122],"coding,":[11,129],"that":[12,62,73,96,107,167],"is":[13,74,93,143],"based":[14],"on":[15,110],"interleaving":[17,154],"of":[18,60,135,148,159],"variable-to":[19],"variable":[20],"length":[21],"binary":[22],"source":[23],"codes.":[24],"A":[25],"module":[27],"implementing":[28],"this":[29,114],"technique":[30,92],"has":[31,84,102],"the":[32,43,68,77,82,133,146,153],"same":[33],"functionality":[34],"as":[35,42,190,192],"arithmetic":[36,128],"coding":[37,123],"and":[38,138,151,162,179,187],"can":[39,172],"be":[40,100,173],"used":[41],"engine":[44],"in":[45,70,95,145,152],"various":[46],"algorithms.":[49],"The":[50,87],"encoder":[51],"compresses":[52],"bit":[54,98],"sequence":[55],"by":[56],"recursively":[57],"encoding":[58,88,186],"groups":[59],"bits":[61],"have":[63,125],"similar":[64],"estimated":[65],"statistics,":[66],"ordering":[67],"output":[69],"way":[72],"suited":[75],"to":[76,99],"decoder.":[78,140],"As":[79],"result,":[81],"decoder":[83],"low":[85],"complexity.":[86],"process":[89],"for":[90],"our":[91],"adaptable":[94],"each":[97],"encoded":[101,112],"an":[103],"associated":[104],"probability-of-zero":[105],"estimate":[106],"may":[108,124],"depend":[109],"previously":[111],"bits;":[113],"adaptability":[115],"allows":[116],"more":[117],"effective":[118],"compression.":[119],"Recursive":[120],"advantages":[126],"over":[127],"including":[130],"most":[131],"notably":[132],"admission":[134],"simple":[137],"fast":[139],"Much":[141],"variation":[142],"possible":[144],"choice":[147],"component":[149],"codes":[150],"structure,":[155],"yielding":[156],"coder":[157,165,177],"designs":[158,166],"varying":[160],"complexity":[161],"efficiency;":[164],"achieve":[168],"arbitrarily":[169],"small":[170],"redundancy":[171],"produced.":[174],"discuss":[176],"design":[178],"performance":[180,194],"estimation":[181],"methods.":[182],"practical":[185],"decoding":[188],"algorithms,":[189],"well":[191],"measured":[193],"results.":[195]},"counts_by_year":[],"updated_date":"2026-09-22T06:50:58.402377","created_date":"2016-06-24T00:00:00"}
