{"id":"https://openalex.org/W2170638146","doi":"https://doi.org/10.1109/dcc.2004.1281449","title":"Fast algorithms for optimal two-description scalar quantizer design","display_name":"Fast algorithms for optimal two-description scalar quantizer design","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2170638146","doi":"https://doi.org/10.1109/dcc.2004.1281449","mag":"2170638146"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2004.1281449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281449","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/A5070675586","display_name":"Sorina Dumitrescu","orcid":"https://orcid.org/0000-0001-7287-0310"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"S. Dumitrescu","raw_affiliation_strings":["Department of Electrical & Computer Engineering, McMaster University, Hamilton, ONT, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, McMaster University, Hamilton, ONT, Canada","institution_ids":["https://openalex.org/I98251732"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101467563","display_name":"Xiaolin Wu","orcid":"https://orcid.org/0000-0002-7230-9168"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaolin Wu","raw_affiliation_strings":["Department of Computer and Information Science, Polytechnic University, Brooklyn, NY, USA","New York University**"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Polytechnic University, Brooklyn, NY, USA","institution_ids":[]},{"raw_affiliation_string":"New York University**","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026244625","display_name":"Gaurav Bahl","orcid":"https://orcid.org/0000-0001-7801-2739"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"G. Bahl","raw_affiliation_strings":["Department of Electrical & Computer Engineering, McMaster University, Hamilton, ONT, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, McMaster University, Hamilton, ONT, Canada","institution_ids":["https://openalex.org/I98251732"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070675586"],"corresponding_institution_ids":["https://openalex.org/I98251732"],"apc_list":null,"apc_paid":null,"fwci":1.6397,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8579884,"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":"42","last_page":"51"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9824000000953674,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/algorithm","display_name":"Algorithm","score":0.604511559009552},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5389528870582581},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5258991122245789},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5222768783569336},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5163982510566711},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46130281686782837},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.45890986919403076},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44302475452423096},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41605132818222046},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4143965542316437},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3872288465499878},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30278998613357544}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.604511559009552},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5389528870582581},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5258991122245789},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5222768783569336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5163982510566711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46130281686782837},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45890986919403076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44302475452423096},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41605132818222046},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4143965542316437},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3872288465499878},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30278998613357544},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcc.2004.1281449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281449","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2055257826","https://openalex.org/W2096102601","https://openalex.org/W2100743136","https://openalex.org/W2103904364","https://openalex.org/W2117594482","https://openalex.org/W2144741948","https://openalex.org/W2150020269","https://openalex.org/W2164886257"],"related_works":["https://openalex.org/W12413374","https://openalex.org/W2146569528","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W1998712144","https://openalex.org/W3164774158","https://openalex.org/W2372211403","https://openalex.org/W4297817344"],"abstract_inverted_index":{"New":[0],"efficient":[1],"algorithms":[2],"are":[3,83,122],"presented":[4],"to":[5,18,60,98,124],"design":[6,67,134],"globally":[7],"optimal":[8,131],"two-description":[9],"quantizers":[10],"of":[11,33,52,54,74,86,89,109],"fixed":[12,42],"rate.":[13],"The":[14,41],"optimization":[15],"objective":[16,111],"is":[17,71,96],"minimize":[19],"the":[20,24,29,48,55,72,75,84,90,110,119,125,130],"expected":[21],"distortion":[22],"at":[23],"receiver":[25],"side.":[26],"We":[27],"formulate":[28],"problem":[30,135],"as":[31],"one":[32],"shortest":[34,56],"path":[35],"in":[36,139],"a":[37,105],"directed":[38],"acyclic":[39],"graph.":[40],"rate":[43],"requirement":[44],"puts":[45],"constraints":[46],"on":[47],"number":[49,85],"and":[50,78,118],"type":[51],"edges":[53],"path,":[57],"which":[58],"leads":[59],"an":[61],"O(K/sub":[62,99],"1/K/sub":[63,100],"2/N/sup":[64,101],"3/)":[65],"time":[66],"algorithm,":[68],"where":[69],"N":[70],"cardinality":[73],"source":[76],"alphabet,":[77],"K/sub":[79,81,115],"1/,":[80],"2/":[82],"codecells,":[87],"respectively,":[88],"two":[91,120],"side":[92],"quantizers.":[93],"This":[94],"complexity":[95],"reduced":[97],"2/)":[102,141],"by":[103],"exploiting":[104],"so-called":[106],"Monge":[107],"property":[108],"function.":[112],"Furthermore,":[113],"if":[114],"1/=K/sub":[116],"2/=K":[117],"descriptions":[121],"subject":[123],"same":[126],"channel":[127],"statistics,":[128],"then":[129],"description":[132],"quantizer":[133],"can":[136],"be":[137],"solved":[138],"O(KN/sup":[140],"time.":[142]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}