...
首页> 外文期刊>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences >An Encoding Algorithm for IFS Coding of Homogeneous Fractal Images Using Univariate Polynomial Manipulation
【24h】

An Encoding Algorithm for IFS Coding of Homogeneous Fractal Images Using Univariate Polynomial Manipulation

机译:单变量多项式处理的均匀分形图像IFS编码的编码算法

获取原文
获取原文并翻译 | 示例

摘要

This paper proposes a fast encoding algorithm for iterated function system (IFS) coding of gray-level homoge- neous fractal images. In order to realize IFS coding of high order fractal images, it is necessary to solve a set of simultaneous equa- tions with many unknowns. Solving the simultaneous equations using a multi-dimensional, numerical root-finding method is how- ever very time consuming. As preprocessing of numerical com- putation, the proposed algorithm employs univariate polynomial manipulation, which requires less computation time than mul- tivariate polynomial manipulation. Moreover, the symmetry of the simultaneous equations with respect to the displacement co- efficients enables us to derive an equation with a single unknown from the simultaneous equations using univariate polynomial ma- nipulation. An experimental result is presented to illustrate that the encoding time of the proposed algorithm is about 5 seconds on a personal computer with a 400 MHz Pentium II processor.
机译:本文提出了一种用于灰度均匀分形图像的迭代函数系统(IFS)编码的快速编码算法。为了实现高阶分形图像的IFS编码,必须解决许多未知数的一组同时方程。然而,使用多维数值根法求解联立方程非常耗时。作为数值计算的预处理,提出的算法采用单变量多项式运算,比多变量多项式运算需要更少的计算时间。此外,联立方程相对于位移系数的对称性使我们能够使用单变量多项式运算从联立方程中导出具有单个未知数的方程。实验结果表明,该算法在具有400 MHz Pentium II处理器的个人计算机上的编码时间约为5秒。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号