余域中分形方块编码的一种快速解码结构

分形方块编码（ＦＢＣ）作为一种具有高压缩比潜力的图像编码方法，正受到越来越多的关注，余域中的分形方块编码（ＦＢＣＲＤ）是对基本ＦＢＣ的一种改进，它使得在编码效应及恢复图像质量基本不变的情况下，解码的迭代次数和计算时间大为减少，本文针对ＦＢＣＲＤ又提出一种快速解码迭代结构，使得解码迭代过程进一步优化，实验表明，总的解码计算时间比基本的ＦＢＣ和非快速解码结构的ＦＢＣＲＤ都大大地减少了，这为分形图像编码     

使用区域搜索的DCT域分形图像编码方法

为降低ＤＣＴ域分形图像压缩的编码复杂度,文中引入了平坦块的概念,对那些经过ＤＣＴ变换后,能量非常集中的块不做块匹配,而是直接编码输出。同时经统计发现,对于给定的区块,与它匹配最好的域块通常位于这个区块的上方或附近,文中利用这个事实构造了一种优化的自适应搜索方案,大大减少了编码所需要的时间。实验表明,与一般的ＤＣＴ域分形图像压缩方法相比,文中方案在提高了编码速度的同时降低了比特率。     

Combining fractal image compression and vector quantization

In fractal image compression, the code is an efficient binary representation of a contractive mapping whose unique fixed point approximates the original image. The mapping is typically composed of affine transformations, each approximating a block of the image by another block (called domain block) selected from the same image. The search for a suitable domain block is time-consuming. Moreover, the rate distortion performance of most fractal image coders is not satisfactory. We show how a few fixed vectors designed from a set of training images by a clustering algorithm accelerates the search for the domain blocks and improves both the rate-distortion performance and the decoding speed of a pure fractal coder, when they are used as a supplementary vector quantization codebook. We implemented two quadtree-based schemes: a fast top-down heuristic technique and one optimized with a Lagrange multiplier method. For the 8 bits per pixel (bpp) luminance part of the 512kappa512 Lena image, our best scheme achieved a peak-signal-to-noise ratio of 32.50 dB at 0.25 bpp.     

一种快速分形图像编码算法

目前,分形图像编码技术最主要的缺点仍然是编码时间太长.因此,如何提高分形图像编码速度成为当前分形图像编码技术的研究热点.本文从分形图像编码通用公式推导出一个不等式,利用此不等式,可以预先排除大量不可能与值域块匹配的定义域块,从而减少值域块与定义域块的匹配计算,以此达到缩短编码时间的目的.实验结果表明,在解码图像质量基本不变情况下,本文的方法所使用的编码时间比Fisher方案所需的编码时间减少了很多.     

Gradient match and side match fractal vector quantizers for images

In this paper, we propose gradient match fractal vector quantizers (GMFVQs) and side match fractal vector quantizers (SMFVQs), which are two classes of finite state fractal vector quantizers (FSFVQs), for the image coding framework. In our previous work, we proposed the noniterative fractal block coding (FBC) technique to improve the decoding speed and the coding performance for conventional FBC techniques. To reduce the number of bits for denoting the fractal code of the range block, the concepts of the gradient match vector quantizers (GMVQs) and the side match vector quantizers (SMVQs) are employed to the noniterative FBC technique. Unlike ordinary vector quantizers, the super codebooks in the proposed GMFVQs and SMFVQs are generated from the affine-transformed domain blocks in the noniterative FBC technique. The codewords in the state codebook are dynamically extracted from the super codebook with the side-match and gradient-match criteria. The redundancy in the affine-transformed domain blocks is greatly reduced and the compression ratio can be significantly increased. Our simulation results show that 15%-20% of the bit rates in the noniterative FBC technique are saved by using the proposed GMFVQs.     

基于分形的混合图象压缩方法

分形图象压缩方法是近年来迅速兴起的一种高倍率图象压缩方法，它依据分形原理，利用迭代函数系统（IFS）来抽取自然图象中的自相似性，达到压缩图象的目的；解码时利用拼帖定理来快速恢复图象。然而它最大的缺点是速度太慢。为此，本文将分形图象压缩同传统的块截取变换方法（BlockTruncatingCoding）结合，在压缩速度、压缩倍数和压缩失真方面有个折衷，达到较好的性能。     

