{"title":"分形图像压缩算法的并行实现","authors":"W. Stapleton, W. Mahmoud, D. J. Jackson","doi":"10.1109/SSST.1996.493524","DOIUrl":null,"url":null,"abstract":"Presented in this paper are experimental results for a parallel implementation of a fractal image compression algorithm. The fractal image compression process exhibits a natural parallelism and the specific parallel implementation is shown to be beneficial for the execution speed of the algorithm. Furthermore, computational speed has been enhanced through an algorithmic modification employing a quadtree recomposition approach in which quadtree subblocks are iteratively combined into larger ranges for fractal encoding. Furthermore, classification schemes which serve to reduce the O(n/sup 4/) algorithmic complexity are explored.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A parallel implementation of a fractal image compression algorithm\",\"authors\":\"W. Stapleton, W. Mahmoud, D. J. Jackson\",\"doi\":\"10.1109/SSST.1996.493524\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presented in this paper are experimental results for a parallel implementation of a fractal image compression algorithm. The fractal image compression process exhibits a natural parallelism and the specific parallel implementation is shown to be beneficial for the execution speed of the algorithm. Furthermore, computational speed has been enhanced through an algorithmic modification employing a quadtree recomposition approach in which quadtree subblocks are iteratively combined into larger ranges for fractal encoding. Furthermore, classification schemes which serve to reduce the O(n/sup 4/) algorithmic complexity are explored.\",\"PeriodicalId\":135973,\"journal\":{\"name\":\"Proceedings of 28th Southeastern Symposium on System Theory\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 28th Southeastern Symposium on System Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSST.1996.493524\",\"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 of 28th Southeastern Symposium on System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1996.493524","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A parallel implementation of a fractal image compression algorithm
Presented in this paper are experimental results for a parallel implementation of a fractal image compression algorithm. The fractal image compression process exhibits a natural parallelism and the specific parallel implementation is shown to be beneficial for the execution speed of the algorithm. Furthermore, computational speed has been enhanced through an algorithmic modification employing a quadtree recomposition approach in which quadtree subblocks are iteratively combined into larger ranges for fractal encoding. Furthermore, classification schemes which serve to reduce the O(n/sup 4/) algorithmic complexity are explored.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
