{"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}
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.<>