首页> 外文会议>Conference on Image Processing: Algorithms and Systems III; 20040119-20040121; San Jose,CA; US >Integer Orthogonal Transforms: Design, Fast algorithms, and Applications
【24h】

Integer Orthogonal Transforms: Design, Fast algorithms, and Applications

机译:整数正交变换:设计,快速算法和应用

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

摘要

The paper is devoted to design, fast implementation and applications of a family of 8-points integer orthogonal transforms based on a parametric matrix. A unified algorithm for their efficient computations is developed. Derived fast transforms have close coding gain performance to the optimal Karhunen-Loeve transform for the first order Markov process. Among them are also such that closely approximate the DCT-II and, at the same time, have a larger coding gain. For a particular set of parameters, integer transforms with reduced computational complexity are obtained. The comparative analysis of these transforms with the DCT-II in the framework of image denoising and video coding is performed.
机译:本文致力于基于参数矩阵的8点整数正交变换系列的设计,快速实现和应用。开发了用于其高效计算的统一算法。派生的快速变换与一阶马尔可夫过程的最佳Karhunen-Loeve变换具有接近的编码增益性能。在它们之中还可以使DCT-II非常接近,同时具有较大的编码增益。对于一组特定的参数,可获得具有降低的计算复杂度的整数变换。在图像去噪和视频编码的框架下,使用DCT-II对这些变换进行了比较分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号