...
首页> 外文期刊>Turkish Journal of Electrical Engineering and Computer Sciences >A novel hardware-efficient spatial orientation tree-based image compression algorithm and its field programmable gate array implementation
【24h】

A novel hardware-efficient spatial orientation tree-based image compression algorithm and its field programmable gate array implementation

机译:一种新的硬件有效的空间方向树的图像压缩算法及其现场可编程门阵列实现

获取原文
           

摘要

Set partitioning in hierarchical trees (SPIHT) has become a popular research topic for more than a decade now. This is because it is simple, besides having compression efficiency close to the state-of-the-art JPEG2000 standard. The main drawback of SPIHT is that it uses three lists to store addresses of coefficients during its operation. These lists are dynamic and in worst cases need to store more number of addresses than total coefficients. In this work, a novel hardware-efficient spatial orientation tree-based algorithm is proposed and its hardware implementation is carried out. The wavelet transformed image is partitioned into 2 $imes$ 2 blocks. Each node of spatial orientation tree (SOT) represent a block of coefficients, rather than a single coefficient. Two small state-tables are used in this algorithm to store the status of each block. In addition to this, two extremely small lists are used to store the node addresses of a single SOT tree. To store the state-tables and lists for 512 $imes$ 512 image, only 0.88 % of the memory needed by SPIHT is required for five levels of dyadic decomposition. The peak-signal-to-noise ratio (PSNR) gain of 0.1 dB to 0.3 dB at low bit rates (below 1 bpp) and 0.6 dB to 1.2 dB at high bit rates (above 1.75 bpp) in comparison to SPIHT is observed for test image Lena. A field programmable gate array (FPGA) implementation targeted for Xilinx Zynq Z-7020 is presented in the paper. The proposed architecture saves 90 % of the FPGA area used by SPIHT. The hardware efficiency of the proposed architecture is better in comparison to different existing architectures.
机译:在分层树中设置分区(SPIHT)已成为现在十多年的流行研究主题。这是因为它很简单,除了接近最先进的JPEG2000标准的压缩效率。 SPIHT的主要缺点是它使用三个列表来在其操作期间存储系数的地址。这些列表是动态的,在最糟糕的情况下,需要存储更多的地址,而不是总系数。在这项工作中,提出了一种新的硬件有效的空间取向树算法,并执行其硬件实现。小波变换图像被分成2 $ times $ 2块。空间方向树(SOT)的每个节点代表一块系数,而不是单个系数。在该算法中使用两个小型状态表来存储每个块的状态。除此之外,两个非常小的列表用于存储单个SOT树的节点地址。要存储512 $ times $ 512图像的状态表和列表,则为五个级别的二元分解需要SPIHT所需的0.88%。观察到与SPIHT相比,在低比特率(低于1bpp)和0.6dB至1.2db的低比特率(低于1bpp)和0.6dB至1.2dB的峰值信噪比(PSNR)增益。测试图片lena。本文提出了一种用于Xilinx Zynq Z-7020的现场可编程门阵列(FPGA)实现。拟议的架构节省了SPIHT使用的90%的FPGA区域。与不同现有架构相比,所提出的架构的硬件效率更好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号