基于分形和小波变换的自适应混合图像编码

待编码图像经过金字塔型离散小波变换后的系数在小波域内可以组成分层树状数据结构一个小波树，这些跨越不同分辨率的小波树之间存在一定的相似性，可以通过分形变换来描述，本文正是构造小波树的基础邮基于分形和小波变换的自适应混合图像压缩算法，实验证明，我们提出的图像压缩方法与ＪＰＥＧ相比，能够在相近的压缩比的情况下（６０：１～７０：１）使得重建图像的ＰＳＮＲ（〉２９．５ｄＢ）增加约５．４ｄＢ并且图像的主观视觉     

机动目标的逆合成孔径雷达成像原理与算法

对于非合作的机动目标,由于目标相对于雷达射线的姿态和转速难以测定,而且是时变的,因而给逆合成孔径雷达(ISAR)成像造成较大困难.本文讨论了这种情况下成像的一般原理,并对机动性不太大,散射点子回波多普勒变化满足一阶近似条件时,提出了实用算法.实测数据的处理结果说明新算法是可行的.     

Statistical feature extraction based technique for fast fractal image compression

Fractal image compression is an innovative way of image representation by using relationships among the sub-section of image itself. It utilizes the existence of self-symmetry and uses affine contractive transforms. This technique has manifold advantages like, very high compression ratio, high decompression speed, high bit-rate and resolution independence, but high computation time expenses of suitable domain search in coding phase is the major bottleneck of the technique. This paper presents a fast fractal compression scheme based on feature extraction and innovative way of image comparison. In proposed development the complexity of suitable domain search is reduced by transforming the problem from image domain to vector domain. Simulation results confirms that suggested variant leads to a faster system as compared to existing state-of art Fractal Image Compression techniques.     

序列图像的分形编码

分形方法作为一种新兴的图像编码方法,有着压缩比高等独特的优点。但由于它也有着致命的缺点,即编码速度速度很慢,目前对于序列图像的分形编码的研究方兴未艾。文章介绍了两类主要的序列图像分形编码方法,并对其进行了展望。     

Isometry-Based Shape-Adaptive Fractal Coding for Images

Fractal image coding is an effective method to eliminate the image redundancy through piecewise self-transformability. The fractal code consists of a set of contractive affine transforms. To improve the performance when a range block experiences large error, we usually partition the range block into square or nonsquare subrange blocks for two- or multilevel fractal coding. In this paper, we find an inherent property of fractal coding that can be used to decide the edge orientation of a range block. Then this property is used for shape-adaptive fractal coding (SAFC). In SAFC, the top-level range block is partitioned into square or nonsquare (rectangle or triangle) subrange blocks for multilevel fractal encoding. Here, the maximum size of the range block can be the same as that of the whole image size while the minimum size is 4×4. In SAFC, no additional computations are required to obtain the edge orientation of a range block. Instead, we propose an edge-orientation detector, where the edge orientation of a range block is obtained during the fractal encoding process. According to our simulation results, SAFC can reduce the bit rate requirement of the conventional fractal coding scheme.     

一种新的分形图象压缩编码方法

本文首先研究了一般分形图象压缩方法存在的缺陷,然后对它进行了改进.最后在DCT域进行进一步改进。实验结果表明,与原来方法相比较,改进后的方法具有明显的优越性。     

A NEW FRACTAL IMAGE CODING METHOD

Some shortcomings of common fractal image coding methods are studied , then they are corrected with a new method. The new method is improved further in DCT domain. Coding results show the advantage of the new method.     

基于遗传算法和迭代函数系统的图像压缩方法

分形图像编码是一种具有诱人前景的压缩编码方法,它能够实现很高的压缩比而且主观质量良好。由于分形编码中搜索与给定值域块了相匹配的定义域块的过程耗时很长,因此分形编码速度很低。遗传算法是一种在最优搜索应用中十分常见的高效搜索算法。文中在讨论研究遗传算法效率的基础上,将遗传算法应用到分形图像压缩编码中,有效地解决了分形图像编码中的最优匹配问题,实验结果表明将遗传算法与分形压缩编码有机地结合起来可以大大提     

分形图像压缩方法

