A Mathematical Comparison of Point Detectors

Size: px
Start display at page:

Download "A Mathematical Comparison of Point Detectors"

Transcription

1 Mathematcal Comarson of Pont Detectors M. Zulan, C. Kenney and B. S. Manjunath Vson Research Lab Deartment of Electrcal and Comuter Engneerng Unversty of Calforna, Santa Barbara Santa Barbara, C 9306 Emal: {zulan, kenney, manj}@ece.ucsb.edu bstract Selectng salent onts from two or more mages for comutng corresondences s a fundamental roblem n mage analyss. hree methods orgnally roosed by Harrs et al. n [], by Noble et al. n [] and by Sh et al. n [3] roved to be qute effectve and robust and have been wdely used by the comuter vson communty. he goal of ths aer s to analyze these ont detectors startng from the algebrac and numercal roertes of the mage auto-correlaton matrx. o accomlsh ths task we wll frst ntroduce a natural constrant that needs to be satsfed by any ont detector based on the auto-correlaton matrx. hen, by castng the ont detecton roblem n a mathematcal framework based on condton theory [4], we wll show that under certan hyothess the ont detectors [], [3], [4] are equvalent modulo the choce of a secfc matrx norm. he results resented n ths aer wll rovde a novel unfyng descrton for the most commonly used ont detecton algorthms. I. INRODUCION In order to establsh corresondences among a collecton of mages t s frst necessary to dentfy a set of salent onts n each mage. Pont corresondences consttute the nut for more comlex algorthms that am at regsterng mages, at reconstructng the three dmensonal structure of a scene or at montorng actvtes n a certan area, just to lst a few. One of the aradgms to comute ont corresondences that s largely used by the comuter vson communty s comosed of two stes: ntally a set of te onts s detected n each nut mage and then ths set s ftted to a model that s suosed to descrbe the transformaton between the mages. tycal examle s the estmaton of the lanar homograhy between two vews of a lanar scene. Crucal for the success of ths aroach s a hgh reeatablty rate of the ont detector see [5]). hs means that f a ont q s detected n mage I then, wth hgh robablty, the corresondng ont q wll be detected n mage I. Snce the transformaton that relates the mages s not known a ror, a ont detector should exlot only the nformaton contaned n one sngle mage. Intensty based methods acheve ths goal by assocatng to each ont q a scalar value that defnes ts goodness as a te ont. hs evaluaton s done by erformng some oeratons on the mage ntensty values n a neghborhood of the ont q. he methods roosed by Harrs and Stehens [] and the modfed verson ntroduced by Noble []), by Sh and omas [3] and by Kenney et al. [4] can all be consdered ntensty based methods. he goal of ths work s to exlore n detal what s the quanttatve relaton between these detectors, startng from the algebrac and numercal roertes of the mage autocorrelaton matrx. hs s motvated by the fact that all the detecton rules are based on the sectral structure of ths matrx. Our frst contrbuton to ths analyss s to observe that any functon based on the auto-correlaton matrx) used to detect te onts should satsfy a monotoncty constrant that arses naturally from the hyscal nterretaton of the autocorrelaton matrx. hen, after havng notced that the ratonale behnd the ont detectors roosed by Harrs, Stehens and Noble and by Sh and omas ental a noton of comutatonal stablty, we shall see how these consderatons can be restated from frst rncles usng a mathematcal framework based on condton theory. hs aroach wll shed new lght on the rules used to detect te onts, demonstratng that the revously mentoned aroaches are equvalent modulo a sutable choce of a matrx norm. he aer s structured as follows: secton II ntroduces some of the notaton that wll be used throughout the aer, secton III summarzes the condton theory framework used to relate the dfferent ont detectors, whch are resented n secton IV together wth the nondecreasng constrant. he man results of the aer are stated, roved and dscussed n secton V, whereas the fnal conclusons can be found n secton VI. II. PRELIMINRIES. Geometrc ransformatons of Images sngle channel mage I can be thought as a bounded scalar functon defned over a comact subset of R : I : D [I mn, I max ] R q Iq) We are nterested n detectng te onts n mages related by a geometrc transformaton θ : R R that deends on the arameter vector θ. hese transformatons can be groued n transformaton classes defned as: def {f : θ such that f θ } In ths aer we wll focus our attenton on two classes of transformatons: ranslaton ): θ x ) def x tx + t y for whch the arameter vector s θ [ t x t y ]

