一种基于块的并行ZM-SPECK算法

2021 8th International Conference on Smart Computing and Communications (ICSCC) Pub Date : 2021-07-01 DOI:10.1109/ICSCC51209.2021.9528101

Yusra Meraj, E. Khan

{"title":"一种基于块的并行ZM-SPECK算法","authors":"Yusra Meraj, E. Khan","doi":"10.1109/ICSCC51209.2021.9528101","DOIUrl":null,"url":null,"abstract":"The zero memory set partitioned embedded block (ZM-SPECK) technique is an embedded and memory efficient image compression algorithm. However, it is computationally complex due to the repetitive significance checking of sets and coefficients in each and every bit plane. To overcome this limitation, it is proposed to parallelize the algorithm over smaller blocks to reduce the overall encoding and decoding times of ZM-SPECK algorithm. The proposed approach called block based parallel ZM-SPECK (BPZM-SPECK) decomposes the wavelet transformed image into independent nonoverlapping spatial blocks utilizing the unique child-parent relationships in spatial orientation trees (in wavelet domain) and concurrently encodes every single bits in each bit plane of a block. The experimental results show significant improvement in computation time over the existing ZM-SPECK algorithm.","PeriodicalId":382982,"journal":{"name":"2021 8th International Conference on Smart Computing and Communications (ICSCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Block Based Parallel ZM-SPECK Algorithm\",\"authors\":\"Yusra Meraj, E. Khan\",\"doi\":\"10.1109/ICSCC51209.2021.9528101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The zero memory set partitioned embedded block (ZM-SPECK) technique is an embedded and memory efficient image compression algorithm. However, it is computationally complex due to the repetitive significance checking of sets and coefficients in each and every bit plane. To overcome this limitation, it is proposed to parallelize the algorithm over smaller blocks to reduce the overall encoding and decoding times of ZM-SPECK algorithm. The proposed approach called block based parallel ZM-SPECK (BPZM-SPECK) decomposes the wavelet transformed image into independent nonoverlapping spatial blocks utilizing the unique child-parent relationships in spatial orientation trees (in wavelet domain) and concurrently encodes every single bits in each bit plane of a block. The experimental results show significant improvement in computation time over the existing ZM-SPECK algorithm.\",\"PeriodicalId\":382982,\"journal\":{\"name\":\"2021 8th International Conference on Smart Computing and Communications (ICSCC)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 8th International Conference on Smart Computing and Communications (ICSCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSCC51209.2021.9528101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 8th International Conference on Smart Computing and Communications (ICSCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCC51209.2021.9528101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

零存储集分割嵌入块(ZM-SPECK)技术是一种嵌入式和内存高效的图像压缩算法。然而，由于在每个位平面上对集合和系数进行重复的显著性检查，计算起来很复杂。为了克服这一限制，提出了在更小的块上并行化算法，以减少ZM-SPECK算法的整体编码和解码时间。提出了一种基于块的并行ZM-SPECK (BPZM-SPECK)方法，该方法利用空间方向树(小波域)中独特的父子关系，将小波变换后的图像分解为独立的非重叠空间块，并对块的每个位平面上的每个位并行编码。实验结果表明，与现有的ZM-SPECK算法相比，该算法在计算时间上有显著提高。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Block Based Parallel ZM-SPECK Algorithm

The zero memory set partitioned embedded block (ZM-SPECK) technique is an embedded and memory efficient image compression algorithm. However, it is computationally complex due to the repetitive significance checking of sets and coefficients in each and every bit plane. To overcome this limitation, it is proposed to parallelize the algorithm over smaller blocks to reduce the overall encoding and decoding times of ZM-SPECK algorithm. The proposed approach called block based parallel ZM-SPECK (BPZM-SPECK) decomposes the wavelet transformed image into independent nonoverlapping spatial blocks utilizing the unique child-parent relationships in spatial orientation trees (in wavelet domain) and concurrently encodes every single bits in each bit plane of a block. The experimental results show significant improvement in computation time over the existing ZM-SPECK algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2021 8th International Conference on Smart Computing and Communications (ICSCC)

自引率

0.00%

发文量