Image Morphing Based on Morphological Interpolation Combined with Linear Filtering
|
|
- Job Hardy
- 6 years ago
- Views:
Transcription
1 Image Morphng Based on Morphologcal Inerpolaon Combned wh Lnear Flerng Marcn Iwanowsk Insue of Conrol and Indusral Elecroncs Warsaw Unversy of Technology ul.koszykowa Warszawa POLAND el e-mal: ABSTRACT Ths paper descrbes a novel approach o color mage morphng whch s based on he combnaon of morphologcal mage processng ools and lnear flerng. In he proposed mehod he morphng engne s provded by he morphologcal nerpolaon by means of he morphologcal medan. By he successve generaon of morphologcal medans usng an algorhm proposed n he paper, he sequence ransformng one npu mage no anoher one s produced. The algorhm makes use of he smlary measure beween wo successve frames. Two versons of he algorhm are proposed - n he frs one he requred parameer s he number of frames of he fnal sequence, n he second one he maxmal accepable error beween wo consecuve frames. Three lnear ools are proposed o mprove he vsual qualy of he morphng sequence: he emporal lnear flerng, he spaal lnear flerng and he auxlary cross-dssolvng. Conrary o he radonal approaches o mage morphng, he proposed mehod doesn requre any conrol pons. The human operaor s oblged o nroduce only a few npu parameers. Two examples showng he resuls are also presened n he paper. Keywords: Image morphng, color mage processng, mahemacal morphology, morphologcal nerpolaon. INTRODUCTION Alhough varous mage processng conceps are n common use n he compuer graphcs [Gomes97], an applcaon of mahemacal morphology [Serra83,88] o hs doman s a recen fled of research. I has proved s usefulness n varous areas of mage processng: mage flerng, segmenaon, granulomery, ec. One of he mos popular felds of s applcaons s mage nerpolaon a process of auomaed creaon of a sequence ransformng one gven mage (he nal mage) no he second (fnal) one. Ths knd of operaon s presen n compuer graphcs under he name of morphng. The applcaon of mahemacal morphology no mage nerpolaon s a recen feld of exploraon [Iwano]. The resuls of he very frs research works have been publshed n 996 and 998 [Beuch98, Meyer96, Serra98]. They concerned he nerpolaon of bnary, mosac and grayone mages. In [Beuch98, Serra98] an mporan operaon was nroduced: he morphologcal medan. Ths operaon - compleely dfferen from he medan fler wdely used n mage processng - resuls n a new mage, creaed on he bass of gven wo npu mages, locaed halfway beween hem. The erave generaon of medan mages allows producng he nerpolaon sequence ha ransforms he nal mage no he fnal one a morphng sequence. Imporan s ha, conrary o he well-known cross-dssolvng [Gomes97, Wolbe99], he morphologcal approach ransforms he shapes of objecs on he mages. Cross-dssolvng produces merely a knd of blendng of npu mages. The mehod proposed n [Beuch98] has been exended no color mages n [Iwano99]. Two verson of nerpolaon was proposed: he fully auomac and half-auomac nerpolaon. In hs paper we exend he fully auomac mehod. I allows deformng he mages n a auomac manner, whou seng up he conrol pons. The orgnal mehod has a dsadvanage: n
2 some cases, he vsual qualy of he sequence s no hgh, especally when he npu mages nclude he areas of dfferen colors on he nal and fnal mages. Frames of he morphng sequence conan ofen nclusons of hghly conrased pxels wh he hue and lumnance values dfferen from her background. Due o ha fac he vsual qualy of he morphng sequence s no hgh enough o use n an effcen way. In hs paper he qualy mprovemen s proposed. In order o mprove he smoohness of he sequence we use he lnear mage processng echnques. The combnaon of he morphologcal nerpolaon and he qualy mprovemen by lnear spaal and emporal flerng allows performng he mage morphng, whch produces neresng and good-lookng resuls. The paper presens also a new mehod for he producon of he morphologcally nerpolaed sequence. The algorhm s based on he smlary measure beween frames. The radonal mehod [Beuch98,Iwano99] s a blnd one nerpolaed frames are produced whou comparng he already nerpolaed ones. The new algorhm does and s more flexble allows producng he nerpolaon sequence usng dfferen crera, wo of whch are presened n he paper: he number of frames and maxmum error crera. The paper s dvded no 6 secons. Secon descrbes he morphologcal medan of color mages. New mehod of he nerpolaon sequence formaon s nroduced n secon 3. Secon 4 descrbes he mehod of he lnear qualy mprovemens. Secon 5 conans he resuls and examples, and fnally secon 6 summarzes and concludes he paper.. COLOR MORPHOLOGICAL MEDIAN. Defnon of morphologcal medan The morphologcal medan has been nroduced for bnary [Serra98], mosac and grayone [Beuch98] mages. I s based on he morphologcal operaons of eroson and dlaon [Serra88]. Eroson s defned as a mnmum operaor, whch assgns o every mage pxel a mnmum value from among her neghbors. The neghborhood s defned n mahemacal morphology usng a srucurng elemen. In he case consdered n hs paper an elemenary srucurng elemen s used. I conans he closes pxel s neghborhood. The eroson of he npu mage F s defned by: { F( p + q) } h G ε ( F) p Ρ: G( p) mn () q N ( p) where G represens he oupu mage, ε s he eroson operaor, P s an mage doman, N(p) represens he closes neghborhood of pxel p, and h s he hegh of he srucurng elemen. The operaon of dlaon s based on he maxmum value among he neghborng pxels and s wren as: { F ( p + q) } + h G δ ( F ) p Ρ: G( p) max () q N ( p) where δ represens he operaor of dlaon (he res of symbols has he same meanng as descrbed above). The eroson and dlaon of gven sze n of mage F are defned as, respecvely: ( n) ε ( F) ε( ε... ε( F)..) ; n mes δ ( n) ( F ) δ ( δ... δ ( F )..) n mes The medan mage [Beuch98] s defned as: ( λ ) ( λ ) { nf [ δ (nf( F, ), ε (sup( F, ) ]} M ( F, sup (3) λ where λ are ncreasng neger values. sup and nf symbols represen a supremum and nfnmum mages whch are defned as, respecvely: G sup( F, F ) p Ρ G( p) max{ F ( p), F ( p)} (4) G nf( F, F ) p Ρ G( p) mn{ F ( p), F ( p)} (5) Morphologcal medan of bnary mages. Fgure In case of he bnary mages he hegh of he srucurng elemen have obvously o be h. In he bnary case, however, here exss an addonal condon - he nersecon of he npu bnary mages mus be non-empy [Serra98,Iwano]. The example of bnary medan s presened on Fg.. When compung he morphologcal medan of he grayone mages, he hegh of he srucurng elemen h> [Beuch98,Iwano]. Formally sayng corresponds o he operaon performed wh he cylndrcal srucurng elemen. On he oher hand, he n case of mulvalued mages he condon of a non-empy nersecon doesn exs. In he color case
3 he hegh s represened by a vecor h[h h h 3 ] such ha h,h,h 3 > are n he RGB color space - he ncremenal values of red, green and blue componen respecvely.. Medan of color mages In case of grayone mages he compuaon of (3) s obvous - he mn and max operaors n (),(),(4) and (5) are beng compued on he scalar values. In he case of color mages funcons mn n () and (5) as well as max and () and (4) mus be calculaed on he values from color (vecor) space. In [Iwano99] a soluon based on lexcographc orderng and comparave color space was proposed. In every Caresan color space one always has o compare rples of numbers (hree-elemen vecors) when comparng pxels. One of he mos popular ways of comparng s a lexcographc orderng. I has been appled o color morphology n [Talbo98]. I s based on he successve comparsons of vecors componens begnnng wh componens wh he lowes ndexes. Ths approach has however one mporan dsadvanage - he a pror orderng of he mporance of he vecor componens. In he case of he RGB color space, he r-componen s consdered as more mporan han he g-componen, whle he b- componen s he less mporan one. Bu here s no reason o apply such an order of preference. To solve hs problem a new color space he comparave space [Iwano99] - s nroduced exclusvely for vecor comparson usng he lexcographc orderng. The nal RGB color space s convered o he comparave one by usng a 3x3 converson marx. The converson s based on he vsual mporance of color channels for he human percepon. The color componens are no of he same mporance for he human vson. The ransformaon o he comparave space sors ou he color componens and/or combnes hem by nroducng her lnear combnaons so ha he consecuve comparsons follow he vsual mporance of componens. Transformaon marx M of nal color space no comparave mulples he vecor of color componens: [ v v v ] T M [ r g b] T 3 where [ v v v ] T s a vecor n he comparave 3 s a vecor n he RGB vecor space and [ ] color space. Marx M s n hs paper compued accordng o lgr-orderng [Iwano99]:.3 M.6. In oher words, he order of comparsons s followng: he lumnance value, he g-value, and fnally he r-componen. The approach presened above allows comparng he vecors of RGB color space whle akng no accoun he mporance of colors for human vson. Due o ha fac allows also performng he morphologcal operaons on color mages. Consequenly enables he calculaon he morphologcal medan of color mages..3 The algorhm Equaon (3) s appled o consruc he erave algorhm of medan mage calculaons [Iwano99]. Sarng from a par (F, of nal mages, we nroduce he hree auxlary mages Z, W, M, whch are nally equal o: Z nf( F, ; W sup( F, ; M nf( F, The ndexes represen he number of eraon. Ieraed values n he -h eraon are compued usng he followng rules: Z δ ( Z ) ; W ε( W ) ; M sup[nf( Z, W ), M ] Ieraons are performed unl dempoence of M, whch means ha when he mage M sops o change he ask s accomplshed and fnally: M ( F, where M(F, s he morphologcal medan of mages F and G, and s he lowes eraon number such ha M M. + The above algorhm s convergen, n a sense ha he dempoence s always reached. I s guaraneed by he equaon (3) and he dscree naure of dgal mages. The only heorecal danger for he convergence are he oscllaons such ha M M + M + M. Snce however ha + 3 M M such a suaon canno happen. Examples of color medan mages obaned usng hs algorhm are presened on Fg. and Fg.3. Fg. shows a morphologcal medan of wo mages wh a smlar color palee conanng mosly green and yellow hue values. Fg.3 conans he medan of wo mages wh dfferen color palees wh domnan hues: red-yellow and green-blue. I s clearly vsble M +,
4 represen s ha he medan mage conans he objecs obaned by he shape-deformaon of he objecs on boh npu mages. 3. MORPHING SEQUENCE In he prevous secon he mehod of a sngle nerpolaed mage generaon was presened. Ths secon descrbes how o produce he complee sequence. Tradonal mehod of he producon of he nerpolaon sequence [Beuch98] s based on he successve producon of new medans beween pars of already generaed ones. Such an approach has, however, one dsadvanage. I doesn consder he conen of he mage - so s a knd of blnd operaon. Moreover doesn perm obanng he sequence of any gven lengh. We propose here a new mehod, whch generaes eravely he frames of he nerpolaon sequence one frame per eraon. New frames are nsered n dfferen posons n he sequence. The algorhm decdes, dependng on he dfference beween wo neghborng mages, wheher s necessary o generae a new medan or no. Ths decson s based on he dfference beween mages and s aken afer calculang he smlary measure beween wo frames. In he mehod from [Beuch98] he ask was o fnd an equdsan dsrbuon of nerpolaon levels whou akng no consderaon he conen of he mages. In our case nsead of he dsrbuon of levels, one opmzes he dsrbuon of measures beween every par of consecuve frames. The smlary measure s equal o an error e, whch s compued as he mean square error (MSE) beween he lumnance values of pxels belongng o consecuve frames P and Q: x y e( P, Q) xmax ymax (6) where funcon lum represens a lumnance value of s argumen, and x, y max max are he mage szes. max max [ lum( P(, j)) lum( Q(, j)) ] The algorhm makes use of wo vecors. The frs one S S S,, s a vecor of sequence frames [ ], he second one s a vecor of smlary measures beween every par of consecuve frames e. Boh vecors have he same number of elemens. The npu mages are X and Y. The emporary varable (couner) s equal o he number of already produced frames. The algorhm of morphng sequence producon: Le: (sar he couner) Le: S X, S Y Compue he error beween he npu mages: e e( S, S) Le: max (ndex of he hghes error value) Whle (no(sop-condon)) do:. Inser new, empy frame beween frames max and max+ (elemens of vecors S and e wh ndexes beween and max remans unchanged; elemens wh ndexes from max + o ge new ndexes from max + o + respecvely, ndex of a new elemen s max+). Calculae new medan: S M S, S ) max + ( max max+ e max e( Smax, S max+ e max + e( S max +, S max + 3. Le: ) 4. Le: ) 5. Le: + 6. Fnd max such ha: e max max{ e, e,, e } Sop he algorhm The fnal sequence of mages S [ S S, S ],, he morphologcally nerpolaed sequence, such ha S X, S Y ; frames S, S,, S he nerpolaed mages. The use of he srucurng elemen of a gven hegh h> durng he calculaons of sngle medans, guaranees he convergence of he above algorhm. I means ha when compung S k M ( S k, X ), afer ceran number of eraons Sk Sk X. The same resul would be obaned f, nsead of he nal mage X, he fnal one Y, would be used. Two versons of he algorhm are proposed. The dfference beween hem les n he sopcondon. Frs one generaes he sequence wh gven number of frames n. The algorhm s sopcondon n hs case s: ( n ). In he second verson s based on he hghes accepable error e MAX beween wo consecuve frames. The number of frames of he fnal sequence can vary dependng on he complexy and dfference beween npu mages. The eraons are performed unl he error (6) becomes smaller han e. In hs MAX case he sop-condon s: ( e < e ). The fnal max MAX value of ndcaes he number of frames of he nerpolaon sequence.
5 Dependng on he verson of he algorhm appled eher he requred number of frames n, or he value e should be gven. of MAX 4. QUALITY IMPROVEMENTS The bgges problem ha occurs, whle observng he frames of he morphologcally nerpolaed sequence, are he nclusons of hghly conrased groups of pxels. They make he sequence look unnaural and dsurb s vsual qualy by decreasng he spaal smoohness of he sequence frames. The nex problem les n he emporal smoohness of a sequence. I happens ha he ransons beween he frames of he sequence somemes seem abrup. The soluon of boh problems s based on he lnear flerng. I allows mprovng boh he spaal and he emporal smoohness of a sequence. We propose hree qualy-mprovng ools ha can be appled eher separaely or jonly dependng on he parcular demand. Frs wo of hem are he lnear flers. The reason for nroducng he lnear flerng s no o remove he nclusons, bu o sofen hers color value and o oban smooher ransons beween sequence frames. The hrd ool s an auxlary cross-dssolvng operaon ha mproves he emporal smoohness of he sequence. 4. Temporal flerng The emporal flerng allows reducng he conras of he mage pxels. The emporal fler of sze s gven by: S S '( x, S + λ S + S λ + S + f f f < < n n (7) where S (x, s a pxel on he -h frame of he nal sequence, S (x, s pxel on he flered frame, n s a oal number of frames of he morphologcally nerpolaed sequence. I s a weghed mean value - he weghs of he pxels from he prevous and he nex frame are se o. The wegh of he curren pxel λ can be chosen manually dependng on he vsual qualy of he sequence. Snce he frs and he las sequence frame are equal o wo nal frames, hey are no flered. The parameer λ conrols he nfluence of he curren frame on he flered one. I can be equal o any posve neger. The growh of hs parameer reduces however he effec of flerng. The applcaon of emporal flerng sofens he color values of nclusons whou nroducng he spaal blurrng. I allows reducng he conras of he nclusons. I resuls n more naural vsual effec and smoohes ou he emporal ransons beween frame pxels. The emporal flerng offers he bes resuls for he nclusons presen a he curren frame beng a he same me absen on he precedng. In such a case an effec of blendng s vsble and conras reducon s remarkable. On he oher hand when small nclusons are no growng on several consecuve frames, hey sar o be oo conrased agan afer few successve frames. Such knd of nclusons canno be flered usng he emporal flerng. The example of emporal flerng s shown on Fg.4b. I conans he resul of he emporal lnear flerng (wh λ) of mage on Fg.4a. 4. Spaal flerng Anoher knd of lnear flerng proposed s he spaal flerng. I reduces he vsual mpac of he nclusons by nroducng he spaal blurrng. The lnear spaal flerng s expressed by usng he followng equaon: S '( x, s s S ( x +, y + j) m( + s +, j + s + ) (8) s j s s+ s+ j m(, j) where S (x, s a pxel on he -h frame of he nal sequence, S (x, s a pxel on he flered one, s s a sze of a lnear fler, and m s a mask of hs fler represened by a marx of sze s+. Smlarly o he case of he emporal flerng, n he curren one we also fler only he morphologcally nerpolaed frames.e. frames wh he ndexes: < < n. The frs and he las frame of he sequence are smply coped from he nal sequence o he flered one. Varous masks can be appled o perform he spaal flerng. The followng hree masks of sze s have been consdered: m m 4 m 3 4 (9) Mask m represens he mean fler 3x3, mask m s weaker verson and mask m 3 he Gaussan fler. Ths knd of flerng s necessary when he case, menoned a he end of he precedng secon, happens. I occurs when he conras of he nclusons s oo hgh and, a he same me, he nclusons have smlar shape on several consecuve frames. In such
6 a case he effec of locally hgh conras canno be removed by emporal flerng and he spaal one mus be appled. The choce of fler depends on he vsual qualy of he fnal sequence. If one prefers o ge a sequence more myserous one may use sronger flers lke e.g. m. If one wans o have sharper nerpolaed mages weaker fler lke e.g. m s more suable. The example of spaal flerng s presened on fg.4c. The flerng (8) has been performed usng fler m from (9). Afer boh knds of flerng he arfacs caused by he morphologcal medan (clearly vsble on Fg.4a), has been eher removed (by emporal flerng) or sofened (by he spaal one). 4.3 Cross-dssolvng In order o make he ransons beween morphologcally nerpolaed frames smooher, he addonal cross-dssolvng s appled. Ths operaon can be wren usng he followng equaons: S' S' S' α S, α+ β α ( + ) ( S + < β < α; < n β α ) S + β α S +, () where α s gven number of new frames ncluded beween every par of consecuve sequence frames, S s a frame of cross-dssolved sequence, S s a frame of he nal one. Afer he cross-dssolvng operaon he lengh of a sequence S grows α+ mes by nserng α crossdssolved frames beween every par of consecuve frames of he nal morphologcally nerpolaed and lnearly flered sequence S. Cross dssolvng s especally useful n he ransformaon of he nal, gven mage o he closes morphologcally nerpolaed one. I allows human percepon o adap o he nerpolaed mage. An example of he crossdssolvng s presened on Fg.5a-5g. Fg.5a conans he npu, gven mage. Fg.5g he frs frame of he morphologcally nerpolaed sequence. Fg.5b-5f show he cross-dssolved frames (α5). 5. RESULTS Two morphng sequences are presened as an example. Boh have been obaned usng he proposed mehod. All hree proposed mprovemens have been appled: emporal flerng, spaal flerng and cross-dssolvng. The frs sequence conans he ransformaon of an mage of flowers no anoher one presenng a bole of beer. Boh mages have smlar color palees. Fg.6 presens he frames of a sequence, whch were produced usng he morphologcal nerpolaon and he lnear flerng. The morphologcal medan has been calculaed usng he dlaons () and erosons () usng a srucurng elemen of hegh h[,,]. The sequence was generaed usng he second rule. The gven maxmal error was equal o e MAX. I resuled n 8 morphologcally nerpolaed frames. Each nerpolaed frame was flered usng he emporal fler (7) wh λ and spaal fler (8) wh mask m from (9). The error values and order of producon of new medans s shown n Table. To creae he fnal sequence he cross-dssolved frames was nsered beween every par of consecuve frames accordng o (). The number of cross-dssolved frames was α. The second example shows he ransformaon of he nal mage presenng a ree n summer no he fnal mage wh a fores n auumn. The color palees n boh npu mages are dfferen. Fg.7 presens he frames of a sequence, whch were produced usng he morphologcal nerpolaon and he lnear flerng. The morphologcal medan has been usng a srucurng elemen of hegh h[,,]. The gven lengh of a sequence was: n3. Each frame was flered usng he emporal fler (7) wh λ and spaal fler (8) wh mask m 3 from (9). Fg. 4 shows he resul of cross-dssolvng produced afer he consrucon of morphologcal nerpolaon followed by emporal and spaal flerng. In hs case he number of cross-dssolved frames nsered beween every par of consecuve ones was α5. Frame Prod. order Error S Inal e(s, S )998 S 7 e(s, S )8 S 6 e(s, S 3 )6 S 3 4 e(s 3, S 4 )45 S 4 e(s 4, S 5 )76 S 5 e(s 5, S 6 )8 S 6 3 e(s 6, S 7 )6 S 7 5 e(s 7, S 8 )455 S 8 8 e(s 8, S 9 )883 S 9 Fnal Frs example - ls of errors Table 6. CONCLUSIONS The mehod of auomac morphng has been presened. I combnes he morphologcal nerpolaon and lnear flerng. The mehod s able o produce he nerpolaon sequence usng exclusvely he mage processng ools. Sarng from wo nal mages he morphng sequence
7 ransformng he nal mage no he fnal one s creaed. The ransformaon s produced whou applyng he conrol pons. The only human asssance s requred n order o ndcae he number of morphologcally nerpolaed frames and - f needed - he parameers for he lnear flerng ools (number of cross-dssolved frames as well as he ype of emporal and spaal lnear fler). The proposed mehod can be compared wh anoher auomac mehod: he pure cross-dssolvng. Conrary however o he las one conans shape meamorphoss of he objecs on he mage. In comparson on he oher hand wh he classc morphng echnques [Wolbe99], doesn requre an nroducon of he conrol pons, whch s meconsumng and manual process. Bu, n fac, sn a real compeor of classc morphng echnques. Boh mehods are complemenary and her usage depends on he mages one s dealng wh. The proposed mehod can be employed o ransform he mages whou sensve areas, ransformaon of whch have o be conrolled precsely, lke eyes, mouh, nose ec. n he human face morphng. The mehod can be successfully appled o he ransformaon of mages where he correspondence of areas on boh mages s no crucal. I s useful, n parcular, when a leas one of wo mages conans a lo of small deals (lke flowers or rees on examples shown n he paper), whch should be deformed - no blended (blendng could be obaned usng he smple cross-dssolvng). The deformaon of such mages usng radonal mesh-warpng would requre a huge amoun of conrol pons whch have o be ndcaed manually by he operaor. The proposed mehod deforms hem whou nroducng he conrol pons. The resuls, obaned usng he proposed mehod, are neresng also from he arsc pon of vew he ransformaon of he shape looks myserous. The mehod can be successfully appled o he producon of specal vsual effecs n TV, flm and mulmeda ndusry. [Iwano] Iwanowsk M.: Applcaon of mahemacal morphology o nerpolaon of dgal mages, Ph.D. hess Warsaw Unversy of Technology, School of Mnes of Pars, Warsaw-Fonanebleau [Meyer96] Meyer F.: Morphologcal nerpolaon mehod for mosac mages, In P.Maragos, R.W.Schafer, M.A.Bu Mahemacal morphology and s applcaon o mage and sgnal processng, Kluwer, 996. [Serra83] Serra J.: Image Analyss and Mahemacal Morphology vol.. Academc Press, 983 [Serra88] Serra J.: Image Analyss and Mahemacal Morphology vol.. Academc Press, 988 [Serra98] Serra J.: Hausdorff dsance and nerpolaons In: H.Hemans and J.Roednk, edors, Mahemacal Morphology and s Applcaons o Image and Sgnal Processng. Kluwer, 998 [Talbo98] Talbo H., Evans C., Jones R.: Complee orderng and mulvarae morphology In: H.Hemans and J.Roednk, edors, Mahemacal Morphology and s Applcaons o Image and Sgnal Processng. Kluwer, 998 [Wolbe99] Wolberg G.: Dgal Image Warpng, IEEE Compuer Socey Press, Los Alamos CA, REFERENCES [Beuch98] Beucher S.: Inerpolaon of ses, of parons and of funcons In: H.Hemans and J.Roednk, edors, Mahemacal Morphology and s Applcaons o Image and Sgnal Processng. Kluwer, 998 [Gomes97] Gomes J., Velho L.: Image Processng for Compuer Graphcs, Sprnger-Verlag, 997 [Iwano99] Iwanowsk M., Serra J.: Morphologcal Inerpolaon and Color Images Proc. of h Inernaonal Conference on Image Analyss and Processng Sep. 7-9, 999 Vence, Ialy; IEEE Compuer Socey
8 Two nal mages (a) and (b) conanng colors of smlar hue values (green and yellow) and her morphologcal medan (c). Fgure Frs example Fgure 6 Inal mages (a) and (c) conanng colors of dfferen hue values and her medan mage (b). Fgure 3 Morphologcal medan frame of he morphng sequence (a); afer emporal lnear flerng (b); and afer spaal and emporal flerng (c). Fgure 4 Cross-dssolvng Fgure 5 Second example Fgure 7
Bayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance
INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule
More informationCubic Bezier Homotopy Function for Solving Exponential Equations
Penerb Journal of Advanced Research n Compung and Applcaons ISSN (onlne: 46-97 Vol. 4, No.. Pages -8, 6 omoopy Funcon for Solvng Eponenal Equaons S. S. Raml *,,. Mohamad Nor,a, N. S. Saharzan,b and M.
More informationSolution in semi infinite diffusion couples (error function analysis)
Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of
More informationVariants of Pegasos. December 11, 2009
Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on
More informationGENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim
Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran
More informationTHE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS
THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he
More informationOn One Analytic Method of. Constructing Program Controls
Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna
More informationVolatility Interpolation
Volaly Inerpolaon Prelmnary Verson March 00 Jesper Andreasen and Bran Huge Danse Mares, Copenhagen wan.daddy@danseban.com brno@danseban.com Elecronc copy avalable a: hp://ssrn.com/absrac=69497 Inro Local
More informationChapter 6: AC Circuits
Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.
More informationTSS = SST + SSE An orthogonal partition of the total SS
ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure
More information( ) () we define the interaction representation by the unitary transformation () = ()
Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger
More informationClustering (Bishop ch 9)
Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
Ths documen s downloaded from DR-NTU, Nanyang Technologcal Unversy Lbrary, Sngapore. Tle A smplfed verb machng algorhm for word paron n vsual speech processng( Acceped verson ) Auhor(s) Foo, Say We; Yong,
More informationApproximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy
Arcle Inernaonal Journal of Modern Mahemacal Scences, 4, (): - Inernaonal Journal of Modern Mahemacal Scences Journal homepage: www.modernscenfcpress.com/journals/jmms.aspx ISSN: 66-86X Florda, USA Approxmae
More informationTesting a new idea to solve the P = NP problem with mathematical induction
Tesng a new dea o solve he P = NP problem wh mahemacal nducon Bacground P and NP are wo classes (ses) of languages n Compuer Scence An open problem s wheher P = NP Ths paper ess a new dea o compare he
More informationV.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS
R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon
More informationTight results for Next Fit and Worst Fit with resource augmentation
Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of
More informationRelative controllability of nonlinear systems with delays in control
Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.
More informationHEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD
Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,
More informationLecture 6: Learning for Control (Generalised Linear Regression)
Lecure 6: Learnng for Conrol (Generalsed Lnear Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure 6: RLSC - Prof. Sehu Vjayakumar Lnear Regresson
More informationNew M-Estimator Objective Function. in Simultaneous Equations Model. (A Comparative Study)
Inernaonal Mahemacal Forum, Vol. 8, 3, no., 7 - HIKARI Ld, www.m-hkar.com hp://dx.do.org/.988/mf.3.3488 New M-Esmaor Objecve Funcon n Smulaneous Equaons Model (A Comparave Sudy) Ahmed H. Youssef Professor
More informationComputing Relevance, Similarity: The Vector Space Model
Compung Relevance, Smlary: The Vecor Space Model Based on Larson and Hears s sldes a UC-Bereley hp://.sms.bereley.edu/courses/s0/f00/ aabase Managemen Sysems, R. Ramarshnan ocumen Vecors v ocumens are
More informationDynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005
Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc
More informationLi An-Ping. Beijing , P.R.China
A New Type of Cpher: DICING_csb L An-Png Bejng 100085, P.R.Chna apl0001@sna.com Absrac: In hs paper, we wll propose a new ype of cpher named DICING_csb, whch s derved from our prevous sream cpher DICING.
More informationEEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment
EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N
More informationIn the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!
ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal
More informationJohn Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany
Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy
More informationCS286.2 Lecture 14: Quantum de Finetti Theorems II
CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2
More informationChapter Lagrangian Interpolation
Chaper 5.4 agrangan Inerpolaon Afer readng hs chaper you should be able o:. dere agrangan mehod of nerpolaon. sole problems usng agrangan mehod of nerpolaon and. use agrangan nerpolans o fnd deraes and
More informationLecture VI Regression
Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M
More informationAnomaly Detection. Lecture Notes for Chapter 9. Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar
Anomaly eecon Lecure Noes for Chaper 9 Inroducon o aa Mnng, 2 nd Edon by Tan, Senbach, Karpane, Kumar 2/14/18 Inroducon o aa Mnng, 2nd Edon 1 Anomaly/Ouler eecon Wha are anomales/oulers? The se of daa
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationOrdinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s
Ordnary Dfferenal Equaons n Neuroscence wh Malab eamples. Am - Gan undersandng of how o se up and solve ODE s Am Undersand how o se up an solve a smple eample of he Hebb rule n D Our goal a end of class
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4
CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped
More informationOutline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model
Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon
More informationAdvanced Machine Learning & Perception
Advanced Machne Learnng & Percepon Insrucor: Tony Jebara SVM Feaure & Kernel Selecon SVM Eensons Feaure Selecon (Flerng and Wrappng) SVM Feaure Selecon SVM Kernel Selecon SVM Eensons Classfcaon Feaure/Kernel
More informationThe Finite Element Method for the Analysis of Non-Linear and Dynamic Systems
Swss Federal Insue of Page 1 The Fne Elemen Mehod for he Analyss of Non-Lnear and Dynamc Sysems Prof. Dr. Mchael Havbro Faber Dr. Nebojsa Mojslovc Swss Federal Insue of ETH Zurch, Swzerland Mehod of Fne
More informationComb Filters. Comb Filters
The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of
More informationEfficient Asynchronous Channel Hopping Design for Cognitive Radio Networks
Effcen Asynchronous Channel Hoppng Desgn for Cognve Rado Neworks Chh-Mn Chao, Chen-Yu Hsu, and Yun-ng Lng Absrac In a cognve rado nework (CRN), a necessary condon for nodes o communcae wh each oher s ha
More informationFTCS Solution to the Heat Equation
FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence
More informationExistence and Uniqueness Results for Random Impulsive Integro-Differential Equation
Global Journal of Pure and Appled Mahemacs. ISSN 973-768 Volume 4, Number 6 (8), pp. 89-87 Research Inda Publcaons hp://www.rpublcaon.com Exsence and Unqueness Resuls for Random Impulsve Inegro-Dfferenal
More informationGraduate Macroeconomics 2 Problem set 5. - Solutions
Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K
More information[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5
TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres
More informationSampling Procedure of the Sum of two Binary Markov Process Realizations
Samplng Procedure of he Sum of wo Bnary Markov Process Realzaons YURY GORITSKIY Dep. of Mahemacal Modelng of Moscow Power Insue (Techncal Unversy), Moscow, RUSSIA, E-mal: gorsky@yandex.ru VLADIMIR KAZAKOV
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm H ( q, p, ) = q p L( q, q, ) H p = q H q = p H = L Equvalen o Lagrangan formalsm Smpler, bu
More information. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue.
Lnear Algebra Lecure # Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons
More informationDepartment of Economics University of Toronto
Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of
More information2/20/2013. EE 101 Midterm 2 Review
//3 EE Mderm eew //3 Volage-mplfer Model The npu ressance s he equalen ressance see when lookng no he npu ermnals of he amplfer. o s he oupu ressance. I causes he oupu olage o decrease as he load ressance
More informationJ i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.
umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal
More informationIntroduction to Boosting
Inroducon o Boosng Cynha Rudn PACM, Prnceon Unversy Advsors Ingrd Daubeches and Rober Schapre Say you have a daabase of news arcles, +, +, -, -, +, +, -, -, +, +, -, -, +, +, -, + where arcles are labeled
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm Hqp (,,) = qp Lqq (,,) H p = q H q = p H L = Equvalen o Lagrangan formalsm Smpler, bu wce as
More informationOn computing differential transform of nonlinear non-autonomous functions and its applications
On compung dfferenal ransform of nonlnear non-auonomous funcons and s applcaons Essam. R. El-Zahar, and Abdelhalm Ebad Deparmen of Mahemacs, Faculy of Scences and Humanes, Prnce Saam Bn Abdulazz Unversy,
More information. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue.
Mah E-b Lecure #0 Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons are
More informationHow about the more general "linear" scalar functions of scalars (i.e., a 1st degree polynomial of the following form with a constant term )?
lmcd Lnear ransformaon of a vecor he deas presened here are que general hey go beyond he radonal mar-vecor ype seen n lnear algebra Furhermore, hey do no deal wh bass and are equally vald for any se of
More informationJanuary Examinations 2012
Page of 5 EC79 January Examnaons No. of Pages: 5 No. of Quesons: 8 Subjec ECONOMICS (POSTGRADUATE) Tle of Paper EC79 QUANTITATIVE METHODS FOR BUSINESS AND FINANCE Tme Allowed Two Hours ( hours) Insrucons
More informationOnline Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading
Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More informationPerformance Analysis for a Network having Standby Redundant Unit with Waiting in Repair
TECHNI Inernaonal Journal of Compung Scence Communcaon Technologes VOL.5 NO. July 22 (ISSN 974-3375 erformance nalyss for a Nework havng Sby edundan Un wh ang n epar Jendra Sngh 2 abns orwal 2 Deparmen
More informationLecture 18: The Laplace Transform (See Sections and 14.7 in Boas)
Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on
More informationTime-interval analysis of β decay. V. Horvat and J. C. Hardy
Tme-nerval analyss of β decay V. Horva and J. C. Hardy Work on he even analyss of β decay [1] connued and resuled n he developmen of a novel mehod of bea-decay me-nerval analyss ha produces hghly accurae
More informationLecture 11 SVM cont
Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc
More informationDiscrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition
EHEM ALPAYDI he MI Press, 04 Lecure Sldes for IRODUCIO O Machne Learnng 3rd Edon alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/ml3e Sldes from exboo resource page. Slghly eded and wh addonal examples
More informationRobust and Accurate Cancer Classification with Gene Expression Profiling
Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem
More information3. OVERVIEW OF NUMERICAL METHODS
3 OVERVIEW OF NUMERICAL METHODS 3 Inroducory remarks Ths chaper summarzes hose numercal echnques whose knowledge s ndspensable for he undersandng of he dfferen dscree elemen mehods: he Newon-Raphson-mehod,
More informationM. Y. Adamu Mathematical Sciences Programme, AbubakarTafawaBalewa University, Bauchi, Nigeria
IOSR Journal of Mahemacs (IOSR-JM e-issn: 78-578, p-issn: 9-765X. Volume 0, Issue 4 Ver. IV (Jul-Aug. 04, PP 40-44 Mulple SolonSoluons for a (+-dmensonalhroa-sasuma shallow waer wave equaon UsngPanlevé-Bӓclund
More informationA Novel Object Detection Method Using Gaussian Mixture Codebook Model of RGB-D Information
A Novel Objec Deecon Mehod Usng Gaussan Mxure Codebook Model of RGB-D Informaon Lujang LIU 1, Gaopeng ZHAO *,1, Yumng BO 1 1 School of Auomaon, Nanjng Unversy of Scence and Technology, Nanjng, Jangsu 10094,
More informationLet s treat the problem of the response of a system to an applied external force. Again,
Page 33 QUANTUM LNEAR RESPONSE FUNCTON Le s rea he problem of he response of a sysem o an appled exernal force. Agan, H() H f () A H + V () Exernal agen acng on nernal varable Hamlonan for equlbrum sysem
More informationMath 128b Project. Jude Yuen
Mah 8b Proec Jude Yuen . Inroducon Le { Z } be a sequence of observed ndependen vecor varables. If he elemens of Z have a on normal dsrbuon hen { Z } has a mean vecor Z and a varancecovarance marx z. Geomercally
More informationAlgorithm Research on Moving Object Detection of Surveillance Video Sequence *
Opcs and Phooncs Journal 03 3 308-3 do:0.436/opj.03.3b07 Publshed Onlne June 03 (hp://www.scrp.org/journal/opj) Algorhm Research on Movng Objec Deecon of Survellance Vdeo Sequence * Kuhe Yang Zhmng Ca
More informationDetection of Waving Hands from Images Using Time Series of Intensity Values
Deecon of Wavng Hands from Images Usng Tme eres of Inensy Values Koa IRIE, Kazunor UMEDA Chuo Unversy, Tokyo, Japan re@sensor.mech.chuo-u.ac.jp, umeda@mech.chuo-u.ac.jp Absrac Ths paper proposes a mehod
More informationDensity Matrix Description of NMR BCMB/CHEM 8190
Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon Alernae approach o second order specra: ask abou x magnezaon nsead of energes and ranson probables. If we say wh one bass se, properes vary
More informationDEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL
DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL Sco Wsdom, John Hershey 2, Jonahan Le Roux 2, and Shnj Waanabe 2 Deparmen o Elecrcal Engneerng, Unversy o Washngon, Seale, WA, USA
More informationCS 536: Machine Learning. Nonparametric Density Estimation Unsupervised Learning - Clustering
CS 536: Machne Learnng Nonparamerc Densy Esmaon Unsupervsed Learnng - Cluserng Fall 2005 Ahmed Elgammal Dep of Compuer Scence Rugers Unversy CS 536 Densy Esmaon - Cluserng - 1 Oulnes Densy esmaon Nonparamerc
More informationA Novel Efficient Stopping Criterion for BICM-ID System
A Novel Effcen Soppng Creron for BICM-ID Sysem Xao Yng, L Janpng Communcaon Unversy of Chna Absrac Ths paper devses a novel effcen soppng creron for b-nerleaved coded modulaon wh erave decodng (BICM-ID)
More informationAn introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,
More informationFall 2010 Graduate Course on Dynamic Learning
Fall 200 Graduae Course on Dynamc Learnng Chaper 4: Parcle Flers Sepember 27, 200 Byoung-Tak Zhang School of Compuer Scence and Engneerng & Cognve Scence and Bran Scence Programs Seoul aonal Unversy hp://b.snu.ac.kr/~bzhang/
More informationAttribute Reduction Algorithm Based on Discernibility Matrix with Algebraic Method GAO Jing1,a, Ma Hui1, Han Zhidong2,b
Inernaonal Indusral Informacs and Compuer Engneerng Conference (IIICEC 05) Arbue educon Algorhm Based on Dscernbly Marx wh Algebrac Mehod GAO Jng,a, Ma Hu, Han Zhdong,b Informaon School, Capal Unversy
More informationExtracting Duration Facts in Qualitative Simulation using Comparison Calculus
Exracng Duraon Facs n Qualave Smulaon usng Comparson Calculus Tolga Könk 1 and A. C. Cem Say 2 1: konk@umch.edu Compuer Scence and Engneerng ATL., Unv. Mchgan, 1101 Beal Ave., Ann Arbor, 48105-2106 MI,
More informationMANY real-world applications (e.g. production
Barebones Parcle Swarm for Ineger Programmng Problems Mahamed G. H. Omran, Andres Engelbrech and Ayed Salman Absrac The performance of wo recen varans of Parcle Swarm Opmzaon (PSO) when appled o Ineger
More informationKernel-Based Bayesian Filtering for Object Tracking
Kernel-Based Bayesan Flerng for Objec Trackng Bohyung Han Yng Zhu Dorn Comancu Larry Davs Dep. of Compuer Scence Real-Tme Vson and Modelng Inegraed Daa and Sysems Unversy of Maryland Semens Corporae Research
More informationFuzzy Set Theory in Modeling Uncertainty Data. via Interpolation Rational Bezier Surface Function
Appled Mahemacal Scences, Vol. 7, 013, no. 45, 9 38 HIKARI Ld, www.m-hkar.com Fuzzy Se Theory n Modelng Uncerany Daa va Inerpolaon Raonal Bezer Surface Funcon Rozam Zakara Deparmen of Mahemacs, Faculy
More informationIntroduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms
Course organzaon Inroducon Wee -2) Course nroducon A bref nroducon o molecular bology A bref nroducon o sequence comparson Par I: Algorhms for Sequence Analyss Wee 3-8) Chaper -3, Models and heores» Probably
More informationBernoulli process with 282 ky periodicity is detected in the R-N reversals of the earth s magnetic field
Submed o: Suden Essay Awards n Magnecs Bernoull process wh 8 ky perodcy s deeced n he R-N reversals of he earh s magnec feld Jozsef Gara Deparmen of Earh Scences Florda Inernaonal Unversy Unversy Park,
More informationImplementation of Quantized State Systems in MATLAB/Simulink
SNE T ECHNICAL N OTE Implemenaon of Quanzed Sae Sysems n MATLAB/Smulnk Parck Grabher, Mahas Rößler 2*, Bernhard Henzl 3 Ins. of Analyss and Scenfc Compung, Venna Unversy of Technology, Wedner Haupsraße
More informationCH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC
CH.3. COMPATIBILITY EQUATIONS Connuum Mechancs Course (MMC) - ETSECCPB - UPC Overvew Compably Condons Compably Equaons of a Poenal Vecor Feld Compably Condons for Infnesmal Srans Inegraon of he Infnesmal
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 0 Canoncal Transformaons (Chaper 9) Wha We Dd Las Tme Hamlon s Prncple n he Hamlonan formalsm Dervaon was smple δi δ Addonal end-pon consrans pq H( q, p, ) d 0 δ q ( ) δq ( ) δ
More informationSingle-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method
10 h US Naonal Congress on Compuaonal Mechancs Columbus, Oho 16-19, 2009 Sngle-loop Sysem Relably-Based Desgn & Topology Opmzaon (SRBDO/SRBTO): A Marx-based Sysem Relably (MSR) Mehod Tam Nguyen, Junho
More informationAn adaptive approach to small object segmentation
An adapve approach o small ojec segmenaon Shen ngzh ang Le Dep. of Elecronc Engneerng ejng Insue of echnology ejng 8 Chna Asrac-An adapve approach o small ojec segmenaon ased on Genec Algorhms s proposed.
More informationPolymerization Technology Laboratory Course
Prakkum Polymer Scence/Polymersaonsechnk Versuch Resdence Tme Dsrbuon Polymerzaon Technology Laboraory Course Resdence Tme Dsrbuon of Chemcal Reacors If molecules or elemens of a flud are akng dfferen
More informationLearning Objectives. Self Organization Map. Hamming Distance(1/5) Introduction. Hamming Distance(3/5) Hamming Distance(2/5) 15/04/2015
/4/ Learnng Objecves Self Organzaon Map Learnng whou Exaples. Inroducon. MAXNET 3. Cluserng 4. Feaure Map. Self-organzng Feaure Map 6. Concluson 38 Inroducon. Learnng whou exaples. Daa are npu o he syse
More informationWiH Wei He
Sysem Idenfcaon of onlnear Sae-Space Space Baery odels WH We He wehe@calce.umd.edu Advsor: Dr. Chaochao Chen Deparmen of echancal Engneerng Unversy of aryland, College Par 1 Unversy of aryland Bacground
More informationA Novel Iron Loss Reduction Technique for Distribution Transformers. Based on a Combined Genetic Algorithm - Neural Network Approach
A Novel Iron Loss Reducon Technque for Dsrbuon Transformers Based on a Combned Genec Algorhm - Neural Nework Approach Palvos S. Georglaks Nkolaos D. Doulams Anasasos D. Doulams Nkos D. Hazargyrou and Sefanos
More informationGORDON AND NEWELL QUEUEING NETWORKS AND COPULAS
Yugoslav Journal of Operaons Research Vol 9 (009) Number 0- DOI:0.98/YUJOR0900C GORDON AND NEWELL QUEUEING NETWORKS AND COPULAS Danel CIUIU Facul of Cvl Indusral and Agrculural Buldngs Techncal Unvers
More informationA Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
A Deermnsc Algorhm for Summarzng Asynchronous Sreams over a Sldng ndow Cosas Busch Rensselaer Polyechnc Insue Srkana Trhapura Iowa Sae Unversy Oulne of Talk Inroducon Algorhm Analyss Tme C Daa sream: 3
More informationIncluding the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.
Soluons o Ordnary Derenal Equaons An ordnary derenal equaon has only one ndependen varable. A sysem o ordnary derenal equaons consss o several derenal equaons each wh he same ndependen varable. An eample
More information( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model
BGC1: Survval and even hsory analyss Oslo, March-May 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng
More informationBoosted LMS-based Piecewise Linear Adaptive Filters
016 4h European Sgnal Processng Conference EUSIPCO) Boosed LMS-based Pecewse Lnear Adapve Flers Darush Kar and Iman Marvan Deparmen of Elecrcal and Elecroncs Engneerng Blken Unversy, Ankara, Turkey {kar,
More informationISSN MIT Publications
MIT Inernaonal Journal of Elecrcal and Insrumenaon Engneerng Vol. 1, No. 2, Aug 2011, pp 93-98 93 ISSN 2230-7656 MIT Publcaons A New Approach for Solvng Economc Load Dspach Problem Ansh Ahmad Dep. of Elecrcal
More informationA NEW TECHNIQUE FOR SOLVING THE 1-D BURGERS EQUATION
S19 A NEW TECHNIQUE FOR SOLVING THE 1-D BURGERS EQUATION by Xaojun YANG a,b, Yugu YANG a*, Carlo CATTANI c, and Mngzheng ZHU b a Sae Key Laboraory for Geomechancs and Deep Underground Engneerng, Chna Unversy
More informationA Deza Frankl type theorem for set partitions
A Deza Frankl ype heorem for se parons Cheng Yeaw Ku Deparmen of Mahemacs Naonal Unversy of Sngapore Sngapore 117543 makcy@nus.edu.sg Kok Bn Wong Insue of Mahemacal Scences Unversy of Malaya 50603 Kuala
More information