{"title":"数字半调的动态通信算法","authors":"P. Hingston, R. L. While","doi":"10.1145/563857.563815","DOIUrl":null,"url":null,"abstract":"We present a novel algorithm for digital halftoning. The algorithm combines a technique based on error diffusion with the use of a cost function to determine termination. Its chief advantages include the use of randomness to avoid visual artifacts in the binary image and its amenability to parallel execution. The algorithm is a member of the class of \"dynamic communication algorithms\" which make novel use of dynamically-routed messages to structure the execution of a program.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Dynamic Communication Algorithm for Digital Halftoning\",\"authors\":\"P. Hingston, R. L. While\",\"doi\":\"10.1145/563857.563815\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a novel algorithm for digital halftoning. The algorithm combines a technique based on error diffusion with the use of a cost function to determine termination. Its chief advantages include the use of randomness to avoid visual artifacts in the binary image and its amenability to parallel execution. The algorithm is a member of the class of \\\"dynamic communication algorithms\\\" which make novel use of dynamically-routed messages to structure the execution of a program.\",\"PeriodicalId\":136130,\"journal\":{\"name\":\"Australasian Computer Science Conference\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Australasian Computer Science Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/563857.563815\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Australasian Computer Science Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/563857.563815","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Dynamic Communication Algorithm for Digital Halftoning
We present a novel algorithm for digital halftoning. The algorithm combines a technique based on error diffusion with the use of a cost function to determine termination. Its chief advantages include the use of randomness to avoid visual artifacts in the binary image and its amenability to parallel execution. The algorithm is a member of the class of "dynamic communication algorithms" which make novel use of dynamically-routed messages to structure the execution of a program.