Image Compression Based on Restricted Wavelet Synopses with Maximum Error Bound

Xiaoyu Li, Shizhong Huang, Huanyu Zhao, Xueyan Guo, Libo Xu, Xingsen Li, Youjia Li
{"title":"Image Compression Based on Restricted Wavelet Synopses with Maximum Error Bound","authors":"Xiaoyu Li, Shizhong Huang, Huanyu Zhao, Xueyan Guo, Libo Xu, Xingsen Li, Youjia Li","doi":"10.1145/2996890.3007880","DOIUrl":null,"url":null,"abstract":"The construction of wavelet synopses with maximum error bound have been studied by many years, which has many real world applications, such as health data stream analysis and image compression. Recently, there are two kinds of wavelet synopses with maximum error bound: one is restricted wavelet synopses whose synopses are restricted to the haar coefficients. Another is unrestricted wavelet synopses whose synopses are not equal to the haar coefficients. In this paper, we propose a simple and novel compression approach of restricted wavelet synopses with maximum error bound. The approach is applied in image compression in this paper. This approach firstly performs a stepwise Haar transformation for each 2×2 non-overlapping sub-block of an image. It then filters each level of detail coefficients by using varied thresholds. This approach guarantees each pixel's error in an user-defined error bound and can maintain image quality greatly in reconstruction. Experiment results show that the approach has faster execution speed and can obtain better reconstruction effects under the same compression ratio than the existing approaches. This advantage is more obvious, especially in the situation of high compression ratio.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2996890.3007880","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The construction of wavelet synopses with maximum error bound have been studied by many years, which has many real world applications, such as health data stream analysis and image compression. Recently, there are two kinds of wavelet synopses with maximum error bound: one is restricted wavelet synopses whose synopses are restricted to the haar coefficients. Another is unrestricted wavelet synopses whose synopses are not equal to the haar coefficients. In this paper, we propose a simple and novel compression approach of restricted wavelet synopses with maximum error bound. The approach is applied in image compression in this paper. This approach firstly performs a stepwise Haar transformation for each 2×2 non-overlapping sub-block of an image. It then filters each level of detail coefficients by using varied thresholds. This approach guarantees each pixel's error in an user-defined error bound and can maintain image quality greatly in reconstruction. Experiment results show that the approach has faster execution speed and can obtain better reconstruction effects under the same compression ratio than the existing approaches. This advantage is more obvious, especially in the situation of high compression ratio.
基于最大误差界的受限小波图像压缩
具有最大误差界的小波集的构造已经被研究了很多年,在健康数据流分析和图像压缩等方面有很多实际应用。最近,有两种小波与最大误差界梗概:一是限制小波对照表哈尔系数对照表的限制。另一种是不受限制的小波小波,小波小波不等于哈尔系数。本文提出了一种简单新颖的具有最大误差界的受限小波集压缩方法。本文将该方法应用于图像压缩中。该方法首先对图像的每个2×2非重叠子块进行逐步Haar变换。然后,它通过使用不同的阈值过滤每个级别的细节系数。该方法保证了每个像素的误差在用户定义的误差范围内,并且在重建过程中可以很好地保持图像质量。实验结果表明,在相同压缩比下,该方法比现有方法具有更快的执行速度和更好的重构效果。这种优势更加明显,特别是在压缩比高的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信