arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2110.02556eess.IV
收藏

六边形图像的子带编码

Sub-band coding of hexagonal images

Md Mamunur Rashid, Usman R. Alim

摘要:

根据圆形填充定理,六边形晶格的填充效率高于等效的正方形镶嵌。因此,在几种情况下,六边形采样的图像相比,他们的笛卡尔对应更好地保存信息内容。在本文中,新的映射技术旁边的小波压缩方案提出了六角形图像。具体来说,我们引入两个基于树的编码方案,称为SBHex(螺旋映射分支编码六边形图像)和BBHex(宽度优先块编码六边形图像)。这两种编码方案都尊重六边形晶格的几何形状,并产生更好的压缩结果。我们的实证结果表明,所提出的算法六边形图像产生更好的重建质量在低比特每像素表示相比,基于树的编码对应的笛卡尔网格。

英文摘要:

According to the circle-packing theorem, the packing efficiency of a hexagonal lattice is higher than an equivalent square tessellation. Consequently, in several contexts, hexagonally sampled images compared to their Cartesian counterparts are better at preserving information content. In this paper, novel mapping techniques alongside the wavelet compression scheme are presented for hexagonal images. Specifically, we introduce two tree-based coding schemes, referred to as SBHex (spirally-mapped branch-coding for hexagonal images) and BBHex (breadth-first block-coding for hexagonal images). Both of these coding schemes respect the geometry of the hexagonal lattice and yield better compression results. Our empirical results show that the proposed algorithms for hexagonal images produce better reconstruction quality at low bits per pixel representations compared to the tree-based coding counterparts for the Cartesian grid.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