Accelerating the 2D Mallat decomposition algorithm with cyclical convolution and FNTT

Author

Tang, Yan ; Sun, Qi ; Ma, Hong ; Ren, De B. ; Yan Tang ; Chen, Zhi K.

Author_Institution

Dept. of Comput. Sci., Hong Kong Baptist Univ., Kowloon, Hong Kong

fYear

1999

fDate

20-22 Sep 1999

Firstpage

87

Lastpage

90

Abstract

This paper presents a novel approach to accelerate the 2D Mallat decomposition algorithm. In particular the proposed approach performs the 2D Mallat decomposition algorithm by way of computing the 2D cyclical convolution, and further completes the 2D cyclical convolution with the fast number theoretical transform (FNTT). Therefore, the 2D Mallat decomposition algorithm can be speeded up. The results obtained from the theoretical analysis and the experiment show that the 2D Mallat decomposition algorithm is significantly improved

Keywords

computational complexity; convolution; image processing; number theory; transforms; 2D Mallat decomposition algorithm acceleration; 2D cyclical convolution; cyclical convolution; fast number theoretical transform; Acceleration; Computer science; Convolution; Digital signal processing; Image processing; Low pass filters; Mathematics; Read only memory; Signal processing algorithms; Sun;

fLanguage

English

Publisher

ieee

Conference_Titel

Document Analysis and Recognition, 1999. ICDAR '99. Proceedings of the Fifth International Conference on

Conference_Location

Bangalore

Print_ISBN

0-7695-0318-7

Type

conf

DOI

10.1109/ICDAR.1999.791731

Filename

791731