{"title":"一种提高分形图像压缩次数的新方法","authors":"T. Zumbakis, J. Valantinas","doi":"10.1109/ISPA.2005.195457","DOIUrl":null,"url":null,"abstract":"The paper presents a new approach to improving fractal image compression times. The range blocks and corresponding domain blocks are categorized in accordance with their smoothness level. The searching is carried out between the same (or, neighbouring) smoothness classes for range-domain comparisons which significantly reduces the computational complexity. Theoretical and experimental results show that extremely high compression time savings are achieved for images of size 512/spl times/512.","PeriodicalId":238993,"journal":{"name":"ISPA 2005. Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A new approach to improving fractal image compression times\",\"authors\":\"T. Zumbakis, J. Valantinas\",\"doi\":\"10.1109/ISPA.2005.195457\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents a new approach to improving fractal image compression times. The range blocks and corresponding domain blocks are categorized in accordance with their smoothness level. The searching is carried out between the same (or, neighbouring) smoothness classes for range-domain comparisons which significantly reduces the computational complexity. Theoretical and experimental results show that extremely high compression time savings are achieved for images of size 512/spl times/512.\",\"PeriodicalId\":238993,\"journal\":{\"name\":\"ISPA 2005. Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005.\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ISPA 2005. Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPA.2005.195457\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISPA 2005. Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2005.195457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new approach to improving fractal image compression times
The paper presents a new approach to improving fractal image compression times. The range blocks and corresponding domain blocks are categorized in accordance with their smoothness level. The searching is carried out between the same (or, neighbouring) smoothness classes for range-domain comparisons which significantly reduces the computational complexity. Theoretical and experimental results show that extremely high compression time savings are achieved for images of size 512/spl times/512.