2 Rotaton and [ translaton R ]): θ x ) def cos φ sn φ x sn φ cos φ q tx ) + t y for whch the arameter vector s θ φ t x t y and q s the ont about whch the mage atch rotates. For an examle of a transformaton n the class R see Fgure. Note that we dd not consder transformatons that nvolve scale, snce scale requres a secfc treatment. hs s because the ont detecton methods we wll be consderng are ntensty based methods. hs means that they rocess the mage ntenstes n a neghborhood centered about the ont of nterest and therefore such neghborhood should transform covarantly wth the mages. s an examle consder two mages related only by a change of scale: the neghborhood of corresondent onts wll contan the same mage orton only f t scales covarantly wth the mages. he only set of transformatons where the structure of the neghborhood s reserved s the class of rotatons and translaton the shae of a crcle whch s translated and rotated does not change). dscusson about automatc methods to retreve corresondent neghborhoods n mages related by transformaton that do not reserve crcular neghborhoods can be found n [6] and [7]. B. he uto-correlaton Matrx he smoothed verson of the mage I s gven by: Lq, σ, I) G σ I) q) where G σ s a Gaussan functon wth standard devaton σ. he gradent ndcated usng the symbol x ) of L s used to comute the auto-correlaton matrx assocated to mage I: µq, σ I, σ D, I) wσi x L, σ D, I) x L, σ D, I) ) q) w σi q x) x Lx, σ D, I) x Lx, σ D, I)dx ) R where w σ s a weghtng functon whose sze s deendent on the arameter σ I. We shall refer to σ I as the ntegraton scale t s the arameter that defnes sze of the wndow about the ont q ), and to σ D as the dfferentaton scale. he dscretzed verson of equaton ) s: µq, σ I, σ D, I) x w σi q x ) x Lx, σ D, I) x Lx, σ D, I) ) he vectors x are the onts that form the dscretzed suort set of the weghtng functon w σi. Exresson ) can be rewrtten comactly n matrx form as: µq, σ I, σ D, I) W 3) Fg.. he fgure shows the mang between the mage ar I and Î. he shaded crcle reresents the neghborhood of the ont q and the black dots nsde the shaded crcle n the left mage reresent the onts n the neghborhood of q that are used to construct the matrx see equaton 3)). where the matrx R N s formed by stackng the gradents x Lx, σ D, I) one on to of the other and W s a dagonal weghtng matrx such that W w σi q x ). he matrx q, σ D, I) deends both on the ont q and on the dfferentaton scale σ D. Smlarly the matrx W W σ I ) deends on the ntegraton scale σ I. However, to smlfy the notaton we wll henceforth avod to wrte exlctly such deendences. he auto-correlaton matrx rovdes an mortant nformaton about the mage neghborhood for whch the wndow functon s non zero. Each egenvalue µ measures the mage gradent strength along the drectons of the egenvectors of µ. he larger the gradent strength the stronger the corner-lke structure s. C. Matrx Norms In ths secton we wll ntroduce the notaton and the basc concets about matrx norms that are used n ths aer. For a more thorough dscusson of these tocs lease refer to [8], [9]. Let s frst ntroduce the vector -norm: x def x ) Vector -norms lead to the defnton of the nduced matrx -norm: def x su 4) x 0 x It can be shown that σ max ), where σ max ) s the maxmum sngular value of the matrx. he Schatten matrx -norm s defned as: Often tmes w σi s chosen to be a Gaussan functon, whose suort s the entre lane. In ths case the rght hand sde of equaton ) becomes an nfnte summaton. However, to deal wth fnte dmensonal matrces, we can consder the suort of w σi to be the comact set { x R : x Σ x c }, where c s some sutable constant. Dscretzng the revous set we obtan a fnte summaton. S, def σ ) ) where σ ) s the th sngular value of the matrx. 5)

