Optimum LMSE Discrete Transform
|
|
- Bartholomew Harrison
- 6 years ago
- Views:
Transcription
1 Image Trasformatio Two-dimesioal image trasforms are extremely importat areas of study i image processig. The image output i the trasformed space may be aalyzed, iterpreted, ad further processed for implemetig diverse image processig tass. These trasformatios are widely used, sice by usig these trasformatios, it is possible to express a image as a combiatio of a set of basic sigals, ow as the basis fuctios. I case of Fourier trasform of a image these basis sigals are siusoidal sigals with differet periods which describe the spatial frequecies i a image. Thus such trasforms, such as the Fourier trasform, reveal spectral structures embedded i the image that may be used to characterize the image. The term Image trasform are usually refers to a class of uitary matrices used for represetig images. large class of image processig trasformatios is liear i ature; a output image is formed from liear combiatios of pixels of a iput image. Such trasforms iclude covolutios, correlatios, ad uitary trasforms. Liear trasforms have bee utilized to ehace images ad to extract various features from images. For example, the Fourier trasform is used i highpass ad lowpass filterig as well as i texture aalysis. Aother applicatio is image codig i which badwidth reductio is achieved by deletig low-magitude trasform coefficiets. The followig table illustrate the complexity of trasformatios Trasform Processig ad Ecodig TYPE OPERATIOS COMMETS Karhue Loeve 4 Optimum LMSE Discrete Trasform Discrete Fourier HADAMARD log log Asymptotic to K.L.Trasform Biary Basis Matrices Discrete Cosie More Complex Useful i sca directio i real time, Better tha Fourier ad Hadamard Slat Trasform Complex Suited for vertical ecodig, Better tha Fourier ad Hadamard HAAR Trasform Geeralized Differetial Ecodig Simply Implemeted Fourier Trasform Fourier trasform is oe of the most importat tools which have bee extesively used ot oly for uderstadig the ature of a image ad its formatio but also for processig the image. Usig Fourier trasform, it has bee possible to aalyze a image as a set of spatial siusoids i various directios, each siusoid havig a precise frequecy.
2 Oe-Dimesioal Fourier Trasform The oe-dimesioal cotiuous Fourier trasform,(cft) of a cotiuous fuctio f(x) is Two-Dimesioal Fourier Trasform Extedig the cocept of oe-dimesioal Fourier trasform, the two-dimesioal Fourier trasform of a cotiuous fuctio f(x, y) is deoted by The variable i Eq. 4.6 idicates the frequecy,i.e., the umber of waves per uit legth i X directio, ad idicates the umber of waves alog the Y directio. The correspodig iverse two-dimesioal Fourier trasform is Discrete Fourier Trasform (DFT) Sice the sigal is discretized, the operatio of itegratio i cotiuous Fourier trusfom (CFT) is replaced by summatio operatios i DFT. We preset the oedimesioal DFT ad also the two-dimesioal DFT i the followig subsectios. Oe-Dimesioal DFT The oe-dimesioal discrete Fourier trasform of a fuctio f(x) of size with iteger idex x ruig from 0 to -, is represeted by
3 [error : replace y i summatio by x] The correspodig oe-dimesioal iverse DFT is [replace M by ] Two-Dimesioal DFT The two-dimesioal discrete Fourier trasform of a two-dimesioal sigal f ( x, y ) of dimesio M x with iteger idices x ad y ruig from 0 to M - ad 0 to -, is represeted by The equivalet two-dimesioal iverse DFT is Trasformatio Kerels As we have already oted the geeral forward ad iverse Fourier trasformatio ca be expressed as I the above equatios g(x, y, u, v) is ow as forward trasformatio erel ad h(x, y, u, v) is the iverse trasformatio erel. Here u ad v assume values i the rage (0,,..., - ). As ca be further observed, these erels are depedet oly 3
4 o the spatial positios ad frequecies alog X ad Y directios, ad are idepedet of either f ( x,y ) or F(u,w ). If the erel g ( x, y, u, v ) = g(x,u)g(y,v), we say that the erel is separable. If i additio the fuctioal forms of g ad g are idetical, the the erel is said to be symmetric. It easy to show that the erel g(x, y, u, v) is separable ad symmetric sice Properties - Traslatio: The traslatio of a Fourier trasform pair is The above implicatio idicates the correspodece betwee a two dimesioal image fuctio ad its Fourier trasform. - Rotatio: Assumig that the fuctio f ( x,y ) udergoes a rotatio of, the correspodig fuctio f (x,y ) i polar coordiates will the be represeted as f ( r, ), where x= r cosc ad y = r si. The correspodig DFT F(u,w) i polar coordiates will be represeted as The above implies that if f ( x,y ) is rotated by, the F ( u,w ) will be rotated by the same agle ad hece we ca imply that correspods to i the DFT domai ad vice versa. 3- Separability : The separability property of a two-dimesioal trasform ad its iverse esures that such computatios ca be performed by decomposig the twodimesioal trasforms ito two oe-dimesioal trasforms. From Eqs. 4.3 ad 4.4 describig the DFT ad iverse DFT of a two-dimesioal fuctio f ( x,y ), we ca express them i separable form as follows. 4- Distributive property: The DFT of sum of two fuctios f( x,y ) ad f ( x, y ) is idetical to the sum of the DFT of these two fuctios, i.e., 4
5 5- Scalig property: The DFT of a fuctio f ( x, y ) multiplied by a scalar() is idetical to the multiplicatio of the scalar with the DFT of the fuctio f(x,y), i.e., 6- Covolutio: The DFT of covolutio of two fuctios is equal to the product of the DFT of these two fuctios, i.e., 7- Correlatio: The correlatio betwee two fuctios f(x,y) ad f ( x,y) i cotiuous domai is deoted as whereas the correlatio i the discrete domai is deoted as 8- Periodicity: The DFT of a two-dimesioal fuctio f ( x, y ) ad its iverse are both periodic with period, i.e., Fast Fourier Trasform The umber of complex multiplicatios ad additios to compute Eq. 4. for DFT is O(). However, we ca adopt a divide-ad- coquer approach to reduce the computatioal complexity of the algorithm to O( log ). This algorithm is popularly ow as the Fast Fourier Trasform (FFT). Here we preset a geeral idea of the divide-ad-coquer approach toward implemetatio of the FFT. The geeral priciples is based o successive divisio method usig divide-ad-coquer approach as explaied below. As show i Eq. 4., the oe-dimesioal DFT of a oedimesioal 5
6 sigal f(x) is computed The Discrete Cosie Trasform ( DCT ) This importat trasform (DCT for short) has origiated by. The DCT i oe dimesio is give by The iput is a set of data values pt (pixels, audio samples, or other data), ad the output is a set of DCT trasform coefficiets (or weights) Gf. The first coefficiet G0 is called the DC Coefficiet, ad the rest are referred to as the AC coefficiets. otice that the coefficiets are real umbers eve if the iput data cosists of itegers. Similarly, the coefficiets may be positive or egative eve if the iput data cosists of oegative umbers oly. This computatio is The IDCT i oe dimesio is give by the most of the trasform coefficiets produced by the DCT are zeros or small umbers, ad oly a few are large (ormally the first oes). We will see that the early coefficiets cotai the importat (low-frequecy) image iformatio ad the later coefficiets cotai the less-importat (high-frequecy) image iformatio. Compressig data with the DCT is therefore doe by quatizig the coefficiets. Experiece idicates that = 8 is a good value, ad most data compressio methods that employ the DCT use this value of. The followig example illustrates the differece i performace betwee the DCT ad the DFT. We start with the simple, highly correlated sequece of eight umbers (8, 6, 4, 3, 40, 48, 56, 64). It is displayed graphically i followig Figure Applyig the DCT to it yields (00, 5, 0, 5, 0,, 0, 0.4). Whe this is quatized to 6
7 (00, 5, 0, 5, 0, 0, 0, 0) ad trasformed bac, it produces (8,5,4, 3, 40, 48,57, 63), a sequece almost idetical to the origial iput. Applyig the DFT to the same iput, o the other had, yields (36, 0, 0, 6, 6, 4, 4, 4). Whe this is quatized to (36, 0, 0, 6, 0, 0, 0, 0) ad is trasformed bac, it produces (4,, 0, 3,40,5, 59, 48). This output is show i the followig Figure, ad it illustrates the tedecy of the Fourier Trasform to produce a periodic result. The DCT i two dimesio is give by for 0 i ad 0 j m ad for Ci ad Cj defied by Equatio (4.3). The first coefficiet G00 is agai termed the DC coefficiet, ad the remaiig coefficiets are called the AC coefficiets., The IDCT i two dimesio is give by We illustrate the performace of the DCT i two dimesios by applyig it to two blocs of 8 8 values. The first bloc (Table 4.3a) has highly correlated iteger values i the rage [8, ], ad the secod bloc has radom values i the same rage(table 4.4) The first bloc results i a large DC coefficiet, followed by small AC coefficiets (icludig 0 zeros, Table 4.3b, where egative umbers are uderlied). Whe the coefficiets are quatized (Table 4.3c), 7
8 The result, show i Table 4.3d, is very similar to the origial values. I cotrast, the coefficiets for the secod bloc (Table 4.4b) iclude just oe zero. Whe quatized (Table 4.4c) ad trasformed bac, may of the 64 results are very differet from the origial values (Table 4.4d). The ext example illustrates the differece i the performace of the DCT whe applied to a cotiuous-toe image ad to a discrete-toe image. We start with the highly correlated patter of Table
9 9 This is a idealized example of a cotiuous-toe image, sice adjacet pixels differ by a costat amout except the pixel (uderlied) at row 7, colum 7. The 64 DCT coefficiets of this patter are listed i Table 4.6. It is clear that there are oly a few domiat coefficiets. Table 4.7 lists the coefficiets after they have bee coarsely quatized, so that oly four ozero coefficiets remai! The results of performig the IDCT o these quatized coefficiets are show i Table 4.8. It is obvious that the four ozero coefficiets have recostructed the origial patter to a high degree. The oly visible differece is i row 7, colum 7, which has chaged from to 7.55 (mared i both figures). [ page 5-54 of ail] properties of dct بولطم Sie trasform The third equatio represet the two dimesio (,) 0.5 provided that KLT, DST iscloseto the fast algorithm, 0, si, 0, si 0, si 0 0 S S S S v u u v T
10 Hartley Trasform The discrete two-dimesioal Hartley trasform is defied by the trasform pair Hadamard Trasform [Ray] The basis vector of the trasform tae oly the biary value +,- The symmetric WHT for =,, 4 ad 8 are show i Eqs respectively: H = [I] (4.6) 0
11 Haar Trasform [scott page 5-30] KARHAUE-LOEVE TRASFORM OR PRICIPAL COMPOET AALYSIS [ray] Karhaue.-Loeve Trasform, or Pricipal Compoet Aalysis (PCA) has bee a popular techique for may image processig ad patter recogitio applicatios. This trasform which is also ow as Hotellig Trasform is based o the cocepts of statistical properties of image pixels or patter features Pricipal compoet aalysis (PCA) forms the basis of the Karhue-Loeve (KL) trasform for compact represetatio of data. The KL trasform ad the theory behid the pricipal compoet aalysis are of
12 fudametal importace i sigal ad image processig. The priciple has also foud its place i data miig for reductio of large-dimesioal datasets. It has bee successfully applied to text aalysis ad retrieval for text miig as well, Before describig the PCA, we would briefly preset the cocepts of covariace matrix. Covariace Matrix I practical patter recogitio problems there are usually more tha oe feature. Durig the process of statistical aalysis of these data, we have to fid out whether these features are idepedet of oe aother. Otherwise there exists a relatioship betwee each pair of features. For example, while extractig the features of huma face, oe may choose two features such as () X to deote the distace betwee the ceters of the two irises, ad () Y to deote the distace betwee the ceters of the left ad right eyebrows. From a large set of huma faces, we ca determie the mea ad the stadard deviatio of the above two features. The stadard deviatio for each of the above two dimesios of the face data set may be computed idepedetly of each other. To uderstad whether there exists ay relatioship betwee these two features, we have t o compute how much the first feature X of each of the patters i our data set varies from the mea of the secod feature Y. This measure, which is computed similar to variace, is always measured betwee two features. The covariace is computed as follows: the covariace is measured betwee each pair of features. Eigevectors ad Eigevalues Before we discuss pricipal compoet aalysis, we will briefly explai the cocept of eigevectors ad eigevalues of a matrix. Let us assume that we have a square matrix A of dimesio x, which whe multiplied by a vector X of dimesio x yields aother vector Y of dimesio x, which is essetially the same as the origial vector X that was chose iitially. Such a vector X is called a eigevector which trasforms a square matrix A ito a vector, which is either the same vector X or a multiple of X. Every eigevector is associated with a correspodig eigevalue. The cocept of a eigevalue is that of a scale which whe multiplied by the eigevector yields the same scaled vector i the same directio. Pricipal Compoet Aalysis While computig the pricipal compoet aalysis, we represet a x image as a oe-dimesioal vector of * elemets, by placig the rows of the image oe after aother. The we compute the covariace matrix of the etire data set. ext we compute the eigevalues of this covariace matrix. The eigevectors correspodig
13 to the most sigificat eigevalues will yield the pricipal compoets. To get the origial data bac we have to cosider all the eigevectors i our trasformatio. If we discard some of the less sigificat eigevectors i the fial trasformatio, the the retrieved data will lose some iformatio. However, if we choose all the eigevectors, we ca retrieve the origial data. The Slat Trasform [Ail page 6 6] The x slat trasform matrices are defied by the recursio. Table 5.3 Summary of image trasform [Ail page 79] 3
Session 5. (1) Principal component analysis and Karhunen-Loève transformation
200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSEMS Versio ECE II, Kharagpur Lesso 8 rasform Codig & K-L rasforms Versio ECE II, Kharagpur Istructioal Oectives At the ed of this lesso, the studets should e ale to:.
More informationFrequency Domain Filtering
Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationOlli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5
Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4
More information2D DSP Basics: 2D Systems
- Digital Image Processig ad Compressio D DSP Basics: D Systems D Systems T[ ] y = T [ ] Liearity Additivity: If T y = T [ ] The + T y = y + y Homogeeity: If The T y = T [ ] a T y = ay = at [ ] Liearity
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationFrequency Response of FIR Filters
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state
More informationThe z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More informationChapter 2 Systems and Signals
Chapter 2 Systems ad Sigals 1 Itroductio Discrete-Time Sigals: Sequeces Discrete-Time Systems Properties of Liear Time-Ivariat Systems Liear Costat-Coefficiet Differece Equatios Frequecy-Domai Represetatio
More informationThe Discrete Fourier Transform
The Discrete Fourier Trasform Complex Fourier Series Represetatio Recall that a Fourier series has the form a 0 + a k cos(kt) + k=1 b k si(kt) This represetatio seems a bit awkward, sice it ivolves two
More informationMachine Learning for Data Science (CS 4786)
Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm
More informationFilter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and
Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More information1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y
Questio (a) A square matrix A= A is called positive defiite if the quadratic form waw > 0 for every o-zero vector w [Note: Here (.) deotes the traspose of a matrix or a vector]. Let 0 A = 0 = show that:
More informationCourse 4: Preparation for Calculus Unit 1: Families of Functions
Course 4: Preparatio for Calculus Uit 1: Families of Fuctios Review ad exted properties of basic fuctio families ad their uses i mathematical modelig Develop strategies for fidig rules of fuctios whose
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationChapter 7: The z-transform. Chih-Wei Liu
Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationPrinciple Of Superposition
ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give
More informationSensitivity Analysis of Daubechies 4 Wavelet Coefficients for Reduction of Reconstructed Image Error
Proceedigs of the 6th WSEAS Iteratioal Coferece o SIGNAL PROCESSING, Dallas, Texas, USA, March -4, 7 67 Sesitivity Aalysis of Daubechies 4 Wavelet Coefficiets for Reductio of Recostructed Image Error DEVINDER
More informationADVANCED DIGITAL SIGNAL PROCESSING
ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationEE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course
Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL
More informationChapter 7 z-transform
Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationMachine Learning for Data Science (CS 4786)
Machie Learig for Data Sciece CS 4786) Lecture 9: Pricipal Compoet Aalysis The text i black outlies mai ideas to retai from the lecture. The text i blue give a deeper uderstadig of how we derive or get
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationFFTs in Graphics and Vision. The Fast Fourier Transform
FFTs i Graphics ad Visio The Fast Fourier Trasform 1 Outlie The FFT Algorithm Applicatios i 1D Multi-Dimesioal FFTs More Applicatios Real FFTs 2 Computatioal Complexity To compute the movig dot-product
More informationChapter 8. DFT : The Discrete Fourier Transform
Chapter 8 DFT : The Discrete Fourier Trasform Roots of Uity Defiitio: A th root of uity is a complex umber x such that x The th roots of uity are: ω, ω,, ω - where ω e π /. Proof: (ω ) (e π / ) (e π )
More informationFIR Filter Design: Part II
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationx[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.
x[ ] x[ ] x[] x[] x[] x[] 9 8 7 6 5 4 3 3 4 5 6 7 8 9 Figure. Graphical represetatio of a discrete-time sigal. From Discrete-Time Sigal Processig, e by Oppeheim, Schafer, ad Buck 999- Pretice Hall, Ic.
More informationMatrices and vectors
Oe Matrices ad vectors This book takes for grated that readers have some previous kowledge of the calculus of real fuctios of oe real variable It would be helpful to also have some kowledge of liear algebra
More informationLinear time invariant systems
Liear time ivariat systems Alejadro Ribeiro Dept. of Electrical ad Systems Egieerig Uiversity of Pesylvaia aribeiro@seas.upe.edu http://www.seas.upe.edu/users/~aribeiro/ February 25, 2016 Sigal ad Iformatio
More informationWeb Appendix O - Derivations of the Properties of the z Transform
M. J. Roberts - 2/18/07 Web Appedix O - Derivatios of the Properties of the z Trasform O.1 Liearity Let z = x + y where ad are costats. The ( z)= ( x + y )z = x z + y z ad the liearity property is O.2
More informationELEG3503 Introduction to Digital Signal Processing
ELEG3503 Itroductio to Digital Sigal Processig 1 Itroductio 2 Basics of Sigals ad Systems 3 Fourier aalysis 4 Samplig 5 Liear time-ivariat (LTI) systems 6 z-trasform 7 System Aalysis 8 System Realizatio
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More information7. Modern Techniques. Data Encryption Standard (DES)
7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio
More informationModule 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur
Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More informationDiscrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations
-6.3 Digital Sigal Processig ad Filterig..8 Discrete-ime Sigals ad Systems ime-domai Represetatios of Discrete-ime Sigals ad Systems ime-domai represetatio of a discrete-time sigal as a sequece of umbers
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More informationPractical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement
Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),
More informationThe Discrete Fourier Transform
The iscrete Fourier Trasform The discrete-time Fourier trasform (TFT) of a sequece is a cotiuous fuctio of!, ad repeats with period. I practice we usually wat to obtai the Fourier compoets usig digital
More informationSignal Processing in Mechatronics
Sigal Processig i Mechatroics Zhu K.P. AIS, UM. Lecture, Brief itroductio to Sigals ad Systems, Review of Liear Algebra ad Sigal Processig Related Mathematics . Brief Itroductio to Sigals What is sigal
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 50-004 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig
More informationLecture 14. Discrete Fourier Transforms (cont d) The Discrete Cosine Transform (DCT) (cont d)
Lecture 14 Discrete Fourier Trasforms (cot d) The Discrete Cosie Trasform (DCT) (cot d) I the previous lecture, we arrived at the followig formula for the discrete cosie trasform (DCT) of a -dimesioal
More informationIntroduction to Signals and Systems, Part V: Lecture Summary
EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationDISTRIBUTION LAW Okunev I.V.
1 DISTRIBUTION LAW Okuev I.V. Distributio law belogs to a umber of the most complicated theoretical laws of mathematics. But it is also a very importat practical law. Nothig ca help uderstad complicated
More informationQuestion1 Multiple choices (circle the most appropriate one):
Philadelphia Uiversity Studet Name: Faculty of Egieerig Studet Number: Dept. of Computer Egieerig Fial Exam, First Semester: 2014/2015 Course Title: Digital Sigal Aalysis ad Processig Date: 01/02/2015
More informationREVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.
The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values of the variable it cotais The relatioships betwee
More informationModule 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation
Module 8 Discrete Time Sigals ad Z-Trasforms Objective:To uderstad represetig discrete time sigals, apply z trasform for aalyzigdiscrete time sigals ad to uderstad the relatio to Fourier trasform Itroductio
More informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More information2 Geometric interpretation of complex numbers
2 Geometric iterpretatio of complex umbers 2.1 Defiitio I will start fially with a precise defiitio, assumig that such mathematical object as vector space R 2 is well familiar to the studets. Recall that
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationmultiplies all measures of center and the standard deviation and range by k, while the variance is multiplied by k 2.
Lesso 3- Lesso 3- Scale Chages of Data Vocabulary scale chage of a data set scale factor scale image BIG IDEA Multiplyig every umber i a data set by k multiplies all measures of ceter ad the stadard deviatio
More informationMatrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc.
2 Matrix Algebra 2.2 THE INVERSE OF A MATRIX MATRIX OPERATIONS A matrix A is said to be ivertible if there is a matrix C such that CA = I ad AC = I where, the idetity matrix. I = I I this case, C is a
More informationFinite-length Discrete Transforms. Chapter 5, Sections
Fiite-legth Discrete Trasforms Chapter 5, Sectios 5.2-50 5.0 Dr. Iyad djafar Outlie The Discrete Fourier Trasform (DFT) Matrix Represetatio of DFT Fiite-legth Sequeces Circular Covolutio DFT Symmetry Properties
More informationZ - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Trasform The -trasform is a very importat tool i describig ad aalyig digital systems. It offers the techiques for digital filter desig ad frequecy aalysis of digital sigals. Defiitio of -trasform:
More informationDigital Signal Processing, Fall 2006
Digital Sigal Processig, Fall 26 Lecture 1: Itroductio, Discrete-time sigals ad systems Zheg-Hua Ta Departmet of Electroic Systems Aalborg Uiversity, Demark zt@kom.aau.dk 1 Part I: Itroductio Itroductio
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More informationA widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α
Nice plottig of proteis: I A widely used display of protei shapes is based o the coordiates of the alpha carbos - - C α -s. The coordiates of the C α -s are coected by a cotiuous curve that roughly follows
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationCov(aX, cy ) Var(X) Var(Y ) It is completely invariant to affine transformations: for any a, b, c, d R, ρ(ax + b, cy + d) = a.s. X i. as n.
CS 189 Itroductio to Machie Learig Sprig 218 Note 11 1 Caoical Correlatio Aalysis The Pearso Correlatio Coefficiet ρ(x, Y ) is a way to measure how liearly related (i other words, how well a liear model
More informationPhysics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.
Physics 324, Fall 2002 Dirac Notatio These otes were produced by David Kapla for Phys. 324 i Autum 2001. 1 Vectors 1.1 Ier product Recall from liear algebra: we ca represet a vector V as a colum vector;
More informationFortgeschrittene Datenstrukturen Vorlesung 11
Fortgeschrittee Datestruture Vorlesug 11 Schriftführer: Marti Weider 19.01.2012 1 Succict Data Structures (ctd.) 1.1 Select-Queries A slightly differet approach, compared to ra, is used for select. B represets
More informationSignal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform
Sigal Processig i Mechatroics Summer semester, 1 Lecture 3, Covolutio, Fourier Series ad Fourier rasform Dr. Zhu K.P. AIS, UM 1 1. Covolutio Covolutio Descriptio of LI Systems he mai premise is that the
More informationAnalysis of Algorithms. Introduction. Contents
Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We
More informationa for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a
Math S-b Lecture # Notes This wee is all about determiats We ll discuss how to defie them, how to calculate them, lear the allimportat property ow as multiliearity, ad show that a square matrix A is ivertible
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationSection 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations
Differece Equatios to Differetial Equatios Sectio. Calculus: Areas Ad Tagets The study of calculus begis with questios about chage. What happes to the velocity of a swigig pedulum as its positio chages?
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationSignals & Systems Chapter3
Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of
More information1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationFIR Filter Design: Part I
EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I. Itroductio FIR Filter Desig: Part I I this set o otes, we cotiue our exploratio o the requecy respose o FIR ilters. First, we cosider some
More informationReview of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk
Review of Discrete-time Sigals ELEC 635 Prof. Siripog Potisuk 1 Discrete-time Sigals Discrete-time, cotiuous-valued amplitude (sampled-data sigal) Discrete-time, discrete-valued amplitude (digital sigal)
More informationProblem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =
Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,
More information11 Correlation and Regression
11 Correlatio Regressio 11.1 Multivariate Data Ofte we look at data where several variables are recorded for the same idividuals or samplig uits. For example, at a coastal weather statio, we might record
More informationDeterminants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)
5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper
More informationREVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.
the Further Mathematics etwork wwwfmetworkorguk V 07 The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationExponential Moving Average Pieter P
Expoetial Movig Average Pieter P Differece equatio The Differece equatio of a expoetial movig average lter is very simple: y[] x[] + (1 )y[ 1] I this equatio, y[] is the curret output, y[ 1] is the previous
More informationGeneralizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations
Geeraliig the DTFT The Trasform M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl 1 The forward DTFT is defied by X e jω = x e jω i which = Ω is discrete-time radia frequecy, a real variable.
More informationDIGITAL FILTER ORDER REDUCTION
DIGITAL FILTER RDER REDUTI VAHID RAISSI DEHKRDI, McGILL UIVERSITY, AADA, vahid@cim.mcgill.ca AMIR G. AGHDAM, RDIA UIVERSITY, AADA, aghdam@ece.cocordia.ca ABSTRAT I this paper, a method is proposed to reduce
More informationSolutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.
Quiz November 4th, 23 Sigals & Systems (5-575-) P. Reist & Prof. R. D Adrea Solutios Exam Duratio: 4 miutes Number of Problems: 4 Permitted aids: Noe. Use oly the prepared sheets for your solutios. Additioal
More informationLecture 7: Fourier Series and Complex Power Series
Math 1d Istructor: Padraic Bartlett Lecture 7: Fourier Series ad Complex Power Series Week 7 Caltech 013 1 Fourier Series 1.1 Defiitios ad Motivatio Defiitio 1.1. A Fourier series is a series of fuctios
More informationProbability, Expectation Value and Uncertainty
Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such
More informationLecture 8: Solving the Heat, Laplace and Wave equations using finite difference methods
Itroductory lecture otes o Partial Differetial Equatios - c Athoy Peirce. Not to be copied, used, or revised without explicit writte permissio from the copyright ower. 1 Lecture 8: Solvig the Heat, Laplace
More information