共查询到18条相似文献,搜索用时 109 毫秒
1.
2.
3.
分形图象压缩编码的回顾与展望 总被引:1,自引:0,他引:1
介绍了分析图象压缩编码的历史和现状,以及几种方法的分形压缩技术,总结了近年来在分形图象压缩编码方法所取得的重要进展,并提出了一种新的序列图象分形编码的思路。 相似文献
4.
基于分形的混合图象压缩方法 总被引:9,自引:0,他引:9
分形图象压缩方法是近年来迅速兴起的一种高倍率图象压缩方法,它依据分形原理,利用迭代函数系统(IFS)来抽取自然图象中的自相似性,达到压缩图象的目的;解码时利用拼帖定理来快速恢复图象。然而它最大的缺点是速度太慢。为此,本文将分形图象压缩同传统的块截取变换方法(BlockTruncatingCoding)结合,在压缩速度、压缩倍数和压缩失真方面有个折衷,达到较好的性能。 相似文献
5.
6.
快速分形图象压缩编码 总被引:37,自引:3,他引:34
本文提出一种基于局部迭代函数系统(LIFS)的快速分形图象压缩编码、解码方法。实验表明,该法在恢复图象的信噪比为30dB时,仍能达到25倍的压缩倍数。 相似文献
7.
范策 《微电子学与计算机》2002,19(11):65-67
文章就分形图象压缩中搜索与匹配过程的相似性提出了一个经过不同对比度实现快速分形编码算法,基于序列块和主块之间当前最小象差的方差信息,该算法排除不必搜索的主块,这样大大减少了每个序列块进行搜索和匹配的主块数与相应的编码时间,该算法在减少的时间内生成了与常规满搜索近乎一致的分形编码。 相似文献
8.
9.
分形插值图象放大和压缩编码 总被引:2,自引:0,他引:2
本文讨论了随机分形插值方法及其在图象放大和图象压缩编码中的应用。实验结果表明,用分形插值方法实现图象放大和压缩编码能获得良好的结果。 相似文献
10.
分形插值在图象处理中的应用 总被引:4,自引:1,他引:3
本文讨论了随机分形插值方法及其在图象放大和图象压缩编码中的应用,实验结果表明,用分形插值方法实现图象放大和压缩编码能获得良好的结果,其突出优点是速度快。 相似文献
11.
本文在分析混合分形零树小波图像编码算法(FZW)优缺点的基础上,提出一种新的基于方向性小波子树的分形图像编码算法。该算法结合零树小波编码和分形编码,通过在匹配搜索过程中使用方向性range和domain子树,提高匹配精度,改善了传统分形小波图像压缩中的方块效应,更大限度的保留了图像的边缘信息。实验结果表明,该算法在提高压缩比和去除图像的方块效应方面,均取得了良好的效果。 相似文献
12.
Fast fractal compression of greyscale images 总被引:1,自引:0,他引:1
A new algorithm for fractal compression of greyscale images is presented. It uses some previous results allowing the compression process to be reduced to a nearest neighbors problem, and is essentially based on a geometrical partition of the image block feature space. Experimental comparisons with previously published methods show a significant improvement in speed with no quality loss 相似文献
13.
提出了一种基于平滑双正交小波和自适应分割算法的小波域分形图像编码算法,在基于离散有限方差(DFV)最优准则下得到了适合图像编码的一种新的平滑双正交小波,从而改善了分块效应。在小波域的分形编码中,提出了一种基于图像信息分布特征的自适应分割算法,实验表明,该文算法在相同压缩比的情况下,解码图像的主观视觉质量和峰值信噪比都明显优于SQS方法、基本分形图像编码方法和SPIHT方法。 相似文献
14.
Speed-up fractal image compression with a fuzzy classifier 总被引:4,自引:0,他引:4
This paper presents a fractal image compression scheme incorporated with a fuzzy classifier that is optimized by a genetic algorithm. The fractal image compression scheme requires to find matching range blocks to domain blocks from all the possible division of an image into subblocks. With suitable classification of the subblocks by a fuzzy classifier we can reduce the search time for this matching process so as to speedup the encoding process in the scheme. Implementation results show that by introducing three image classes and using fuzzy classifier optimized by a genetic algorithm the encoding process can be speedup by about 40% of an unclassified encoding system. 相似文献
15.
16.
Ponomarenko N. Egiazarian K. Lukin V. Astola J. 《Vision, Image and Signal Processing, IEE Proceedings -》2003,150(4):239-243
An approach based on applying Delaunay triangulation to the compression of mean values of image blocks that have non-identical shape and size is proposed. It can be useful for image compression methods that require the use of image partition schemes with non-equal block sizes, such as fractal and DCT-based image coding. Some aspects of practical realisation of the proposed method are discussed. Evaluation of the performance of the proposed method is carried out and comparisons with some conventional methods are made, demonstrating the potential of the method. 相似文献
17.
介绍了基于IFS(Iterated Function System)的图像分形压缩技术的基本理论,利用原图像及其相对梯度图自相似的特点,采用自适应四叉树分割方法,提出了基于相对梯度的自适应图像分形压缩并行算法。算法复杂性分析表明该方法提高了图像分形的压缩比,计算量少,效率较高。 相似文献
18.
Davoine F. Antonini M. Chassery J.-M. Barlaud M. 《IEEE transactions on image processing》1996,5(2):338-346
Presents a new scheme for fractal image compression based on adaptive Delaunay triangulation. Such a partition is computed on an initial set of points obtained with a split and merge algorithm in a grey level dependent way. The triangulation is thus fully flexible and returns a limited number of blocks allowing good compression ratios. Moreover, a second original approach is the integration of a classification step based on a modified version of the Lloyd algorithm (vector quantization) in order to reduce the encoding complexity. The vector quantization algorithm is implemented on pixel histograms directly generated from the triangulation. The aim is to reduce the number of comparisons between the two sets of blocks involved in fractal image compression by keeping only the best representative triangles in the domain blocks set. Quality coding results are achieved at rates between 0.25-0.5 b/pixel depending on the nature of the original image and on the number of triangles retained. 相似文献