快速分形图象压缩算法的研究

分形编码是一种非常有潜力的图象压缩技术，但因其与具很高的时间复杂度，故至今未能获得广泛的应用，本文提出了旨在降低分形编码复杂度，缩短编码时间的分形图像压缩改进算法，该算法采取递归四树分块结构，将多种块分类技术相结合，并通过预计算，旋转与翻转标准化等方法降低计算复杂度，采取高效的存储方案来提高压缩化，力求在图像质量，压缩比和编码时间上取得了良好的折Ｚｏｎｇ使分形编码更加实用化。实验结果表明，采用这种     

分形图像压缩

欧氏几何学不能处理自然界中非常复杂的形状,这只能借助于分形几何学,分形图像压缩就是利用分形几何学的有关原理进行编码,达到图像压缩之目的。     

Structured-light Image Compression Based on Fractal Theory

The method of fractal image compression is introduced which is applied to compress the line structured light image. Based on the self similarity of the structured light image, we attain satisfactory compression ratio and higher peak signal to noise ratio (PSNR). The experimental results indicate that this method can achieve high performance.     

Strkuctured-light Image Compression Based on Fractal Theory

The method of fractal image compression is introduced which is applied to compress the line structured-light image.Based on the self-similarity of the structured-light image, we attain satisfactory compression ratio and higher peak signal-to-noise ratio (PSNR).The experimental results indicate that this method can achieve high performance.     

一种改进的分形图像压缩算法

为了提高分形图像压缩编码的速度,针对在基本分形图像压缩算法中值域块编码匹配搜索时需要对变换后的定义域块一一对应,导致编码时间较长的缺点,提出了一种基于菱形搜索算法的分形图像压缩编码新算法.菱形搜索算法是一种运动估计的快速搜索算法,主要过程是在所有的候选块中搜索当前块的最优匹配块.通过运用菱形搜索算法中的大小菱形模板进行匹配搜索,实验证明文中算法在提高编码速度和降低编码复杂度是有效的.     

分形学与图像压缩编码

介绍分形学的产生意义和作用，提出分形物体的数学模型，讨论分形技术应用于图像压缩编码中的迭代收缩变换算法。     

Low-Delay Parallel Architecture for Fractal Image Compression

This paper presents an efficient hardware architecture for implementing fractal image compression (FIC) algorithm aimed toward image compression with improved encoding speed. The proposed architecture follows the full-search-based FIC scheme. Parallel processing has been effectively used in the present work to achieve the goal of reducing the time complexity of the encoder. This architecture requires a total of \(2n+2\) clock cycles for executing the set of operations consisting of fetching the pixels, calculating the mean of range and domain blocks and doing their mapping, computing the error, and storing the fractal parameter in a memory with n number of pixels in the range block. Further, this architecture does not make use of any preprocessing operations as specified in literature and utilizes the benefits of isometric transformation without requiring additional cycles for every single matching operation. Effective application of isometric transformation has also led to memory reduction of nearly 67 %. Again, in the present work, the use of multipliers has been avoided to save the chip area, to reduce hardware complexity, and to enhance the encoding speed. The operation of transforming contracted domain block with a zero-mean domain block has facilitated relatively fast convergence at the decoder. PSNR above 30dB for a range block of size \(4\times 4\) has been achieved by the proposed architecture, which is comparable to that realizable by other architectures. The proposed design has been coded in Verilog HDL, has been implemented in Xilinx Virtex-5 FPGA, and operates at a clock frequency of 75.52 MHz.     

快速分形图象压缩编码

本文提出一种基于局部迭代函数系统（ＬＩＦＳ）的快速分形图象压缩编码、解码方法。实验表明，该法在恢复图象的信噪比为３０ｄＢ时，仍能达到２５倍的压缩倍数。     

基于分形与改进的SPIHT算法的图像压缩方法

为了避免分形编码所固有的方块效应,进一步提高图像编码的工作效率和重构图像的质量,对分形编码和小波零树编码进行优化组合,提出一种分形与改进的SPIHT算法相结合的图像压缩方法.基本方法是,对小波分解后的低频子带进行基于信息熵的快速分形编码,以减少编码时间;时包含图像细节边缘信息的高频子带进行改进的SPIHT编码,以舍去算法中对显著系数的排序扫描过程,减少算法的复杂度,同时提高重构图像的峰值信噪比.实验表明,相对于经典分形缟码和小波城内的分形编码,该方法在相同压缩比下,提高了编码效率和重构图像的质量,是一种高效快速的编码方法.     

Speeding Up Fractal Image Compression by Genetic Algorithms

The main problem with all fractal compression implementation is execution time. Algorithms can spend hours to compress a single image. Most of the major variants of the standard algorithm for speeding up computation time have led to a bad-quality or a lower compression ratio. For example, the Fishers [7] proposed classification pattern greatly accelerated the algorithm, but image quality was poor due to the search-space reduction imposed by the classification, which eleminates a lot of good solutions.By using genetic algorithms to address the problem, we optimize the domain blocks search. We explore all domain blocks present in the image but not in exhaustive way (like a standard algorithm) and without omitting any possible block (solution) as a classification pattern does. A genetic algorithm is the unique method for satisfying these constraints. And it is a way to do be a random search because the genetic one is directed by fitness selection, which produces optimal solutions.Our goal in this work is to use a genetic algorithm to solve the IFS inverse problem and to build a fractal compression algorithm based on the genetic optimization of a domain blocks search. we have also implemented standard Barnsley algorithm, the Y. Fisher based on classification, and the genetic compression algorithm with quadtree partitioning. A population of transformations was evolved for each range block, and the result is compared with the standard Barnsely algorithm and the Fisher algorithm = based classification.We deduced an optimal set of values for the best parameters combination, and we can also specify the best combination for each desired criteria: best compression ratio, best image quality, or quick compression process. By running many test images, we experimentally found the following set of optimal values of all the algorithm parameters that ensure compromise between execution time and solutions optimality: Population size = 100, Maximum generations = 20, Crossover rate = 0.7, Mutation rate = 0.1, RMS limit = 5, Decomposition error limit = 10, Flips and isometrics count = 8.In our proposed algorithm, results were much better than those obtained both vences and Rudomin [5] and Lankhorst [4] approaches.First online version published in May 2005     