分形几何方法是一种新的图像压缩编码方法。本文介绍了分形几何和分形图像压缩的一些基本概念，以及以分形为基础的几种图像压缩编码方法。     

基于视觉特性的分形图像压缩编码

介绍了分形的基本概念及分形的数学原理，并针对传统的分形图像压缩编码算法的不足之处，提出了一种基于视觉特性的分形压缩算法，该方法利用人眼对灰度变化的敏感程度与背景有关的特点，在综合考虑图像块的均值与方差的前提下，动态地改变分形压编码时定义域块仿射变换后拼贴到值域块的最小误差，从而提高了编码速度。     

基于平方加权质心特征的快速分形图像压缩编码

分形图像压缩利用自身图像具有的相似性,结合压缩仿射变换减少图像数据的冗余来实现图像数据的压缩,具有压缩比高、恢复简单的特点。然而,分形图像压缩编码也具有编码时间长、计算复杂的缺点。为了解决上述的缺点,提出了基于平方加权质心特征的快速分形图像压缩编码算法,利用平方加权质心特征可以将基本分形图像压缩编码过程中的全局搜索转化为局部搜索,限定搜索范围,减少码本数量,在巨大图像信息量传输和存储过程中,在一定程度上缩短了编码时间。将平方加权质心特征快速分形图像压缩编码算法和双交叉和算法、改进叉迹算法、规范五点和算法进行比较,仿真结果表明,所提算法在恢复质量可接受情况下,编码时间具有巨大优势。     

Fractal coding of subbands with an oriented partition

We propose a new image compression scheme based on fractal coding of the coefficients of a wavelet transform, in order to take into account the self-similarity observed in each subband. The original image is first decomposed into subbands containing information in different spatial directions and at different scales, using an orthogonal wavelet-generated filter bank. Subbands are encoded using local iterated function systems (LIFS), with range and domain blocks presenting horizontal or vertical directionalities. Their sizes are defined according to the correlation lengths and resolution of each subband. The edge degradation and the blocking effects encountered at low bit-rates using conventional LIFS algorithm are reduced with this approach. The computation complexity is also greatly decreased by a 12:1 factor in comparison to fractal coding of the full resolution image. The proposed method is applied to standard test images. The comparison with other fractal coding approaches and with JPEG shows an important increase in terms of PPSNR/bit-rate. Especially for images presenting a privileged directionality, the use of adaptive partitions results in about 3 dB improvement in PPSNR. We also discuss the distorsion versus rate improvement obtained on high-frequency subbands when fractal coding instead of pyramidal vector quantization is used. Our approach achieves a real gain in PPSNR for low bit-rates between 0.3 and 1.2 bpp.     

四线和特征的快速分形图像编码

分形图像编码具有压缩比高、解码速度快、重构图像质量高等特点,但因这种算法在编码时定义域的搜索量十分巨大,导致其计算复杂度高、编码时间过长,阻碍了它的实用性和普遍应用.为解决此问题,文中提出一种基于四线和特征值编码算法,该算法根据匹配均方根误差与四线和特征间的关系,将全局搜索转化为局部搜索(近邻搜索),限定搜索空间,减少定义域块的搜索,从而提高编码速度.仿真实验结果表明:该算法解码图像质量在客观上优于1 -范数特征算法;与基本分形编码算法相比,基于四线和特征算法在主观上不改变重构图像质量,但在编码速度上却得到极大提高.     

一种满速率空时分组编码CDMA系统及多用户接收方案

通过引入满速率空时分组码方案, 该文给出一种满速率空时分组编码CDMA系统模型, 并针对现有空时编码CDMA系统过高的译码复杂度, 提出一种低复杂度的多用户接收方案。该方案在通过类似多用户检测方法有效抑制多用户干扰后, 充分利用空时分组码的复正交性来简化原有方案高译码复杂度。与原有指数性译码复杂度相比, 该方案有着线性复杂度, 而且与满分集空时分组编码CDMA系统相比, 可实现满速率、低复杂度和部分分集, 有着相对多的空间冗余信息, 从而级联信道编码后可有效弥补部分分集所带来的性能损失。仿真结果表明在相同系统容量和级联码的情况下, 所给系统比相应的满分集空时编码CDMA系统有着低的误比特率。