{"id":"https://openalex.org/W2122774602","doi":"https://doi.org/10.1109/dcc.2004.1281534","title":"Model based optimal bit allocation","display_name":"Model based optimal bit allocation","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2122774602","doi":"https://doi.org/10.1109/dcc.2004.1281534","mag":"2122774602"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2004.1281534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","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/A5069179055","display_name":"Nasir Rajpoot","orcid":"https://orcid.org/0000-0002-4706-1308"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"N.M. Rajpoot","raw_affiliation_strings":["Department of Computer Science, University of Warwick, UK","Department of Computer Science, Warwick University, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"Department of Computer Science, Warwick University, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069179055"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.8282,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76008909,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"558","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9998999834060669,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9998999834060669,"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":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6705242395401001},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.578898549079895},{"id":"https://openalex.org/keywords/bit","display_name":"Bit (key)","score":0.5710138082504272},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5671705007553101},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5403542518615723},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5318920612335205},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5203832387924194},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44894668459892273},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4180355370044708},{"id":"https://openalex.org/keywords/rate\u2013distortion-theory","display_name":"Rate\u2013distortion theory","score":0.41298970580101013},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20947206020355225},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.15550941228866577},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10528188943862915}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6705242395401001},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.578898549079895},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.5710138082504272},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5671705007553101},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5403542518615723},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5318920612335205},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5203832387924194},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44894668459892273},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4180355370044708},{"id":"https://openalex.org/C64185310","wikidata":"https://www.wikidata.org/wiki/Q843483","display_name":"Rate\u2013distortion theory","level":3,"score":0.41298970580101013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20947206020355225},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.15550941228866577},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10528188943862915},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/dcc.2004.1281534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:61392","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.406","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.406","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csdl.computer.org/comp/proceedings/dcc/2004/2082/00/20820558.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.114.5846","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.5846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.warwick.ac.uk/~nasir/papers/dcc04_summary.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1967483773","https://openalex.org/W1992091448","https://openalex.org/W1994242544","https://openalex.org/W2069277547","https://openalex.org/W2099627681","https://openalex.org/W2122774602","https://openalex.org/W2149591893"],"related_works":["https://openalex.org/W2411923897","https://openalex.org/W4285347720","https://openalex.org/W4381186982","https://openalex.org/W4200259850","https://openalex.org/W2333831899","https://openalex.org/W2484894494","https://openalex.org/W2367385042","https://openalex.org/W2040781570","https://openalex.org/W1991001836","https://openalex.org/W1983210329"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"analytical":[3],"modelling":[4],"of":[5,17],"the":[6,14,33,58,68],"operational":[7,44],"R-D":[8,45],"characteristics":[9],"that":[10,57],"can":[11],"significantly":[12],"reduce":[13],"computational":[15],"complexity":[16],"an":[18,79],"optimal":[19],"bit":[20,35,74],"allocation":[21,75],"algorithm":[22,76],"is":[23],"studied.":[24,71],"Two":[25],"new":[26],"models":[27,51,70],"namely":[28],"average":[29],"distortion-rate":[30],"function":[31],"and":[32],"low":[34],"rate":[36],"model":[37,60],"are":[38,52],"also":[39],"proposed.":[40],"Comparative":[41],"results":[42,55,85],"for":[43,86],"curve":[46],"fitting":[47],"using":[48],"these":[49],"two":[50],"presented.":[53],"Preliminary":[54],"show":[56],"exponential-polynomial":[59],"often":[61],"gives":[62,83],"a":[63],"better":[64],"fit":[65],"than":[66],"all":[67],"other":[69],"Model":[72],"based":[73],"employed":[77],"in":[78],"image":[80],"coding":[81],"framework":[82],"promising":[84],"overall":[87],"visual":[88],"quality.":[89]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}