A. Docef, F. Kossentini, W. Chung, Mark J. T. Smith
{"title":"彩色图像的无乘子带编码","authors":"A. Docef, F. Kossentini, W. Chung, Mark J. T. Smith","doi":"10.1109/DCC.1995.515525","DOIUrl":null,"url":null,"abstract":"This paper describes a very computationally efficient design algorithm for color image coding at low bit rates. The proposed algorithm is based on uniform tree-structured subband decomposition, multistage scalar quantization of the image subbands, and high order entropy coding. The main advantage of the algorithm is that no multiplications are required in both analysis/synthesis and encoding/decoding. This can lead to a simple hardware implementation of the subband coder, while maintaining a high level of performance.","PeriodicalId":107017,"journal":{"name":"Proceedings DCC '95 Data Compression Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Multiplication-free subband coding of color images\",\"authors\":\"A. Docef, F. Kossentini, W. Chung, Mark J. T. Smith\",\"doi\":\"10.1109/DCC.1995.515525\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a very computationally efficient design algorithm for color image coding at low bit rates. The proposed algorithm is based on uniform tree-structured subband decomposition, multistage scalar quantization of the image subbands, and high order entropy coding. The main advantage of the algorithm is that no multiplications are required in both analysis/synthesis and encoding/decoding. This can lead to a simple hardware implementation of the subband coder, while maintaining a high level of performance.\",\"PeriodicalId\":107017,\"journal\":{\"name\":\"Proceedings DCC '95 Data Compression Conference\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '95 Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1995.515525\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '95 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1995.515525","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multiplication-free subband coding of color images
This paper describes a very computationally efficient design algorithm for color image coding at low bit rates. The proposed algorithm is based on uniform tree-structured subband decomposition, multistage scalar quantization of the image subbands, and high order entropy coding. The main advantage of the algorithm is that no multiplications are required in both analysis/synthesis and encoding/decoding. This can lead to a simple hardware implementation of the subband coder, while maintaining a high level of performance.