结合判别函数的分形IFS图像检索

该文提出一种分形编码的图像比对搜索方法,即把迭代函数系可反映图像的拓扑特性,用于图像的储存和检索.而图像经过分形编码后,得到大量资料,需要一个有效的方法进行检索,文中根据Fisher判别函数来判定图像相似度.实验结果表明,图像比对搜索引擎能准确找出查询图像的相似图像外,还证实本方法对图像有一定的容错性能,能有效地提高图像比对搜索引擎在实际应用中的可适性。     

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

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

Content-based image retrieval using block-constrained fractalcoding and nona-tree decomposition

Fractal coding has been proved useful for image compression. In fractal coding, an image is represented by a number of self-transformations (fractal code) by which an approximation of the original image can be reconstructed. The authors present a block-constrained fractal coding scheme and a nona-tree decomposition based matching strategy for content-based image retrieval. In the coding scheme, an image is partitioned into non-overlapped blocks with a size close to that of a query iconic image. The fractal code is generated for each block independently. In the similarity measure of the fractal code, an improved nona-tree decomposition scheme is adopted to avoid matching the fractal code globally in order to reduce computational complexity. The experimental results show that the authors' coding scheme and matching strategy are useful for image retrieval, and compare favourably with two other methods tested in terms of storage usage and computing time     

一种分形域基于内容的图像检索方法

基于内容的图像检索是多媒体、网络通信及计算机等应用研究领域的一项关键技术。该文提出了一种在分形压缩域直接进行基于内容的图像检索方法。该方法不需要对查询图像进行分形变换，因此可以提高检索速度，降低检索复杂度。仿真结果表明，使用该文提出的方法，能够有效地进行分形域基于内容的图像检索，比较大幅度地降低了检索时间，优于试验中其他3种方法。     

使用拼贴误差直方图的分形图像检索

拼贴误差是值域块与最匹配的定义域块相似性的一个度量,然而很多基于分形编码参数的分形图像检索技术却忽略了拼贴误差。该文使用拼贴误差直方图作为检索条件,来判定图像的相似度。对有200多张纹理图像的数据库的实验显示,该方法不仅减少了计算的复杂度,而且也有一定的检索准确率。     

多波段遥感图像的快速分形编码

分形图像编码用动态迭代过程的参数来表示相应的静态图像数据,可以突破熵压缩编码的理论界限,因而得到广泛的关注.将分形图像编码应用于多波段遥感图像压缩中,根据多波段遥感图像的特点,对基于四叉树分割的快速分形编码方法进行改进,令各个波段图像共享同一四叉树分割方式,同时,利用多波段遥感图像的谱间相关性,缩小仿射变换的搜索匹配空间,以此来提高压缩比和编码速度,实验表明,本方法能显著提高基于四叉树分割的分形编码方法的性能,取得了令人满意的结果.     

基于FGSE的快速分形图像编码算法及其多描述编码方案

本文在基于分形图像编码的多描述编码方案（MDFIC）的基础上,做了两处改进：一是引入提出的基于FGSE的快速分形图像编码算法,以提高编码速度;二是利用相邻值域块均值间的相关性,以减少比特率。实验结果表明,本方案与MDFIC相比,可以在保持解码图像质量几乎不变的情况下,提高编码速度和减少比特率,并具有较高的鲁棒性。     

基于图像活动性的序列图像分形编码方法

介绍了分形的概念以及分形压缩的主要思想;阐述了传统的分形图像压缩编码的基本原理与实现方法;提出了一种基于图像活动性序列图像分形编码方法。该方法首先由相邻帧之间的预测差值来判断当前编码块的活动性,然后根据图像的活动性,对不同特性的块采用不同的分形编码策略,最后对编码后得到的迭代函数系统（IFS）码进行可变长度编码（VLC）,以获得更高的压缩比。     

Still image coding based on vector quantization and fractalapproximation

In this paper, we propose a coding algorithm for still images using vector quantization (VQ) and fractal approximation, in which low-frequency components of an input image are approximated by VQ, and its residual is coded by fractal mapping. The conventional fractal coding algorithms indirectly used the gray patterns of an original image with contraction mapping, whereas the proposed fractal coding method employs an approximated and then decimated image as a domain pool and uses its gray patterns. Thus, the proposed algorithm utilizes fractal approximation without the constraint of contraction mapping. For approximation of an original image, we employ the discrete cosine transform (DCT) rather than conventional polynomial-based transforms. In addition, for variable blocksize segmentation, we use the fractal dimension of a block that represents the roughness of the gray surface of a region. Computer simulations with several test images show that the proposed method shows better performance than the conventional fractal coding methods for encoding still pictures.     

