{"title":"Lossless compression of VQ indexes using search-order and correction codes","authors":"En-Cheng Liu, T.-C. Wang","doi":"10.1109/SIPS.1998.715783","DOIUrl":null,"url":null,"abstract":"In a fixed-rate vector quantization system, an image is divided into smaller blocks, and each block is usually independently encoded by an index of the same length that points to the closest codevector in the codebook. Recently, an algorithm called search-order coding has been proposed to further reduce the bit rate by encoding the indexes but without introducing any extra encoding distortion. We present an improved algorithm that extends the idea of the search-order coding algorithm by encoding the indexes pair by pair. In addition, the correction codes are also adopted to improve the bit rate further. Simulation results indicate that our algorithm is able to achieve a bit rate up to 7% lower than the search-order coding algorithm.","PeriodicalId":151031,"journal":{"name":"1998 IEEE Workshop on Signal Processing Systems. SIPS 98. Design and Implementation (Cat. No.98TH8374)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1998 IEEE Workshop on Signal Processing Systems. SIPS 98. Design and Implementation (Cat. No.98TH8374)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIPS.1998.715783","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In a fixed-rate vector quantization system, an image is divided into smaller blocks, and each block is usually independently encoded by an index of the same length that points to the closest codevector in the codebook. Recently, an algorithm called search-order coding has been proposed to further reduce the bit rate by encoding the indexes but without introducing any extra encoding distortion. We present an improved algorithm that extends the idea of the search-order coding algorithm by encoding the indexes pair by pair. In addition, the correction codes are also adopted to improve the bit rate further. Simulation results indicate that our algorithm is able to achieve a bit rate up to 7% lower than the search-order coding algorithm.