{"title":"大型字母源的有损Lempel-Ziv算法及其在图像压缩中的应用","authors":"W. Finamore, Marcelo de A. Leister","doi":"10.1109/ICIP.1996.559474","DOIUrl":null,"url":null,"abstract":"Two practical lossy Lempel-Ziv schemes are proposed in this paper. The schemes are suitable for compression of sources with large alphabet cardinality. Computer simulation results obtained by compressing the output of a Gaussian source revealed a performance comparable to the performance of scalar quantization followed by entropy coding. Compression of DCT transformed and subband decomposed images showed a performance close to the performance of JPEG compressed images.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"126 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Lossy Lempel-Ziv algorithm for large alphabet sources and applications to image compression\",\"authors\":\"W. Finamore, Marcelo de A. Leister\",\"doi\":\"10.1109/ICIP.1996.559474\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two practical lossy Lempel-Ziv schemes are proposed in this paper. The schemes are suitable for compression of sources with large alphabet cardinality. Computer simulation results obtained by compressing the output of a Gaussian source revealed a performance comparable to the performance of scalar quantization followed by entropy coding. Compression of DCT transformed and subband decomposed images showed a performance close to the performance of JPEG compressed images.\",\"PeriodicalId\":192947,\"journal\":{\"name\":\"Proceedings of 3rd IEEE International Conference on Image Processing\",\"volume\":\"126 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 3rd IEEE International Conference on Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIP.1996.559474\",\"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 of 3rd IEEE International Conference on Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.1996.559474","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Lossy Lempel-Ziv algorithm for large alphabet sources and applications to image compression
Two practical lossy Lempel-Ziv schemes are proposed in this paper. The schemes are suitable for compression of sources with large alphabet cardinality. Computer simulation results obtained by compressing the output of a Gaussian source revealed a performance comparable to the performance of scalar quantization followed by entropy coding. Compression of DCT transformed and subband decomposed images showed a performance close to the performance of JPEG compressed images.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
