检索结果-内蒙古大学图书馆

fractal image compression based on delaunay triangulation and vector quantization

IEEE TRANSACTIONS ON image PROCESSING 1996年第2期5卷 338-346页

作者： Davoine, F Antonini, M Chassery, JM Barlaud, M UNIV NICE SOPHIA ANTIPOLIS MESRCNRSISISPRCGDRVALBONNEFRANCE

This paper 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.

关键词： mesh generation original image split and merge algorithm Vector quantization Data compression fractal image compression image compression Triangle compression ratio

来源：评论

学校读者我要写书评

暂无评论

fractal image compression based on spatial correlation and hybrid genetic algorithm

引用

JOURNAL OF VISUAL COMMUNICATION AND image REPRESENTATION 2009年第8期20卷 505-510页

作者： Wang Xing-yuan Li Fan-ping Wang Shu-guo Dalian Univ Technol Sch Elect & Informat Engn Dalian 116024 Peoples R China

In order to solve the high complexity of the conventional encoding scheme for fractal image compression, a spatial correlation hybrid genetic algorithm based on the characteristics of fractal and partitioned iterated function system (PITS) is proposed in this paper. There are two stages for the algorithm: (I) Make use of spatial correlation in images for both range and domain pool to exploit local optima. (2) Adopt simulated annealing genetic algorithm (SAGA) to explore the global optima if the local optima are not satisfied. In order to avoid premature convergence, the algorithm adopt dyadic mutation operator to take place of the traditional one. Experiment results show that the algorithm convergent rapidly. At the premise of good quality of the reconstructed image, the algorithm saved the encoding time and obtained high compression ratio. (C) 2009 Elsevier Inc. All rights reserved.

关键词： fractal image compression Block coding PIFS Spatial correlation Hybrid genetic algorithm Simulated annealing Neighborhood Dyadic mutation operator

来源：评论

学校读者我要写书评

暂无评论

fractal image compression using a fast affine transform and hierarchical classification scheme

引用

VISUAL COMPUTER 2022年第11期38卷 3867-3880页

作者： Nandi, Utpal Vidyasagar Univ Dept Comp Sci Midnapore 721102 W Bengal India

fractal image compression is one of the efficient structure-based methods in applications where images are compressed only once but decoded several times due to its resolution-independent feature and fast reconstruction time. However, it has high computational complexity restricting practical use most of the time. Although several methods have been developed to speed up the compression process, these do not satisfy the compression time or the decoded image quality requirements. The affine transforms of image blocks used in fractal coding require a huge number of multiplications and additions and are very expensive in computation that may also slow down the compression process. This paper presents a novel fractal image compression using a fast affine transform and hierarchical classification scheme. The applied affine transform computation algorithm of image blocks uses relationships among neighboring pixels of transformed image block that significantly reduces the number of multiplication and addition operations. Then, this strategy with hierarchical classification and class-wise domain sorting is applied in fractal coding with quad-tree and horizontal vertical partitioning schemes to reduce compression time. Experimental results show that the quad-tree-based fractal coding with the proposed scheme can significantly speed up the compression process keeping image quality and compression ratio almost unchanged.

关键词： fractal image compression Affine transform Encoding time compression ratio image quality Iterated function system

来源：评论

学校读者我要写书评

暂无评论

fractal image compression using visual-based particle swarm optimization

引用

image AND VISION COMPUTING 2008年第8期26卷 1154-1162页

作者： Tseng, Chun-Chieh Hsieh, Jer-Guang Jeng, Jyh-Horng Natl Sun Yat Sen Univ Dept Elect Engn Kaohsiung 804 Taiwan I Shou Univ Dept Informat Engn Kaohsiung 840 Taiwan

fractal image compression is promising both theoretically and practically. The encoding speed of the traditional full search method is a key factor rendering the fractal image compression unsuitable for real-time applications. In this papey, particle swarm optimization (PSO) method by utilizing the visual information of the edge property is proposed, which can speedup the encoder and preserve the image quality. Instead of the full search, a direction map is built according to the edge-type of image blocks, which directs the particles in the swarm to regions consisting of candidates of higher similarity. Therefore, the searching space is reduced and the speedup can be achieved. Also, since the strategy is performed according to the edge property, better visual effect can be preserved. Experimental results show that the visual-based particle swarm optimization speeds up the encoder 125 times faster with only 0.89 dB decay of image quality in comparison to the full search method. (C) 2008 Elsevier B.V. All rights reserved.

关键词： fractal image compression particle swarm optimization edge-type classification

来源：评论

学校读者我要写书评

暂无评论

fractal image compression algorithms based on possibility theory

引用

fractalS-COMPLEX GEOMETRY PATTERNS AND SCALING IN NATURE AND SOCIETY 2007年第2期15卷 183-195页