3 III. CONDIION HEORY FOR POIN MCHING In ths secton we wll ntroduce the fundamental facts about condton theory for ont matchng. more thorough dscusson of ths theory can be found n [4]. he basc dea s to dentfy whch onts n an mage can be used to estmate robustly the arameters that defne a certan transformaton. Suose I and I are two mages related by the transformaton θ so that I θ q )) I q ), and let s defne the transformed mage lus nose as: Îq ) def I θ q )) + ηq ) Let s also ntroduce the error cost functon: J θ q ) def [ ] w σ q x ) I θ x )) Îx ) dx R 6) In the nose free case.e. η 0) the mnmzer for 6) s gven by θ whereas n resence of nose such mnmzer s moved to θ + θ. We would lke to quantfy the effect of the nose on the estmaton of the transformaton arameter θ. o acheve ths goal we defne a number that relates θ to η n the lmt for the nose tendng to zero. Defnton : he transformaton condton number CN) at ont q wth resect to the transformaton θ s defned as: K θ q ) def lm su δ 0 η δ θ η where η takes nto consderaton the nose over the suort of the wndow functon w σ. he nterretaton of exresson 7) s the followng: a large condton number means that small erturbatons n the lumnance of the mage can greatly affect the value of the mnmzer of 6). herefore t s reasonable to seek a set of te onts for whch the CN has a small value. Unfortunately for an arbtrary transformaton the CN deends on the arameters of the transformaton tself, so t s of lttle use f we want to assess the sutablty of certan ont to estmate θ by usng just one sngle mage: n fact at ths tme θ s unknown. hs consderaton leads us to a further defnton. Defnton : he class condton number CCN) at ont q wth resect to the class of transformatons s defned as: K q ) def max K θ q ) 8) θ In ths case the condton number s ndeendent from the transformaton arameters. he followng theorems rovde a mean to calculate the condton numbers. For the roofs see the aendces I and II. heorem : he CCN at ont q for the class of translatons s aroxmated by: K q ) W ) W 9) where the matrces and W are defned as n 3). 7) heorem : For W I, usng the nduced matrx -norm n 9), the CCN satsfy the followng nequalty: K q ) K R q ) Moreover, the scalar ) s a lower bound for K q ) and K R q ) for any weghtng matrx W. heorem rovdes a closed form exresson for the CCN wth resect to the class of translaton transforms. heorem states that f a ont s badly condtoned wth resect to the class of transformatons t wll also be bad condtoned wth resect to the class of transformatons R. hs result agrees wth the ntuton: f we have to estmate more arameters usng the same amount of data, then the nose wll have a stronger nfluence on the estmate, roducng a larger varaton θ. he lower bound ntroduced n heorem rovdes a comutatonally effcent method to dscard onts that are bad condtoned: ts calculaton requres the comutaton of a matrx roduct and the soluton of a second order equaton to detect the mnmum egenvalue. IV. POIN DEECORS ont detector s an algorthm that takes one mage as nut and then oututs a set of te onts that can be dentfed wth hgh reeatablty n mages that are related by a transformaton θ. Such an algorthm s comletely defned as long as we secfy the rule for detectng the te onts. In ths secton we wll brefly descrbe the Harrs-Stehens corner detector rule [] wth a artcular emhass on the modfcaton roosed by Noble []), the Sh-omas ont detector rule [3] and fnally the ont detector rule roosed by Kenney et al. n [4]. In all these works the detecton rule s strongly connected to the sectral structure of the autocorrelaton matrx µ. In general a ont q s consdered to be a te-ont as long as: M λ µq, σ I, σ D, I))) 0) where M s a functon of the egenvalues of the autocorrelaton matrx whch are ndcated usng the notaton λ )) and s some sutable threshold. s dscussed at the end of secton II, the strength of cornerlke mage structures s reflected n the magntude of the egenvalues of µ. herefore t s natural to requre M to be a non decreasng functon of the egenvalues of µ n other words the stronger s a corner-lke structure the stronger must be the resonse of the functon 0). We wll refer to ths condton as the nondecreasng constrant on M: Constrant : ny functon M used to measure the strength of a corner-lke mage structure based on the autocorrelaton matrx must be a non-decreasng functon of the egenvalues of. In other words, for any λ λ, λ λ : Mλ, λ ) Mλ, λ ) )

4 . Harrs-Stehens and Noble Corner Detector Harrs and Stehens s corner detector draws ts orgns n the corner detector roosed by Moravec [0], where the authors consder to be good corners those onts for whch the dfference between ther neghborhood and shfted verson of the same neghborhood roduces an error surface wth a well defned mnmum. hs dea encasulates the noton of comutatonal stablty that s the core of the condton theory resented n [4] and summarzed n secton III. Harrs and Stehens roosed the followng functon to measure the corner strength: M H q, σ I, σ D, I) det W ) α trace W )) ) he larger the value of α the less senstve s the detector to corner lke structures. he major drawback of ths corner detector s the resence of a arameter α that needs to be manually tuned. o overcome ths dffculty Noble [] roosed a modfed verson of the Harrs functon that does not contan any constant: M N q, σ I, σ D, I) det W ) trace 3) W ) + ε he small constant ε s used to avod a sngular denomnator n case of a rank zero auto-correlaton matrx. B. Sh-omas Pont Detector In [3] Sh and omas roosed a crteron to decde whch onts are sutable for trackng see also []). her dea s to select onts for whch the system that rovdes an estmate of the dslacement from one frame to the other s numercally well condtoned. lso n ths case we fnd a connecton wth the core deas of the condton theory summarzed n secton III. he Sh and omas functon s defned as: M S q, σ I, σ D, I) λ mn W ) 4) where λ mn W ) ndcates the smallest egenvalue of the auto-correlaton matrx. C. Kenney et al. Pont Detector s dscussed n secton III, heorem ) and heorem ) suggest the followng rule to detect te onts: select those onts that have a small condton number wth resect to the class. he detecton rule can be formalzed by defnng the Kenney s functon: M K, q, σ I, σ D, I) W ) W where ndcates whch matrx norm has been used. V. RELION BEWEEN POIN DEECORS. Equvalence of Pont Detectors s onted out n secton IV, both the Harrs-Stehens detector and consequently the Nobel detector) and the Sh- omas detector somehow encasulate a noton of comutatonal stablty. hs fact suggests that the functons 3) and 4) should reflect n some way ths noton. o suort ths observaton we wll rove a theorem that establshes a relaton between the ont detectors descrbed before, showng that the Noble functon, the Sh-omas functon and the Kenney functon are equvalent modulo the choce of a sutable matrx norm. heorem 3: For ε 0 and W I: M N M K, Schatten 5) M S M K, 6) Proof: Suose the sectrum of the matrx W s gven by λ λ 0. We wll frst show the equvalence relaton between the Harrs-Stehens-Nobel functon and Kenney s one when the -Schatten norm s used. Consder the matrx M ). Frst we wll rove that: σ M) σ ) ) 7) hs results follows drectly from the SVD decomoston of the matrces M and ) : ) V Σ U UΣV ) V Σ V M ) V Σ V V Σ U V [ Σ 0 ] U where Σ s the dagonal matrx contanng the sngular values of ). From the defnton of the Schatten norm 5) t follows that: ) S, σ M) ] σ ) ) ] σ M) ] M S, Gven that for a symmetrc matrx the sngular values concde wth the egenvalues we have that: M K, Schatten ) S, M S, because of 7)) λ + λ λ λ λ + λ for ε 0) M N whch roves the frst art of the theorem, snce the Nobel functon 3) can be rewrtten as: M N λ λ λ + λ + ε

