You are here:
| transfer matrix |
|
|
|
| Written by Eng.Admin | |||||||||
| Tuesday, 04 November 2008 23:43 | |||||||||
|
The transfer matrix is a formulation in terms of a block-Toeplitz matrix of the two-scale equation, which characterizes refinable functions. Refinable functions play an important role in wavelet theory and finite element theory. For the mask h, which is a vector with component indexes from a to b, the transfer matrix of h, we call it Th here, is defined as . More verbosely The effect of Th can be expressed in terms of the downsampling operator " ": . Properties
) and let ho be the odd indexed coefficients of h ( ). Then , where res is the resultant. This connection allows for fast computation using the Euclidean algorithm.
where g − denotes the mask with alternating signs, i.e. .
, then x * (1, − 1) is an eigenvector of Th * (1,1) with respect to the same eigenvalue, i.e. .
it holds Actually not n − 2 convolutions are necessary, but only ones, when applying the strategy of efficient computation of powers. Even more the approach can be further sped up using the Fast Fourier transform.
where is the size of the filter and if all eigenvalues are real, it is also true that , where . transfered
Powered by !JoomlaComment 3.26
3.26 Copyright (C) 2008 Compojoom.com / Copyright (C) 2007 Alain Georgette / Copyright (C) 2006 Frantisek Hliva. All rights reserved."
|
|||||||||
| Last Updated on Tuesday, 11 November 2008 12:39 |










.
The effect of Th can be expressed in terms of the downsampling operator "
":
.
.
) and let ho be the odd indexed coefficients of h (
). Then
, where res is the resultant. This connection allows for fast computation using the Euclidean algorithm.
where g − denotes the mask with alternating signs, i.e.
.
, then
.
, then x * (1, − 1) is an eigenvector of Th * (1,1) with respect to the same eigenvalue, i.e.
.
be the eigenvalues of Th, which implies
and more generally
. This sum is useful for estimating the spectral radius of Th. There is an alternative possibility for computing the sum of eigenvalue powers, which is faster for small n.
it holds
Actually not n − 2 convolutions are necessary, but only
ones, when applying the strategy of efficient computation of powers. Even more the approach can be further sped up using the Fast Fourier transform.
. It holds
where
is the size of the filter and if all eigenvalues are real, it is also true that
, where
.