THE PRACTICE OF AUTOMATIC SATELLITE IMAGE REGISTRATION

Size: px
Start display at page:

Download "THE PRACTICE OF AUTOMATIC SATELLITE IMAGE REGISTRATION"

Transcription

1 THE PRACTICE OF AUTOMATIC SATELLITE IMAGE REGISTRATION Yao Janchao and Cha Ten Chern Sgnal Processng Laboratory, DSO Natonal Laboratores Scence Park Drve, Sngapore 1183 Tel: 65) Fax : 65) {yjancha,ctenche}@dso.org.sg KEY WORDS: Iage Regstraton, Intensty Matchng, Projectve Model, Levenberg-Maruardt Algorth, Robust Estaton ABSTRACT: In ths paper, a new algorth for satellte age regstraton was developed. The an characterstc of the algorth s to algn two ages autoatcally, wthout requrng ether control ponts or sensor s paraeters. Two knds of odels, charactersng the age varablty between ages, were utlsed. One s projectve odel, accountng for geoetrcal varaton. The other s the polynoal llunaton change odel, accountng for the varaton n llunaton at dfferent te. These two odel paraeters can be sultaneously estated va the ntensty atchng, usng the Levenberg-Marquardt nsaton fraework ncorporated wth ult-resoluton and ultple odel strategy. The algorth has been verfed by an ntensve experent on a great nuber of real ages, taken by satellte, dgtal and frae caera. The Experental result deonstrates the robustness, effcency and accuracy of the algorth. 1. INTRODUCTION Satellte Iage regstraton s a crucal underlyng process for applcaton such as osackng, change detecton, cloud reoval and dgtal elevaton odel reconstructon. Coercal software, such as ErDas, utlses control ponts or sensors nforaton to pleent age regstraton. However, nforaton on the control ponts or sensors nforaton ay not be readly avalable or accurate enough, the regstraton based on such nforaton s therefore lted and ay even be naccurate. Another dsadvantage of usng control ponts for age regstraton s that too uch anual work s nvolved. It s ndeed a tedous work for user to nput so any correspondences on both of the ages va an nteractve way. Therefore, the functonalty of autoatc satellte age regstraton s uch requred. Although the autoatc regstraton technques have been well developed for the applcaton of vdeo osack Gregory D al 1998, LG Brown 199, P.Anandan 1988, R.Szelsk al. 1997), a challenge was faced when these technques are appled for regstraton of aeral photograph or satellte age, due to the followng reasons. In the frst place, snce the satellte ages to be algned are usually taken at dfferent te or even dfferent da and dfferent locaton, the brghtness constancy assupton, whch underles the coon ntensty atchng approach, s volated. Therefore, we have to take the llunaton change nto account for successful regstraton of two satellte ages contanng llunaton varatons. Although the generalsed brghtness odel to account for unfor photoetrc varaton.e. αi+β, where α and β are the llunaton ultplcaton and bas factors) was wdely used n vdeo/age processng, ths odel cannot however account for spatally varyng change of llunaton exstng n satellte age par. Secondly, because satellte ages are taken at dfferent te, there ay be soe envronent change durng the nterval. For nstance, the cloud ay be present when the frst age was captured, and t ay have dsappeared when the second age was taken. In such a case, the algorth should have certan knd of echans to detect autoatcally whch pxel s an outler correspondng to cloud), and whch pxel s an nler, n order to do a successful regstraton. To overcoe these probles, a generalsed dynac age odel s used n the paper, whch assues the llunaton ultplcaton and bas factor to be functons of locaton. We assue that these two llunaton factors are slowly varyng functons of locaton, thus they can be well approxated by low-order polynoals of poston varables. The satellte age regstraton s then forulated as an energy nsaton proble to estate the projectve transforaton paraeters accountng for the age varablty caused by poston change of caera, as well as llunaton polynoal coeffcent accountng for varaton n llunaton at dfferent te. The fraework and new algorth for estatng such a set of paraeters were developed. In order to ncrease the speed of estaton, the ult-resoluton and ult-odel schee was pleented. In addton, the robust estaton fraework was ntegrated n the algorth so that the erroneous easureent or the easureents not consstent wth ajort s treated as outlers and ther nfluence on estaton s reduced. In ths way, the algorth has the capablty of dealng wth partal occluson and ultple oton. The experental results deonstrated that the algorth s of robustness, effcency and accuracy.

