基于快速逐次逼近量化的零树编码图像压缩算法  

A Zerotree Coding Image Compression Algorithm Based on Fast Successive Approximation Quantization

作　　者：刘利章[1] 史浩山[1] 杨少军[1] 

机构地区：[1]西北工业大学电子信息学院,西安710072

出　　处：《计算机工程与应用》2005年第14期12-14,共3页Computer Engineering and Applications

基　　金：部委基础研究项目资助

摘　　要：提出一种基于快速逐次逼近量化的零树编码图像压缩算法。该算法通过以下三项措施提高EZW算法的编码效率:(1)引进子带峰值的概念建立逐次逼近量化的快速算法;(2)对小波边缘子带进行有效处理以消除编码冗余;(3)建立了5个上下文内容模型对重要位符号进行编码。实验结果表明,该算法是一种高效的图像压缩算法,在压缩性能方面优于经典的EZW和SPIH T算法。The paper proposes a zerotree coding image compression algorithm based on fast successive approximation quantization.The algorithm improves the coding efficiency of EZW.It establishes fast successive approximation quantization by introducing the conception of subband peak,and disposes marginal subband effectively.More,it codes sign of important coefficient with the five ambient context model.The experiment shows that it is an effective image compression algorithm,and its compression performance is superior to EZW and SPIHT algorithms.

关 键 词：EZW算法 小波变换 零树 子带峰值 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]