| http://www.w3.org/ns/prov#value | - The wavelet transform of a discrete time signal of N=2M samples is easily computed using O(N) computations (where O is a notation indicating on the order of; meaning in this context that the number of computations is proportional to N) using a tree-like cascade of complementary low-pass and high-pass filters (LPF and HPF, respectively in FIG. 1A).
|