2 . THE FORMULATION OF IMAGE REGISTRATION The conventonal age regstraton algorths, n partcular age ntensty atchng approach, are based on the brghtness constancy assupton gven as follows: g x, y ) = f x, 1) Where f and g are the age ntensty functons at te t 1 and t respectvely. Soe prevous work utlsed a generalsed brghtness odel to account for unfor photoetrc varaton,.e., g x, y ) = α f x, + β ) Note that the constants α and β are the llunaton ultplcaton and the bas factors respectvely. However, ths odel cannot account for spatally varyng llunaton varatons. To overcoe ths restrcton, a generalsed dynac age odel s proposed S. Negahdarpour, 1998) by assung the llunaton ultplcaton and bas factor α and β) to be functons of locaton x,. In ths paper, we assue these two llunaton factors are slowly varyng functons of locaton, thus they can be well approxated by low-order polynoal of poston varables x, as follows. g x, y ) = α x, f x, + β x, 3) Where α x, and β x, are the low-order polynoal functons wth the coeffcents represented by = 1 p 1 = 1 p 1 α α, α, α ) and β β, β, β ) respectvely. In our pleentaton, for splcty, we eployed a blnear odel for the llunaton ultplcaton functon and a constant functon for the llunaton α = bas. In ths sple case, α, α, ) and β ). It can be readly extended to a ore coplcated 1 α β = case. The coeffcents of these two polynoal functons can be deterned sultaneously wth the geoetrc transforaton paraeters. The geoetrc transforaton n the age atchng for planar objects can be strctly represented by a projectve transforaton. For projectve transforaton, The poston relatonshp between a par of correspondng ponts can be wrtten as: o x + 1 y + = x + y x ; y = 4) 6 7 x + y + x + y Where = {, 1, h7} s the paraeter vector for a projectve odel. The error functon between two fraes after projectve transforaton wll be represented as: g x, y ) x, y ) f x, y ) β x, y ) α 5) The algnent of two ages s to fnd such optal paraeters,α, that nse a weghted su of errors,.e., E = w x y g x, y ) α x, y ) f x, y ) β, )) 6) It should be notced that w s the weght assocated wth the data constrant coputed at the locaton x, y ). The weghtng allows us to ncorporate robust estaton nto our nsaton fraework, whch s accoplshed by dynacally adjustng the weght for each constrant approprately based on ts resdue. Snce equaton 6) s a nonlnear nsaton proble, we have to use the teratve non-lnear nsaton algorth, say Levenberg- Marquardt algorth, to obtan the optal values of,α, β β. As we know, n order to ake the algorth to converge to global nu, the ntal estate of,α, should be close to the soluton. In our approach, the ntal paraeters s obtaned by pseudo sulated annealng approach ncorporated wth ultresoluton and ultple odel strategy, t s then refned va Levenberg-Marquardt algorth based on ntensty-based atch. 3. THE DESCRIPTION OF THE ALGORITHM 3.1 Robust estaton Va Dynac Weghtng β

3 Snce ages ay contan partal occluson, ultple oton and perturbaton nose, robust estaton technque was used n the paper. In the robust estaton approach, the quadratc functon of resdue used n least-squares estaton s replaced by a ρ-functon, whch assgns sall weghts for the constrant wth larger resdues. There are a few eber of ρ-functons used n age processng, we used Lorentzon functon n the paper, whch s gven as follows: ρ x x, σ ) = log1 ) σ LO + where x s the resdue of data constrant and σ s the scale paraeter. When usng the ρ-functon for odel fttng, the nfluence for each data constrant to the soluton s charactersed by an nfluence functon, whch s the dervatve of the ρ-functon. If we take the dervatves of the above functon, we can obtan the nfluence functon as follow x ψ x, σ ) = σ + x The nfluence functon decrease as the agntude of the resdue ncreases. For the least-square estaton, the nfluence functon s lnearly ncreasng as the agntude of the resdue ncreases. Therefore the least-square estaton s ore senstve to outlers than the robust estaton. To use robust estaton n our nsaton fraework, we can sply replace the quadratc functon n 6) by above ρ-functon, Ths yelds the followng new objectve functon E, α, β ) = w ρ r, σ ) = w g x y x y f x y x y LO ρ LO, ) α, ), ) β, ), σ ) 7) 3. Optsaton Algorth Once the ntal estate of both projectve and llunaton odel paraeter were gven, we can solve the nsaton proble of 7) by usng Levenberg-Marquardt algorth. The algorth requres coputaton of the partal dervatves of r defned n 7) wth respect to projectve odel paraeters {, 1, 7} and α = llunaton paraeters α, α, ) and β ). These are straghtforward to copute. For exaple, r r α 1 α β = x g r y g g =,, = ; x + y D x 7 D x y r r = f x, y ), = x f x, y ), = 1 α β Where x + y 1 1 g g D = and, ) x y s the age ntensty gradent of g at x, ). Fro these partal dervatves, we constructed the followng teratve procedure based on the Levenberg-Marquardt algorth: = α β 1. Intalse odel paraeter c,, ) based on ntal value estaton procedure dscussed later. The ntal σ was selected to be large enough so that the robust estaton s very uch lke the least-squares estators at begnnng. Set the teraton ndex k=;. Copute the resdues r and the assocated gradent vector gad 3. Copute the weght τ assocated wth each data constrant by r = c based on equaton 8). τ = w ρ r ) r 4. For the weghted Hessan atrx and the weghted gradent vector H gad gad, b = r gad τ. y = τ 8) T

