{"title":"A fixed-rate quantizer using block-based entropy-constrained quantization and run-length coding","authors":"Dongchang Yu, M. Marcellin","doi":"10.1109/DCC.1997.582054","DOIUrl":null,"url":null,"abstract":"A fast and efficient quantization technique is described. It is fixed-length, robust to bit errors, and compatible with most current compression standards. It is based on entropy-constrained quantization and uses the well-known and efficient Viterbi algorithm to force the coded sequence to be fixed-rate. Run-length coding techniques are used to improve the performance at low encoding rates. Simulation results show that it can achieve performance comparable to that of Huffman coded entropy-constrained scalar quantization with computational complexity increasing only linearly in block length.","PeriodicalId":403990,"journal":{"name":"Proceedings DCC '97. Data Compression Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '97. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1997.582054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
A fast and efficient quantization technique is described. It is fixed-length, robust to bit errors, and compatible with most current compression standards. It is based on entropy-constrained quantization and uses the well-known and efficient Viterbi algorithm to force the coded sequence to be fixed-rate. Run-length coding techniques are used to improve the performance at low encoding rates. Simulation results show that it can achieve performance comparable to that of Huffman coded entropy-constrained scalar quantization with computational complexity increasing only linearly in block length.