...
首页> 外文期刊>International journal of computational intelligence research >Multiwavelet Transform based Image Compression using Modified SPIHT Compression Scheme
【24h】

Multiwavelet Transform based Image Compression using Modified SPIHT Compression Scheme

机译:使用改进的SPIHT压缩方案的基于多小波变换的图像压缩

获取原文
获取原文并翻译 | 示例
           

摘要

In the present work a new implementation of multiwavelet transform, which is combined with modified Set Partitioning in Hierarchical Tree (SPIHT) compression scheme has been introduced. The SPIHT provides even better performance than Embedded Zero tree Wavelet (EZW). EZW coding introduced by J.M.Shapiro, is a very effective and computationally simple technique for image compression. Here an alternative explanation of the principles of its operation has been given, so that the reasons for its excellent performance can be better understood. These principles are partial ordering by magnitude with a set partitioning sorting algorithm, ordered bit plane transmission, and exploitation of self similarity across different scales of an image multiwavelet transforms. We provide the analysis of the problems arising from the application of zero tree quantization based algorithms, such as SPIHT to multiwavelet transform coefficients. We established the generalized parent-child relationships for multiwavelet, providing complete tree structure for SPIHT. The results obtained with the combination of multiwavelet transforms and the SPIHT compression scheme are much better than EZW and wavelet transform based image compression.
机译:在本工作中,已介绍了一种多小波变换的新实现,该实现与改进的“分层树中的集划分”(SPIHT)压缩方案相结合。 SPIHT提供了比嵌入式零树小波(EZW)更好的性能。 J.M. Shapiro引入的EZW编码是一种非常有效且计算简单的图像压缩技术。这里已经给出了其工作原理的另一种解释,以便可以更好地理解其出色性能的原因。这些原理是使用集合分区排序算法按量级进行部分排序,有序位平面传输以及在图像多小波变换的不同尺度上利用自相似性。我们提供了对基于零树量化的算法(例如SPIHT)应用于多小波变换系数所引起的问题的分析。我们为多小波建立了广义的父子关系,为SPIHT提供了完整的树结构。结合小波变换和SPIHT压缩方案获得的结果比基于EZW和基于小波变换的图像压缩要好得多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号