您现在的位置: 首页> 研究主题> 零树编码

零树编码

零树编码的相关文献在1995年到2018年内共计178篇,主要集中在无线电电子学、电信技术、自动化技术、计算机技术、数学 等领域,其中期刊论文161篇、会议论文15篇、专利文献224414篇;相关期刊103种,包括电子科技大学学报、系统工程与电子技术、中国图象图形学报等; 相关会议14种,包括全国第19届计算机技术与应用学术会议(CACIS·2008)、全国第二届嵌入式技术联合学术会议、中国仪器仪表学会第八届青年学术会议等;零树编码的相关文献由360位作者贡献,包括张立保、王珂、许超等。

零树编码—发文量

期刊论文>

论文:161 占比:0.07%

会议论文>

论文:15 占比:0.01%

专利文献>

论文:224414 占比:99.92%

总计:224590篇

零树编码—发文趋势图

零树编码

-研究学者

  • 张立保
  • 王珂
  • 许超
  • 鞠德航
  • 黄普明
  • 王成儒
  • 练秋生
  • 陈万忠
  • 雷辉
  • 乔世杰
  • 期刊论文
  • 会议论文
  • 专利文献

搜索

排序:

年份

    • 吴晓云; 赵杰
    • 摘要: Due to shortcomings of the long time of traditional fractal image compression,an improved fractal coding method is proposed in this paper.The wavelet transform is combined with the improved fractal coding.Test experiments are runned in MATLAB software and the experimental results show that in the case that the quality of the image compression is basically unchanged,the coding time of the algorithm which is proposed in this paper is greatly shortened than traditional fractal coding algorithm,and compression ratio is improved.This algorithm has high application value.%针对传统的分形图像压缩编码时间长的缺点,提出了改进的分形编码方法,并将小波变换与改进的分形编码结合.在MATLAB软件中进行测试实验,实验结果表明,与传统的分形编码算法相比,在保证图像压缩质量基本不变的情况下,新算法编码时间大大缩短了,并且提高了压缩比,具有较高的应用价值.
    • 马建平; 徐家园; 陈渤; 陈强
    • 摘要: 针对渐进网格快速重构的需求,提出一种稳定型渐进网格结构,并借助半边结构对初始渐进网格进行重构.首先按照半边结构的构建顺序对初始基网格进行构建,同时按照网格细分顺序对偏移向量集进行存储,得到稳定型渐进网格.然后,通过改进零树编码初始阈值的设定方式,设计新的偏移量小波树构建方法,对稳定型渐进网格进行嵌入式零树压缩编码.实验结果表明,该算法较诸以往算法,在保证视觉效果的前提下,不但获得了更高的压缩比,而且大大提高了渐进网格的重构速度,有利于提升三维网络应用程序的交互性和响应速度.%Aiming at the demand for rapid reconstruction of progressive mesh (PM),a stable progressive mesh (SPM) is proposed.It reconstructs the initial progressive mesh by half-edge structure.Firstly,it constructs initial base mesh according to the order of halfedge structure and it stores the offsets by the order of mesh subdivision.Then,by improving the setting of initial threshold of zerotree coding,a new offset wavelet-tree construction method is designed.Finally,the Embedded Zero Tree Coding is carrided on SPM.The experimental results show that this algorithm satisfies the visual effects.Comparing with former algorithm,it obtains a higher compression ratio and greatly improves the reconstruction speed of progressive mesh.It contributes to interactivity and response speed of 3D web application.
    • 袁昌茂
    • 摘要: 随着现代遥感技术的迅速发展,遥感图像分辨率越来越高,数据量也越来越大,由此带来了存储、传输和应用的"瓶颈".本文中,选择多小波GHM和SA4压缩遥感图像,客观评价指标采用压缩比和峰值信噪比(PSNR).实验结果表明,多小波在遥感图像压缩中的应用具有很大的优势和潜力.
    • 赵法林; 李飞; 鲍旭东
    • 摘要: 票据图像是一种广泛应用于人们生活及工作的图像,由于票据图像中主要包含文字、数字及线条等信息,其细节和边缘信息极其重要。一般的压缩方法,如JPEG压缩,已经不适用于票据图像的压缩,会造成边缘细节信息的损失。因此针对票据图像的特殊性,经过颜色聚类和多分辨率分解后,应用改进的零树编码进行压缩编码。实验结果表明,该文方法比JPEG压缩标准具有更高的压缩比和更好的图像阅读质量。%The bill image is an image that is widely used in human life and work. Because there is important information in bill image such as words, numbers, and lines, the detail and edge information is extremely important for bill image. General compres?sion methods, such as JPEG compression standard, don’t apply to compress bill image, which can cause loss of detail and edge in?formation. According to the particularity of bill image, the proposed method applies to compress bill image. Firstly, the color clus?tering method and multiresolution decomposition classify bill image to the pyramid structure. And the improved zerotrees coding is used to compress the pyramid structure. The results demonstrated much higher compression rates and better reading quality of the proposed method than of JPEG compression standard.
    • 胡静涛; 陈卫
    • 摘要: 文中详细介绍了嵌入式零树小波编码,并分析了嵌入式零树小波编码的不足。针对其不足,提出了一种改进的编码方法。最后通过MATLAB7.0实验仿真,实验结果证明了改进算法的有效性。
    • 黄可坤
    • 摘要: In order to raise the performance of Set Partitioning in Hierarchical Trees(SPIHT) algorithm and maintain the encoding speed, an improved SP1HT algorithm based on binary tree is proposed. Four coefficients splited by D-type sets are coded by binary tree. Through coding the significance of L-type sets first, the algorithm can determine the significance of the root of the binary tree in advance with high probability, so as to further improve the coding efficiency. Experimental results show that the speed of the proposed algorithm is as fast as SPIHT algorithm, and it can improve Peak Signal to Noise Ratio(PSNR).%为在保持多级树集合分裂(SPIHT)算法编码速度的同时提高其性能,提出一种基于二叉树的改进SPIHT算法.对D型集合分裂得到的4个系数进行二叉树编码,优先编码L型集合的重要性,并以较高的概率提前判断二叉树根节点的重要性,从而提高编码效率.实验结果表明,该算法的执行速度与SPIHT算法相当,且具有较高的峰值信噪比.
    • 张海燕
    • 摘要: 本文设计并实现了一个有效的图像压缩算法。选取了Daubechies-5小波基,通过对小波系数的特点的研究,提出了将嵌入式零树编码和改进的游程编码相结合的方法,实现了小波系数的有效编码,实验表明,该算法取得较好的压缩效果。%  an effective image compression algorithm is designed and implemented in this paper, Daubechies-5 wavelet basis is selected and by research of Wavelet coefficients characteristics,combining method of zerotree coding and improved RLE is embedded in this paper, we implement Effective coding of the wavelet coefficients. The experiments show that the algorithm to achieve better compression effect.
    • 王安红; 李志宏; 郑义; 王宇洋
    • 摘要: 本文提出一种基于优化网格编码量化(TCQ)的小波图像编码方法.该方法首先利用小波子带间的相关性对小波系数进行改进四叉树速历扫描,然后对扫描后的非零系数采用一种优化TCQ进行量化,最后将量化系数进行熵编码.由于优化TCQ方案利用不同子带小波系数的重要性进行不同精度的量化,因此所提出的小波图像编码方法比经典的零树编码取得更好的率失真性能,同时还具有编码复杂度适中的优点.实验验证了方案的有效性.%The image coding method based on optimized trellis coded quantization (TCQ) is presented in the wavelet domain. First, the improved scanning of quadtree exploits correlation between the sub-bands to classify the zero trees and non-zero trees in wavelet coefficients, and then the non-zero tree is quantized by adopting optimized TCQ. Finally, the quantized coefficients are compressed by entropy coding. Because the optimized TCQ considers the characters of wavelet coefficients in different subbands, the proposed scheme is expected to achieve better rate-distortion performance than the classical zero-tree coding with modest encoding complexity. The experimental results confirm the effectiveness of our scheme.
    • 陈卫; 胡静涛
    • 摘要: 针对傅里叶变换的不足,介绍了小波变换,详细分析了嵌入式零树小波编码方法。采用bior3.7对图像woman进行单层分解,将原始图像与分解后低频和高频信息图像进行对比,清晰地看出图像的能量主要集中于低频系数,而高频系数主要是图像的细节信息。
    • 陈波; 王红霞; 成礼智
    • 摘要: The traditional discrete cosine transform (DCT) can only sparsely represent the horizontal and vertical edges in images.The computation complexity of directional prediction DCT (DPDCT), which has the ability to represent more directions, is much higher.To overcome these shortcomings, the fast directional discrete cosine transforms (FDDCT) is proposed in this paper, in which the transformation is performed on the predefined direction mode.Compared with DPDCT, no interpolation is needed in FDDCT, so FDDCT can sparsely represent the anisotropic edges in much faster images.A special lifting algorithm is designed between adjacent blocks to ensure the perfect reconstruction, which compacts energy in edges lying across the blocks.The experimental results show that the computation of FDDCT is no more than 1.4 times that of DCT's.Coding with the same set partition method,PSNR compressed images that are combined with FDDCT are 0.4~1.6dB higher than those with DCT and DPDCT.Also, the edges and the details in the images are much clearer and less distortion exists.%传统的二维DCT(discrete cosine transform)无法稀疏表示除水平或垂直方向以外的边缘,而具有强方向表示能力的方向预测离散余弦变换(directional prediction DCT,简称DPDCT)计算复杂度又过高.针对这些问题,提出了一种快速方向离散余弦变换(fast directional discrete cosine transform,简称FDDCT).该算法沿给定的方向模式进行变换.避免了DPDCT中的插值运算,可以快速、稀疏地表示图像中各向异性边缘信息.此外,FDDCT通过设计块边界提升,在进一步集中边缘能量的同时保证了算法的完全重构.实验结果表明,FDDCT计算复杂度不超过DCT的1.4倍;采用同样的编码方法,基于FDDCT的压缩图像与基于DCT以及DPDCT的压缩图像相比,峰值信噪比可提高0.4dB~1.6dB,而且边缘细节更加清晰、完整.
  • 查看更多

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号