基于树搜索的分形图像压缩编码

本文提出基于树搜索的分形图像压缩编码的新算法。该算法在恢复图像信噪比和主观质量较之全搜索算法略有损失的前提下，大大提高了分形图像编码的速度。     

一种基于K-均值聚类优化的快速分形图像压缩算法

提出了一种基于K-均值聚类的快速分形图像压缩算法,对搜索窗中的父块和子块,根据其方差的不同,用K-均值聚类方法分别对子块和父块进行聚类,子块只对同一类中的父块进行匹配,从而大大缩短了编码时间。实验结果表明,与经典分形压缩算法相比,本文算法编码速度可提高5倍;同基于方差的快速分形压缩算法相比,本文算法也有明显的优势。     

分形插值图像压缩的一种快速解码算法

一维分形插值图像编码是用插值点数据构造分形曲线来拟合数字图像的灰度曲线从而实现压缩。其解码过程就是求用插值点数据构造的迭代函数系统(IFS)的吸引子,由于图像数据以及分形插值迭代规律的特殊性,使得随机迭代算法和通常的固定迭代算法并不适用。本文设计了快速且节省内存的解码算法,并进行了复杂度分析。同时,本文的算法作为分形插值方法的一部分,同样可以用在分形插值法的其他应用领域。     

分形插值图象放大和压缩编码

本文讨论了随机分形插值方法及其在图象放大和图象压缩编码中的应用。实验结果表明，用分形插值方法实现图象放大和压缩编码能获得良好的结果。     

基于相对梯度的自适应图像分形压缩并行算法

介绍了基于IFS(Iterated Function System)的图像分形压缩技术的基本理论,利用原图像及其相对梯度图自相似的特点,采用自适应四叉树分割方法,提出了基于相对梯度的自适应图像分形压缩并行算法。算法复杂性分析表明该方法提高了图像分形的压缩比,计算量少,效率较高。     

Distortion Minimization with Fast Local Search for Fractal Image Compression

Optimal fractal image coding is an NP-hard combinatorial optimization problem, which consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Current fractal image schemes are based on a greedy suboptimal algorithm known as collage coding. In a previous paper, Hamzaoui, Hartenstein, and Saupe proposed a local search algorithm that iteratively improves an initial solution found by collage coding. For a standard fractal scheme based on quadtree image partitions, peak-signal-to-noise ratio (PSNR) gains are up to 0.8 dB. However, the algorithm is time-consuming because it involves many iteration steps, each of which requires the computation of the fixed point of an affine mapping. In this paper, we provide techniques that drastically reduce the complexity of the algorithm. Moreover, we show that the algorithm is also successful with a state-of-the-art fractal scheme based on highly adaptive image partitions.     

基于LabVIEW的图像压缩的研究

DCT(Discrete Cosine Transform,离散余弦变换)是目前应用最为广泛的多媒体数据压缩技术之一,是近年来国际上高速海量的数据处理领域研究的热点之一。利用LabVIEW软件平台及友好的界面实现图像压缩编程。实验表明,适当选取DCT系数,能得到小的均方误差、压缩比高,同时图像效果好,符合图像与视频信息在大量存储以及传输的要求。     

图像压缩与远距离传输研究

为了保障发射机和接收机之间数据的实时传输,研究了保障远距离图像实时无线传输问题。提出了适用于图像压缩编码的改进EZW算法总体框架,论述了算法实现过程,给出了图像压缩发射方案,并设计实现了发射和接收系统。最后进行了图像传输试验,并对结果进行了分析,显然图像传输达到了预期的效果。     

一种基于CCSDS的遥感图像压缩算法研究

提出了一种遥感图像数据的近无损压缩算法,用于对一幅红外图像进行2倍压缩以及解压.该算法基于CCSDS(空间数据系统咨询委员会)提出的对空间数据无损压缩的标准.实现了无损压缩和有损压缩的兼容,对于简单的图像可以实现无损压缩,且压缩比大于2倍,复杂的图像进行2∶1有损压缩,总体压缩比大干等于2.     

基于图像修复的图像编码技术

数字图像修复技术是图像恢复领域的一个重要分支,它的目的是根据图像现有的信息来自动恢复丢失的信息,它可以用于旧照片中丢失信息的恢复、视频文字去除以及视频错误隐藏等。结合数字修复技术的图像压缩编码技术是基于对象的第二代图像编码中的研究热点之一。这里首先介绍了图像修复技术的概念,然后分类说明了几种常见的修复技术,在此基础上,得到了基于图像修复的压缩编码技术的基本处理流程,最后以具体算法为例说明了基于图像修复的压缩编码技术的压缩过程。