Signal Analysis. Filter Banks and. One application for filter banks is to decompose the input signal into different bands or channels
|
|
- Thomas Blankenship
- 5 years ago
- Views:
Transcription
1 Filter banks Multi dimensional Signal Analysis A common type of processing unit for discrete signals is a filter bank, where some input signal is filtered by n filters, producing n channels Channel 1 Lecture 2G Filter Banks and Multi resolution Analysis (I) Input signal Channel 2 This an example of how to create n channels Signals and filters are discrete! Channel n 2 Filter banks In order to have the same amount of data (on average per time unit) before and after the filtering: down sample the filter outputs by a factor n Keep every n th sample Filter banks, applications One application for filter banks is to decompose the input signal into different bands or channels Here band is rather imprecise and can mean frequency band but also more general subspaces 3 4
2 Filter banks, applications Filter banks, applications Each hband dis processed independently d relative lti to the others Filtering, e.g., LP filter to reducenoise Data compression, to reduce data Numerical resolution, to reducedatadata Even: removal, to reduce data Each band is then stored or transmitted From each band we want to be able to reconstruct the input signal again Possibly only to some degree of approximation Or perfect reconstruction: output = input (+ shift!) In general, something like this: Input signal Possibly less data than the input signal Output tsignal Input signal 5 6 The 2 channel filter bank The simplest type of filter bank is the 2 channel filter bank Down sample = Remove every second sample Analysing part Same amount of samples as the input signal s Reconstructing part Only specific choices of filters can make s = s Up sample = Insert 0 between every sample 7 The 2 channel filter bank Let the DFTs of h 0, h 1, g 0, g 1 be denoted as H 0, H 1, G 0, G 1 (they are 2π periodic!) We can show that necessary and sufficient conditions for s = s are given by H 1 (u)h 0 (u)+g 1 (u)g 0 (u) =2 H 1 (u)h 0 (u + π)+g 1 (u)g 0 (u + π) =0 FB1: No distortion FB2: No aliasing from the sub sampling (why?) (FB1) (FB2) Ex
3 A practical note Assuming that all four filters are causal: The filters introduce delays in the output signal s This means that, at best, we can accomplish s [k] = s[k d] for some positive integer d We will ignore this practical matter for now and consider the requirement s [k] = s[k] As a consequence, some filters may become non causal Can be fixed by time shift if they also are FIR Output will then be delayed accordingly We want the four filters to be FIR Finding thefour filters Bad idea: choose two of the filters arbitrarily and solve the other two from FB1 and FB2 (why?) Better idea: Apply some design principles for the four filters that produce useful filters Many possibilities exists! 9 10 A particular choice of filters FB2 is automatically satisfied if H 0 (u) = H 1 (u) G iu 1 (u) = e H 1 (u + π) G 0 (u) = e iu H 1 (u + π) = G 1 (u) FB1 then becomes H 1 (u) 2 + H 1 (u + π) 2 =2 (O) Called: Conjugate Mirror filters Ex Alternating flip The conjugate mirror filter condition can also be formulated in the time domain as h 0 [k] = h 1 [ k] g ( 1) 1 k 1 [k] = h 1 [1 k] Called: Alternating flip g = ( 1) k+1 0 [k] h 1 [k + 1] = g 1 [ k] Ex
4 An orthogonal set We can show that the condition (O) implies that hh 1 [ ] h 1 [ 2 m]i = δ[m] h 1 is always orthogonal to itself when shifted by multiples l of 2 (unless m = 0) Ex Convolution and linear combinations We have already seen that the convolution operation can be interpreted in terms of producing linear combinations Here: u 2 [k] = X a[n] h 1 [k 2 n] n= The signal u 2 is a linear combination of shifted versions of h 1 Shift by multiples of 2 We just saw that they form an ON set! 14 More orthogonality In the same way we can show that the conjugate mirror filter bank leads to hg 1 [ ] g 1 [ 2 m]i = δ[m] hg 1 [ ] h 1 1[ [ 2 m]i =0 Ex (why?) 15 More orthogonality This means that also v 2 [k] is formed as a linear combination of orthonormal discrete functions g 1 [k 2 m] These are functions of k, one for each m Finally, it also means that the two orthogonal sets h 1 [k 2 m] and g 1 [k 2 m] are mutually orthogonal These are functions of k, one for each m 16
5 Reconstruction The output signal from the filter bank, s = s, is formed as the linear combination of two orthogonal sets of functions (an ON basis) Means: thecoefficients in this linear combination are the coordinates relative the reconstructing basis functions. These are a[m] for the basis functions h 1 [k 2m] 1 d[m] for the basis functions g 1 [k 2m] Analysis In the filter bank, a[m] is formed as a[m] =(s h 0 )[2 m] = X = k= s[k] h 0 [2 m k] X X s[k] [ ] h1 [k 2 m] ] = hs[ [ ] h 1 [ 2 m]i k= Analysis Similarly: d[m] = h s[ ] g 1 [ 2 m] i This result is expected! We are analysing s[k] [ ] using an ON basis The corresponding coordinates are then given as the scalar products between s[k] [ ] and the basis functions They are their own duals! 19 Orthogonal filter bank In summary: we choose H 1 such that 2 2 H 1 (u) 2 + H 1 (u + π) 2 =2 and then the other three filters such that H 0 (u) = H 1 (u) G 1 (u) =e iu H 1 (u + π) G 0 (u) =e iu H 1 (u + π) =G 1 (u) This produces an orthogonal filter bank 20
6 Orthogonal filter bank If it is possible to choose h 1 as a FIR filter, then h 0, g 1, g 0 also become FIR 0 g 1 g 0 Is this possible? Yes: h 1 = 2 1/2 (1, 1) is the simplest possible choice g 1 = 2 1/2 ( 1, 1) 1/2 Called: h 0 = 2 (1, 1) Haar filter bank also exist! g 0 = 2 1/2 (1, 1) Other choices Splitting ofthesignal space The signal u 2 is constructed as a linear combination of 2 shifts of h 1 Span some subspace V 0 of the signal space V The signal v 2 is constructed as a linear combination of 2 shifts of g 1 Span some subspace W 0 of the signal space V The output signal s V is u 2 + v 2 V = V 0 W 0, V 0 W Filter banks The conjugate mirror filter bank is only one special solution to FB1 and FB2! There are other ways of obtaining s = s Still leads to perfect reconstruction ti Some approaches do not lead to an orthogonal filter bank Can be useful anyway! Scaling function Consider a function φ(t) ) that satisfies ifi 1. φ(t k), k Z, is an orthogonal basis of some function space V 0 2. φ(t) can be written as a linear combination of the functions φ(2t k), k Z Such a function φ is called a scaling function These relatively simple and innocent assumptions lead to a framework for defining a discrete wavelet transform in terms of orthogonal filter banks 23 24
7 Example The simplest example of a scaling function is φ(t) ) = ( 1 0 t<1 0 otherwise Example In this case: V 0 is the space of piece wise constant functions on integer intervals The functions φ(2t k) look like k = 0 k = 1 φ(t) = φ(2 t) + φ(2 t 1) k = Consequences The fact that φ(t k) is an orthogonal basis for k Z means Z hφ(t) φ(t k)i = φ(t) φ(t k) dt = δ[k], k Z From this follows that also 2 1/2 φ(2t k), k Z, form an orthogonal basis Ex 22.1 Spans a function space V 1 V 0 Ex Consequences (II) Property 2. of the scaling functions leads to φ(t) = X hk 2 1/2 φ(2 t k) k= for some sequence of scalars h k Since we have an ON basis: Coordinates of φ relative to the ON basis 2 1/2 φ(2x k), k Z Z h k = hφ(t) 2 1/2 φ(2 t k)i =2 1/2 φ(t) ) φ(2 t k) ) dt 28
8 Consequences (III) In fact, any φ(x ( l), ) l Z, can be written as a linear combination of the basis 2 1/2 φ(2 t k): φ(t l) = X m= h m 2l 2 1/2 φ(2 t m) Ex Consequences (IV) Notice that: t The functions φ(t k) are shifted by multiples of 1 relative to t Spans a space denoted V 0 The functions 2 1/2 φ(2t k) are shifted by multiples of 1/2 relative to t Functions in V Spans a space denoted V 1 can 1 contain finer details than V 0 Both thbases are orthonormal within each space V 0 V 1 Since V 1 has a basis that spans every basis vector in V 0 30 Consequences (V) Returning to property 1. we have seen that hφ(t) φ(t k)i = δ[k] This can also be formulated as X Φ(v +2πk) 2 =1 Ex 22.4 k where Φ is the Fourier transform of φ 31 The sequence h The sequence of scalars h[k], k Z, depends d only on the choice of scaling function φ Remember that φ itself has particular properties, p described by 1. and 2. Also h[k] has particular properties! h[k] can be interpreted as the coefficients of a discrete filter with Fourier transform X X H(u) = hk e iuk This is a 2π periodic k= function 32
9 The function H From 1. and 2. follows that H must be related to Φ as ³ u ³ u Φ(u) = 2 1/2 H Φ 2 2 Ex 22.5 The function H The fact that φ has special properties and that H is related to φ leads to 2 2 H(u) 2 + H(u + π) 2 =2 Ex 22.6 or H(u) =2 1/2 Φ(u) This must be a 2π periodic Φ(2 u) function! We recognise this as condition (O) on the filter h 1 in a conjugate mirror filter bank! The function ψ(x) Define a new function ψ(t), with a Fourier transform Ψ given by Where or 1 ³ u ³ u Ψ(u) = G Φ G(u) =e iu H(u + π) g[n] ] = ( 1) 1 n h[1 [ n] ] This is the alternating fp flip condition in a conjugate mirror filter bank The sequence g The sequence g is derived from h But, h depends only on φ: g depends only on φ Also ψ depends only on the choice of φ Finally, we can derive 1/2 hψ(t) 2 1/2 φ(2t n)i = g[n] Ex
10 The sequences h and g We summarise: h[k] = hφ(t) 2 1/2 φ(2 t k)ii Coordinates of φ relative basis in V 1 g[k] = hψ(t) 2 1/2 φ(2 t k)i Coordinates of ψ or, more generally: hφ(t l) 2 1/2 φ(2 t k)i = h[k 2 l] hψ(t l) 2 1/2 φ(2 t k)i = g[k 2 l] relative basis in V 1 At least if we can prove that ψ V 1 We can show that: ψ(t l) = X k Properties of ψ, (I) ( 1) k h k 2 1/2 φ(2t k +2l +1) which means that all ψ(t l) V 1, l Z Ex 22.8 g n are the coordinates of ψ in the ON basis of V Example For the simple example of a scaling function ( 1 0 t < 1 φ(t) = 0 otherwise we get g[k] = {2 1/2, 2 1/2 } and the corresponding function ψ(t): Called Haar wavelet Properties of ψ, (II) Using the previous relations, we can also prove that Ex 22.9 hψ(t m) φ(t l)i =0 forl,, m Z which means that all ψ(t l) ) are orthogonal to the space V 0 since φ(t m) is a basis for this space ψ(t m) V 1 and ψ(t m) V
11 Properties of ψ, (III) We can also show hat hψ(t n) ψ(t)i = δ[n] which means that the set ψ(t n) is orthonormal for n Z In summary: ll ψ( ) All ψ(t n) are to V 0 They form an orthonormal set Ex (why?) Properties of V 1 Let f be an arbitrary function in V 1. It can then be written as f(t) = X s[n] 2 1/2 φ(2t n) n for some sequence s[n] since 2 1/2 φ(2t n) is an ON basis for V Properties of V 1 Using the previous results, we can show that it is also possible to write this f V 1 as p f 1 f(t) = X a[n] φ(t n) + X d[n] ψ(t n) n n Ex for some sequences a[k] and d[k] This means that φ(t n) and ψ(t n) together span V 1 The difference space W 0 V 0 is a subspace of V 1 Any f V 1 can be written as a unique linear combination of a component in V 0 and a component in V 1, and this component is orthogonal to V 0 There is a difference space W 0 characterised by o W 0 V 1 V 0 o W 0 V 0 o V 1 = V 0 W 0 V 1 o For any f V 1 : f = f 0 + w 0, f 0 V 0, w 0 W 0 W
12 The difference space W 0 V 1 has an ON basis 2 1/2 φ(2t k), k Z V 0 has an ON basis φ(t k), k Z W 0 has an ON basis ψ(t k), k Z W 0 V 0 V 1 = V 0 W 0 Coordinates of f V 1 are given by s[k] [ ] Coordinates of f V 0 W 0 given by a[k] and d[k] Sequences a, b and c Since f V 1 is completely represented either by sequence s[k], [ ] or by sequences a[k] [ ] and d[k] [ ] : There must be a (linear) mapping s (a, d) There must be a (linear) mapping (a, d) s A linear mapping a b & c A linear mapping b & c a From previous results follows: From previous results also follows: Ex Ex a[k] = (s[ ] h[ ])[2 k] d[k] =(s[ ] g[ ])[2 k] Convolve and skip every second sample (the odd ones) s[k] = X X n= (a[n] h[k 2 n] + d[n] g[k 2 n]) Insert zeros between every sample and convolve 47 48
13 A 2 channel filter bank We can summarise these results as Coordinates of f relative to basis in V 1 Coordinates of f relative to basis in V 0 Coordinates of f relative to basis in W 0 An orthogonal 2 channel filter bank with h 0 = h g 0 = g (as alternating flip of h 0 ) What you should know The anatomy of the 2 channel lfilter bank The 2 constraints on the 4 filters to produce s =s The conjugate mirror filter (CMF) bank Orthogonal 2 channel filter bank How a CMF decomposes the signal space into V 0 and W 0, and how they are related Definition of a scaling function φ Leads to a unique function ψ How φ and ψ decompose the signal space into V 0 and W 0, and how they are related 49 50
Signal Analysis. Multi resolution Analysis (II)
Multi dimensional Signal Analysis Lecture 2H Multi resolution Analysis (II) Discrete Wavelet Transform Recap (CWT) Continuous wavelet transform A mother wavelet ψ(t) Define µ 1 µ t b ψ a,b (t) = p ψ a
More informationIntroduction to Discrete-Time Wavelet Transform
Introduction to Discrete-Time Wavelet Transform Selin Aviyente Department of Electrical and Computer Engineering Michigan State University February 9, 2010 Definition of a Wavelet A wave is usually defined
More informationWavelets and Multiresolution Processing
Wavelets and Multiresolution Processing Wavelets Fourier transform has it basis functions in sinusoids Wavelets based on small waves of varying frequency and limited duration In addition to frequency,
More information1 The Continuous Wavelet Transform The continuous wavelet transform (CWT) Discretisation of the CWT... 2
Contents 1 The Continuous Wavelet Transform 1 1.1 The continuous wavelet transform (CWT)............. 1 1. Discretisation of the CWT...................... Stationary wavelet transform or redundant wavelet
More informationLecture 16: Multiresolution Image Analysis
Lecture 16: Multiresolution Image Analysis Harvey Rhody Chester F. Carlson Center for Imaging Science Rochester Institute of Technology rhody@cis.rit.edu November 9, 2004 Abstract Multiresolution analysis
More informationAssignment #09 - Solution Manual
Assignment #09 - Solution Manual 1. Choose the correct statements about representation of a continuous signal using Haar wavelets. 1.5 points The signal is approximated using sin and cos functions. The
More informationDigital Image Processing Lectures 15 & 16
Lectures 15 & 16, Professor Department of Electrical and Computer Engineering Colorado State University CWT and Multi-Resolution Signal Analysis Wavelet transform offers multi-resolution by allowing for
More informationMLISP: Machine Learning in Signal Processing Spring Lecture 8-9 May 4-7
MLISP: Machine Learning in Signal Processing Spring 2018 Prof. Veniamin Morgenshtern Lecture 8-9 May 4-7 Scribe: Mohamed Solomon Agenda 1. Wavelets: beyond smoothness 2. A problem with Fourier transform
More informationChapter 7 Wavelets and Multiresolution Processing
Chapter 7 Wavelets and Multiresolution Processing Background Multiresolution Expansions Wavelet Transforms in One Dimension Wavelet Transforms in Two Dimensions Image Pyramids Subband Coding The Haar
More informationLecture 2: Haar Multiresolution analysis
WAVELES AND MULIRAE DIGIAL SIGNAL PROCESSING Lecture 2: Haar Multiresolution analysis Prof.V. M. Gadre, EE, II Bombay 1 Introduction HAAR was a mathematician, who has given an idea that any continuous
More information6 The Fourier transform
6 The Fourier transform In this presentation we assume that the reader is already familiar with the Fourier transform. This means that we will not make a complete overview of its properties and applications.
More informationEEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.
EEE400F EXAM DIGITAL SIGNAL PROCESSING PART A Basic digital signal processing theory.. A sequencex[n] has a zero-phase DTFT X(e jω ) given below: X(e jω ) University of Cape Town Department of Electrical
More informationMultirate signal processing
Multirate signal processing Discrete-time systems with different sampling rates at various parts of the system are called multirate systems. The need for such systems arises in many applications, including
More informationCourse and Wavelets and Filter Banks
Course 8.327 and.30 Wavelets and Filter Banks Multiresolution Analysis (MRA): Requirements for MRA; Nested Spaces and Complementary Spaces; Scaling Functions and Wavelets Scaling Functions and Wavelets
More informationDigital Image Processing
Digital Image Processing, 2nd ed. Digital Image Processing Chapter 7 Wavelets and Multiresolution Processing Dr. Kai Shuang Department of Electronic Engineering China University of Petroleum shuangkai@cup.edu.cn
More informationChapter 7 Wavelets and Multiresolution Processing. Subband coding Quadrature mirror filtering Pyramid image processing
Chapter 7 Wavelets and Multiresolution Processing Wavelet transform vs Fourier transform Basis functions are small waves called wavelet with different frequency and limited duration Multiresolution theory:
More informationTwo Channel Subband Coding
Two Channel Subband Coding H1 H1 H0 H0 Figure 1: Two channel subband coding. In two channel subband coding A signal is convolved with a highpass filter h 1 and a lowpass filter h 0. The two halfband signals
More informationModule 4 MULTI- RESOLUTION ANALYSIS. Version 2 ECE IIT, Kharagpur
Module MULTI- RESOLUTION ANALYSIS Version ECE IIT, Kharagpur Lesson Multi-resolution Analysis: Theory of Subband Coding Version ECE IIT, Kharagpur Instructional Objectives At the end of this lesson, the
More informationModule 4. Multi-Resolution Analysis. Version 2 ECE IIT, Kharagpur
Module 4 Multi-Resolution Analysis Lesson Multi-resolution Analysis: Discrete avelet Transforms Instructional Objectives At the end of this lesson, the students should be able to:. Define Discrete avelet
More informationFilter Banks II. Prof. Dr.-Ing. G. Schuller. Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany
Filter Banks II Prof. Dr.-Ing. G. Schuller Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany Page Modulated Filter Banks Extending the DCT The DCT IV transform can be seen as modulated
More informationMultiresolution image processing
Multiresolution image processing Laplacian pyramids Some applications of Laplacian pyramids Discrete Wavelet Transform (DWT) Wavelet theory Wavelet image compression Bernd Girod: EE368 Digital Image Processing
More informationSubband Coding and Wavelets. National Chiao Tung University Chun-Jen Tsai 12/04/2014
Subband Coding and Wavelets National Chiao Tung Universit Chun-Jen Tsai /4/4 Concept of Subband Coding In transform coding, we use N (or N N) samples as the data transform unit Transform coefficients are
More informationLecture 15: Time and Frequency Joint Perspective
WAVELETS AND MULTIRATE DIGITAL SIGNAL PROCESSING Lecture 15: Time and Frequency Joint Perspective Prof.V.M.Gadre, EE, IIT Bombay Introduction In lecture 14, we studied steps required to design conjugate
More informationAn Introduction to Wavelets and some Applications
An Introduction to Wavelets and some Applications Milan, May 2003 Anestis Antoniadis Laboratoire IMAG-LMC University Joseph Fourier Grenoble, France An Introduction to Wavelets and some Applications p.1/54
More informationWavelets Marialuce Graziadei
Wavelets Marialuce Graziadei 1. A brief summary 2. Vanishing moments 3. 2D-wavelets 4. Compression 5. De-noising 1 1. A brief summary φ(t): scaling function. For φ the 2-scale relation hold φ(t) = p k
More informationDigital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design
Digital Speech Processing Lecture Short-Time Fourier Analysis Methods - Filter Bank Design Review of STFT j j ˆ m ˆ. X e x[ mw ] [ nˆ m] e nˆ function of nˆ looks like a time sequence function of ˆ looks
More informationWavelets and Multiresolution Processing. Thinh Nguyen
Wavelets and Multiresolution Processing Thinh Nguyen Multiresolution Analysis (MRA) A scaling function is used to create a series of approximations of a function or image, each differing by a factor of
More informationBasic Multi-rate Operations: Decimation and Interpolation
1 Basic Multirate Operations 2 Interconnection of Building Blocks 1.1 Decimation and Interpolation 1.2 Digital Filter Banks Basic Multi-rate Operations: Decimation and Interpolation Building blocks for
More informationLecture 11 FIR Filters
Lecture 11 FIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/4/12 1 The Unit Impulse Sequence Any sequence can be represented in this way. The equation is true if k ranges
More informationProblem with Fourier. Wavelets: a preview. Fourier Gabor Wavelet. Gabor s proposal. in the transform domain. Sinusoid with a small discontinuity
Problem with Fourier Wavelets: a preview February 6, 2003 Acknowledgements: Material compiled from the MATLAB Wavelet Toolbox UG. Fourier analysis -- breaks down a signal into constituent sinusoids of
More informationWavelets: a preview. February 6, 2003 Acknowledgements: Material compiled from the MATLAB Wavelet Toolbox UG.
Wavelets: a preview February 6, 2003 Acknowledgements: Material compiled from the MATLAB Wavelet Toolbox UG. Problem with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of
More information6.02 Fall 2012 Lecture #10
6.02 Fall 2012 Lecture #10 Linear time-invariant (LTI) models Convolution 6.02 Fall 2012 Lecture 10, Slide #1 Modeling Channel Behavior codeword bits in generate x[n] 1001110101 digitized modulate DAC
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationDigital Image Processing
Digital Image Processing Wavelets and Multiresolution Processing (Wavelet Transforms) Christophoros Nikou cnikou@cs.uoi.gr University of Ioannina - Department of Computer Science 2 Contents Image pyramids
More informationMULTIRATE DIGITAL SIGNAL PROCESSING
MULTIRATE DIGITAL SIGNAL PROCESSING Signal processing can be enhanced by changing sampling rate: Up-sampling before D/A conversion in order to relax requirements of analog antialiasing filter. Cf. audio
More informationHaar wavelets. Set. 1 0 t < 1 0 otherwise. It is clear that {φ 0 (t n), n Z} is an orthobasis for V 0.
Haar wavelets The Haar wavelet basis for L (R) breaks down a signal by looking at the difference between piecewise constant approximations at different scales. It is the simplest example of a wavelet transform,
More informationLecture 27. Wavelets and multiresolution analysis (cont d) Analysis and synthesis algorithms for wavelet expansions
Lecture 7 Wavelets and multiresolution analysis (cont d) Analysis and synthesis algorithms for wavelet expansions We now return to the general case of square-integrable functions supported on the entire
More informationFrom Fourier to Wavelets in 60 Slides
From Fourier to Wavelets in 60 Slides Bernhard G. Bodmann Math Department, UH September 20, 2008 B. G. Bodmann (UH Math) From Fourier to Wavelets in 60 Slides September 20, 2008 1 / 62 Outline 1 From Fourier
More informationExamples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:
Discrete-Time s - I Time-Domain Representation CHAPTER 4 These lecture slides are based on "Digital Signal Processing: A Computer-Based Approach, 4th ed." textbook by S.K. Mitra and its instructor materials.
More informationMath 2025, Quiz #2. Name: 1) Find the average value of the numbers 1, 3, 1, 2. Answere:
Math 5, Quiz # Name: ) Find the average value of the numbers, 3,,. Answere: ) Find the Haar wavelet transform of the initial data s (3,,, 6). Answere: 3) Assume that the Haar wavelet transform of the initial
More informationWavelet Filter Transforms in Detail
Wavelet Filter Transforms in Detail Wei ZHU and M. Victor WICKERHAUSER Washington University in St. Louis, Missouri victor@math.wustl.edu http://www.math.wustl.edu/~victor FFT 2008 The Norbert Wiener Center
More informationWavelets and multiresolution representations. Time meets frequency
Wavelets and multiresolution representations Time meets frequency Time-Frequency resolution Depends on the time-frequency spread of the wavelet atoms Assuming that ψ is centred in t=0 Signal domain + t
More informationECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet
ECE58 Final Exam Fall 7 Digital Signal Processing I December 7 Cover Sheet Test Duration: hours. Open Book but Closed Notes. Three double-sided 8.5 x crib sheets allowed This test contains five problems.
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 12 Introduction to Wavelets Last Time Started with STFT Heisenberg Boxes Continue and move to wavelets Ham exam -- see Piazza post Please register at www.eastbayarc.org/form605.htm
More informationACM 126a Solutions for Homework Set 4
ACM 26a Solutions for Homewor Set 4 Laurent Demanet March 2, 25 Problem. Problem 7.7 page 36 We need to recall a few standard facts about Fourier series. Convolution: Subsampling (see p. 26): Zero insertion
More informationLecture 2 Discrete-Time LTI Systems: Introduction
Lecture 2 Discrete-Time LTI Systems: Introduction Outline 2.1 Classification of Systems.............................. 1 2.1.1 Memoryless................................. 1 2.1.2 Causal....................................
More informationDigital Image Processing Lectures 13 & 14
Lectures 13 & 14, Professor Department of Electrical and Computer Engineering Colorado State University Spring 2013 Properties of KL Transform The KL transform has many desirable properties which makes
More informationINTRODUCTION TO. Adapted from CS474/674 Prof. George Bebis Department of Computer Science & Engineering University of Nevada (UNR)
INTRODUCTION TO WAVELETS Adapted from CS474/674 Prof. George Bebis Department of Computer Science & Engineering University of Nevada (UNR) CRITICISM OF FOURIER SPECTRUM It gives us the spectrum of the
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationFilter Banks II. Prof. Dr.-Ing Gerald Schuller. Fraunhofer IDMT & Ilmenau Technical University Ilmenau, Germany
Filter Banks II Prof. Dr.-Ing Gerald Schuller Fraunhofer IDMT & Ilmenau Technical University Ilmenau, Germany Prof. Dr.-Ing. G. Schuller, shl@idmt.fraunhofer.de Page Modulated Filter Banks Extending the
More information6.02 Fall 2012 Lecture #11
6.02 Fall 2012 Lecture #11 Eye diagrams Alternative ways to look at convolution 6.02 Fall 2012 Lecture 11, Slide #1 Eye Diagrams 000 100 010 110 001 101 011 111 Eye diagrams make it easy to find These
More informationWavelet Transform. Figure 1: Non stationary signal f(t) = sin(100 t 2 ).
Wavelet Transform Andreas Wichert Department of Informatics INESC-ID / IST - University of Lisboa Portugal andreas.wichert@tecnico.ulisboa.pt September 3, 0 Short Term Fourier Transform Signals whose frequency
More informationOn the Dual-Tree Complex Wavelet Packet and. Abstract. Index Terms I. INTRODUCTION
On the Dual-Tree Complex Wavelet Packet and M-Band Transforms İlker Bayram, Student Member, IEEE, and Ivan W. Selesnick, Member, IEEE Abstract The -band discrete wavelet transform (DWT) provides an octave-band
More informationLinear Convolution Using FFT
Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular
More informationDigital Signal Processing. Midterm 2 Solutions
EE 123 University of California, Berkeley Anant Sahai arch 15, 2007 Digital Signal Processing Instructions idterm 2 Solutions Total time allowed for the exam is 80 minutes Please write your name and SID
More informationCourse and Wavelets and Filter Banks. Filter Banks (contd.): perfect reconstruction; halfband filters and possible factorizations.
Course 18.327 and 1.130 Wavelets and Filter Banks Filter Banks (contd.): perfect reconstruction; halfband filters and possible factorizations. Product Filter Example: Product filter of degree 6 P 0 (z)
More informationMultiresolution analysis
Multiresolution analysis Analisi multirisoluzione G. Menegaz gloria.menegaz@univr.it The Fourier kingdom CTFT Continuous time signals + jωt F( ω) = f( t) e dt + f() t = F( ω) e jωt dt The amplitude F(ω),
More informationCourse and Wavelets and Filter Banks
Course 18.327 and 1.130 Wavelets and Filter Banks Refinement Equation: Iterative and Recursive Solution Techniques; Infinite Product Formula; Filter Bank Approach for Computing Scaling Functions and Wavelets
More informationFrames. Hongkai Xiong 熊红凯 Department of Electronic Engineering Shanghai Jiao Tong University
Frames Hongkai Xiong 熊红凯 http://ivm.sjtu.edu.cn Department of Electronic Engineering Shanghai Jiao Tong University 2/39 Frames 1 2 3 Frames and Riesz Bases Translation-Invariant Dyadic Wavelet Transform
More informationA Novel Fast Computing Method for Framelet Coefficients
American Journal of Applied Sciences 5 (11): 15-157, 008 ISSN 1546-939 008 Science Publications A Novel Fast Computing Method for Framelet Coefficients Hadeel N. Al-Taai Department of Electrical and Electronic
More informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationFast Wavelet/Framelet Transform for Signal/Image Processing.
Fast Wavelet/Framelet Transform for Signal/Image Processing. The following is based on book manuscript: B. Han, Framelets Wavelets: Algorithms, Analysis Applications. To introduce a discrete framelet transform,
More informationWe have to prove now that (3.38) defines an orthonormal wavelet. It belongs to W 0 by Lemma and (3.55) with j = 1. We can write any f W 1 as
88 CHAPTER 3. WAVELETS AND APPLICATIONS We have to prove now that (3.38) defines an orthonormal wavelet. It belongs to W 0 by Lemma 3..7 and (3.55) with j =. We can write any f W as (3.58) f(ξ) = p(2ξ)ν(2ξ)
More informationThe Convolution Sum for Discrete-Time LTI Systems
The Convolution Sum for Discrete-Time LTI Systems Andrew W. H. House 01 June 004 1 The Basics of the Convolution Sum Consider a DT LTI system, L. x(n) L y(n) DT convolution is based on an earlier result
More informationWavelets and Filter Banks
Wavelets and Filter Banks Inheung Chon Department of Mathematics Seoul Woman s University Seoul 139-774, Korea Abstract We show that if an even length filter has the same length complementary filter in
More informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #21 Friday, October 24, 2003 Types of causal FIR (generalized) linear-phase filters: Type I: Symmetric impulse response: with order M an even
More information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More informationProperties of LTI Systems
Properties of LTI Systems Properties of Continuous Time LTI Systems Systems with or without memory: A system is memory less if its output at any time depends only on the value of the input at that same
More informationLet p 2 ( t), (2 t k), we have the scaling relation,
Multiresolution Analysis and Daubechies N Wavelet We have discussed decomposing a signal into its Haar wavelet components of varying frequencies. The Haar wavelet scheme relied on two functions: the Haar
More informationDigital Image Processing
Digital Image Processing Wavelets and Multiresolution Processing () Christophoros Nikou cnikou@cs.uoi.gr University of Ioannina - Department of Computer Science 2 Contents Image pyramids Subband coding
More informationMultiresolution schemes
Multiresolution schemes Fondamenti di elaborazione del segnale multi-dimensionale Multi-dimensional signal processing Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione
More informationMultiresolution schemes
Multiresolution schemes Fondamenti di elaborazione del segnale multi-dimensionale Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione dei Segnali Multi-dimensionali e
More informationWavelets, Filter Banks and Multiresolution Signal Processing
Wavelets, Filter Banks and Multiresolution Signal Processing It is with logic that one proves; it is with intuition that one invents. Henri Poincaré Introduction - 1 A bit of history: from Fourier to Haar
More informationModule 4 MULTI- RESOLUTION ANALYSIS. Version 2 ECE IIT, Kharagpur
Module 4 MULTI- RESOLUTION ANALYSIS Lesson Theory of Wavelets Instructional Objectives At the end of this lesson, the students should be able to:. Explain the space-frequency localization problem in sinusoidal
More informationIntroduction to Orthogonal Transforms. with Applications in Data Processing and Analysis
i Introduction to Orthogonal Transforms with Applications in Data Processing and Analysis ii Introduction to Orthogonal Transforms with Applications in Data Processing and Analysis October 14, 009 i ii
More informationEE67I Multimedia Communication Systems
EE67I Multimedia Communication Systems Lecture 5: LOSSY COMPRESSION In these schemes, we tradeoff error for bitrate leading to distortion. Lossy compression represents a close approximation of an original
More informationHarmonic Analysis: from Fourier to Haar. María Cristina Pereyra Lesley A. Ward
Harmonic Analysis: from Fourier to Haar María Cristina Pereyra Lesley A. Ward Department of Mathematics and Statistics, MSC03 2150, 1 University of New Mexico, Albuquerque, NM 87131-0001, USA E-mail address:
More informationRepresentation of 1D Function
Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Systems Lecture 2 Representation of 1D Function From the sifting property, we can write a 1D function as g( = g(ξδ( ξdξ. To
More information(Refer Slide Time: 0:18)
Foundations of Wavelets, Filter Banks and Time Frequency Analysis. Professor Vikram M. Gadre. Department Of Electrical Engineering. Indian Institute of Technology Bombay. Week-1. Lecture -2.3 L2 Norm of
More informationMGA Tutorial, September 08, 2004 Construction of Wavelets. Jan-Olov Strömberg
MGA Tutorial, September 08, 2004 Construction of Wavelets Jan-Olov Strömberg Department of Mathematics Royal Institute of Technology (KTH) Stockholm, Sweden Department of Numerical Analysis and Computer
More informationVII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.
1 VII. Discrete Fourier Transform (DFT) Chapter-8 A. Modulo Arithmetic (n) N is n modulo N, n is an integer variable. (n) N = n m N 0 n m N N-1, pick m Ex. (k) 4 W N = e -j2π/n 2 Note that W N k = 0 but
More informationOptimization of biorthogonal wavelet filters for signal and image compression. Jabran Akhtar
Optimization of biorthogonal wavelet filters for signal and image compression Jabran Akhtar February i ii Preface This tet is submitted as the required written part in partial fulfillment for the degree
More information1 1.27z z 2. 1 z H 2
E481 Digital Signal Processing Exam Date: Thursday -1-1 16:15 18:45 Final Exam - Solutions Dan Ellis 1. (a) In this direct-form II second-order-section filter, the first stage has
More informationWavelets For Computer Graphics
{f g} := f(x) g(x) dx A collection of linearly independent functions Ψ j spanning W j are called wavelets. i J(x) := 6 x +2 x + x + x Ψ j (x) := Ψ j (2 j x i) i =,..., 2 j Res. Avge. Detail Coef 4 [9 7
More informationHST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007
MIT OpenCourseare http://ocw.mit.edu HST.58J / 6.555J / 16.56J Biomedical Signal and Image Processing Spring 7 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationDiscrete-Time Signals & Systems
Chapter 2 Discrete-Time Signals & Systems 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 2-1-1 Discrete-Time Signals: Time-Domain Representation (1/10) Signals
More informationDevelopment and Applications of Wavelets in Signal Processing
Development and Applications of Wavelets in Signal Processing Mathematics 097: Senior Conference Paper Published May 014 David Nahmias dnahmias1@gmailcom Abstract Wavelets have many powerful applications
More informationDigital Signal Processing:
Digital Signal Processing: Mathematical and algorithmic manipulation of discretized and quantized or naturally digital signals in order to extract the most relevant and pertinent information that is carried
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Issued: Tuesday, September 5. 6.: Discrete-Time Signal Processing Fall 5 Solutions for Problem Set Problem.
More informationMulti-rate Signal Processing 3. The Polyphase Representation
Multi-rate Signal Processing 3. The Polyphase Representation Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by
More information1. Fourier Transform (Continuous time) A finite energy signal is a signal f(t) for which. f(t) 2 dt < Scalar product: f(t)g(t)dt
1. Fourier Transform (Continuous time) 1.1. Signals with finite energy A finite energy signal is a signal f(t) for which Scalar product: f(t) 2 dt < f(t), g(t) = 1 2π f(t)g(t)dt The Hilbert space of all
More informationImage Transforms. Digital Image Processing Fundamentals of Digital Image Processing, A. K. Jain. Digital Image Processing.
Digital Image Processing Fundamentals of Digital Image Processing, A. K. Jain 2D Orthogonal and Unitary Transform: Orthogonal Series Expansion: {a k,l (m,n)}: a set of complete orthonormal basis: N N *
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 05 Image Processing Basics 13/02/04 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationDefining the Discrete Wavelet Transform (DWT)
Defining the Discrete Wavelet Transform (DWT) can formulate DWT via elegant pyramid algorithm defines W for non-haar wavelets (consistent with Haar) computes W = WX using O(N) multiplications brute force
More informationRepresentation of 1D Function
Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Systems Lecture 2 Representation of 1D Function From the sifting property, we can write a 1D function as g(x) = g(ξ)δ(x ξ)dξ.
More informationLecture 7 January 26, 2016
MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture 7 January 26, 26 Prof Emmanuel Candes Scribe: Carlos A Sing-Long, Edited by E Bates Outline Agenda:
More informationLecture 2: Basics of Harmonic Analysis. 1 Structural properties of Boolean functions (continued)
CS 880: Advanced Complexity Theory 1/25/2008 Lecture 2: Basics of Harmonic Analysis Instructor: Dieter van Melkebeek Scribe: Priyananda Shenoy In the last lecture, we mentioned one structural property
More informationSignal Analysis. Principal Component Analysis
Multi dimensional Signal Analysis Lecture 2E Principal Component Analysis Subspace representation Note! Given avector space V of dimension N a scalar product defined by G 0 a subspace U of dimension M
More informationContents. 0.1 Notation... 3
Contents 0.1 Notation........................................ 3 1 A Short Course on Frame Theory 4 1.1 Examples of Signal Expansions............................ 4 1.2 Signal Expansions in Finite-Dimensional
More informationBiorthogonal Spline Type Wavelets
PERGAMON Computers and Mathematics with Applications 0 (00 1 0 www.elsevier.com/locate/camwa Biorthogonal Spline Type Wavelets Tian-Xiao He Department of Mathematics and Computer Science Illinois Wesleyan
More information