4 5. Update the oton paraeter estate c by an aount stablsaton paraeter. 6. Update the scale paraeter σ = / 7. Set τ r τ c k + 1 = c k + c and k=k+1; f = c, stop ; else go back to step 1 c = H + λ I) b, where λ s a te-varyng The advantage of usng Levenberg-Marquardt over straghtforward gradent descent s that t converges n less teraton. 3.3 Intal value estaton In order to provde the algorth wth good stablty and lockng capabltes, a coarse-to-fne strategy s eployed n whch we construct a pyrad of spatally fltered and sub-sapled ages. In our pleentaton, fve-level of pyrad representaton of age was constructed. At the coarse level, we used translaton only odel; at second, thrd and fourth level, we used affne odel; and at orgnal resoluton of age, we used projectve odel. As n the fgure 1. Orgnal Iage 1 Projectve odel Regstraton Orgnal Iage 1st level lower resoluton Iage 1 nd level lower resoluton Iage o 1 3rd level lower resoluton Iage 1 Lowest resoluton Iage 1 o 5, 1,, 3, 4, Affne Model Regstraton 5, 1,, 3, 4, Affne Model Regstraton, 1,, 3, 4, 5) Affne Model Regstraton 5, ) Translaton Model regstraton Guaasan flter ) ) 1st level lower resoluton Iage nd level lower resoluton Iage 3rd level lower resoluton Iage Lowest resoluton Iage Fgure 1. Mult-resoluton and ultple odel strategy for age regstraton In the coarsest level, n order to estate the translaton ters and 5 correctly, we used pseudo sulated annealng approach. The paraeter space of and 5 was dvded nto non-overlappng subspace. The paraeter space of translaton s lted by age sze of that level, snce t s possble to fnd a translaton that s larger than age sze. In each subspace, the central pont of the subspace s taken as ntal value and runnng Gauss- Newton algorth sultaneously, the optal translaton paraeter s then obtaned va search for the nu energy aong converged ponts of all the subspace. The next level n the pyrad s then processed. The ntal estates at ths level are 1,,,,1, 5 ). These paraeter s further refned va LM algorth decrbed before. The output of ths level for the optal affne paraeters s {, 1,, 3, 4, 5}. There s the sae procedure for the thrd and fourth level. Fnally, the ffth level n the pyrad s processed at orgnal resoluton of age). The ntal estated at ths level s {, 1,, 3, 4,5,,}. These values s agan refned va LM algorth at ths level to output the fnal result of projectve odel paraeters. That s what we requred. 4. EXPERIMENTAL RESULT Fgure shows an exaple of algnent of two ages taken by aeral dgtal caera. The ages were taken under dfferent llunaton condton. In addton, geoetrc varaton between two ages s qute large. The orgnal denson of the age s 154x11. For such knd of ages, t s qute dffcult to algn the accurately by usng conventonal ultple odel and ult-resoluton algorth, snce ntal paraeter values of a odel are

5 far away fro zero. By usng our algorth, the regstraton result s shown n fgure c). The ultple odel paraeter value estated at dfferent resoluton s shown n table 1. Although these two ages contan large varaton n geoetry and llunaton, the algorth algns the precsely. Fgure 3 shows an exaple of algnent of two SPOT satellte ages. These two ages coe fro Pal Sprngs, Calforna. They are both SPOT panchroatc ages wth 1-eter resoluton. Autoatc regstraton of these two ages nvolves two cascaded steps. In the frst step, we got the projectve paraeter algnng frst pcture wth second one. The result s { }. Due to too uch age varablty between the, the transfored age or warped age) s not well algned wth second age. Therefore, n the second step, we conducted algnent between the warped age and second one agan. The estated paraeters s { }. Cobnng these two sets of projectve odel paraeters together, we obtan the ore accurate projectve odel paraeters that brngs the frst age to be algned wth second one precsely. The result s shown n fgure 3. c). 5. CONCLUSION In the paper, a new algorth for satellte age regstraton was developed. The algorth has the followng characterstcs. 1). The regstraton process s totally autoatc, wthout requrng ether control ponts or sensors paraeters. ). The robust estaton echans was ncorporated nto the algorth, thus allowng partal occluson and ultple oton; 3) Illunaton odel based on low-order polynoal functons used n our approach enhances the robustness of the algorth aganst llunaton changes. The Experental result deonstrates the robustness, effcency and accuracy of the algorth. REFERENC Gregory D. Hager, Peter N.Belhueur, Effcent Regon Trackng wth Paraetrc Models of Geoetry and Illunaton. IEEE trans. PAMI, vol., No. 1, pp L.G Brown, 199. A survey of age regstraton technques. ACM Coputng Surveys, Vol. 4, No. 4, pp M.J.Black and A.D. Jepson, 1998, EgenTrackng: Robust Matchng and Trackng of Artculated Objects Usng A Vew-based Representaton. Int. J. Coputer Vson, Vol 6, No. 1, pp P.Anandan, 1988., A coputatonal fraework and an algorth for the easureent of vsual oton. Int. J. Coputer Vson, Vol., No. 3, pp R. Szelsk and J. Coughlan, Splne-based age regstraton. Int. J Coputer Vson, Vol., No.3, pp S. Negahdarpour, Rovsed defnton of optcal flow : ntegraton of radoetrc and geoetrc cues for dynac scene analyss.. IEEE Tran. Patt. Anal. Mach. Intel. Vol., No. 9, pp 961~979 Table 1. Model paraeter estaton at dfferent level of pyrad Orgnal Resoluton st level lower Res nd level lower Res rd level lower Res Lowest Resoluton a) b)

