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

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

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

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.
Original languageEnglish
Title of host publicationProceedings of the Fifth International Conference on Document Analysis and Recognition. ICDAR '99 (Cat. No.PR00318)
EditorsBob Werner
PublisherIEEE Canada
Pages87-90
Number of pages4
ISBN (Print)0769503187
DOIs
Publication statusPublished - 20 Sept 1999
Externally publishedYes
EventProceedings of the Fifth International Conference on Document Analysis and Recognition. ICDAR '99 (Cat. No.PR00318) - Bangalore, India
Duration: 22 Sept 199922 Sept 1999

Conference

ConferenceProceedings of the Fifth International Conference on Document Analysis and Recognition. ICDAR '99 (Cat. No.PR00318)
Period22/09/9922/09/99

User-Defined Keywords

  • Acceleration
  • Convolution
  • Signal processing algorithms
  • Low pass filters
  • Sun
  • Computer science
  • Mathematics
  • Read only memory
  • Digital signal processing
  • Image processing

Fingerprint

Dive into the research topics of 'Accelerating the 2D Mallat decomposition algorithm with cyclical convolution and FNTT'. Together they form a unique fingerprint.

Cite this