{"title":"基于WFA的类轮廓图像压缩","authors":"K. Culík, V. Valenta, J. Kari","doi":"10.1109/DCC.1997.582089","DOIUrl":null,"url":null,"abstract":"Summary form only given. The authors present the design a lossy fractal compression method for silhouette-like bi-level images that has an excellent quality to compression rate ratio. Their approach is based on weighted finite automata (WFA). We reduce the problem of the encoding of a silhouette-like bi-level image to the encoding of two one-variable functions describing the boundary (-ies) of the black and white regions of the given image. One advantage is that the automata encoding different bitplanes can share states.","PeriodicalId":403990,"journal":{"name":"Proceedings DCC '97. Data Compression Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Compression of silhouette-like images based on WFA\",\"authors\":\"K. Culík, V. Valenta, J. Kari\",\"doi\":\"10.1109/DCC.1997.582089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. The authors present the design a lossy fractal compression method for silhouette-like bi-level images that has an excellent quality to compression rate ratio. Their approach is based on weighted finite automata (WFA). We reduce the problem of the encoding of a silhouette-like bi-level image to the encoding of two one-variable functions describing the boundary (-ies) of the black and white regions of the given image. One advantage is that the automata encoding different bitplanes can share states.\",\"PeriodicalId\":403990,\"journal\":{\"name\":\"Proceedings DCC '97. Data Compression Conference\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '97. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1997.582089\",\"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.582089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Compression of silhouette-like images based on WFA
Summary form only given. The authors present the design a lossy fractal compression method for silhouette-like bi-level images that has an excellent quality to compression rate ratio. Their approach is based on weighted finite automata (WFA). We reduce the problem of the encoding of a silhouette-like bi-level image to the encoding of two one-variable functions describing the boundary (-ies) of the black and white regions of the given image. One advantage is that the automata encoding different bitplanes can share states.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