作者： Yang, Rui Yang, Xiaoyuan Li, B. Beihang Univ Sch Sci Dept Math Beijing 100083 Peoples R China Beihang Univ Sch Comp Beijing 100083 Peoples R China Minist Educ Key Lab Math Informat & Behav Semant Beijing 100083 Peoples R China

Two fractal image compression algorithms based on possibility theory are originally presented in this paper. Fuzzy sets are used to represent the edge character of each image block, and two kinds of membership function are designed. A fuzzy integrated judgement model is also proposed. The model generates an accurate value for each edge block, which would be a label during the search process. The edge possibility distribution function and the edge necessity level are designed to control the quantity of the blocks to be searched. Meanwhile the pre- restriction is proposed, the average intensity value at different locations is used to be a necessary condition before the MSE computations. It is shown by our experiments that the encoding times of our two algorithms, compared to that of Jacquin's approach, are reduced to 60% - 70% and 10% - 20%, respectively.

关键词： fuzzy theory possibility distribution necessity distribution possibility measure fractal image compression

来源：评论

学校读者我要写书评

暂无评论

fractal image compression and recurrent iterated function systems

引用

IEEE COMPUTER GRAPHICS AND APPLICATIONS 1996年第4期16卷 25-33页

作者： Hart, JC Washington State University USA

When every domain element can be expressed as the union of range elements, fractal image compression produces a structure equivalent to an RIFS, enabling it to automatically model arbitrary shapes.

关键词： fractals Iterated Function System algorithms COMPUTER GRAPHICS Data compression CCL7 gene Convert Computer-Aided Design geometric representation fractal image compression image compression

来源：评论

学校读者我要写书评

暂无评论

fractal image compression with simple classification scheme in frequency domain

引用

ELECTRONICS LETTERS 2000年第8期36卷 716-717页

作者： Jeng, JH Shyu, JR I Shou Univ Dept Informat Engn Kaohsiung 84008 Taiwan

In fractal image compression, the mean squared error (MSE) computations of the eight orientations of the domain blocks can be reduced into two groups of inner products in the frequency domain. A very simple classification scheme is presented for reducing the two groups of computations into one, which makes the encoder up to 4.7 times faster.

关键词： image and video coding data compression fractals encoder image coding frequency domain classification inner product fractal image compression mean squared error computation image classification mean square error methods

来源：评论

学校读者我要写书评

暂无评论

fractal image compression applied in PD pattern recognition 5

Fractal image compression applied in PD pattern recognition

引用

5th International Conference on Electrical Machines and Systems

作者： Li, J Sun, CX Li, J Yuan, ZJ Yang, J Chongqing Univ Key Lab High Voltage Engn & Elect New Technol Minist Educ Chongqing 400044 Peoples R China

ISBN: (纸本)7506251159

Partial discharge (PD) is an important cause for insulation degradation in transformers and electrical machines. This paper introduces a kind of fractal image compression (FIC) method used in PD pattern recognition. With classification to domain blocks and quadtree partition to image, the method. can compress PD gray intensity image effectively. By comparing the fractal dimensions of PD original and reconstructed images, the computation results indicate the fractal dimensions of two kind of images approach closely to each other under a certain degree of peak signal to noise, as shows that the FIC method can be used for PD pattern recognition.

关键词： partial discharge fractal image compression pattern recognition fractal dimension

来源：评论

学校读者我要写书评

暂无评论

fractal image compression with predicted dihedral transformation

Fractal image compression with predicted dihedral transforma...

引用

12th IEEE Symposium on Computers and Communications

作者： Duh, D. J. Jeng, J. H. Chen, S. Y. Yuan Ze Univ Dept Comp Sci & Engn Tao Yuan 320 Taiwan I Shou Univ Dept Informat Engn Kaohsiung Taiwan

ISBN: (纸本)9781424415205

fractal image compression exploits the self-similarity of an image to achieve image compression. The conventional algorithm allows the transformations on domain blocks to obtain eight orientations so as to increase the quality of retrieved image. On the other hand, if no transformation is performed in order to speedup the encoder, the image quality will decay. In this paper, a direct allocating method to predict the desired transformation for similarity measure is proposed. Simulations show that the encoding time is almost the same as that of the method without tran formations while the image quality is close to that of the standard method.

关键词： fractal image compression PIFS dihedral transformation DCT AC coefficients

来源：评论

学校读者我要写书评

暂无评论

fractal image compression methods: A review

Fractal image compression methods: A review

引用

3rd International Conference on Information Technology and Applications

作者： Zhao, EJ Liu, D Dalian Maritime Univ Inst Naut Sci & Technol Dalian 116026 Peoples R China

ISBN: (纸本)0769523161

fractal image compression is a new technique in image compression field based on Affine contractive transforms. fractal image compression methods belong to different categories according to the different theories they are based on. All of those are discussed in this paper. In the end a conclusion is made to summarize the characters of fractal image compression.

关键词： fractal image compression fractal image coding Iterated Function System

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：