6 c) Fgure. a)b) The orgnal ages, c) The algnent of frst age wth second one a) b) c) Fgure 3. a)b) Two SPOT satellte ages; c) The algnent of frst age wth second one

Lecture 3. Camera Models 2 & Camera Calibration. Professor Silvio Savarese Computational Vision and Geometry Lab. 13- Jan- 15.

Lecture 3. Camera Models 2 & Camera Calibration. Professor Silvio Savarese Computational Vision and Geometry Lab. 13- Jan- 15. Lecture Caera Models Caera Calbraton rofessor Slvo Savarese Coputatonal Vson and Geoetry Lab Slvo Savarese Lecture - - Jan- 5 Lecture Caera Models Caera Calbraton Recap of caera odels Caera calbraton proble

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng

More information

BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup

BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng

More information

Applied Mathematics Letters

Applied Mathematics Letters Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć

More information

Excess Error, Approximation Error, and Estimation Error

Excess Error, Approximation Error, and Estimation Error E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple

More information

System in Weibull Distribution

System in Weibull Distribution Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co

More information

Denote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form

Denote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon

More information

XII.3 The EM (Expectation-Maximization) Algorithm

XII.3 The EM (Expectation-Maximization) Algorithm XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles

More information

LECTURE :FACTOR ANALYSIS

LECTURE :FACTOR ANALYSIS LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If

More information

ITERATIVE ESTIMATION PROCEDURE FOR GEOSTATISTICAL REGRESSION AND GEOSTATISTICAL KRIGING

ITERATIVE ESTIMATION PROCEDURE FOR GEOSTATISTICAL REGRESSION AND GEOSTATISTICAL KRIGING ESE 5 ITERATIVE ESTIMATION PROCEDURE FOR GEOSTATISTICAL REGRESSION AND GEOSTATISTICAL KRIGING Gven a geostatstcal regresson odel: k Y () s x () s () s x () s () s, s R wth () unknown () E[ ( s)], s R ()

More information

What is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.

