根据此思想给出了一个新的具体实现分形编码的算法。
Based on the idea, a new concrete algorithm for realizing fractal image coding is designed in the paper.
提出了一种基于自适应四叉树分形编码的数字水印技术。
This article introduces a digital watermarking technology based on adaptive quadtree fractal coding.
在分形编码过程中，搜索值域块的最佳匹配的定义域块的计算量最大。
The searching computation of the best matched domain block is most heavy in the fractal encoding process.
传统的基于分形编码的水印技术一般采用0,1码，没有实现灰度图像的嵌入。
The traditional watermarking techniques based on fractal coding is generally using 0, 1 sequence as the watermark.
分形编码的时间主要花费于在一个海量码本中搜索每个输入子块的最佳匹配块。
The time to encode fractally an image is mostly spent on searching for the best-matched block for each of range blocks in a usually-large domain pool.
传统的基于分形编码的水印技术一般嵌入0,1序列，没有实现灰度图像嵌入。
For traditional watermarking techniques based on fractal coding, watermarking format is limited to binary sequence 0, 1, thus incapable of gray-scale image embedding.
传统的利用分形编码嵌入数字水印的方法所需编码时间较长，对图像质量的影响大。
The traditional method of using fractal coding to embed watermarking often took a long time, which also strongly influenced the quality of images.
分形编码在图像压缩方面取得了很好的效果，同时也能够用于基于内容的图像检索。
Fractal coding has been proved useful for image compression, and it is also proved effective for content-based image retrieval.
目前有很多基于离散小波变换(DWT)的水印算法，但结合分形编码技术的很少。
Currently, there are many DWT (Discrete wavelet Transform) based watermarking algorithms, but few of them discuss the issue in association with fractal image coding in wavelet domain.
第3章介绍分形编码的基本原理、基本分形算法的描述与实现，以及实验结果的讨论。
Chapter 3 describes the basic principle of fractal image coding, and gives the description and implementation of the baseline fractal coding algorithm, and discusses experimental results.
本文通过介绍常见的图像压缩技术——哈夫曼编码和分形编码，提出了一些改进的方法。
This paper first introduces the common image compression technology-Huffman coding and fractal coding, and then proposes some improvements.
提出了基于多尺度匹配的快速分形块编码，该方法为缩短分形编码的搜索时间提供了一条新途径。
A quick fractal block coding based on multiscale matching is presented in this paper. It provides a new approach for reducing search time.
提出了基于四叉树分形编码的水印算法，通过在不同寻找区域中搜索最佳匹配定义域块来嵌入水印。
This paper proposes a watermarking algorithm based on quadtree fractal coding, which is to search for the optimized matched domain blocks in different regions and to embed the watermarking.
因此，一幅图像的分形编码就是寻找一个合适的压缩仿射变换，它的不动点是原始图像尽可能好的近似。
Thus, encoding an image by fractal techniques consists of finding an appropriate contractive transformation whose fixed point is the best possible approximation of the original image.
对原始图像进行四叉树分形编码后，通过给定子块在不同的寻找区域中搜索其最佳匹配父块来嵌入水印。
After the original image is maked to quadtree fractal coding, we embed watermarking into it by range blocks searching its most-matched domain blocks in different search regions.
为了缩短分形编码中值域块与定义域块池中的定义域块逐一匹配时间，提出了四级邻域匹配分形近似编码。
To shorten the matching time, the four level fractal approximation coding based on matching in neighborhood is presented.
采用值域块均值作为分形编码的参数可加快分形编码的速度，提高压缩比和加快分形图像压缩解码的收敛速度。
With the mean of range block, the compression ratio is improved, the coding time and reconstruction time are decreased.
接着进一步提出一种可能的快速混合分形编码的算法，该算法将快速搜索方法、统计规范化、频域比较结合起来。
We further propose a possible fast hybrid fractal encoding algorithm which combines existing fast search methods, statistical normalization and frequency domain comparison.
在分形近邻距离的基础上，提出了分形奇异值近邻距离，并把分形编码和局部奇异值分解结合起来，提高了识别率。
Fractal singular value neighbor distance is brought forward based on fractal neighbor distance. Fractal coding and local singular value decomposition are used to improve the recognition rate.
利用改进的分形编码提出了一种有效的视频编码方法，称作基于小波分形逼近(WBFA)，和运动补偿(MC)。
An efficient scheme for video coding is presented which utilizes progressive fractal coding, called wavelet-based fractal approximation (WBFA), and motion compensation (MC).
本文参考了分形编码中现在最新颖的匹配算法-特征向量法，提出了基于相对梯度的快速编码和基于叉迹特征的快速编码算法。
So we used the most novel matching method-feature vector method to propose two fast algorithms: one is relative gradient-based algorithm, the other is cross trace-based algorithm.
针对分形图像压缩中矩形划分计算量太大的问题，提出了一种混合分类方法并将其应用于图像的矩不变量，得到了一种基于矩形划分的快速分形编码方法。
Aiming at the question that the computational complexity of HV partition is great in fractal image compressing, a hybrid classification method was proposed and it was used on mass center of image.
在图像分形编码结果的所有元素中，拼贴误差最直观地表现了值域块与其最优匹配块之间的相似程度，因而我们选用它来作为图像的局部自相似性的度量。
We choose collage error as local self-similarity evaluation of the image, because collage error visually represents the similarity between value range blocks and optimal matching blocks.
目前分形图像压缩的最主要问题是其编码时间太长，这主要是因为在分形编码时，对每一个待编码值域块都需要比较数量巨大的定义域块才能找到它的最优匹配块。
The nowadays fractal image compression schemes suffers from long encoding time, because of considerable comparisons with domain blocks for each range block to find its best-match domain blocks.
分形几何方法是一种新的图像压缩编码方法。
Fractal geometry method is a new method of image compression coding.
量化后的仿射变换t构成了图像块的分形块编码。
Quantized affine transformation t constitutes the fractal block coding of the image block.
量化后的仿射变换t构成了图像块的分形块编码。
Quantized affine transformation t constitutes the fractal block coding of the image block.
应用推荐