最优上下文树的线性时间构造

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI:10.1109/DCC.1998.672167

H. Helfgott, M. Cohn

{"title":"最优上下文树的线性时间构造","authors":"H. Helfgott, M. Cohn","doi":"10.1109/DCC.1998.672167","DOIUrl":null,"url":null,"abstract":"We show how to construct an optimal context tree for a given plaintext and context order. Our algorithm runs in time linear in the size of the plaintext and the size of the context, and consumes space linear in the size of the plaintext. We evaluate the algorithm's performance on the CCITT test set for bilevel images with the Euclidean-norm context order.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Linear-time construction of optimal context trees\",\"authors\":\"H. Helfgott, M. Cohn\",\"doi\":\"10.1109/DCC.1998.672167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show how to construct an optimal context tree for a given plaintext and context order. Our algorithm runs in time linear in the size of the plaintext and the size of the context, and consumes space linear in the size of the plaintext. We evaluate the algorithm's performance on the CCITT test set for bilevel images with the Euclidean-norm context order.\",\"PeriodicalId\":191890,\"journal\":{\"name\":\"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1998.672167\",\"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 '98 Data Compression Conference (Cat. No.98TB100225)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1998.672167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

我们将展示如何为给定的明文和上下文顺序构建最佳上下文树。我们的算法在明文大小和上下文大小上按时间线性运行，并且在明文大小上按空间线性消耗。我们在具有欧几里得范数上下文顺序的双层图像的CCITT测试集上评估了算法的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Linear-time construction of optimal context trees

We show how to construct an optimal context tree for a given plaintext and context order. Our algorithm runs in time linear in the size of the plaintext and the size of the context, and consumes space linear in the size of the plaintext. We evaluate the algorithm's performance on the CCITT test set for bilevel images with the Euclidean-norm context order.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)

自引率

0.00%

发文量