EIGENVALUE DISTRIBUTION OF THE CORRELATION MATRIX IN L`-FILTERS. Constantine Kotropoulos and Ioannis Pitas

Size: px
Start display at page:

Download "EIGENVALUE DISTRIBUTION OF THE CORRELATION MATRIX IN L`-FILTERS. Constantine Kotropoulos and Ioannis Pitas"

Transcription

1 EIGEVALUE DISTRIBUTIO OF THE CORRELATIO MATRI I L`-FILTERS Constantne Kotropoulos and Ioanns Ptas Dept of Informatcs, Arstotle Unversty of Thessalonk Box, Thessalonk 0 0, GREECE fcostas, ptas g@zeuscsdauthgr ABSTRACT L`-flters are a fundamental flter class wthn the famly of order statstc flters In ths paper, startng from frst prncples, we derve the cumulatve densty functon and the probablty densty functon of tme and ranked ordered samples for ndependent dentcally/non-dentcally dstrbuted nput random varables The raw second moments and the product moments of the tme and ranked ordered samples are then computed for ndependent dentcally dstrbuted nput samples Based on the aforementoned moments the correlaton matrx of the tme and ranked ordered samples s derved and ts egenvalue dstrbuton s determned We present relatonshps between the egenvalues of the correlaton matrx of tme and ranked ordered samples and those of the correlaton matrx of the ordered samples ITRODUCTIO onlnear flters have become a very mportant tool n sgnal processng, and especally n mage analyss and computer vson For a revew of the nonlnear flter classes the reader may consult [] One of the best known nonlnear famles s based on the order statstcs It uses the concept of data orderng One of the major classes of order statstc flters s the L`-flter [, ] It has the form of a lnear combnaton of the observatons and t explots the combned rank and locaton nformaton nherent n the observatons Powerful extensons of the L`-flters have been proposed n the lterature, such as the order statstc flter banks [], the permutaton flter lattces [] Closely related estmators to the L`-estmator have been proposed for the estmaton of the mean usng order statstcs n [] In practce, adaptve desgns based on the Least Mean Squares algorthm (LMS of L`-flters and ther extensons preval [] In ths paper, startng from frst prncples, we derve the cumulatve densty functon and the probablty densty functon of tme and ranked ordered samples for ndependent dentcally/nondentcally dstrbuted nput random varables The raw second moments and the product moments of the tme and ranked ordered samples are then computed for ndependent dentcally dstrbuted (d nput samples Based on the aforementoned moments the correlaton matrx of the tme and ranked ordered samples s derved and ts egenvalue dstrbuton s determned Although L`flters loose some of ther advantage n an d envronment, lke permutaton flters [8], because all tme-rank orderngs are equally lkely, the propertes derved under ths assumpton gve a valuable nsght nto the operaton of adaptve LMS L`-flters n respect of ther convergence n the mean and n the mean-square Such an d envronment s the case of a constant sgnal corrupted by addtve zero-mean whte nose For an observaton vector of length, we prove that out of the egenvalues of the tme and ranked ordered samples are gven by the egenvalues of the correlaton matrx of the ranked ordered samples dvded by We also derve lower and upper bounds for the mnmal and maxmal egenvalue of the correlaton matrx of the tme and ranked ordered samples These bounds depend on the extreme egenvalues of the correlaton matrx of the ranked ordered samples The latter egenvalues are related through nequaltes wth the egenvalues of the ranked ordered nose samples The theoretcal results have been verfed by numercal computatons The outlne of the paper s as follows Secton brefly descrbes L`-estmators Secton deals wth the probablty densty functon of one tme and ranked ordered sample and the jont probablty densty functon of two tme and ranked ordered samples The egenvalues of the correlaton matrx of ndependent dentcally dstrbuted tme and ranked ordered samples are studed n Secton Upper and lower bounds on the extreme egenvalues are derved n ths secton as well Smlar bounds on the extreme egenvalues of the correlaton matrx of ranked ordered samples are presented n Secton L`-ESTIMATORS Let us consder that the observed sgnal fx(ng can be expressed as a sum of an arbtrary nose-free sgnal fs(ng plus zero-mean addtve whte nose fv(ng, n denotes dscrete-tme Let x`(n be the vector of nput observatons x`(n =(x (n;x (n;:::;x (n T ( and x L(n be the ranked ordered nput vector at n gven by x L(n = x( (n;x ( (n;:::;x ( (n T x ( (n» x ( (n» :::» x ( (n The vector x L(n s commonly referred as the vector of the order statstcs of x`(n Let us defne the temporal locaton vector [] ( ο ( (n =(ο (n;ο (n;:::;ο (n T ( ρ f x ο ( (n $ x j(n j(n = ( 0 otherwse In ( x ( (n $ x j(n denotes that the th order statstc occupes the jth temporal sample By usng the temporal locaton vector we create the followng vector x L`(n = x( (nο T ( (n j x ((nο T ( (n j jx ((n

2 ο T ( (n T = x( (n;:::;x ( (n j ::: j x ( (n;:::;x ( (n T : ( An estmate bs(n of the orgnal (nose-free sgnal can be obtaned by bs(n =c T x L`(n ( that defnes the so-called -L`-estmator [] Henceforth we call ths estmator L`-estmator for brevty Let us assume that x L`(n defnedn(ands(n are jontly statonary stochastc sgnals Based on the statonarty assumpton we are nterested n the dervaton of the -L`-flter that mnmzes the mean squared error " = Ef(s(n bs(n g = c T R L` c c T p L` +Efs (ng ( R L` =Efx L`(nx T L`(ng s the correlaton matrx of the tme and ranked ordered samples, x L`(n, andp L` = Efs(n x L`(ng s the cross-correlaton vector between the vector x L`(n and the desred response s(n Clearly, provded that R L` s not sngular, the optmal -L`-flter coeffcent vector c o s gven by c o = R L` p L`: (8 Approaches to determnng the L`-flter coeffcents c usng the LMS algorthm have been proposed n [, 9] The convergence n the mean and n the mean square of the LMS-based desgn approaches depends strongly on the egenvalue dstrbuton of R L` [0] The objectve of ths paper s to study the egenvalue dstrbuton of R L` n an d envronment PROBABILIT DESIT FUCTIO OF THE CORRELATIO MATRI OF TIME AD RAKED ORDERED SAMPLES Let g (t and G (t denote, respectvely, the probablty densty functon (pdf and the cumulatve densty (cdf functon the -th nput observaton The pdf of the random varable x (m for ndependent non-dentcally dstrbuted observatons s gven by the followng expresson: f (m (t = g (t (n ;n ;:::;n m n ;n ;:::;n m S n <n <:::<n m n l n l S ;n ;:::;n m G n (tg n (t :::G nm (t [ G nl (t] m =; ;:::; and =; ;:::; (9 S = f; ;:::;g, S = Sfg, ands ;n ;n ;:::;n m = S fn ;n ;:::;n mg In (9 the summaton extends over all permutatons (n ;n ;:::;n m of ; ;:::; ;+ ;:::; whch are m n total Eq (9 can be proved startng from frst prncples for =, and subsequently applyng mathematcal nducton Alternatvely, t can be obtaned as a specal case of the analyss n [8, ] For =and m = =(9 yelds f ( (t =g (t[ G (t] [ G (t] : (0 The cdf of the random varable x (m can be obtaned by Z t F (m (t = f (m (ψdψ: ( For d nput observatons, we have f (m (t = g(tg m (t[ G m (t] m = f (m(t ( f (m (t s the pdf of the m-th order statstc x (m [] For» k<l», ; j =; ;:::;, = j and t <t the jont pdf of the random varables x (k and x (lj s gven by f (k (lj (t ;t =g (t g j(t (n ;n ;:::;n lk n ;n ;:::;n lk S ;j;q ;:::;q k n <n <:::<n lk G n m(t ] k ρ= (q ;q ;:::;q k q ;q ;:::;q k S j q <q <:::<q k G q ρ (t f S ;j;q ;:::;q k ;n ;:::;n lk lk m= [G n m (t [ G f (t ] : ( For d nput observatons ( yelds ρ f (k (lj (t ;t ( f (k(l(t ;t f t <t = f (l(t f t t ( f (k(l (t ;t s the jont pdf of the order statstcs x (k and x (l EIGEVALUES OF THE CORRELATIO MATRI OF TIME AD RAKED ORDERED SAMPLES In the subsequent analyss we assume that the nput observatons are d random varables, e, the nose-free sgnal s a constant s Under ths assumpton, usng ( and (, we obtan the followng expressons for the second-order moment of the random varable x (m and the product moments of the random varables x (k and x (lj : Efx (kg = Efx (kg ( Efx (k x (lj g = ( Efx (kx (l g ( k < l, = j and k; l = ; ;:::; Let us denote by Q = R L = Efx Lx T Lg the correlaton matrx of the ranked ordered samples Smlarly let R L` =Efx L`x T L`g defne the correlaton matrx of tme and ranked ordered samples By defnton both R L` and R L are postve sem-defnte Followng smlar arguments to [, pp 90-9], we argue that the aforementoned matrces are postve defnte f the random varables of concern are lnearly ndependent It s trval to show that the sum of the egenvalues s the same n both R L` and Q,thats = (R L` = = (Q =(ff + s (

3 (Q s the -th egenvalue of Q and ff s the nose varance Let 0 denote an matrx of zeroes By employng elementary smlarty transformatons t can be shown that R L` s smlar to a matrx havng the followng structure: G = G 0 ::: 0 0 A ::: A 0 A ::: A Q ( Q ( Q ::: Q ::: (8 ( Q ( Q ( Q ( Q ::: Q (9 and A j, ; j =;:::; are approprate matrces The egenvalues of matrx G can be obtaned analytcally, e (G = (Q: (0 Accordngly, we have found that under the d assumpton out of the egenvalues of R L` can be obtaned from the egenvalues of R L dvded by The egenvalue dstrbuton of the correlaton matrx of ranked ordered samples R L and the tme and ranked ordered samples R L` s plotted n Fgure for unform, Gaussan and Laplacan nose dstrbuton havng zero mean and unt varance, when s =and = In the followng subsecton, we demonstrate that t s also possble to derve upper and lower bounds for the smallest and the largest egenvalue of R L` Upper and lower bounds on the extreme egenvalues of the correlaton matrx of tme and ranked ordered samples The correlaton matrx of the tme and ranked ordered samples can be decomposed as R L` = dag (Q;Q;:::;Q Ω I + B ( dag( denotes the dagonal matrx whose dagonal elements are those nsde parentheses, I s the dentty matrx, Ω denotes the Kronecker product and B = Ω W The matrces and W are gven by = W = 0 Q ::: Q Q 0 ::: Q Q Q ::: 0 ( T I ( ( s the vector of ones B has egenvalues whose sum equals zero The sum of the egenvalues of both and W equals zero as well Therefore, the smallest egenvalue of matrx s negatve whle ts largest egenvalue s postve It can be shown that W has two dstnct egenvalues, e, (W = wth multplcty and (W = ( wth multplcty ( Accordngly, the egenvalues of B are as follows: ( ( ; wth multplcty, =; ;:::; ( ; =; ;:::; ( ( are the egenvalues of matrx The prevous dscusson yelds the followng expressons: mn( max(b = max ( ; max( mn(b = mn max( ( ; mn( : ( Accordngly, we need to relate the egenvalues of matrces B and to the egenvalues of the correlaton matrx of ranked ordered samples R L = Q The latter matrx can be decomposed as follows: Q = + dag (Q ;Q ;:::;Q : ( Let us defne by max and mn the maxmum and mnmum dagonal element of the correlaton matrx of the ranked ordered samples, respectvely, e: max = max (Q ;Q ;:::;Q ( mn = mn (Q ;Q ;:::;Q : (8 By applyng Theorem 8 [, p 9] we obtan ff = max(q max ff» max(» f fl» mn(» ff (9 f = max(q mn fl = mn(q max ff = mn(q mn: (0 The applcaton of the same theorem yelds also max + mn(b» max(r L`» max + max(b mn + mn(b» mn(r L`» mn + max(b ( By combnng ( and the nequaltes (9, (0 and ( we get mn(r L max(rl + max mn» max(r L`» mn(r L ( max mn» mn(r L`» max(rl : ( The numercal computatons summarzed n Table ndcate that the extreme egenvalues of R L` are equal to the extreme egenvalues of R L dvded by, a result that s wthn the ntervals predcted by the analyss descrbed above As a consequence the egenvalue spread of the correlaton matrx of tme and ranked ordered samples s the same wth that of the correlaton matrx of ranked ordered samples

4 Correlaton matrx (=,s= 0 Correlaton matrx (=,s= 0 Correlaton matrx (=,s= Egenvalues 0 0 Egenvalues 0 0 Egenvalues Tme and Tme and Tme and (a (b (c Fg Egenvalue dstrbuton of ranked ordered samples R L and the tme and ranked ordered samples R L` when s =and =for (a unform, (b Gaussan, and (c Laplacan nose dstrbuton havng zero mean and unt varance Table Smallest and largest egenvalues of R L and R L` for unform, Gaussan and Laplacan parent dstrbuton havng mean s =:0 and unt varance parent dstrbuton mn(r L mn(r L` max(r L max(r L` unform Gaussan Laplacan EIGEVALUES OF THE CORRELATIO MATRI OF RAKED ORDERED SAMPLES In the precedng analyss we have employed the correlaton matrx of the ranked ordered (nosy observatons Under the assumpton of a constant sgnal corrupted by addtve whte nose, the latter correlaton matrx can be expressed n terms of the correlaton matrx of ranked ordered nose samples, Φ =Efv Lv T Lg, as follows: R L = Φ + s μ T + μ T + s T ( μ =Efv Lg s the vector of the expected values of the order statstcs of nose samples Subsequently, we analyze the behavor of the egenvalues of R L For symmetrc nose dstrbutons T about zero, t can be shown that the matrx H = μ T + μ s smlar to []» H 0 = : ( For odd, the matrces and n ( are gven, respectvely, by: = ~μ~ T + ~ ~μ T ( = ~ ~μ T ~μ~ T ( ~μ s the vector of the expected values of v (, v (, :::, v (, ~ s the ( -dmensonal vector of ones and s the matrx that has ones along the secondary dagonal and zeros else It can be further proved that the matrx defned n ( has ( zero egenvalues and the remanng two non-zero ones are gven by ( ;(H = ;(H 0 =± p ~μ T ~μ: ( Wthout any loss of generalty, f s>0, we obtan p ;(s H =± = ±s ~μ T ~μ: (8 By applyng Theorem 8 [, pp 9] t can be shown that mn(φ + s H» mn(φ + (9 max(φ + s H» max(φ + : (0 Theorem 88 [, pp 9] asserts that there exst nonnegatve coeffcents k, k,,k such that ( (R L= ( (Φ + s H +k s ( the egenvalues are arranged n ascendng order of magntude

5 If ( (R L= (+ (Φ + s H = ( (Φ; =; ;:::; ( then t can be shown that max(r L» s + ( (Φ + max(φ ( The assumpton ( has been verfed n numercal computatons, as can be seen n Table In the computatons we have used the tables from [] The valdty of the upper bound n ( s demon- Table Egenvalues of matrces Φ, Φ+sH,andR L for Gaussan nose dstrbuton havng zero mean and unt varance, when s = :0 ( (Φ ( (Φ + sh ( (R L strated n Table for unform, Gaussan and Laplacan parent dstrbutons havng mean s =:0 and unt varance Accordngly, the smallest egenvalue of R L and consequently R L` s controlled exclusvely by the nose statstcs, that s, the smallest egenvalue of the correlaton matrx of the ordered nose samples On the contrary, the largest egenvalue of both R L and R L` s nfluenced by the dmensonalty of the observaton wndow, the true constant sgnal value, and the nose varance REFERECES [] I Ptas and A Venetsanopoulos, onlnear Dgtal Flters: Prncples and Applcatons, Kluwer Academc Publ, orwell, MA, 990 [] F Palmer and CG Boncelet, Jr, L`-fltersa new class or order statstc flters, IEEE Transactons on Acoustcs, Speech, and Sgnal Processng, vol, no, pp 90, May 989 [] PP Gandh and SA Kassam, Desgn and performance of combnaton flters for sgnal restoraton, IEEE Transactons on Sgnal Processng, vol 9, no, pp 0, July 99 Table Valdty of the upper bound n ( for unform, Gaussan and Laplacan parent dstrbutons havng when s = :0 and unt varance parent dstrbuton max(r L Upper bound unform Gaussan Laplacan [] G Arce and M Tan, Order statstc flter banks, IEEE Transactons on Image Processng, vol, no, pp 8 8, June 99 [] -T Km and GR Arce, Permutaton flter lattces: A general order statstc flterng framework, IEEE Trans on Sgnal Processng, vol, no 9, pp, September 99 [] S Zozor, E Mosan, and P Amblard, Revstng the estmaton of the mean usng order statstcs, Sgnal Processng, vol 8, pp, 998 [] C Kotropoulos and I Ptas, Adaptve order statstc flterng of stll mages and vdeo sequences, n onlnear Model- Based Image/Vdeo Processng and Analyss, C Kotropoulos and I Ptas, Eds J Wley, ew ork, 00 [8] KE Barner and GR Arce, Permutaton flters: A class of nonlnear flters based on set permutatons, IEEE Transactons on Sgnal Processng, vol, no, pp 898, Aprl 99 [9] I Ptas and S Vougoukas, LMS order statstc flter adaptaton by backpropagaton, Sgnal Processng, vol, pp 9, 99 [0] S Haykn, Adaptve Flter Theory, Prentce Hall, Englewood Clffs, J, 98 [] M Prasad and H Lee, Stack flters and selecton probabltes, IEEE Transactons on Sgnal Processng, vol, no 0, pp 8, October 99 [] HA Davd, Order Statstcs, J Wley, ew ork, 980 [] A Papouls, Probabltes, Random Varables and Stochastc Processes, McGraw-Hll, ew ork, rd edton, 99 [] G Golub and CF van Loan, Matrx Computatons, The Johns Hopkns Unversty Press, Baltmore, rd edton, 99 [] A Canton and P Butler, Egenvalues and egenvectors of symmetrc centrosymmetrc matrces, Lnear Algebra and ts Applcatons, vol, pp 8, 9 [] D Techroew, Tables of expected values of order statstcs and products of order statstcs for samples of sze twenty and less from the normal dstrbuton, Ann Math Statst, vol, pp 0, 9

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Tracking with Kalman Filter

Tracking with Kalman Filter Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16 STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus

More information

Lecture 12: Classification

Lecture 12: Classification Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

Lecture 16 Statistical Analysis in Biomaterials Research (Part II)

Lecture 16 Statistical Analysis in Biomaterials Research (Part II) 3.051J/0.340J 1 Lecture 16 Statstcal Analyss n Bomaterals Research (Part II) C. F Dstrbuton Allows comparson of varablty of behavor between populatons usng test of hypothess: σ x = σ x amed for Brtsh statstcan

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

More information

Chapter 3 Describing Data Using Numerical Measures

Chapter 3 Describing Data Using Numerical Measures Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering / Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons

More information

Estimating the Fundamental Matrix by Transforming Image Points in Projective Space 1

Estimating the Fundamental Matrix by Transforming Image Points in Projective Space 1 Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com

More information

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models Computaton of Hgher Order Moments from Two Multnomal Overdsperson Lkelhood Models BY J. T. NEWCOMER, N. K. NEERCHAL Department of Mathematcs and Statstcs, Unversty of Maryland, Baltmore County, Baltmore,

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue

More information

Feb 14: Spatial analysis of data fields

Feb 14: Spatial analysis of data fields Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s

More information

arxiv:cs.cv/ Jun 2000

arxiv:cs.cv/ Jun 2000 Correlaton over Decomposed Sgnals: A Non-Lnear Approach to Fast and Effectve Sequences Comparson Lucano da Fontoura Costa arxv:cs.cv/0006040 28 Jun 2000 Cybernetc Vson Research Group IFSC Unversty of São

More information

Probability Theory (revisited)

Probability Theory (revisited) Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted

More information

Statistical analysis using matlab. HY 439 Presented by: George Fortetsanakis

Statistical analysis using matlab. HY 439 Presented by: George Fortetsanakis Statstcal analyss usng matlab HY 439 Presented by: George Fortetsanaks Roadmap Probablty dstrbutons Statstcal estmaton Fttng data to probablty dstrbutons Contnuous dstrbutons Contnuous random varable X

More information

/ n ) are compared. The logic is: if the two

/ n ) are compared. The logic is: if the two STAT C141, Sprng 2005 Lecture 13 Two sample tests One sample tests: examples of goodness of ft tests, where we are testng whether our data supports predctons. Two sample tests: called as tests of ndependence

More information

Here is the rationale: If X and y have a strong positive relationship to one another, then ( x x) will tend to be positive when ( y y)

Here is the rationale: If X and y have a strong positive relationship to one another, then ( x x) will tend to be positive when ( y y) Secton 1.5 Correlaton In the prevous sectons, we looked at regresson and the value r was a measurement of how much of the varaton n y can be attrbuted to the lnear relatonshp between y and x. In ths secton,

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,

More information

Error Probability for M Signals

Error Probability for M Signals Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal

More information

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform

More information

Communication with AWGN Interference

Communication with AWGN Interference Communcaton wth AWG Interference m {m } {p(m } Modulator s {s } r=s+n Recever ˆm AWG n m s a dscrete random varable(rv whch takes m wth probablty p(m. Modulator maps each m nto a waveform sgnal s m=m

More information

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Research Article Green s Theorem for Sign Data

Research Article Green s Theorem for Sign Data Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of

More information

Lecture 10: May 6, 2013

Lecture 10: May 6, 2013 TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,

More information

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models

More information

Convergence of random processes

Convergence of random processes DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large

More information

Dimension Reduction and Visualization of the Histogram Data

Dimension Reduction and Visualization of the Histogram Data The 4th Workshop n Symbolc Data Analyss (SDA 214): Tutoral Dmenson Reducton and Vsualzaton of the Hstogram Data Han-Mng Wu ( 吳漢銘 ) Department of Mathematcs Tamkang Unversty Tamsu 25137, Tawan http://www.hmwu.dv.tw

More information

Chapter 11: Simple Linear Regression and Correlation

Chapter 11: Simple Linear Regression and Correlation Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

Primer on High-Order Moment Estimators

Primer on High-Order Moment Estimators Prmer on Hgh-Order Moment Estmators Ton M. Whted July 2007 The Errors-n-Varables Model We wll start wth the classcal EIV for one msmeasured regressor. The general case s n Erckson and Whted Econometrc

More information

x i1 =1 for all i (the constant ).

x i1 =1 for all i (the constant ). Chapter 5 The Multple Regresson Model Consder an economc model where the dependent varable s a functon of K explanatory varables. The economc model has the form: y = f ( x,x,..., ) xk Approxmate ths by

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models

More information

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

More information

Lecture 4: September 12

Lecture 4: September 12 36-755: Advanced Statstcal Theory Fall 016 Lecture 4: September 1 Lecturer: Alessandro Rnaldo Scrbe: Xao Hu Ta Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer: These notes have not been

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA 4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Pulse Coded Modulation

Pulse Coded Modulation Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy Compression. Compromise accuracy of reconstruction for increased compression. Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models

More information

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities Supplementary materal: Margn based PU Learnng We gve the complete proofs of Theorem and n Secton We frst ntroduce the well-known concentraton nequalty, so the covarance estmator can be bounded Then we

More information

Singular Value Decomposition: Theory and Applications

Singular Value Decomposition: Theory and Applications Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real

More information

An (almost) unbiased estimator for the S-Gini index

An (almost) unbiased estimator for the S-Gini index An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

Unified Subspace Analysis for Face Recognition

Unified Subspace Analysis for Face Recognition Unfed Subspace Analyss for Face Recognton Xaogang Wang and Xaoou Tang Department of Informaton Engneerng The Chnese Unversty of Hong Kong Shatn, Hong Kong {xgwang, xtang}@e.cuhk.edu.hk Abstract PCA, LDA

More information

UNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours

UNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours UNIVERSITY OF TORONTO Faculty of Arts and Scence December 005 Examnatons STA47HF/STA005HF Duraton - hours AIDS ALLOWED: (to be suppled by the student) Non-programmable calculator One handwrtten 8.5'' x

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A

More information

Monte Carlo Simulation and Generation of Random Numbers

Monte Carlo Simulation and Generation of Random Numbers S-7.333 Postgraduate Course n Radocommuncatons Sprng 000 Monte Carlo Smulaton and Generaton of Random umbers Dmtr Foursov Dmtr.Foursov@noka.com Contents. Introducton. Prncple of Monte Carlo Smulaton 3.

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

Identification of Linear Partial Difference Equations with Constant Coefficients

Identification of Linear Partial Difference Equations with Constant Coefficients J. Basc. Appl. Sc. Res., 3(1)6-66, 213 213, TextRoad Publcaton ISSN 29-434 Journal of Basc and Appled Scentfc Research www.textroad.com Identfcaton of Lnear Partal Dfference Equatons wth Constant Coeffcents

More information

Hidden Markov Models & The Multivariate Gaussian (10/26/04)

Hidden Markov Models & The Multivariate Gaussian (10/26/04) CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models

More information

10-701/ Machine Learning, Fall 2005 Homework 3

10-701/ Machine Learning, Fall 2005 Homework 3 10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Statistical pattern recognition

Statistical pattern recognition Statstcal pattern recognton Bayes theorem Problem: decdng f a patent has a partcular condton based on a partcular test However, the test s mperfect Someone wth the condton may go undetected (false negatve

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Experment-I MODULE VII LECTURE - 3 ANALYSIS OF COVARIANCE Dr Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Any scentfc experment s performed

More information

Statistics for Managers Using Microsoft Excel/SPSS Chapter 13 The Simple Linear Regression Model and Correlation

Statistics for Managers Using Microsoft Excel/SPSS Chapter 13 The Simple Linear Regression Model and Correlation Statstcs for Managers Usng Mcrosoft Excel/SPSS Chapter 13 The Smple Lnear Regresson Model and Correlaton 1999 Prentce-Hall, Inc. Chap. 13-1 Chapter Topcs Types of Regresson Models Determnng the Smple Lnear

More information

Multi-dimensional Central Limit Argument

Multi-dimensional Central Limit Argument Mult-dmensonal Central Lmt Argument Outlne t as Consder d random proceses t, t,. Defne the sum process t t t t () t (); t () t are d to (), t () t 0 () t tme () t () t t t As, ( t) becomes a Gaussan random

More information

Improved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays

Improved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays Avalable onlne at www.scencedrect.com Proceda Engneerng 5 ( 4456 446 Improved delay-dependent stablty crtera for dscrete-tme stochastc neural networs wth tme-varyng delays Meng-zhuo Luo a Shou-mng Zhong

More information

STATS 306B: Unsupervised Learning Spring Lecture 10 April 30

STATS 306B: Unsupervised Learning Spring Lecture 10 April 30 STATS 306B: Unsupervsed Learnng Sprng 2014 Lecture 10 Aprl 30 Lecturer: Lester Mackey Scrbe: Joey Arthur, Rakesh Achanta 10.1 Factor Analyss 10.1.1 Recap Recall the factor analyss (FA) model for lnear

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

Differentiating Gaussian Processes

Differentiating Gaussian Processes Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Appendix B. The Finite Difference Scheme

Appendix B. The Finite Difference Scheme 140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton

More information

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980 MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and

More information

Uncertainty as the Overlap of Alternate Conditional Distributions

Uncertainty as the Overlap of Alternate Conditional Distributions Uncertanty as the Overlap of Alternate Condtonal Dstrbutons Olena Babak and Clayton V. Deutsch Centre for Computatonal Geostatstcs Department of Cvl & Envronmental Engneerng Unversty of Alberta An mportant

More information

Chapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of

Chapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When

More information

OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau

OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION Chrstophe De Lug and Erc Moreau Unversty of Toulon LSEET UMR CNRS 607 av. G. Pompdou BP56 F-8362 La Valette du Var Cedex

More information

Lecture 4: Universal Hash Functions/Streaming Cont d

Lecture 4: Universal Hash Functions/Streaming Cont d CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected

More information

Lecture 3: Shannon s Theorem

Lecture 3: Shannon s Theorem CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts

More information

First Year Examination Department of Statistics, University of Florida

First Year Examination Department of Statistics, University of Florida Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER. In real environmental conditions the speech signal may be

CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER. In real environmental conditions the speech signal may be 55 CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER 4.1 Introducton In real envronmental condtons the speech sgnal may be supermposed by the envronmental nterference. In general, the spectrum

More information

Mixed Noise Suppression in Color Images by Signal-Dependent LMS L-Filters

Mixed Noise Suppression in Color Images by Signal-Dependent LMS L-Filters 46 R. HUDEC MIXED OISE SUPPRESSIO I COLOR IMAGES BY SIGAL-DEPEDET LMS L-FILTERS Mxed ose Suppresson n Color Images by Sgnal-Dependent LMS L-Flters Róbert HUDEC Dept. of Telecommuncatons Unversty of Žlna

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information