Iteration-free fractal image coding based on efficient domain pooldesign

The domain pool design is one of the dominant issues which affect the coding performance of fractal image compression. In this paper, we employ the LBG algorithm and propose a block averaging method to design the efficient domain pools based on a proposed iteration-free fractal image codec. The redundancies between the generated domain blocks are reduced by the proposed methods. Therefore, we can obtain the domain pools that are more efficient than those in the conventional fractal coding schemes and thus the coding performance is improved. On the other hand, the iteration process in the conventional fractal coding scheme not only requires a large size of memory and a high computation complexity but also prolongs the decoding process. The proposed iteration-free fractal codec can overcome the problems above. In computer simulation, both the LBG-based and block-averaging methods for the domain pool design in the proposed iteration free scheme achieve excellent performances. For example, based on the proposed block-averaging method, the decoded Lena image has at least a 0.5 dB higher PSNR (under the same bit rate) and an eight-time faster decoding speed than the conventional fractal coding schemes that require iterations.     

序列图像的分形编码

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

An effective image retrieval method based on Kernel Density Estimation of collage error and moment invariants

In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The proposed method is called CHK (KDE of Collage error and Hu moment) and it is tested on the Vistex texture database with 640 natural images. Experimental results show that the Average Retrieval Rate (ARR) can reach into 78.18%, which demonstrates that the proposed method performs better than the one with parameters respectively as well as the commonly used histogram method both on retrieval rate and retrieval time.     

基于Krawtchouk矩不变量和核模糊聚类的快速分形编码

针对基于分类的快速分形编码方法存在着编码速度与解码质量间的矛盾,鉴于Krawtchouk矩不变量具有在仿射变换下保持不变的特性和核模糊聚类在处理非线性问题上的突出优势,本文首次将这两者引入到分形编码中,提出了基于Krawtchouk矩不变量和核模糊聚类的自适应分类快速分形编码方法。首先根据Domain块的方差将其粗分类,再根据Domain块的Krawtchouk矩不变量利用核模糊聚类对Domain块细分类。实验结果表明,与其他基于分类的快速分形编码方法相比,在解码图像质量提高的同时,大大加快了分形编码的速度。     

基于小波分析的分形图像去噪压缩方法

近十几年来,分形(Fractal)在图像压缩技术中的应用已成为图像数据压缩领域中最为热点的问题之一。其压缩比在理论上可超过经典压缩方法的几个数量级。但实际上,原始图像经常被噪声污染。噪声的存在一方面使得图像编码的时间延长,另一方面降低了图像的信噪比,使图像质量明显下降。本文对小波变换、分形压缩编码的原理和特点进行了分析;结合小波变换和分形压缩编码,利用分形的自相似性,研究了基于小波域的分形图像去噪、压缩方法。该方法有效地减少了计算复杂度和编码时间并获得了良好的图像质量。实验结果表明,该方法在较大的压缩范围内,能够获得好的压缩结果,同时也表明采用这种方法的潜力之所在。     

分数微积分用于分形压缩图像嵌入灰度水印

传统的基于分形编码的水印技术一般嵌入0,1序列,没有实现灰度图像嵌入。本文在研究正交化分形编码的基础上,利用正交化分形编码参数在迭代过程中的不变性,构造出水印嵌入变换函数,使水印直接嵌入解码参数。分数阶微分序列的引入有效解决了嵌入水印的保密性问题,使得在分形编码的过程中嵌入灰度水印的方法具有了可行性,实现了图像压缩与水印嵌入一体化技术。实验结果表明,水印嵌入对宿主图像的分形编码质量几乎没有影响,水印提取质量良好,且采用分数阶微分序列对灰度水印进行加密效果较好。     

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.     

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

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

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

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

基于亚取样分形插值预测的混合图像编码方法

提出了一种基于亚取样分形插值预测的混合图像编码方法。将原始图像在水平方向和垂直方向皆作１／２抽取得到一幅“亚抽图像”，对亚抽图像进行分形编码得到亚抽图像的分形码，采用分形插值方法由亚抽图像的分形码解码得到原始图像的分形预测图像，然后对预测误差图像进行基于ＤＣＴ的自适应补偿编码。实验表明，这种方法的编码速度有了很大提高，而且恢复图像的质量具有较高的保真度。     

基于方向性零树小波的分形图像编码

该文阐述了分形图像方块编码在小波变换域内实现的原理,将零树概念扩展后与小波域的分形仿射变换相结合,提出一种基于方向性零树小波的分形图像编码方法。计算机模拟实验表明,在高压缩比时,其编码性能优于典型的基于四叉树分割的分形图像编码性能,接近于嵌入式零树小波编码(EZW)的性能。