{"title":"采用自适应树模型的双级图像压缩","authors":"K. Nguyen-Phi, H. Weinrichter","doi":"10.1109/DCC.1997.582122","DOIUrl":null,"url":null,"abstract":"Summary form only given. State-of-the-art methods for bi-level image compression rely on two processes of modelling and coding. The modelling process determines the context of the coded pixel based on its adjacent pixels and using the information of the context to predict the probability of the coded pixel being 0 or 1. The coding process will actually code the pixel based on the prediction. Because the source is finite, a bigger template (more adjacent pixels) doesn't always lead to a better result, which is known as \"context dilution\" phenomenon. The authors present a new method called adaptive tree modelling for preventing the context dilution. They discussed this method by considering a pruned binary tree. They have implemented the proposed method in software.","PeriodicalId":403990,"journal":{"name":"Proceedings DCC '97. Data Compression Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Bi-level image compression using adaptive tree model\",\"authors\":\"K. Nguyen-Phi, H. Weinrichter\",\"doi\":\"10.1109/DCC.1997.582122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. State-of-the-art methods for bi-level image compression rely on two processes of modelling and coding. The modelling process determines the context of the coded pixel based on its adjacent pixels and using the information of the context to predict the probability of the coded pixel being 0 or 1. The coding process will actually code the pixel based on the prediction. Because the source is finite, a bigger template (more adjacent pixels) doesn't always lead to a better result, which is known as \\\"context dilution\\\" phenomenon. The authors present a new method called adaptive tree modelling for preventing the context dilution. They discussed this method by considering a pruned binary tree. They have implemented the proposed method in software.\",\"PeriodicalId\":403990,\"journal\":{\"name\":\"Proceedings DCC '97. Data Compression Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '97. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1997.582122\",\"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 '97. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1997.582122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bi-level image compression using adaptive tree model
Summary form only given. State-of-the-art methods for bi-level image compression rely on two processes of modelling and coding. The modelling process determines the context of the coded pixel based on its adjacent pixels and using the information of the context to predict the probability of the coded pixel being 0 or 1. The coding process will actually code the pixel based on the prediction. Because the source is finite, a bigger template (more adjacent pixels) doesn't always lead to a better result, which is known as "context dilution" phenomenon. The authors present a new method called adaptive tree modelling for preventing the context dilution. They discussed this method by considering a pruned binary tree. They have implemented the proposed method in software.