5 Now let s consder the equvalence between the Sh and omas functon and Kenney s one. Snce the -norm of a matrx concdes wth the largest sngular value, usng the dentty 7) we can wrte: M ) herefore the followng equalty holds: M K, M ) λ M S 8) whch roves also the second equvalence. B. he Nondecreasng Constrant he nondecreasng constrant ) ntroduced at the end of Secton IV says that the detecton functon should be nondecreasng n λ and λ. he followng lemma shows that M N and M S satsfy such constrant, whereas for the Harrs- Stehens functon M H the constrant holds true only when α 4 ths fact rovdes a justfcaton of the common habt of settng α 0.04). Lemma : he functons M N, M S and consequently M K, Schatten and M K, ) all satsfy the nondecreasng constrant ). he functon M H satsfes ) rovded that α 4. Proof: he constrant ) s satsfed as long as the artal dervatves of the functon M are non negatve: M λ 0 M λ 0 For the Nobel functon we have that the artal dervatves are gven by: M N λ jλ j + ε) λ λ + λ j + ε) whch shows that they are always nonnegatve. Now assume that λ λ 0. For the Sh-omas functon we have that: { M N for λ λ λ 0 for λ λ herefore also n ths case the artal dervatves are always non negatve. From heorem 3 t follows that Kenney s ont detector satsfes the nondecreasng constrant when W I and ether the -norm or the Schatten -norm are used. Fnally let s consder the Harrs-Stehens functon for whch: M H λ λ j αλ + λ j ) he artal dervatves are non negatve f and only f: α λ λ + λ ) λ Snce λ +λ ) 4 for any λ λ 0, we conclude that M H wll satsfy ) f and only f α 4. VI. CONCLUSION In ths aer we reformulated the ont detecton rules roosed by Harrs, Stehens and Nobel, by Sh and omas and by Kenney usng a common framework based on condton theory ntroduced n [4] and summarzed n secton III. We restrcted our attenton to rotaton and translaton snce more comlex transformaton would requre an automatc rocedure to detect neghborhoods that vary covarantly wth the transformaton [7]. he central result s stated n heorem 3, where we showed that the ont detectors revously lsted are equvalent modulo a sutable choce of a matrx norm, as long as the weghtng functon s constant over ts suort). hs results tells that the Harrs, Stehens and Nobel corner detector and the feature detector roosed by Sh and omas both select onts that are sutable to estmate robustly the arameters of a translaton between an mage ar. We also ntroduced a constrant that should be satsfed by all the functons M used to detect te onts based on the auto-correlaton matrx. We showed that all the detectors studed n ths aer satsfy the revous constrant automatcally, wth the relevant exceton of the Harrs Stehens corner detector, for whch t s necessary to force α to be less than 4. Future research drectons am at consderng a more flexble defnton of condton numbers, n order to be able to coe wth a larger varety of transformatons ossbly wthout havng to solve exlctly the roblem of the detecton of a covarant neghborhood. We would also lke to study n more detal whch s the role of the weghtng functon w σ, n order to resent an extenson of these results that holds also n the case where W I. cknowledgments. hs roject was suorted n art by the followng grants from the Offce of Naval Research: ONR #N Zulan and Manjunath) and ONR #N Kenney). PPENDIX I PROOF OF HEOREM. Proof: Our goal s to exress the arameter vector θ that mnmzes the cost 6) n terms of the nose η. Suose η 0: then the mnmzer θ wll move to θ + θ. necessary condton for otmalty s that θ J θ + θ q ) 0,.e. : [ ] w σ q x ) I θ + θ x )) Îx ) R x I θ + θ x ))J θ θ + θ x )dx 0 9) where x I θ + θ x )) s the mage gradent comuted at the ont θ + θ x ) and J θ θ x ) s the Jacoban of the transformaton θ. he aylor truncated exanson of the last three factors n 9) s gven by: I θ + θ x )) Îx ) x I θ + θ x )) x I θ x ))J θ θ x ) θ ηx ) x I θ x )) + θ J θ θ x )H x I θ x ))

