基于快速上下文无关HV分割方案的分形图像压缩

U. Nandi, Jyotsna Kumar Mandal
{"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}
引用次数: 8

摘要

提出了一种用于灰度图像分形压缩技术的快速上下文无关HV分割方案。提出的分区方案可以水平或垂直地对范围中间进行分区,以便在范围没有被任何域覆盖时创建子范围。选择两种可能性中的一种,即水平或垂直分区,只需要简单地检查范围的哪一边比另一边大。它不依赖于范围的上下文来计算加速分区的分区点。还提出了一种变体,通过计算中间垂直线和中间水平线的像素值差,确定哪个比另一个大,来决定选择两个距离边中的一个。本文提出的分形分割方案对灰度图像的压缩比四叉树分割方案具有更好的压缩率,且压缩时间基本相同,提高了psnr。虽然压缩率不如HV分区方案,但所提出的方案比HV分区方案快得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信