New algorithm for r-dimensional DCT-II

Author

Zeng, Y. ; Bi, G. ; Leyman, A.R.

Author_Institution

Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore

Volume

148

Issue

1

fYear

2001

fDate

2/1/2001 12:00:00 AM

Firstpage

1

Lastpage

8

Abstract

The paper shows that the type-II r-dimensional discrete cosine transform (rD-DCT-II) of size q^l1×q^l2x...xq ^l1, where r>1 and q is an odd prime number, can be converted into a series of one-dimensional reduced DCT-IIs by using the polynomial transform. The number of multiplications for computing an rD-DCT-II is significantly reduced compared to that needed by the row-column method. The total number of arithmetic operations (additions plus multiplications) needed by the proposed algorithm is also reduced substantially. In addition to the capability of dealing with different dimensional sizes, the proposed algorithm also has a simple computational structure because it requires only the 1D-DCT-II and the polynomial transform

Keywords

data compression; discrete cosine transforms; feature extraction; image reconstruction; signal detection; 1D reduced DCT-II; additions; arithmetic operations; computational complexity; data compression; discrete cosine transform; fast polynomial transform; feature extraction; image reconstruction; multi-frame detection; multiplications; polynomial transform algorithm; r-dimensional DCT-II; row-column method;

fLanguage

English

Journal_Title

Vision, Image and Signal Processing, IEE Proceedings -

Publisher

iet

ISSN

1350-245X

Type

jour

DOI

10.1049/ip-vis:20010239

Filename

918395