6 where H x I θ x )) s the mage Hessan. s far as the Jacoban s concerned we have that n the ure translaton case: J θ θ + θ x ) J θ θ x ) I 0) whereas n the case of rotaton and translaton: J θ θ + θ x ) J θ θ x ) + M θ [ Rφ + π ) q I ] + [ Rφ) q 0 ] θ he matrx Rα) s the matrx n SO) that roduces a rotaton of an angle α and q x q. By drong the second order terms.e. the terms contanng the roducts θ θ and θ ηx )), we obtan the new equaton: R w σ q x ) [ x I θ x ))J θ θ x ) θ ηx )] x I θ x ))J θ θ x ) 0 ) Let s now consder the dscretzed verson of equaton ): x w σ q x ) [ x L θ x ), σ D, I)J θ θ x ) θ ηx )] x L θ x ), σ D, I)J θ θ x ) 0 ) σ )vx )ηx ) 3) where the contnuous dervatves are relaced by convolutons wth the dervatves of a gaussan kernel wth standard devaton σ D. By settng v x ) L θ x ), σ D, I)J θ θ x ), ) can be wrtten as: ] x w q x vx )w σ q x )v x ) θ x By defnng W as n 3) and: 3) can be wrtten as: η [ ηx )... ηx n) ] θ q )W θ q ) θ θ q )W η 4) he exresson for the CN s obtaned by solvng n a least square sense the normal equaton 4). For a ure translaton does not deend on θ because J θ θ x ) I) and therefore: K q ) K θ q ) W ) W rovdes also an exresson for the CCN for translaton. he matrx s the same as n 3). For the rotaton and translaton case the Jacoban J θ θ x ) unfortunately deends on θ and therefore only an exresson for the CN can be rovded: K θ q ) θ q )W θ q ) ) θ q )W PPENDIX II PROOF OF HEOREM. We frst show the followng lemmas. Lemma : Let be defned as n 3) and let w R N. def Let s also defne the matrx J [ w ]. hen the followng nequalty holds: J J ) J ) 5) Proof: s shown n the roof of heorem 3, f 5) holds, then such nequalty can be rewrtten as: or equvalently as: J J ) ) λ mn J J ) λmn ) 6) herefore the lemma wll be roved f we are able to rove 6). For our uroses t s more convenent to consder the transose of the matrces J J and ; n artcular we have that: λ J J ) λ J J ) {0,, 0} {λ }{{} 3, λ, λ, 0,, 0} }{{} N 3 N 3 where λ 3 λ λ 0 and analogously: λ ) λ ) {0,, 0} {λ }{{}, λ, 0,, 0} }{{} N N where λ λ 0. If we rewrte the matrx J J as ww + we can exlot the nterlacng roerty of the egenvalues see n artcular heorem n [9]) accordng to whch λ [0, λ ]. herefore we can conclude that: λ mn J J ) λ λ λ mn ) whch roves the lemma. Lemma 3: For any matrces and W wth comatble dmensons the followng nequalty holds true: W ) W ) 7) Proof: s showed n more detal n the roof of heorem 3, the SVD decomoston of the matrx s: Σ U V 0 and the SVD decomoston of M ) s: M V [ Σ 0 ] U Because the matrx -norm s nvarant wth resect to orthogonal rotatons we have: M [ Σ 0 ] Σ. Introducng the matrx: m m U W U m m