What is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner. (C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that

More information

Geometric Camera Calibration

Geometric Camera Calibration Geoetrc Caera Calbraton EECS 598-8 Fall 24! Foundatons of Coputer Vson!! Instructor: Jason Corso (jjcorso)! web.eecs.uch.edu/~jjcorso/t/598f4!! Readngs: F.; SZ 6. (FL 4.6; extra notes)! Date: 9/7/4!! Materals

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

Multipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18

Multipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18 Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So

More information

Elastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy.

Elastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy. Elastc Collsons Defnton: to pont asses on hch no external forces act collde thout losng any energy v Prerequstes: θ θ collsons n one denson conservaton of oentu and energy occurs frequently n everyday

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

AN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU

AN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng

More information

Collaborative Filtering Recommendation Algorithm

Collaborative Filtering Recommendation Algorithm Vol.141 (GST 2016), pp.199-203 http://dx.do.org/10.14257/astl.2016.141.43 Collaboratve Flterng Recoendaton Algorth Dong Lang Qongta Teachers College, Haou 570100, Chna, 18689851015@163.co Abstract. Ths

More information

1.3 Hence, calculate a formula for the force required to break the bond (i.e. the maximum value of F)

1.3 Hence, calculate a formula for the force required to break the bond (i.e. the maximum value of F) EN40: Dynacs and Vbratons Hoework 4: Work, Energy and Lnear Moentu Due Frday March 6 th School of Engneerng Brown Unversty 1. The Rydberg potental s a sple odel of atoc nteractons. It specfes the potental

More information

1 Definition of Rademacher Complexity

1 Definition of Rademacher Complexity COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the

More information

Gradient Descent Learning and Backpropagation

Gradient Descent Learning and Backpropagation Artfcal Neural Networks (art 2) Chrstan Jacob Gradent Descent Learnng and Backpropagaton CSC 533 Wnter 200 Learnng by Gradent Descent Defnton of the Learnng roble Let us start wth the sple case of lnear

More information

COS 511: Theoretical Machine Learning

COS 511: Theoretical Machine Learning COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that

More information

On Pfaff s solution of the Pfaff problem

On Pfaff s solution of the Pfaff problem Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of

More information

Microrelief measurements for white-light interferometer with adaptive algorithm interferogram processing

Microrelief measurements for white-light interferometer with adaptive algorithm interferogram processing Mcrorelef easureents for whte-lght nterferoeter wth adaptve algorth nterferogra processng Evgeny V Sysoev, Rodon V Kulkov Technologcal Desgn nsttute of Scentfc nstruent Engneerng (TD SE Sberan Branch of

More information

Description of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t

Description of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t Indeternate Analyss Force Method The force (flexblty) ethod expresses the relatonshps between dsplaceents and forces that exst n a structure. Prary objectve of the force ethod s to deterne the chosen set

More information

On the number of regions in an m-dimensional space cut by n hyperplanes

On the number of regions in an m-dimensional space cut by n hyperplanes 6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general

More information

Three Algorithms for Flexible Flow-shop Scheduling

Three Algorithms for Flexible Flow-shop Scheduling Aercan Journal of Appled Scences 4 (): 887-895 2007 ISSN 546-9239 2007 Scence Publcatons Three Algorths for Flexble Flow-shop Schedulng Tzung-Pe Hong, 2 Pe-Yng Huang, 3 Gwoboa Horng and 3 Chan-Lon Wang

More information

The Parity of the Number of Irreducible Factors for Some Pentanomials

The Parity of the Number of Irreducible Factors for Some Pentanomials The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,

More information

CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION

CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala

More information

,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = "J j. k i.

,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = J j. k i. Suppleentary Materal Dervaton of Eq. 1a. Assue j s a functon of the rate constants for the N coponent reactons: j j (k 1,,..., k,..., k N ( The dervatve wth respect to teperature T s calculated by usng

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

halftoning Journal of Electronic Imaging, vol. 11, no. 4, Oct Je-Ho Lee and Jan P. Allebach

halftoning Journal of Electronic Imaging, vol. 11, no. 4, Oct Je-Ho Lee and Jan P. Allebach olorant-based drect bnary search» halftonng Journal of Electronc Iagng, vol., no. 4, Oct. 22 Je-Ho Lee and Jan P. Allebach School of Electrcal Engneerng & oputer Scence Kyungpook Natonal Unversty Abstract

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

IV. Performance Optimization

IV. Performance Optimization IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton

More information

Chapter 12 Lyes KADEM [Thermodynamics II] 2007

Chapter 12 Lyes KADEM [Thermodynamics II] 2007 Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be

More information

1. Statement of the problem

1. Statement of the problem Volue 14, 010 15 ON THE ITERATIVE SOUTION OF A SYSTEM OF DISCRETE TIMOSHENKO EQUATIONS Peradze J. and Tsklaur Z. I. Javakhshvl Tbls State Uversty,, Uversty St., Tbls 0186, Georga Georgan Techcal Uversty,

More information

Solutions for Homework #9

Solutions for Homework #9 Solutons for Hoewor #9 PROBEM. (P. 3 on page 379 n the note) Consder a sprng ounted rgd bar of total ass and length, to whch an addtonal ass s luped at the rghtost end. he syste has no dapng. Fnd the natural

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Our focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.

Our focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e. SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal

More information

Integral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions

Integral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions Int J Open Probles Copt Math, Vol 7, No 4, Deceber 214 ISSN 1998-6262; Copyrght ICSS Publcaton, 214 www-csrsorg Integral Transfors and Dual Integral Equatons to Solve Heat Equaton wth Mxed Condtons Naser

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

Trifocal Tensor for Heterogeneous Cameras

Trifocal Tensor for Heterogeneous Cameras Trfocal Tensor for Heterogeneous Caeras SrRa Thrthala tvn@cs.unc.edu Marc Pollefeys arc@cs.unc.edu Abstract We study the ult-vew geoetry arsng out of a setup consstng of a pn-hole caera and two D radal

More information

Determination of the Confidence Level of PSD Estimation with Given D.O.F. Based on WELCH Algorithm

Determination of the Confidence Level of PSD Estimation with Given D.O.F. Based on WELCH Algorithm Internatonal Conference on Inforaton Technology and Manageent Innovaton (ICITMI 05) Deternaton of the Confdence Level of PSD Estaton wth Gven D.O.F. Based on WELCH Algorth Xue-wang Zhu, *, S-jan Zhang

More information

Estimating the Odometry Error of a Mobile Robot during Navigation

Estimating the Odometry Error of a Mobile Robot during Navigation Estatng the Odoetry Error of a Moble Robot durng Navgaton Agostno Martnell and Roland Segwart Autonoous Systes Lab Swss Federal Insttute of Technology Lausanne (EPFL) CH-5 Lausanne, Swtzerland e-al: agostno.artnell,

More information

A Sub-Pixel Image Registration Technique with Applications to Defect Detection

A Sub-Pixel Image Registration Technique with Applications to Defect Detection Internatonal Journal of Electrcal and Electroncs Engneerng 3:3 009 A Sub-Pxel Iage Regstraton Technque wth Applcatons to Defect Detecton Zhen-Hu Hu, Jyh-Shong Ju, and Mng-Hwe Perng Abstract Ths paper presents

More information

Xiangwen Li. March 8th and March 13th, 2001

Xiangwen Li. March 8th and March 13th, 2001 CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

CHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS

CHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS CHAPER 7 CONSRAINED OPIMIZAION : HE KARUSH-KUHN-UCKER CONDIIONS 7. Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based unconstraned

More information

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

Introducing Entropy Distributions

Introducing Entropy Distributions Graubner, Schdt & Proske: Proceedngs of the 6 th Internatonal Probablstc Workshop, Darstadt 8 Introducng Entropy Dstrbutons Noel van Erp & Peter van Gelder Structural Hydraulc Engneerng and Probablstc

More information

Centroid Uncertainty Bounds for Interval Type-2 Fuzzy Sets: Forward and Inverse Problems

Centroid Uncertainty Bounds for Interval Type-2 Fuzzy Sets: Forward and Inverse Problems Centrod Uncertanty Bounds for Interval Type-2 Fuzzy Sets: Forward and Inverse Probles Jerry M. Mendel and Hongwe Wu Sgnal and Iage Processng Insttute Departent of Electrcal Engneerng Unversty of Southern

More information

By M. O'Neill,* I. G. Sinclairf and Francis J. Smith

By M. O'Neill,* I. G. Sinclairf and Francis J. Smith 52 Polynoal curve fttng when abscssas and ordnates are both subject to error By M. O'Nell,* I. G. Snclarf and Francs J. Sth Departents of Coputer Scence and Appled Matheatcs, School of Physcs and Appled

More information

Slobodan Lakić. Communicated by R. Van Keer

Slobodan Lakić. Communicated by R. Van Keer Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and

More information

Several generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c

Several generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,

More information

y new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion)

y new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion) Feature Selecton: Lnear ransforatons new = M x old Constrant Optzaton (nserton) 3 Proble: Gven an objectve functon f(x) to be optzed and let constrants be gven b h k (x)=c k, ovng constants to the left,

More information

Open Systems: Chemical Potential and Partial Molar Quantities Chemical Potential

Open Systems: Chemical Potential and Partial Molar Quantities Chemical Potential Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,

More information

Digital Signal Processing

Digital Signal Processing Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over

More information

Revision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax

Revision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax .9.1: AC power analyss Reson: Deceber 13, 010 15 E Man Sute D Pullan, WA 99163 (509 334 6306 Voce and Fax Oerew n chapter.9.0, we ntroduced soe basc quanttes relate to delery of power usng snusodal sgnals.

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Small-Sample Equating With Prior Information

Small-Sample Equating With Prior Information Research Report Sall-Saple Equatng Wth Pror Inforaton Sauel A Lvngston Charles Lews June 009 ETS RR-09-5 Lstenng Learnng Leadng Sall-Saple Equatng Wth Pror Inforaton Sauel A Lvngston and Charles Lews ETS,

More information

Quantum Particle Motion in Physical Space

Quantum Particle Motion in Physical Space Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal

More information

total If no external forces act, the total linear momentum of the system is conserved. This occurs in collisions and explosions.

total If no external forces act, the total linear momentum of the system is conserved. This occurs in collisions and explosions. Lesson 0: Collsons, Rotatonal netc Energy, Torque, Center o Graty (Sectons 7.8 Last te we used ewton s second law to deelop the pulse-oentu theore. In words, the theore states that the change n lnear oentu

More information

ENVIRONMENT OBSERVATION BY STRUCTURE FROM MOTION WITH AN OMNI-DIRECTIONAL CAMERA. Tomoaki Harada, Atsushi Yamashita and Toru Kaneko

ENVIRONMENT OBSERVATION BY STRUCTURE FROM MOTION WITH AN OMNI-DIRECTIONAL CAMERA. Tomoaki Harada, Atsushi Yamashita and Toru Kaneko ENVIRONMEN OBSERVAION BY SRUCURE FROM MOION WIH AN OMNI-DIRECIONAL CAMERA ooak Harada, Atsush Yaashta and oru Kaneko Departent of Mechancal Engneerng, Shzuoka Unversty, 3-5- Johoku, Haaatsu-sh, Shzuoka,

More information

PHYS 1443 Section 002 Lecture #20

PHYS 1443 Section 002 Lecture #20 PHYS 1443 Secton 002 Lecture #20 Dr. Jae Condtons for Equlbru & Mechancal Equlbru How to Solve Equlbru Probles? A ew Exaples of Mechancal Equlbru Elastc Propertes of Solds Densty and Specfc Gravty lud

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

Topic 4. Orthogonal contrasts [ST&D p. 183]

Topic 4. Orthogonal contrasts [ST&D p. 183] 4.1 Topc 4. Orthogonal contrasts [ST&D p. 183] ANOVA s a useful and powerful tool to copare several treatent eans. In coparng t treatents, the null hypothess tested s that the t true eans are all equal

More information

Perceptual Organization (IV)

Perceptual Organization (IV) Perceptual Organzaton IV Introducton to Coputatonal and Bologcal Vson CS 0--56 Coputer Scence Departent BGU Ohad Ben-Shahar Segentaton Segentaton as parttonng Gven: I - a set of age pxels H a regon hoogenety

More information

PROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE

PROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE V. Nollau Insttute of Matheatcal Stochastcs, Techncal Unversty of Dresden, Gerany Keywords: Analyss of varance, least squares ethod, odels wth fxed effects,

More information

CHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS

CHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based

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

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

1 Derivation of Point-to-Plane Minimization

1 Derivation of Point-to-Plane Minimization 1 Dervaton of Pont-to-Plane Mnmzaton Consder the Chen-Medon (pont-to-plane) framework for ICP. Assume we have a collecton of ponts (p, q ) wth normals n. We want to determne the optmal rotaton and translaton

More information

ASYMMETRIC TRAFFIC ASSIGNMENT WITH FLOW RESPONSIVE SIGNAL CONTROL IN AN URBAN NETWORK

ASYMMETRIC TRAFFIC ASSIGNMENT WITH FLOW RESPONSIVE SIGNAL CONTROL IN AN URBAN NETWORK AYMMETRIC TRAFFIC AIGNMENT WITH FLOW REPONIVE IGNAL CONTROL IN AN URBAN NETWORK Ken'etsu UCHIDA *, e'ch KAGAYA **, Tohru HAGIWARA *** Dept. of Engneerng - Hoado Unversty * E-al: uchda@eng.houda.ac.p **

More information

Computational and Statistical Learning theory Assignment 4

Computational and Statistical Learning theory Assignment 4 Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}

More information

A DIMENSIONALITY REDUCTION ALGORITHM OF HYPER SPECTRAL IMAGE BASED ON FRACT ANALYSIS

A DIMENSIONALITY REDUCTION ALGORITHM OF HYPER SPECTRAL IMAGE BASED ON FRACT ANALYSIS A DIMENSIONALITY REDUCTION ALGORITHM O HYPER SPECTRAL IMAGE BASED ON RACT ANALYSIS SU Junyng a, *, Shu Nng a a School of Reote Sensng and Inforaton Engneerng, Wuhan Unversty, Luoyu Road 9#, Wuhan, Hube,

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

An Accurate Measure for Multilayer Perceptron Tolerance to Weight Deviations

An Accurate Measure for Multilayer Perceptron Tolerance to Weight Deviations Neural Processng Letters 10: 121 130, 1999. 1999 Kluwer Acadec Publshers. Prnted n the Netherlands. 121 An Accurate Measure for Multlayer Perceptron Tolerance to Weght Devatons JOSE L. BERNIER, J. ORTEGA,

More information

Tutorial 2. COMP4134 Biometrics Authentication. February 9, Jun Xu, Teaching Asistant

Tutorial 2. COMP4134 Biometrics Authentication. February 9, Jun Xu, Teaching Asistant Tutoral 2 COMP434 ometrcs uthentcaton Jun Xu, Teachng sstant csjunxu@comp.polyu.edu.hk February 9, 207 Table of Contents Problems Problem : nswer the questons Problem 2: Power law functon Problem 3: Convoluton

More information

ADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING

ADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING 1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N

More information

Rectilinear motion. Lecture 2: Kinematics of Particles. External motion is known, find force. External forces are known, find motion

Rectilinear motion. Lecture 2: Kinematics of Particles. External motion is known, find force. External forces are known, find motion Lecture : Kneatcs of Partcles Rectlnear oton Straght-Lne oton [.1] Analtcal solutons for poston/veloct [.1] Solvng equatons of oton Analtcal solutons (1 D revew) [.1] Nuercal solutons [.1] Nuercal ntegraton

More information

Handling Overload (G. Buttazzo, Hard Real-Time Systems, Ch. 9) Causes for Overload

Handling Overload (G. Buttazzo, Hard Real-Time Systems, Ch. 9) Causes for Overload PS-663: Real-Te Systes Handlng Overloads Handlng Overload (G Buttazzo, Hard Real-Te Systes, h 9) auses for Overload Bad syste desgn eg poor estaton of worst-case executon tes Sultaneous arrval of unexpected

More information

Designing Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate

Designing Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate

More information

Simulation of Fluid Flow Inside a Back-ward-facing Step by MRT- LBM

Simulation of Fluid Flow Inside a Back-ward-facing Step by MRT- LBM 2012 Internatonal Conference on Flud Dynacs and Therodynacs Technologes (FDTT 2012) IPCSIT vol.33(2012) (2012) IACSIT Press, Sngapore Sulaton of Flud Flow Insde a Back-ward-facng Step by MRT- LBM Mohaad

More information

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

More information

Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum

Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum Recall that there was ore to oton than just spee A ore coplete escrpton of oton s the concept of lnear oentu: p v (8.) Beng a prouct of a scalar () an a vector (v), oentu s a vector: p v p y v y p z v

More information

COMP th April, 2007 Clement Pang

COMP th April, 2007 Clement Pang COMP 540 12 th Aprl, 2007 Cleent Pang Boostng Cobnng weak classers Fts an Addtve Model Is essentally Forward Stagewse Addtve Modelng wth Exponental Loss Loss Functons Classcaton: Msclasscaton, Exponental,

More information

An Optimal Bound for Sum of Square Roots of Special Type of Integers

An Optimal Bound for Sum of Square Roots of Special Type of Integers The Sxth Internatonal Syposu on Operatons Research and Its Applcatons ISORA 06 Xnang, Chna, August 8 12, 2006 Copyrght 2006 ORSC & APORC pp. 206 211 An Optal Bound for Su of Square Roots of Specal Type

More information

Markov Chain Monte-Carlo (MCMC)

Markov Chain Monte-Carlo (MCMC) Markov Chan Monte-Carlo (MCMC) What for s t and what does t look lke? A. Favorov, 2003-2017 favorov@sens.org favorov@gal.co Monte Carlo ethod: a fgure square The value s unknown. Let s saple a rando value

More information

Temperature. Chapter Heat Engine

Temperature. Chapter Heat Engine Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the

More information

On the Eigenspectrum of the Gram Matrix and the Generalisation Error of Kernel PCA (Shawe-Taylor, et al. 2005) Ameet Talwalkar 02/13/07

On the Eigenspectrum of the Gram Matrix and the Generalisation Error of Kernel PCA (Shawe-Taylor, et al. 2005) Ameet Talwalkar 02/13/07 On the Egenspectru of the Gra Matr and the Generalsaton Error of Kernel PCA Shawe-aylor, et al. 005 Aeet alwalar 0/3/07 Outlne Bacground Motvaton PCA, MDS Isoap Kernel PCA Generalsaton Error of Kernel

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

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

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede. ) with a symmetric Pcovariance matrix of the y( x ) measurements V

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede. ) with a symmetric Pcovariance matrix of the y( x ) measurements V Fall Analyss o Experental Measureents B Esensten/rev S Errede General Least Squares wth General Constrants: Suppose we have easureents y( x ( y( x, y( x,, y( x wth a syetrc covarance atrx o the y( x easureents

More information

Support Vector Machines. Vibhav Gogate The University of Texas at dallas

Support Vector Machines. Vibhav Gogate The University of Texas at dallas Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest

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

Special Relativity and Riemannian Geometry. Department of Mathematical Sciences

Special Relativity and Riemannian Geometry. Department of Mathematical Sciences Tutoral Letter 06//018 Specal Relatvty and Reannan Geoetry APM3713 Seester Departent of Matheatcal Scences IMPORTANT INFORMATION: Ths tutoral letter contans the solutons to Assgnent 06. BAR CODE Learn

More information

[ ] T Journal of Software. Vol.13, No /2002/13(05)

[ ] T Journal of Software. Vol.13, No /2002/13(05) -985//(5)957-9 Journal of Software Vol, No5, (, 8) E-al: xqeng@csuclaedu; huz@nlpraaccn http://wwwaaccn/nlpr/ : ( ),,,,,,, : ; ; : P9 : A [,],,,Zhang [] ( ), ( ),, (hoograph), Zhang, (DVS) Zhang,,,, (

More information

6.3.4 Modified Euler s method of integration

6.3.4 Modified Euler s method of integration 6.3.4 Modfed Euler s method of ntegraton Before dscussng the applcaton of Euler s method for solvng the swng equatons, let us frst revew the basc Euler s method of numercal ntegraton. Let the general from

More information