共查询到18条相似文献,搜索用时 218 毫秒
1.
2.
3.
IFS分形吸引子控制技术综述 总被引:1,自引:0,他引:1
迭代函数系统(IFS)是分形吸引子生成的典型方法,近几年来其研究取得了较大的进展,但吸引子的控制技术还很不成熟.概述了国内外的最新研究结果,分析了参数控制、仿射变换控制、概率分布控制和图形交互操作控制等方法,比较了各种控制方法的优缺点.最后指出IFS分形控制技术目前存在的问题和进一步的发展方向. 相似文献
4.
目的为了解决传统的分形图像压缩算法计算量大和实时性差的问题,提出一种改进的分形灰度图像压缩算法。方法算法首先基于Gabor变换提取图像块的纹理特征,然后基于K-means算法对R块和D块以纹理作为特征进行聚类处理,并仅对同一类别的R块和D块进行匹配操作。结果在候选块池的构造过程中,文中提出了8种等距变换的简化算法。结论文中方法能够在加快分形压缩速度的同时,较好地保证重建图像的视觉效果,具有较好的鲁棒性。 相似文献
5.
Al2014+ 15 vo l% SiCPMMC 压缩试样加载应变至约33 % 时, 首次发现应力-应变曲线发生不规则振荡。此振荡应该是试样内微裂纹分形演化至破坏过程的宏观表现。对实验样本数据进行分形插值, 得到一与压缩仿射变换相应的迭代函数系统( IFS) , 以此IFS 应用随机迭代算法重建了该MMC 带分形微裂纹演化的本构关系。对原实验振荡曲线及IFS 随机算法重构曲线进行了功率谱分析, 两者呈现了良好的一致性。最后采用G-P 算法对重构曲线进行时间序列分析, 找到了吸引子积分关联函数, 确定描述该MMC 微裂纹演化动力学过程的最少独立变量数目为4, 得到吸引子维数D = 1. 48。 相似文献
6.
图像经分形编码后产生IFS分形码,它可被用来进行图像检索操作。针对图像检索的特点,将分形码中的位置参数替换为相对距离与方向系数。定义了分形码间的距离以及图像间的分形码距离,并取出分形码距离最小的前门幅图像作为检索结果,由此提出了基于IFS分形码的快速图像检索算法。从时间复杂性上分析,利用本文算法所需的检索时间与值域块的个数有关。实验结果表明,相对缩放与旋转变化,算法对位移与亮度变化具有较强的稳定性,其分形码距离的均值仅为14.07和20.05;并可检索到具有一定相似性的图像,且类间与类内分形码距离约相差8,类内距离远小于类间距离。 相似文献
7.
8.
阐述了迭代函数系(IteratedFunctionSystem,简称IFS)理论及随机迭代算法,通过理论解析给出了求IFS吸引子界的方法,介绍了IFS吸引子的Lyapunov指数和关联维数的算法。利用计算机构造了一系列IFS吸引子,计算了IFS吸引子的界、Lyapunov指数和关联维数,分析了IFS吸引子的动力学特征,讨论了当参数变化时IFS吸引子界的变化规律。 相似文献
9.
图像压缩编码方法综述 总被引:5,自引:0,他引:5
本文对图像压缩的几种经典压缩编码方法进行了汇总和分析。介绍了他们的压缩原理和特点,然后对新一代的编码方法,包括小波变换编码、分形编码和神经网络编码,进行了简要的介绍。指出了各自的优缺点,并对图像压缩编码方法的发展方向进行了展望。 相似文献
10.
矢量量化LBG算法的研究 总被引:2,自引:0,他引:2
论述经典的LBG算法的基本原理、量化器设计的关键之处和存在的问题.以矢量量化技术在图像压缩领域的应用作为研究目标,总结分析现有典型的LBG算法,并针对LBG算法的不足,提出改进的算法,减少计算复杂度,缩短程序运行时间.通过理论推导和具体实现,证明改进方法的可行性和有效性. 相似文献
11.
12.
In this paper, an adaptive searchless fractal image compression technique in the frequency domain is proposed. Proposed methods aim to improve image compression fidelity criteria in discrete cosine transform domain (DCT). In this work spatial domain, adaptive methods are exercised in discrete cosine domain for optimisation of image encoding. Variance-based selection of image blocks and adaptive threshold are two simple adaptive techniques administered on attaining objectives of image compression. First, range block exclusion adaptive method removes homogenous range blocks before FIC coding. This exclusion consequently recedes the number of range-domain blocks matching operations. Proposed hybrid compression algorithm localises domain block location about range block without searching entire domain pool. Second technique implemented is domain pool size reduction. Variances of range and domain blocks are compared. Domain blocks that are within threshold value are kept in the pool. Finally to further optimise the performance of encoding adaptive threshold in quadtree partitioning is applied in along with variance domain selection approach. Simulation results substantiate that adaptive techniques have higher coding performance in terms of encoding time, peak signal to noise ratio and compression ratio in contrast to the fractal image encoding without adaptive techniques. 相似文献
13.
为克服快速分形图像编码带来的解码图像质量下降问题,提出了一种神经网络与方差混合编码的快速分形图像编码算法.该算法结合图像子块复杂度与方差值的对应关系,根据每个区块的方差值大小选择适当的映射编码方法,即对于方差值相对小的区块采用方差编码以提高编码速度,对于方差值相对大的区块采用神经网络编码以提高编码质量.该算法可以较好地修正传统分形编码中由于自仿射映射结构限制所带来的解码质量偏低的问题,在大幅提高编码速度的同时,很好地保持了图像的编码质量.实验结果表明,该算法对比基本分形编码算法可以加速24倍,解码图像的质量对比方差快速分形编码算法有1.1dB的提高.同时,该算法的硬件实现比较容易,非常贴近实用化. 相似文献
14.
本文基于小波变换研究了分形图像压缩系统.根据小波系数的能量分布特性,给出了新的小波树定义与分类方法,并在小波域内建立了具有双伸缩因子的压缩映射.在将新的压缩映射应用于图像编码过程时,结合小波嵌入式零树编码思想给出了新的小波分形图像压缩方法.数值实验给出了本文方法与已有方法的比较. 相似文献
15.
16.
简要介绍了迭代函数系统(IFS)的基本理论,阐述了将IFS理论及IFS分形图形用于包装设计及包装防伪的思想,并提出可供实施的方法. 相似文献
17.
Rajkumar Soundrapandiyan Marimuthu Karuppiah Saru Kumari Sanjay Kumar Tyagi Fan Wu Ki‐Hyun Jung 《International journal of imaging systems and technology》2017,27(2):118-132
Image fusion aims to integrate complementary information from multiple modalities into a single image with none distortion and loss of data. Image fusion is important in medical imaging, specifically for the purpose of detecting the tumor and identification of diseases. In this article, completely unique discrete wavelet transform (DWT) and intuitionistic fuzzy sets (IFSs) based fusion method (DWT‐IFS) is proposed. For fusion, initially, all source images are fused using DWT with the average, maximum, and entropy fusion rules. Besides, on the fused image IFS is applied. In the IFS process images are converted into intuitionistic fuzzy images (IFIs) by selecting an optimum value for the parameter in membership, non‐membership, and hesitation degree function using entropy. Then, the resulting IFIs are decomposed into the blocks, and the corresponding blocks of the images are fused using the intersection and union operations of IFS. The efficiency of the proposed DWT‐IFS fusion method is recognized by examining it with other existing methods, such as Averaging (AVG), Principal Component Analysis (PCA), Laplacian Pyramid Approach (LPA), Contrast Pyramid Approach (CPA), Discrete Wavelet Transform (DWT), Morphological Pyramid Approach (MPA), Redundancy Discrete Wavelet Transform (RDWT), Contourlet Transform (CONTRA), and Intuitionistic Fuzzy Set (IFS) using subjective and objective performance evaluation measures. The experimental results reveal that the proposed DWT‐IFS fusion method provides higher quality of information in terms of physical properties and contrast as compared to the existing methods. 相似文献
18.
Mauricio Gaona Walter S. Kuklinski 《International journal of imaging systems and technology》1999,10(5):369-378
This paper presents a fractal image compression method that utilized a genetic optimization algorithm for optimal domain block selection. The technique successfully addresses the problem of finding an optimal domain block pool for a given range partition, one of the most important issues in fractal image compression. This technique utilizes a genetic optimization algorithm that starts with a source image and generates both a random range partition and a random set of candidate domain blocks for each element of the range partition. Each member of the candidate domain block set was mapped to the corresponding element of the range partition. It was subsequently tested via a quantitative objective function, ranked using a linear fitness scheme and modified, as required, using crossover and mutation operators. This evolutionary process converged to produce an optimal iterated function system (IFS) representation of the source image within a few generations in a robust and efficient manner. © 1999 John Wiley & Sons, Inc. Int J Imaging Syst Technol 10, 369–378, 1999 相似文献