This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Course 18.327 and 1.130 Wavelets and Filter Banks Mallat pyramid algorithm Pyramid Algorithm for Computing Wavelet Coefficients Goal: Given the series expansion for a function f j (t) in V j f j (t) = a j [k] j,k (t) k how do we find the series f j1 (t) = a j1 [k] j1,k (t) k in V j1 and the series g j1 (t) = b j1 [k]w j1,k (t) k in W j1 such that f j (t) = f j1 (t) + g j1 (t) ? 2 1 3 Example: suppose that (t) = box on [0,1]. Then functions in V 1 can be written either as a combination of (2t) 1 0 , 1 0 1 , (2t1) or as a combination of (t) 1 0 1 , , 1 0 1 2 (t1) 4 plus a combination of 1 0 1 , , w(t) w(t1) 1 0 1 2 Easy to see because (2t) = [ (t) + w(t)] (2t 1) = [ (t)  w(t)] 2 5 k Suppose that f(t) is a function in L 2 (R). What are the coefficients, a j [k], of the projection of f(t) on to V j ? Call the projection f j (t), f j (t) = a j [k] j,k (t) a j [k] must minimize the distance between f(t) and f j (t) {f(t) f...
View
Full
Document
This note was uploaded on 12/04/2011 for the course ESD 18.327 taught by Professor Gilbertstrang during the Spring '03 term at MIT.
 Spring '03
 GilbertStrang

Click to edit the document details