{"title":"一种新的快速无搜索分形图像压缩方法","authors":"M. Salarian, H. Hassanpour","doi":"10.1109/ICMV.2007.4469274","DOIUrl":null,"url":null,"abstract":"In this paper a new no search fractal image compression in DCT domain is proposed. Here for each range block we have considered one domain block and searched only for contrast scaling. Therefore the fractal code doesn't contain coordinates of matched domain block. The advantage of this method is that the quadtree algorithm can be applied and the size of the range block can be as small as 2times2 pixels. Therefore the quality of decoded image can be improved while the compression rate is maintained. Some simulation results verify that the proposed method achieved higher coding - performance than no search methods In spatial and wavelet domain.","PeriodicalId":238125,"journal":{"name":"2007 International Conference on Machine Vision","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"A new fast no search fractal image compression in DCT domain\",\"authors\":\"M. Salarian, H. Hassanpour\",\"doi\":\"10.1109/ICMV.2007.4469274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a new no search fractal image compression in DCT domain is proposed. Here for each range block we have considered one domain block and searched only for contrast scaling. Therefore the fractal code doesn't contain coordinates of matched domain block. The advantage of this method is that the quadtree algorithm can be applied and the size of the range block can be as small as 2times2 pixels. Therefore the quality of decoded image can be improved while the compression rate is maintained. Some simulation results verify that the proposed method achieved higher coding - performance than no search methods In spatial and wavelet domain.\",\"PeriodicalId\":238125,\"journal\":{\"name\":\"2007 International Conference on Machine Vision\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Machine Vision\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMV.2007.4469274\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Machine Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMV.2007.4469274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new fast no search fractal image compression in DCT domain
In this paper a new no search fractal image compression in DCT domain is proposed. Here for each range block we have considered one domain block and searched only for contrast scaling. Therefore the fractal code doesn't contain coordinates of matched domain block. The advantage of this method is that the quadtree algorithm can be applied and the size of the range block can be as small as 2times2 pixels. Therefore the quality of decoded image can be improved while the compression rate is maintained. Some simulation results verify that the proposed method achieved higher coding - performance than no search methods In spatial and wavelet domain.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