7 comatbly dmensoned wth U, t s ossble to show that : W ) W V [ Σ Σ m m ] U and consequently: W ) W [ Σ Σ m m t ths ont the lemma s roved, snce: [ Σ Σ m m ] [ Σ 0 ] ] [] W. Förstner and E. Gülch, fast oerator for detecton and recse locaton of dstnct onts, corners and center of crcular features, n Proc. of ISPRS Intercommsson Conference on Fast Processng of Photogrammetrc Data, Interlaken, Swtzerland, June , Usng these results we can now rove heorem. Proof: In the roof of heorem we showed that for rotaton and translaton the rows of the matrx θ q ) can be wrtten as v x ) L θ x ), σ D, I)J θ θ x ), where the Jacoban J θ θ x ) has the form [ u I ]. herefore we can wrte: θ q ) [ w ] If we rename θ q ) wth J then we can aly Lemma, showng drectly that the CN for rotaton and translaton s always greater or equal than the CCN for translaton rovded W I). Snce Lemma holds for any vector w, then the result can be extended to the CCN for rotaton and translaton, yeldng the desred nequalty: K q ) K R q ) he roof of the last art of the theorem s a straghtforward alcaton of Lemma 3. REFERENCES [] C. Harrs and M. Stehens, combned corner and edge detector, n Proc. of the 4th LVEY vson conference, M. M. Matthews, Ed., Unversty of Manchester, England, Setemeber 988, []. Noble, Descrtons of mage surfaces, Ph.D. dssertaton, Deartment of Engneerng Scence, Oxford Unversty, 989. [3] J. Sh and C. omas, Good features to track, n Proc. of IEEE Conference on Comuter Vson and Pattern Recognton CVPR 94), Seattle, Washngton, June 994, [4] C. Kenney, B. Manjunath, M. Zulan, G. Hewer, and. Van Nevel, condton number for ont matchng wth alcaton to regstraton and ost-regstraton error estmaton, IEEE ransactons on Pattern nalyss and Machne Intellgence, vol. 5, no., , November 003. [5] C. Schmd, R. Mohr, and C. Bauckhage, Comarng and evaluatng nterest onts, n Proc. of IEEE 6th Internatonal Conference on Comuter Vson, Bombay, Inda, January 998, [Onlne]. valable: htt:// [6]. Lndeberg, Scale-Sace heory n Comuter Vson. Dordrecht, Netherlands: Kluwer cademc, 994. [7] K. Mkolajczyk and C. Schmd, n affne nvarant nterest ont detector, n Euroean Conference on Comuter Vson. Coenhagen, Denmark: Srnger, 00, [Onlne]. valable: htt:// [8] G. H. Golub and C. F. Van Loan, Matrx Comutatons. he John Hokns Unversty Press, 996. [9] C. D. Meyer, Matrx nalyss and led Lnear lgebra. SIM, 00. [0] H. Moravec, Obstacle avodance and navgaton n the real world by a seeng robot rover, Carnege-Mellon Unversty, Robotcs Insttute, ech. Re. CMU-RI-R-3, Setember 980. We assume m to be nvertble: f t s not a smle lmtng argument gves the same result.

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

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

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

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up Not-for-Publcaton Aendx to Otmal Asymtotc Least Aquares Estmaton n a Sngular Set-u Antono Dez de los Ros Bank of Canada dezbankofcanada.ca December 214 A Proof of Proostons A.1 Proof of Prooston 1 Ts roof

More information

Supplementary Material for Spectral Clustering based on the graph p-laplacian

Supplementary Material for Spectral Clustering based on the graph p-laplacian Sulementary Materal for Sectral Clusterng based on the grah -Lalacan Thomas Bühler and Matthas Hen Saarland Unversty, Saarbrücken, Germany {tb,hen}@csun-sbde May 009 Corrected verson, June 00 Abstract

More information

Non-Ideality Through Fugacity and Activity

Non-Ideality Through Fugacity and Activity Non-Idealty Through Fugacty and Actvty S. Patel Deartment of Chemstry and Bochemstry, Unversty of Delaware, Newark, Delaware 19716, USA Corresondng author. E-mal: saatel@udel.edu 1 I. FUGACITY In ths dscusson,

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

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

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

Algorithms for factoring

Algorithms for factoring CSA E0 235: Crytograhy Arl 9,2015 Instructor: Arta Patra Algorthms for factorng Submtted by: Jay Oza, Nranjan Sngh Introducton Factorsaton of large ntegers has been a wdely studed toc manly because of

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 II LECTURE - GENERAL LINEAR HYPOTHESIS AND ANALYSIS OF VARIANCE Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 3.

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

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1 Problem Set 4 Suggested Solutons Problem (A) The market demand functon s the soluton to the followng utlty-maxmzaton roblem (UMP): The Lagrangean: ( x, x, x ) = + max U x, x, x x x x st.. x + x + x y x,

More information

LECTURE 5: FIBRATIONS AND HOMOTOPY FIBERS

LECTURE 5: FIBRATIONS AND HOMOTOPY FIBERS LECTURE 5: FIBRATIONS AND HOMOTOPY FIBERS In ts lecture we wll ntroduce two mortant classes of mas of saces, namely te Hurewcz fbratons and te more general Serre fbratons, wc are bot obtaned by mosng certan

More information

Confidence intervals for weighted polynomial calibrations

Confidence intervals for weighted polynomial calibrations Confdence ntervals for weghted olynomal calbratons Sergey Maltsev, Amersand Ltd., Moscow, Russa; ur Kalambet, Amersand Internatonal, Inc., Beachwood, OH e-mal: kalambet@amersand-ntl.com htt://www.chromandsec.com

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

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

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

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

Fuzzy approach to solve multi-objective capacitated transportation problem

Fuzzy approach to solve multi-objective capacitated transportation problem Internatonal Journal of Bonformatcs Research, ISSN: 0975 087, Volume, Issue, 00, -0-4 Fuzzy aroach to solve mult-objectve caactated transortaton roblem Lohgaonkar M. H. and Bajaj V. H.* * Deartment of

More information

Digital PI Controller Equations

