AVL树在数值数据自适应压缩中的应用

[Proceedings] DCC `93: Data Compression Conference Pub Date : 1993-03-30 DOI:10.1109/DCC.1993.253118

H. Yokoo

{"title":"AVL树在数值数据自适应压缩中的应用","authors":"H. Yokoo","doi":"10.1109/DCC.1993.253118","DOIUrl":null,"url":null,"abstract":"This paper discusses the compression of computer files of data whose statistical properties are not given in advance. A new lossless coding method for this purpose, which utilizes Adel'son-Vel'skii-Landis trees, is effective to any word length. Its application to the lossless compression of gray-scale images shows wider applicability to any ordered set of 18-bit or 36-bit data.<<ETX>>","PeriodicalId":315077,"journal":{"name":"[Proceedings] DCC `93: Data Compression Conference","volume":"70 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Application of AVL trees to adaptive compression of numerical data\",\"authors\":\"H. Yokoo\",\"doi\":\"10.1109/DCC.1993.253118\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses the compression of computer files of data whose statistical properties are not given in advance. A new lossless coding method for this purpose, which utilizes Adel'son-Vel'skii-Landis trees, is effective to any word length. Its application to the lossless compression of gray-scale images shows wider applicability to any ordered set of 18-bit or 36-bit data.<<ETX>>\",\"PeriodicalId\":315077,\"journal\":{\"name\":\"[Proceedings] DCC `93: Data Compression Conference\",\"volume\":\"70 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] DCC `93: Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1993.253118\",\"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 `93: Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1993.253118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文讨论了未事先给出统计性质的数据的计算机文件的压缩问题。为此，一种新的无损编码方法利用Adel’s - vel’skii- landis树，对任何长度的字都有效。它在灰度图像无损压缩中的应用显示出更广泛的适用性，适用于任何18位或36位的有序数据集

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Application of AVL trees to adaptive compression of numerical data

This paper discusses the compression of computer files of data whose statistical properties are not given in advance. A new lossless coding method for this purpose, which utilizes Adel'son-Vel'skii-Landis trees, is effective to any word length. Its application to the lossless compression of gray-scale images shows wider applicability to any ordered set of 18-bit or 36-bit data.<>

求助全文

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

来源期刊

[Proceedings] DCC `93: Data Compression Conference

自引率

0.00%

发文量

期刊最新文献

Application of AVL trees to adaptive compression of numerical data Coding theory and regularization Robust, variable bit-rate coding using entropy-biased codebooks Compression of DNA sequences Joint codebook design for summation product-code vector quantizers