用于图象压缩的子波变换的算法结构  

An Algorithm Structure of the Wavelet Transform Used in Image Compression

作　　者：殷瑞祥[1] 马维祯[1] 

机构地区：[1]华南理工大学无线电系

出　　处：《数据采集与处理》1995年第4期261-268,共8页Journal of Data Acquisition and Processing

基　　金：国家自然科学基金;广东省科委科学基金

摘　　要：在图象信号的传输过程中，为了降低比特率，必须进行图象压缩。数字图象压缩中的一种重要技术是子带编码。子波变换由于其在空间频率的良好局部化性能，特别适合于子带编码。本文从一有限长子波变换的算法结构出发，利用矩阵Ｋｒｏｎｅｃｋｅｒ积的性质提出了一种用于图象压缩的二维有限长离散子波变换的算法结构，并且给出了设计快速子波变换算法的方法。The image compression is necessary in the transmission of image signals in order tolower the bit rate. An important technique in compression of digital image is the image subbandcoding. The wavelet transforms are especially suited to the splitting subband signals in subbandcoding system due to their good local performances in both time (space) and frequency. By use ofthe algorithm structure of one dimensional finite wavelet transform and the properties of Kronecker product, this paper presents an algorithm structure of two dimensional finite Wavelet transform used in image subband coding and the design procedures of the faSt wavelet transform algorithms.

关 键 词：图象处理 算法 子带编码 子波变换 图象压缩 

分 类 号：TN919.8[电子电信—通信与信息系统]