Digital PI Controller Equations Ver. 4, 9 th March 7 Dgtal PI Controller Equatons Probably the most common tye of controller n ndustral ower electroncs s the PI (Proortonal - Integral) controller. In feld orented motor control, PI controllers

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

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

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q For orthogonal curvlnear coordnates, eˆ grad a a= ( aˆ ˆ e). h q (98) Expandng the dervatve, we have, eˆ aˆ ˆ e a= ˆ ˆ a h e + q q 1 aˆ ˆ ˆ a e = ee ˆˆ ˆ + e. h q h q Now expandng eˆ / q (some of the detals

More information

On the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1

On the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1 Journal of Mathematcal Analyss and Alcatons 260, 15 2001 do:10.1006jmaa.2000.7389, avalable onlne at htt:.dealbrary.com on On the Connectedness of the Soluton Set for the Weak Vector Varatonal Inequalty

More information

Machine Learning. Classification. Theory of Classification and Nonparametric Classifier. Representing data: Hypothesis (classifier) Eric Xing

Machine Learning. Classification. Theory of Classification and Nonparametric Classifier. Representing data: Hypothesis (classifier) Eric Xing Machne Learnng 0-70/5 70/5-78, 78, Fall 008 Theory of Classfcaton and Nonarametrc Classfer Erc ng Lecture, Setember 0, 008 Readng: Cha.,5 CB and handouts Classfcaton Reresentng data: M K Hyothess classfer

More information

6. Hamilton s Equations

6. Hamilton s Equations 6. Hamlton s Equatons Mchael Fowler A Dynamcal System s Path n Confguraton Sace and n State Sace The story so far: For a mechancal system wth n degrees of freedom, the satal confguraton at some nstant

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs hyscs 151 Lecture Canoncal Transformatons (Chater 9) What We Dd Last Tme Drect Condtons Q j Q j = = j, Q, j, Q, Necessary and suffcent j j for Canoncal Transf. = = j Q, Q, j Q, Q, Infntesmal CT

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

Inexact Newton Methods for Inverse Eigenvalue Problems

Inexact Newton Methods for Inverse Eigenvalue Problems Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.

More information

CS4495/6495 Introduction to Computer Vision. 3C-L3 Calibrating cameras

CS4495/6495 Introduction to Computer Vision. 3C-L3 Calibrating cameras CS4495/6495 Introducton to Computer Vson 3C-L3 Calbratng cameras Fnally (last tme): Camera parameters Projecton equaton the cumulatve effect of all parameters: M (3x4) f s x ' 1 0 0 0 c R 0 I T 3 3 3 x1

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

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

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

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also

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

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

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

KNOTS AND THEIR CURVATURES

KNOTS AND THEIR CURVATURES KNOTS AND THEIR CURVATURES LIVIU I. NICOLAESCU ABSTRACT. I dscuss an old result of John Mlnor statng roughly that f a closed curve n sace s not too curved then t cannot be knotted. CONTENTS. The total

More information

Module 3: Element Properties Lecture 1: Natural Coordinates

Module 3: Element Properties Lecture 1: Natural Coordinates Module 3: Element Propertes Lecture : Natural Coordnates Natural coordnate system s bascally a local coordnate system whch allows the specfcaton of a pont wthn the element by a set of dmensonless numbers

More information

2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period

2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period -Adc Comlexty of a Seuence Obtaned from a Perodc Bnary Seuence by Ether Insertng or Deletng Symbols wthn One Perod ZHAO Lu, WEN Qao-yan (State Key Laboratory of Networng and Swtchng echnology, Bejng Unversty

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

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

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

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

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 151 Lecture 22 Canoncal Transformatons (Chater 9) What We Dd Last Tme Drect Condtons Q j Q j = = j P, Q, P j, P Q, P Necessary and suffcent P j P j for Canoncal Transf. = = j Q, Q, P j

More information

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,

More information

Managing Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration

Managing Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada

More information

Math1110 (Spring 2009) Prelim 3 - Solutions

Math1110 (Spring 2009) Prelim 3 - Solutions Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.

More information

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

Georgia Tech PHYS 6124 Mathematical Methods of Physics I Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends

More information

PARTIAL QUOTIENTS AND DISTRIBUTION OF SEQUENCES. Department of Mathematics University of California Riverside, CA

PARTIAL QUOTIENTS AND DISTRIBUTION OF SEQUENCES. Department of Mathematics University of California Riverside, CA PARTIAL QUOTIETS AD DISTRIBUTIO OF SEQUECES 1 Me-Chu Chang Deartment of Mathematcs Unversty of Calforna Rversde, CA 92521 mcc@math.ucr.edu Abstract. In ths aer we establsh average bounds on the artal quotents

More information

Structure from Motion. Forsyth&Ponce: Chap. 12 and 13 Szeliski: Chap. 7

Structure from Motion. Forsyth&Ponce: Chap. 12 and 13 Szeliski: Chap. 7 Structure from Moton Forsyth&once: Chap. 2 and 3 Szelsk: Chap. 7 Introducton to Structure from Moton Forsyth&once: Chap. 2 Szelsk: Chap. 7 Structure from Moton Intro he Reconstructon roblem p 3?? p p 2

More information

Solutions for Tutorial 1

Solutions for Tutorial 1 Toc 1: Sem-drect roducts Solutons for Tutoral 1 1. Show that the tetrahedral grou s somorhc to the sem-drect roduct of the Klen four grou and a cyclc grou of order three: T = K 4 (Z/3Z). 2. Show further

More information

Indeterminate pin-jointed frames (trusses)

Indeterminate pin-jointed frames (trusses) Indetermnate pn-jonted frames (trusses) Calculaton of member forces usng force method I. Statcal determnacy. The degree of freedom of any truss can be derved as: w= k d a =, where k s the number of all

More information

1 Convex Optimization

1 Convex Optimization Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,

More information

CS 468 Lecture 16: Isometry Invariance and Spectral Techniques

CS 468 Lecture 16: Isometry Invariance and Spectral Techniques CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k) ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

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

Naïve Bayes Classifier

Naïve Bayes Classifier 9/8/07 MIST.6060 Busness Intellgence and Data Mnng Naïve Bayes Classfer Termnology Predctors: the attrbutes (varables) whose values are used for redcton and classfcaton. Predctors are also called nut varables,

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

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

EP523 Introduction to QFT I

EP523 Introduction to QFT I EP523 Introducton to QFT I Toc 0 INTRODUCTION TO COURSE Deartment of Engneerng Physcs Unversty of Gazante Setember 2011 Sayfa 1 Content Introducton Revew of SR, QM, RQM and EMT Lagrangan Feld Theory An

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

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

Problem 10.1: One-loop structure of QED

Problem 10.1: One-loop structure of QED Problem 10.1: One-loo structure of QED In Secton 10.1 we argued form general rncles that the hoton one-ont and three-ont functons vansh, whle the four-ont functon s fnte. (a Verfy drectly that the one-loo

More information

SMARANDACHE-GALOIS FIELDS

SMARANDACHE-GALOIS FIELDS SMARANDACHE-GALOIS FIELDS W. B. Vasantha Kandasamy Deartment of Mathematcs Indan Insttute of Technology, Madras Chenna - 600 036, Inda. E-mal: vasantak@md3.vsnl.net.n Abstract: In ths aer we study the

More information

NECESSARY AND SUFFICIENT CONDITIONS FOR ALMOST REGULARITY OF UNIFORM BIRKHOFF INTERPOLATION SCHEMES. by Nicolae Crainic

NECESSARY AND SUFFICIENT CONDITIONS FOR ALMOST REGULARITY OF UNIFORM BIRKHOFF INTERPOLATION SCHEMES. by Nicolae Crainic NECESSARY AND SUFFICIENT CONDITIONS FOR ALMOST REGULARITY OF UNIFORM BIRKHOFF INTERPOLATION SCHEMES by Ncolae Cranc Abstract: In ths artcle usng a combnaton of the necessary and suffcent condtons for the

More information

A total variation approach

A total variation approach Denosng n dgtal radograhy: A total varaton aroach I. Froso M. Lucchese. A. Borghese htt://as-lab.ds.unm.t / 46 I. Froso, M. Lucchese,. A. Borghese Images are corruted by nose ) When measurement of some

More information

Exam, Solutions

Exam, Solutions Exam, 06-07 Solutons Note that many of the answers are more detaled than s requred for full cre Queston he robenus norm he robenus norm of a matrx M, M whch s an overall measure of the sze of the matrx,

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

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

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

THE SUMMATION NOTATION Ʃ

THE SUMMATION NOTATION Ʃ Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

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

Hidden Markov Model Cheat Sheet

Hidden Markov Model Cheat Sheet Hdden Markov Model Cheat Sheet (GIT ID: dc2f391536d67ed5847290d5250d4baae103487e) Ths document s a cheat sheet on Hdden Markov Models (HMMs). It resembles lecture notes, excet that t cuts to the chase

More information

Comparing two Quantiles: the Burr Type X and Weibull Cases

Comparing two Quantiles: the Burr Type X and Weibull Cases IOSR Journal of Mathematcs (IOSR-JM) e-issn: 78-578, -ISSN: 39-765X. Volume, Issue 5 Ver. VII (Se. - Oct.06), PP 8-40 www.osrjournals.org Comarng two Quantles: the Burr Tye X and Webull Cases Mohammed

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

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

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

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

Explicit constructions of all separable two-qubits density matrices and related problems for three-qubits systems

Explicit constructions of all separable two-qubits density matrices and related problems for three-qubits systems Explct constructons of all separable two-qubts densty matrces and related problems for three-qubts systems Y. en-ryeh and. Mann Physcs Department, Technon-Israel Insttute of Technology, Hafa 2000, Israel

More information

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014) 0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes

More information

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse

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

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

More information

9 Characteristic classes

9 Characteristic classes THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL FORMS BRIAN OSSERMAN DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne

More information

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information