首页> 外文会议>International conference on algorithms and architectures for parallel processing >Circulant Euler-Jacket Transform and Its Applications Based on Fast Algorithm
【24h】

Circulant Euler-Jacket Transform and Its Applications Based on Fast Algorithm

机译:快速算法的循环Euler-Jacket变换及其应用

获取原文

摘要

Motivated by the elegant characteristics of the Euler theorem, we propose a novel Euler-Jacket matrix. This matrix has a circle-limitation for exponential function and thus can be created by using matrix operations with angle information. Especially, the inverses of the yielded matrices equals the transpose of elements inverse. It corresponds to the polynomial function, which is an unit operation of the orthogonal matrix in essence. The proposed matrix can be used to generate higher-order Euler-Jacket matrices efficiently and hence other similar real orthogonal matrices with fast algorithm. The proposed matrix is much more concision and frank than direct-computation which means Euler-Jacket transform is an efficient algorithm. Euler-Jacket transform is proved to have stability and simplicity in digital image processing simulation.
机译:基于欧拉定理的优雅特征,我们提出了一种新颖的欧拉-贾克特矩阵。该矩阵具有指数函数的圆限制,因此可以通过使用带有角度信息的矩阵运算来创建。特别是,产生矩阵的逆等于元素逆的转置。它对应于多项式函数,本质上是正交矩阵的单位运算。所提出的矩阵可用于高效地生成高阶Euler-Jacket矩阵,从而可利用快速算法生成其他类似的真实正交矩阵。所提出的矩阵比直接计算更为简洁和坦率,这意味着Euler-Jacket变换是一种有效的算法。事实证明,Euler-Jacket变换在数字图像处理仿真中具有稳定性和简便性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号