Fast algorithm of wavelet decomposition and reconstruction for the fractal signals
A fast algorithm of wavelet decomposition and reconstruction for fractal signals is put forward. In accordance with the self-similarity and long-term-related characteristics of the fractal signals, and by means of the discrete wavelet transformation (DWT), multi-scale resolution is carried out so as...
Saved in:
Published in: | ICSP '98. 1998 Fourth International Conference on Signal Processing (Cat. No.98TH8344) pp. 300 - 304 vol.1 |
---|---|
Main Authors: | , , |
Format: | Conference Proceeding |
Language: | English |
Published: |
IEEE
1998
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | A fast algorithm of wavelet decomposition and reconstruction for fractal signals is put forward. In accordance with the self-similarity and long-term-related characteristics of the fractal signals, and by means of the discrete wavelet transformation (DWT), multi-scale resolution is carried out so as to make them become similar stationary signals and estimate them with the usual Wiener filtering or Kalman filtering methods. Then multi-scale reconstruction is carried out with DWT in order to estimate the primary signals polluted by noise. This paper stresses the algorithm design of the DWT filtering process, and the computing complexity is also considered. |
---|---|
ISBN: | 9780780343252 0780343255 |
DOI: | 10.1109/ICOSP.1998.770211 |