{"title":"基于快速上下文无关HV分割方案的分形图像压缩","authors":"U. Nandi, Jyotsna Kumar Mandal","doi":"10.1109/ISED.2012.13","DOIUrl":null,"url":null,"abstract":"A fast context independent HV partitioning scheme for fractal image compression technique of grey scale images is proposed. The proposed partitioning scheme partitions middle of range either horizontally or vertically to create to sub-ranges if the range is not covered well by any domain. The decision to select one of the two possibilities i.e. horizontal or vertical partitioning is done only by a simple checking which side of the range is larger than the other. It does not depend on the context of the range to compute the partitioning point that speed up the partitioning. One variant of the same is also proposed where the decision to select one of the two sides of range is done by computing the pixel value differences of the middle vertical lines and the middle horizontal lines and determining which is greater than other. The fractal image compression for grey scale image with the proposed partitioning schemes offer better compression rates than the quadtree partitioning scheme maintaining almost same compression times with improved PSNRs. Though the compression rates are not as well as offered by HV partitioning scheme, the proposed schemes are much faster than the same.","PeriodicalId":276803,"journal":{"name":"2012 International Symposium on Electronic System Design (ISED)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Fractal Image Compression Using Fast Context Independent HV Partitioning Scheme\",\"authors\":\"U. Nandi, Jyotsna Kumar Mandal\",\"doi\":\"10.1109/ISED.2012.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fast context independent HV partitioning scheme for fractal image compression technique of grey scale images is proposed. The proposed partitioning scheme partitions middle of range either horizontally or vertically to create to sub-ranges if the range is not covered well by any domain. The decision to select one of the two possibilities i.e. horizontal or vertical partitioning is done only by a simple checking which side of the range is larger than the other. It does not depend on the context of the range to compute the partitioning point that speed up the partitioning. One variant of the same is also proposed where the decision to select one of the two sides of range is done by computing the pixel value differences of the middle vertical lines and the middle horizontal lines and determining which is greater than other. The fractal image compression for grey scale image with the proposed partitioning schemes offer better compression rates than the quadtree partitioning scheme maintaining almost same compression times with improved PSNRs. Though the compression rates are not as well as offered by HV partitioning scheme, the proposed schemes are much faster than the same.\",\"PeriodicalId\":276803,\"journal\":{\"name\":\"2012 International Symposium on Electronic System Design (ISED)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Symposium on Electronic System Design (ISED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISED.2012.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Symposium on Electronic System Design (ISED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISED.2012.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fractal Image Compression Using Fast Context Independent HV Partitioning Scheme
A fast context independent HV partitioning scheme for fractal image compression technique of grey scale images is proposed. The proposed partitioning scheme partitions middle of range either horizontally or vertically to create to sub-ranges if the range is not covered well by any domain. The decision to select one of the two possibilities i.e. horizontal or vertical partitioning is done only by a simple checking which side of the range is larger than the other. It does not depend on the context of the range to compute the partitioning point that speed up the partitioning. One variant of the same is also proposed where the decision to select one of the two sides of range is done by computing the pixel value differences of the middle vertical lines and the middle horizontal lines and determining which is greater than other. The fractal image compression for grey scale image with the proposed partitioning schemes offer better compression rates than the quadtree partitioning scheme maintaining almost same compression times with improved PSNRs. Though the compression rates are not as well as offered by HV partitioning scheme, the proposed schemes are much faster than the same.