{"title":"图像压缩的零树设计:走向加权通用零树编码","authors":"M. Effros","doi":"10.1109/ICIP.1997.647988","DOIUrl":null,"url":null,"abstract":"We consider the problem of optimal, data-dependent zerotree design for use in weighted universal zerotree codes for image compression. A weighted universal zerotree code (WUZC) is a data compression system that replaces the single, data-independent zerotree of Said and Pearlman (see IEEE Transactions on Circuits and Systems for Video Technology, vol.6, no.3, p.243-50, 1996) with an optimal collection of zerotrees for good image coding performance across a wide variety of possible sources. We describe the weighted universal zerotree encoding and design algorithms but focus primarily on the problem of optimal, data-dependent zerotree design. We demonstrate the performance of the proposed algorithm by comparing, at a variety of target rates, the performance of a Said-Pearlman style code using the standard zerotree to the performance of the same code using a zerotree designed with our algorithm. The comparison is made without entropy coding. The proposed zerotree design algorithm achieves, on a collection of combined text and gray-scale images, up to 4 dB performance improvement over a Said-Pearlman zerotree.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"237 1","pages":"616-619 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Zerotree design for image compression: toward weighted universal zerotree coding\",\"authors\":\"M. Effros\",\"doi\":\"10.1109/ICIP.1997.647988\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of optimal, data-dependent zerotree design for use in weighted universal zerotree codes for image compression. A weighted universal zerotree code (WUZC) is a data compression system that replaces the single, data-independent zerotree of Said and Pearlman (see IEEE Transactions on Circuits and Systems for Video Technology, vol.6, no.3, p.243-50, 1996) with an optimal collection of zerotrees for good image coding performance across a wide variety of possible sources. We describe the weighted universal zerotree encoding and design algorithms but focus primarily on the problem of optimal, data-dependent zerotree design. We demonstrate the performance of the proposed algorithm by comparing, at a variety of target rates, the performance of a Said-Pearlman style code using the standard zerotree to the performance of the same code using a zerotree designed with our algorithm. The comparison is made without entropy coding. The proposed zerotree design algorithm achieves, on a collection of combined text and gray-scale images, up to 4 dB performance improvement over a Said-Pearlman zerotree.\",\"PeriodicalId\":92344,\"journal\":{\"name\":\"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing\",\"volume\":\"237 1\",\"pages\":\"616-619 vol.1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIP.1997.647988\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.1997.647988","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18
摘要
我们考虑了用于图像压缩的加权通用零树编码的最优、数据相关的零树设计问题。加权通用零树码(WUZC)是一种数据压缩系统,它取代了Said和Pearlman的单一的、与数据无关的零树(参见IEEE Transactions on Circuits and Systems for Video Technology, vol.6, no. 6)。3, p.243- 50,1996),并在各种可能的源中提供最佳的零树集合,以获得良好的图像编码性能。我们描述了加权通用零树编码和设计算法,但主要关注最优的问题,数据相关的零树设计。我们通过比较在各种目标速率下,使用标准零树的Said-Pearlman风格代码的性能与使用用我们的算法设计的零树的相同代码的性能来证明所提出算法的性能。在不使用熵编码的情况下进行比较。所提出的零树设计算法在文本和灰度图像的组合上,比Said-Pearlman零树的性能提高了4db。
Zerotree design for image compression: toward weighted universal zerotree coding
We consider the problem of optimal, data-dependent zerotree design for use in weighted universal zerotree codes for image compression. A weighted universal zerotree code (WUZC) is a data compression system that replaces the single, data-independent zerotree of Said and Pearlman (see IEEE Transactions on Circuits and Systems for Video Technology, vol.6, no.3, p.243-50, 1996) with an optimal collection of zerotrees for good image coding performance across a wide variety of possible sources. We describe the weighted universal zerotree encoding and design algorithms but focus primarily on the problem of optimal, data-dependent zerotree design. We demonstrate the performance of the proposed algorithm by comparing, at a variety of target rates, the performance of a Said-Pearlman style code using the standard zerotree to the performance of the same code using a zerotree designed with our algorithm. The comparison is made without entropy coding. The proposed zerotree design algorithm achieves, on a collection of combined text and gray-scale images, up to 4 dB performance improvement over a Said-Pearlman zerotree.