Integer orthogonal transforms: Design, fast algorithms, and applications

被引：0
|
作者：
Egiazarian, KO [1 ]
Rusanovskyy, D [1 ]
Astola, JT [1 ]
机构：
[1] Tampere Univ Technol, FIN-33101 Tampere, Finland
来源：
IMAGE PROCESSING: ALGORITHMS AND SYSTEMS III | 2004年 / 5298卷
关键词：
integer transforms; DCT; coding gain; fast algorithms; image denoising; video coding;
D O I：
10.1117/12.538694
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：278 / 289
页数：12
相关论文
共 50 条
  • [21] Fast orthogonal transforms and generation of Brownian paths
    Leobacher, Gunther
    JOURNAL OF COMPLEXITY, 2012, 28 (02) : 278 - 302
  • [22] Fast Computation of Orthogonal Polar Harmonic Transforms
    Hoang, Thai V.
    Tabbone, Salvatore
    2012 21ST INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR 2012), 2012, : 3160 - 3163
  • [23] Fast associated classical orthogonal polynomial transforms
    Klippenstein, Brock
    Slevinsky, Richard Mikael
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2022, 403
  • [24] Integer lapped transforms and their applications to image coding
    Fong, WC
    Chan, SC
    Nallanathan, A
    Ho, KL
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2002, 11 (10) : 1152 - 1159
  • [25] Fast algorithms for discrete polynomial transforms
    Potts, D
    Steidl, G
    Tasche, M
    MATHEMATICS OF COMPUTATION, 1998, 67 (224) : 1577 - 1590
  • [26] Fast algorithms for fractional Fourier transforms
    Creutzburg, R
    Rundblad, E
    Labunets, VG
    PROCEEDINGS OF THE IEEE-EURASIP WORKSHOP ON NONLINEAR SIGNAL AND IMAGE PROCESSING (NSIP'99), 1999, : 383 - 387
  • [27] A comparison of integer fast Fourier transforms for lossless coding
    Yokotani, Y
    Oraintara, S
    Geiger, R
    Schuller, G
    Rao, KR
    IEEE INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES 2004 (ISCIT 2004), PROCEEDINGS, VOLS 1 AND 2: SMART INFO-MEDIA SYSTEMS, 2004, : 1069 - 1073
  • [28] FAST DFT ALGORITHM USING COMPLEX INTEGER TRANSFORMS
    REED, IS
    TRUONG, TK
    ELECTRONICS LETTERS, 1978, 14 (06) : 191 - 193
  • [29] Applications of integer relation algorithms
    Borwein, JM
    Lisonek, P
    DISCRETE MATHEMATICS, 2000, 217 (1-3) : 65 - 82
  • [30] Parallel algorithms for discrete transforms and wavelet transforms with their applications
    Zeng, Yonghong
    Meng, Xiangjie
    He, Lijun
    Li, Xiaomei
    Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology, 2000, 22 (02): : 41 - 45
12345