Fast multiscale statistical signal processing algorithms
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 773-777 vol.2
- https://doi.org/10.1109/acssc.1991.186552
Abstract
It is shown that a large set of (non necessarily stationary) correlation matrices may be transformed into a matrix that consists of essentially banded subblocks. The transformation is accompanied by pre- and postmultiplication with an orthogonal matrix whose elements are derived from the impulse responses of a suitably designed cascade of alias free multirate analysis filter banks. It is further proved that the Cholesky factor of the transformed matrix also consists of essentially banded subblocks. These two observations are combined to show that the linear positive definite systems of equations that arise in statistical signal processing can be solved in O(max(N log /sup 2/(N), N/sup 2/)) operations while matrix-vector multiplication steps may be implemented in O(n log (N)) operations. An error analysis of the proposed linear positive definite system solver is also provided.<>Keywords
This publication has 6 references indexed in Scilit:
- Fast multiscale statistical signal processing algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Correlation structure of the discrete wavelet coefficients of fractional Brownian motionIEEE Transactions on Information Theory, 1992
- Fast wavelet transforms and numerical algorithms ICommunications on Pure and Applied Mathematics, 1991
- Multirate digital filters, filter banks, polyphase networks, and applications: a tutorialProceedings of the IEEE, 1990
- Multifrequency channel decompositions of images and wavelet modelsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Orthonormal bases of compactly supported waveletsCommunications on Pure and Applied Mathematics, 1988