A new method for constructing kernel vectors in morphological associative memories of binary patterns

Size: px
Start display at page:

Download "A new method for constructing kernel vectors in morphological associative memories of binary patterns"

Transcription

1 DOI:.2298/CSIS B A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay pattens Yanns.S. Boutals 1 1 Depatment of Electcal and Compute Engneeng, Democtus Unvesty of Thace, GR-670 Xanth, Geece ybout@ee.duth.g Abstact. : Kenel vectos epesent an elegant epesentaton fo the eteval of patten assocatons, whee the nput pattens ae coupted by both eosve and dlatve nose. Howeve, the acton completely fals when a patcula knd of eosve nose, even of vey low pecentage, coupts the nput patten. In ths pape, a theoetcal ustfcaton of ths fact s gven and a new method s poposed fo the constucton of kenel vectos fo bnay pattens assocatons. The new kenels ae not bnay but gay, because they contan elements wth values n the nteval [0, 1]. It s shown, both theoetcally and expementally that the new kenel vectos cay the good popetes of conventonal kenel vectos and, at the same tme, they can be easly computed. Moeove, they do not suffe fom the patcula nose defcency of the conventonal kenel vectos. The ecallng esult s n geneal a gay patten, whch n the sequel undegoes a smple thesholdng acton and passes though a smple Hammng netwok to poduce hgh ecall ates, even n heavly coupted pattens. Reteval of patten assocatons s vey sgnfcant fo a vaety of scentfc dscplnes ncludng data analyss, sgnal and mage undestandng and ntellgent contol. Keywods: Neual netwoks, Assocatve memoy, Kenel vectos, Nose Robustness. 1. Intoducton Mophologcal Neual Netwoks (MNNs) epesent atfcal neual netwoks whose neuons pefom an elementay opeaton of mathematcal mophology [1], [2]. Unlke Hopfeld netwok [3,4], MNNs povde the esult n one pass though the netwok, wthout any sgnfcant amount of tanng. A numbe of eseaches devsed MNNs fo a ange of applcatons lke those appeang, fo example, n [5-13].

2 Yanns.S. Boutals Atfcal neual netwok models ae specfed by the netwok topology, unt chaactestcs, and tanng o leanng ules. The undelyng algebac system used n these models s the set of eal numbes R togethe wth the opeatons of addton and multplcaton and the laws govenng these opeatons. Ths algebac system, known as ng, s commonly denoted by (R,+,x). The basc computatons occung n mophologcal netwoks ae based on the algebac lattce stuctue ( R,,, ), whee, denote the bnay opeatons fo mnmum and maxmum, espectvely. The basc axomatc opeatons of lattce algeba [14] ae: ( ) ( R R 0 R 0 R An assocatve memoy (AM) s an nput-output system that descbes a elaton R R m R n. If (x, y)r,.e. f the nput x poduces the output y, then the assocatve memoy s sad to stoe o ecod the memoy assocaton (x, y). NN models sevng as assocatve memoes ae geneally capable of etevng a complete output patten y even f the nput patten x s coupted o ncomplete. The pupose of auto-assocatve memoes s the eteval of x fom coupted o ncomplete vesons x. If an atfcal assocatve memoy stoes assocatons (x, y), whee x cannot be vewed as a coupted o ncomplete veson of y, then we speak about heteo-assocatve memoy. Reseach on neual assocatve memoes goes back n the 1950s [15-17]. Lnea assocatve memoy o coelaton memoy [17-19] s one well known neual assocatve memoy. Assocaton of pattens x R n and y R m s acheved by means of a matx-vecto poduct y Wx. If we suppose that the goal s to stoe k vecto pas (x 1, y 1 ),...,(x k, y k ), whee x R n and y R m fo all = 1,...,k, then W s an m n matx gven by the followng oute poduct ule: k 1 (1.1) W y ( x ) (1.2) If X denotes the matx whose column ae the nput pattens x 1,...,x k and Y denotes the matx whose columns ae the output pattens y 1,...,y k, then ths equaton can be wtten n the smple fom Y X'. If the nput pattens x 1,...,x k ae othonomal, then 1 1 k k Wx (( y x )... ( y x ) ) x y (1.3) Thus, we have pefect ecall of the output pattens y 1,...,y k. In case the pattens ae not othonomal the capacty of the memoy s extemely lmted and ts ablty to eteve assocatons s futhe educed when nput pattens ae nosy []. Mophologcal assocatve memoes (MAMs) ae based on the algebac lattce stuctue ( R,,, ). They have been ntally poposed n [14], [21], [22] fo assocatng bnay patten vectos and ae fa moe obust to nose 142 ComSIS Vol. 8, No. 1, Januay 11

3 A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay than the conventonal lnea assocatve memoes. Moeove, the memoy capacty n stoed assocatons s sgnfcantly lage than the capacty of conventonal lnea assocatve memoes. These popetes and the fact that a numbe of notable featues such as optmal absolute stoage capacty and one-step convegence have been shown to hold n the geneal case fo ealvalued pattens [14], motvated fo the extenson to gay-coded vecto assocatons [23] o ecently n geneal gay-scale MAMs and fuzzy oented teatments [24], [25],[26-28]. Recent woks epot also on ecall and stoage pefomance of vaous types of MAMs n colo pattens unde vaous types and pecentages of nose [29], [], whle othe woks pesent new dynamc MAMs and test the pefomance n ecallng gay and colo patten assocatons [31], [32], [33]. Accodng to [14], thee ae two altenatve appoaches to constuct MAMs. In the fst appoach the constucted memoy s vey obust n the pesence of nput pattens contanng eosve nose. In the dual appoach the constucted memoy s vey obust n the pesence of nput pattens contanng dlatve nose. In case the nput patten x s coupted by both eosve and dlatve nose none of the memoes s able to ecall y. To ovecome ths poblem Rtte and hs cowokes [34-36] poposed the dea of two-step MAMs and the poducton of the so-called kenel vectos, as an elegant epesentaton of the assocatons (x, y ). These vectos, n conuncton wth appopate mophologcal opeatons, ae sutable to ecall y when an abtaly coupted (both eoded and dlated) nput patten x appeas at the nput of the MAM. A bnay vecto z s sad to be a kenel of the assocaton (x, y) between the bnay vectos x and y f t s a subset of x and satsfes some condtons gven n [34], [35]. Moe ecent developments on econstuctng pattens fom nosy nputs extend the defnton of kenels and assocate them wth the popety of stong mophologcal ndependence whch should be pesent n the stoed pattens [37-]. Thee ae two mao ssues elated to the kenel method. The fst s the vey selecton of epesentatve kenel vectos. The condtons fo a vecto z to be a kenel vecto, gven n [34], [35], they do not povde wth a fast method fo selectng such vectos. As t wll be ponted out n secton 3 the pocedue of selectng kenel vectos s qute tme consumng, especally when the patten vectos ae of lage dmenson. Addtonal condtons fo kenels and selecton pocedues, whch allevate n some extent ths poblem, ae poposed n [35],[41-43] whle n [37-] the pocedue of selectng the kenels emeges though the steps of the poof of the elevant theoems, povded that the pattens ae ntally modfed to meet the popety of stong mophologcal ndependence. The second mao ssue, whch s of ths pape concen, s elated to the behavo of kenel method n the pesence of nosy nput pattens. Although ths ssue has eceved only mno attenton n the elevant lteatue [43], the kenel method s not entely obust to nose. It can be expementally vefed that, although kenel vectos ae qute satsfactoy n etevng assocatons based on nosy (both dlated and eoded) data, n some cases, they entely fal even n the pesence of vey small nose pecentages. Ths ComSIS Vol. 8, No. 1, Januay

4 Yanns.S. Boutals happens when one o moe nonzeo element of the nput patten, whch coespond to espectve nonzeo elements of the kenel vecto ae ht by eosve nose, whch convets them to zeo-valued elements. In ths case, the eteval pocedue ecalls nothng, even f the amount of nose s qute lmted. In ths pape, a theoetcal poof of ths obsevaton s establshed and the mechansm of poducng ths falue s explaned. Next, a new kenel defnton method s poposed whch ovecomes ths poblem and s moe obust to such knd of nose than the tadtonal kenel vectos. The new kenels ae not anymoe bnay but they contan elements of vaable values n the ange [0, 1]. The values of the elements of each selected kenel ae elated to the fequency of appeaance of the coespondng elements of the nput tanng pattens. Dffeent altenatves of selectng kenels based on fequences ae poposed and ae compaed n espect to the obustness n nose. All fequency based kenel vectos no longe suffe fom the patcula nose defcency of conventonal kenels. Moeove, the pocedue of selectng the kenel vectos s qute smple and well defned; theefoe t s not tme consumng. The development s gven fo an auto-assocatve scheme, but heteo-assocaton can be tackled wth the same pocedue. The patten assocaton ecall s pefomed n thee steps. The fst step s the (nput patten -> kenel) and (kenel -> output patten) ecall. The esult s an output patten, whch n geneal s not bnay but gay and keeps n a lage extend the shape of the output patten to be ecalled. Theefoe a smple thesholdng acton s the second step and may poduce the coespondng bnay patten. The thd step nceases the pefomance of the poposed method by passng the ecalled bnay patten though a smple Hammng netwok equpped wth ndex selecton. The pefomance of the new kenel n bnay patten ecall s demonstated by usng extensve chaacte ecognton expements unde vaous types and pecentages of nose. The pape s oganzed as follows. Fst, n secton 2, a bef but complete ntoducton to the mophologcal assocatve memoes s gven. The kenel method s also epoted n the same secton and ts weaknesses ae demonstated. In the sequence, n secton 3, the theoetcal ustfcaton of the falue of the kenel method n the pesence of the patcula knd of eosve nose s gven. In secton 4, the new kenel defnton method s ntoduced and ts valdty and nose obustness s theoetcally establshed. Secton 5 povdes expemental esults egadng the capacty and nose obustness of the poposed kenels, pesentng also compasons between the altenatve vesons of the fequency based kenels. Conclusons and dscusson ae fnally gven n secton ComSIS Vol. 8, No. 1, Januay 11

5 A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay 2. Mophologcal assocatve memoes and the kenel method Thee ae two basc appoaches to ecod k vecto pas (x 1, y 1 ),...,(x k, y k ) usng a mophologcal assocatve memoy (MAM) [14]. The fst appoach conssts of stuctung an m n matx W XY wth elements computed by k 1 w ( y x ), 1,..., m 1,..., n (2.1) The dual appoach conssts of constuctng an m n matx M XY wth elements computed by k 1 m ( y x ), 1,..., m 1,..., n (2.2) If matx W XY eceves a vecto x as nput, the poduct y WXY x s fomed. The poduct s called max poduct and each element of the esultng vecto y s computed by the fomula n ( y ), 1,..., w x m (2.3) 1 Lkewse, f matx M XY eceves x as nput the so-called mn poduct y MXY x s fomed, whee each element of the esultng vecto y s computed by the fomula. n ( y ), 1,..., m x m (2.4) 1 Matces W XY and M XY, computed by (2.1) and (2.2) espectvely, consttute the memoy of the MAM. The only equed tanng of the netwok s smply the computaton of ethe of the two matces W o M. The dffeence between the two memoes ases when nosy pattens appea at the nput. Memoy M XY s able to eteve y n case a nosy vecto x coupted by dlatve nose appeas at ts nput, whle memoy W XY s able to eteve y n case an eoded veson of the nput patten appeas at ts nput. The natue of dlatve and eosve nose n bnay pattens, as well as the eteval esults of M XY and W XY espectvely s depcted n Fg. 2.1 and 2.2. In case the nput patten x s coupted by both eosve and dlatve nose none of the memoes s able to ecall y. Othe types of memoes have also been poposed n the ecent yeas. The medan opeato (nstead of mn o max) s ntally poposed n [31] to poduce a memoy that s obust n stctly mxed type of nose, whch pesents pefect ecall f ths nose s of medan zeo and f the fundamental (uncoupted) patten set fulflls some stct condtons. To ovecome these estctons the authos n [31] popose the constucton of the memoy usng specally constucted suogates of the fundamental patten set and an algothm fo the tanng and ecall phase usng these suogates. The dea of usng suogates appeas also n [32], [33], whee a dynamc type of memoy s pesented and the md opeato s employed. Although successful n stong and ecallng geneal patten assocatons, dynamc assocatve memoes ae ComSIS Vol. 8, No. 1, Januay

6 Yanns.S. Boutals not appopate fo bnay patten assocatons, because an essental pat of the algothm, namely the detemnaton of actve egon [32], fals when bnay pattens ae nvolved. M XY W XY Fg Patten ecall of a dlated nput usng the mn poduct and memoy matx M. Fg Patten ecall of an eoded nput usng the max poduct and memoy matx W. Anothe type of memoes fo bnay patten assocatons follows fom fuzzy oented teatments [25-28]. A new set theoetc ntepetaton of ecodng and ecall of bnay AMM s gven n [25-27] and a genealzaton s povded usng fuzzy set theoy. Ths esults n the defnton of the so-called fuzzy mophologcal assocatve memoes and the use of the fuzzy max poduct of W and x and the fuzzy mn poduct of M and x. When a coupted bnay patten appeas as nput to memoy W o M the outcome s a gaylevel patten. The espectve bnay ecall s obtaned by usng appopate nomalzed theshold, whch howeve has to be dffeent dependng on the type of memoy used. An teatve algothm s also poposed n [25] fo the detemnaton of the appopate theshold. The ecall scoes ae futhe mpoved n [28], whee an enhanced fuzzy autoassocatve mophologcal memoy s pesented and s combned wth a dscete Hammng neual netwok that nceases the accuacy of the ecall. Expements wth pattens coupted wth vaous nose levels ae pesented, howeve the patten set used s vey lmted and s not suffcent fo dawng clea conclusons. A well establshed appoach to ovecome the poblem of the complete falue of memoes W (eq. 2.1) and M (eq. 2.2) n dlatve and eosve nose espectvely s the kenel method. To ovecome the poblem Sussne, Rtte and cowokes [34], [35] poposed the dea of two-step MAMs and the poducton of the so-called kenel vectos, as an elegant epesentaton of the assocatons (x, y ). These vectos, n conuncton wth matces M and W, ae sutable to ecall y when an abtaly coupted (both eoded and dlated) nput patten x appeas at the nput of the MAM. A bnay vecto z s sad to be a kenel of the assocaton (x, y) between the vectos x and y f t s a subset of x and satsfes the followng condtons. M x z zz (2.5) W z y, ZY (2.6) whee matces M ZZ and W ZY ae computed accodng to (2.1), (2.2). In case of autoassocaton (2.5) and (2.6) ae wtten as M x z ZZ (2.7) and W z x (2.8) ZX 146 ComSIS Vol. 8, No. 1, Januay 11

7 A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay espectvely. Fg. 2.3 shows a sample of bnay pattens (lettes) and the coespondng kenel pattens, whch satsfy equatons (2.7) and (2.8). When an abtaly coupted nput patten x appeas at the nput of a mophologcal autoassocatve netwok, the ognal uncoupted nput patten x s ecalled by the followng equaton: WZX MZZ x x (2.9) Moe ecent developments on econstuctng pattens fom nosy nputs extend the defnton of kenels and assocate them wth the popety of stong mophologcal ndependence whch should be pesent n the stoed pattens [37-]. A pocedue fo selectng such kenels s poposed n [37], whch also nvolves a mechansm of alteng the ntal pattens so that they fulfll the popety of stong mophologcal ndependence. Fg Input pattens and undeneath the espectve kenels Thee ae two mao ssues elated to the tadtonal kenel method. The fst s the vey selecton of epesentatve kenel vectos. Equatons (2.5), (2.6) (o (2.7), (2.8) fo autoassocaton) povde the necessay and suffcent condtons fo a vecto z to be a kenel vecto but they do not povde wth a fast method fo selectng such vectos. An appaent pocedue s the andom selecton of kenel vectos and the acceptance o eecton on the bass of (2.5) and (2.6). Ths pocedue s qute tme consumng, especally when the patten vectos ae of lage dmenson. Addtonal condtons fo kenels and selecton pocedues ae poposed n [35],[41-43]. The second mao ssue, whch s of ths pape concen, s elated to the behavo of kenel method n the pesence of nosy nput pattens. Although ths ssue has eceved only mno attenton n the elevant lteatue [43], the kenel method s not entely obust to nose. It can be expementally vefed that, although kenel vectos ae qute satsfactoy n etevng bnay pattens assocatons based on nosy (both dlated and eoded) data, n some cases of eosve nose, they entely fal even n the pesence of vey small nose pecentages. Ths happens when one o moe nonzeo elements of the nput patten, whch coespond to espectve nonzeo elements of the kenel vecto ae ht by nose, whch convets them to zeo-valued elements. In ths case, the eteval equaton (2.9) ecalls nothng. A theoetcal explanaton of ths fact s gven n the followng secton. Closng ths secton, t s woth notng that even n the dynamc MAM pesented n [32], [33], thee s a pat of the memoy, namely a one column vecto of the espectve matx of the memoy, that the authos call kenel of the assocatve memoy. The elements of such a kenel play an mpotant ComSIS Vol. 8, No. 1, Januay

8 Yanns.S. Boutals ole n ecallng pattens alteed by some knd of nose. The ecall pocedue wll fal f kenel changes, leadng to loss of memoy [32], [33]. Howeve, n ths pape, we wll not futhe efe to ths type of memoes, because dynamc MAM s not appopate fo stong and ecallng bnay patten assocatons. Ths s due to the falue of detemnng the so-called actve egon [32] when bnay pattens ae nvolved. Anothe eason s that, wth bnay pattens, the low accuacy condton (see [32], secton 4.2) s vey often actvated. 3. Nose defcency of the kenel method The basc dea of kenel method s to constuct a vecto (the kenel vecto), whch s a subset, o othewse a spase veson, of the bnay nput vecto t epesents. Actually, the stcte the subsethood t s the bette the pefomance of the method s. Two vey useful condtons fo bnay kenels ae poposed n [34] and n [35]. They ae descbed by the followng equatons z x (3.1) z z 0 (3.2) Equaton (3.1) expesses the condton of subsethood descbed above, whle equaton (3.2) expesses the demand that dffeent kenels should not have common nonzeo ponts. A pctoal ntepetaton of the subsethood condton can be dawn fom Fg Each bnay lette of dmenson (x) can be scanned ow by ow and be epesented by a (0x1) vecto contanng only the values 0 and 1. Hee, 1 epesents the black pxel and 0 epesents the whte pxel. Smlaly, the coespondng kenel pattens can be epesented by the (0x1) kenel vectos. The 1s n the kenel vectos ae much fewe than the 1s of the coespondng pattens and ths s a dect ntepetaton of (3.1). Moeove, the kenel pattens do not have common non-zeo elements and theefoe condton (3.2) s fulflled. Snce each kenel vecto satsfes (3.1), each nput vecto x can be consdeed as a dlated veson of ts coespondng kenel vecto z. Theefoe, snce memoy M ZZ s vey capable n etevng pattens coupted by dlatve nose t can ecall z by usng equaton (2.5) (o (2.7)) and the vecto x as ts nput. In the sequel, each ecalled kenel vecto z can be used as the nput to the memoy W ZX o W ZY to eteve x o y by usng equaton (2.6) o (2.8) espectvely. The combnaton of these two steps s expessed n equaton (2.9), In case an abtaly coupted veson x of the nput patten s consdeed, equaton (2.9) can stll povde easonably good esults, povded that x can be consdeed as a dlated veson of z. If, howeve, x can be consdeed as a coupted veson z, whch contans even the slghtest amount of eosve nose, the ecall pocedue entely fals and equaton (2.5) and consequently (2.9) ecalls nothng. The theoems that follow theoetcally explan ths stuaton. A pctoal epesentaton of the 148 ComSIS Vol. 8, No. 1, Januay 11

9 A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay stuaton s also gven n Fg It can be obseved that f the nput patten s ht by eosve nose, whch affects even one pxel that coesponds to a nonzeo element of the coespondng kenel patten, then the ecall pocedue completely fals. Fo notatonal convenence, we call as kenel pont any element of the kenel vecto whch has nonzeo value (value 1). We also ecall that, kenel vectos satsfy (3.1) and (3.2). Theoem 3.1. The ows of Mzz ae vectos wth values 1. All zeos ( m 0, ) f the ow ndex () does not coespond to any kenel pont of any kenel vecto. 2. All ones ( m 1, ) f the ow ndex () coesponds to a kenel pont belongng to any kenel vecto z, except when the column ndex () coesponds to anothe kenel pont of the same kenel vecto z. In ths case m 0 The poof of Theoem 3.1 s gven n the Appendx. A pctoal epesentaton of Mzz fo the kenels of Fg. 2.3 s gven n Fg. 3.2, whee the values of Mzz ae dsplayed n the fom of a bnay mage (0 = black, 1= whte). In ths example, Mzz s of dmenson (0x0). Theoem 3.2. If thee s at least one ndex, such that x 0 and z 1, then equaton (2.5) ecalls nothng. That s M x 0 ZZ (3.3) and consequently WZX MZZ x 0 (3.4) The poof of Theoem 3.2 s gven n the Appendx. It explans why thee s such a complete falue n the pesence of ths patcula knd of eosve nose, even f the nose pecentage s vey low. 4. The new kenel defnton method In the sequel we popose a new method fo ecallng assocatons between bnay pattens, by constuctng kenel vectos whch does not pesent the nose defcency of the conventonal kenel vectos descbed n the pevous secton. Moeove, the pocedue of constuctng the kenels eques only modeate pocessng tme and theefoe s computatonally much moe effcent than the conventonal kenel method. In ou appoach kenel vectos ae not bnay but the elements ae allowed to take values n the nteval [0, 1]. Each kenel vecto z s constucted to be a subset of an nput vecto x (see equaton (3.1)), but the subsethood s defned n a fuzzy-lke manne. ComSIS Vol. 8, No. 1, Januay

10 Yanns.S. Boutals Ognal Kenel Coupted Recall Fg Falue of the ecall pocedue when even a slght amount of eosve nose affects pxels, whch coespond to nonzeo kenel elements. Fg Pctoal epe-sentaton of the values of Mzz. A black pxel co-esponds to m 0, whle a whte pxel coesponds to m 1. Defnton 4.1. The new kenel vectos ae fomed based on the followng condtons. 1. Kenel vectos contan values that ae n the nteval [0,1]. 2. The values of the elements of each kenel vecto ae zeo when the coespondng values of the nput vecto ae zeo and nonzeo when the coespondng nput vecto values ae nonzeo. 3. The nonzeo values of each kenel vecto ae fomed based on the fequency, f, of appeaance of the coespondng nonzeo nput vecto element n all the nput vectos accodng to the followng method 1: 4. z 1 f f 1, z 0.8 f f 2, z 0.7 f f 3, z 0.4 f f 4 We call the non-zeo elements of a kenel vecto kenel ponts. Each kenel pont s assocated wth ts stength. The kenel ponts wth z 1 ae the stongest kenel ponts, whle kenel ponts wth z 0.8, 0.7, 0.4 ae weake kenel ponts. In usng the fequences to constuct kenels thee ae moe than one altenatve. Two such altenatves, temed method 2 and method 3, ae pesented late on n ths secton. Howeve, method 1 s enough to demonstate the dea and daw the elevant conclusons. Fg. 4.1 shows examples of kenel vectos constucted accodng to method 1 and assocated wth the nput pattens (lettes) of Fg Dffeent gay levels epesent the kenel ponts of dffeent stength wth the stonge kenel ponts coespondng to the bghte ntensty. The algothm fo constuctng kenel vectos s qute smple and obvous and theefoe ts computatonal buden s qute low n compason wth the conventonal kenel method. Indeed, to constuct a kenel vecto z that coesponds to an nput vecto x we poceed as follows: If the value of the element of the nput vecto s 0 the coespondng element of the kenel vecto s set to 0. Fo each nonzeo element of the nput vecto we count the nonzeo occuences of the same element n the othe nput vecto. We call ths fequency of 150 ComSIS Vol. 8, No. 1, Januay 11

11 A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay appeaance. Next we assgn a nonzeo value to the coespondng element of the kenel vecto accodng to the counted fequency and accodng to method 1of defnton 4.1. The same pocedue s appled fo the constucton of all the kenel vectos Patten Kenel 50 Patten Kenel Patten Kenel Patten Kenel Fg Pctoal epesentaton of pattens and the coespondng kenel pattens constucted usng the poposed new method. The bghte pxels coespond to stonge kenel ponts. Each new kenel vecto s a subset of ts coespondng nput vecto accodng to equaton (3.1), but the subsethood s now defned n a fuzzy lke manne snce fo each element of the kenel vecto the followng elaton holds z x, (4.1) The new kenel defnton comes as an ntutve extenson of conventonal bnay kenels. In meetng (3.1) and (3.2), denotng subsethood and unqueness, the esultng bnay kenels ae spase vectos, cayng all nfomaton n the few nonzeo values. All these nonzeo values ae cucal and, as ponted out n secton 3, even f one of them s mssng (has zeo value) n the nput patten the whole ecallng pocedue collapses. In the new defnton, the gay kenel vectos ae allowed to nclude also othe suppotng non-zeo values, assocated wth non-zeo patten elements appeang n moe than one patten. Due to the defnton of the new kenel vectos, whch s based on the fequences of the elements of the coespondng nput vectos, the fom of memoy matx Mzz s now completely dffeent than the coespondng matx poduced by conventonal kenels. The new fom of Mzz allows the ecallng pocedue to be successful even f the nput vecto s coupted by the specal eosve nose descbed n secton 3. The patcula method 1 fo selectng the gay values {1, 0.8, 0.7, 0.4} to be attbuted n kenel ponts assocated wth the espectve patten non-zeo element fequences {1, 2, 3, 4}, came out of autho s obsevatons and s suffcent fo demonstatng the dea and dawng the conclusons. As t s poved n the next theoems, the poposed method 1 seves the pupose of emovng the patcula nose defcency of tadtonal kenels. Othe fequency based methods may also be vald. Two such altenatve methods (method 2 and method 3) ae pesented at the end of ths secton, whch cay the good popety of method 1, and pefom bette n lage patten sets and ae moe obust n mxed nose. Theoem 4.1. The ows of Mzz ae vectos wth values All zeos ( m 0, ) f the ow ndex () does not coespond to any kenel pont of any kenel vecto (fequency 0). ComSIS Vol. 8, No. 1, Januay

12 Yanns.S. Boutals m I 1 1, 0.6, 0.3, 0.2, 0 f the ow ndex coesponds to kenel value z 1 (fequency 1). m I 2 0.8, 0.4, 0.1, 0 f the ow ndex coesponds to kenel value z 0.8 (fequency 2). m I 3 0.7, 0.3, 0 f the ow ndex coesponds to kenel value z 0.7 (fequency 3) m I 4 0.4, 0 f the ow ndex coesponds to kenel value z 0.4 (fequency 4 ). The poof of Theoem 4.1 s gven n the Appendx. Theoem 4.2. If thee ae one o moe ndces, such that x 0 and z 0, then equaton (2.5) ecalls the kenel vecto o an eoded veson of t. That s M x z ZZ (4.2) and consequently WZX MZZ x x (4.3) The poof of Theoem 4.2 s gven n the Appendx. Fg. 4.2 shows examples of pefect ecall usng the new kenel vectos constucted by method 1 and as nput vectos uncoupted pattens. Fgue 4.3 shows examples of pefect ecall usng the new kenel vectos and as nput vectos pattens coupted by the eosve nose descbed n secton 3. (a) (b) (a) (b) (c) (d) (c) (d) Fg Examples of pefect ecall usng the new kenel vectos and nput vectos the uncoupted pattens: (a) the nput, uncoupted vecto (b) the ognal kenel vecto (c) pefect ecall of the kenel vecto by (2.5) (d) pefect ecall of the patten by (2.9) (a) (b) (a) (b) (c) (d) (c) (d) Fg Examples of pefect ecall usng the new kenel vectos and nput vectos coupted by the eosve nose descbed n secton 3. (a) the coupted vecto used as nput (b) the ognal kenel vecto (c) non-pefect ecall of the kenel vecto by (2.5) (d) pefect ecall of the patten by (2.9) 152 ComSIS Vol. 8, No. 1, Januay 11

13 A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay It has to be noted that tem M x n (4.3) wll poduce z, whch can ZZ be consdeed as an eoded veson of x. Memoy WZX s obust n eosve nose but ts obustness depends also on the amount of the eoson. Theefoe, wth the excepton of expements nvolvng small patten sets wth pobably small pecentages of mxed nose, eq. (4.3) wll not poduce a bnay patten but a gay suogate of t, havng a shape qute close to t. A bnay veson of the ecall can be obtaned afte a smple thesholdng acton. Smla to [28], the ecallng esults can be futhe mpoved f the bnay ecall passes though a smple Hammng netwok to poduce an ndex pontng to a patten of the ntal uncoupted patten base. The oveall ecallng scheme s shown n Fg. 4.4 and ts pefomance s demonstated by the expements appeang n the next secton. k x ZX W M x ZZ k x k gay Smple Thesholdng k x bnay Hammng & Index ecall k Fg The thee step ecall pocedue. The coupted bnay patten x passes k though eq. (4.3) to poduce the gay ecall x, whch afte smple thesholdng wll poduce a pobably coupted bnay patten ecall. The thd step wll poduce an ndex to be used fo etevng the uncoupted bnay patten x y. If k we have pefect ecall. In defnton 4.1 the values of the elements of kenel vectos ae detemned by the fequency of appeaance of the coespondng element n the pattens. Howeve, n method 1 only 4 dffeent values ae employed, as all elements havng fequency geate than 4 eceve the same value z 0.4. Two altenatve fequency based methods ae pesented below. Method 2: A plausble extenson of method 1 s to allow fo a fne detemnaton of kenel pont values takng nto account all avalable fequences of appeaance. Snce the maxmum fequency of a non-zeo pxel cannot be geate than the numbe of avalable pattens (nop) the kenel elements eceve the followng gadng f z 1 f f 1, z 1 f f 2 nop Regadng the specal nose defcency of kenels, method 2 caes the same good popetes of method 1, because theoems 4.1 and 4.2 can be easly extended to cove ths method by smply nceasng the numbe of dffeent cases examned to at most nop cases. In ths appoach the sets I n Theoem 4.1 now contan moe and dffeent values than those of method 1, but the atonale of the development and the usage n Theoem 4.2 eman the same. Regadng nose obustness, n the expements caed out n the next secton, method 2 poves to be moe obust than method 1. gay x ComSIS Vol. 8, No. 1, Januay

14 Yanns.S. Boutals Method 3: A slghtly dffeent appoach fo constuctng the gay kenels s the fequency dependent two-step kenel constucton method, whch s descbed hee n detal. In the fst step fequency pattens ae ceated. Then the kenel vectos ae detemned by gvng values to the kenel ponts accodng to the stength of common fequences n the fequency pattens. Moe specfcally, Step 1. Fo each ntal patten x a coespondng fequency patten p s constucted. The elements of the fequency patten ae constucted accodng to the followng ule p 0 f x 0, p f f x 0 Whee, as usual, f s the fequency of appeaance of the non-zeo th element n all pattens. Appaently the mnmum value f can take s 1. Step 2. Based on the set of fequency pattens, the set of common fequences F s detemned. That s, F contans all the dstnct fequences that appea n all the fequency pattens. Appaently, the cadnalty cf of F s at most equal to the numbe of pattens nop; usually t s smalle. Let also fmn mn f F and fmax max f F denote the mnmum and maxmum of the fequences patcpatng n F. Next, fo each patten, ts kenel vecto z s constucted accodng to the followng ule. z 0 f p 0, o z 1 f p f, mn p z F p 1 f max f f mn mn That s, the nonzeo elements of each kenel vecto coespond to elements of the fequency pattens havng fequences that appea n all othe fequency pattens. The concept of stong and weake kenel ponts eman, because the values of the kenel ponts ae detemned by the coespondng fequences, wth the lagest value (=1) taken by elements that coespond to the mnmum common fequency and the othe values (<1) ae gadually educng accodng to the ncease of the coespondng common fequency. Regadng the specal nose defcency of kenels, method 3 caes the same good popetes of method 1 and method 2, because the constucton of Mzz s analogous to that of the othe methods. Theoems 4.1 and 4.2 can be easly extended to cove ths method by smply consdeng dffeent numbe of cases examned (the numbe of cases s cf 1, countng also the m 0 case). The sets I n Theoem 4.1 now contan dffeent values than those of the othe methods, but the atonale of the development and the usage n Theoem 4.2 eman the same. Regadng nose obustness, n the expements caed out n the next secton, method 3 poves to be much moe obust than the othe two methods. f p f mn 154 ComSIS Vol. 8, No. 1, Januay 11

15 A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay 5. Expemental esults To test the pefomance of the poposed method, a numbe of expements wee caed out. In ode to have a meanngfully szed data set, 26 uncoupted bnay pattens wee ntally ceated. The set contans the 35x34 bnay mages of the captal lettes of the Latn alphabet and s shown n Fg Some examples of gay kenels poduced by method 1, 2 and 3 espectvely ae shown n Fg Fg The complete patten set consstng of 35x34 bnay mages of the 26 captal lettes of Englsh alphabet. Fg Sample of kenel vectos poduced by the thee fequency based methods. (a) Kenels of method 1 (b) Kenels of method 2 (c) Kenels of method 3. All methods (1, 2 &3) of constuctng kenels wee ntally tested on the ecall pefomance of uncoupted pattens, when the thee step pocedue of Fg. 4.4 was appled. All methods had a 0% success n ecallng the uncoupted patten. Fg. 5.3 shows thee examples (one fo each method) of the oveall pocedue. The patten nteacts wth memoy M accodng to (4.2) to poduce z. Then, z nteacts wth memoy W accodng to (4.3) to poduce a gay patten x havng the shape of x. Next, the gay outcome passes fom a smple thesholdng scheme to poduce a bnay patten. In ths smple thesholdng scheme evey gay value geate than zeo eceves value 1. In the sequel, the bnay ecall may pass though a Hammng netwok to ecall an ndex pontng to a membe of the ntal patten set. Fnally, the uncoupted patten assocated wth ths ndex appeas as the fnal ecall of ths pocedue. It has to be noted that, n the expements caed out, we dd not use a Hammng netwok. Instead the Hammng dstances n 1 H x x 1,, k (5.1) ComSIS Vol. 8, No. 1, Januay

16 Yanns.S. Boutals between the bnay ecall and each one of the pattens of the ntal patten space wee computed and the ndex of the patten gvng the smallest dstance was selected. The patten ecalled s x, whee ag mn H, 1,, k (5.2) In (5.1), n denotes the sze (n pxels) of a patten, denotes the th element of the patten vecto and k s the numbe of pattens n the patten space. Fg Steps of uncoupted patten ecall accodng to the pocedue of Fg. 4.4 usng the thee fequency based kenel methods. (a) ecall usng method 1, (b) ecall usng method 2, (c) ecall usng method 3. Fom left to ght: 1 st column - nput patten, 2 nd column - kenel ecall usng (4.2), 3 d column - patten ecall usng (4.3), 4 th column bnazaton of column 3 ecall usng smple thesholdng, 5 th column fnal ecall afte computng the mnmum Hammng dstance. The use of (5.1) and (5.2) povdes also a means fo ndectly evaluatng the stoage capacty of the oveall scheme. Statng fom a small szed patten space (k = 5) and gadually nceasng the sze by 2 untl k = 26, the aveage mnmum dstance of all patten ecalls at each patten space fo each method s ecoded. Fgue 5.4 shows the plot of the aveage mnmum dstance (AMD) of ecalls n espect to the sze of the patten space. It s evdent that the AMD nceases n the begnnng but t appoaches an uppe bound as the numbe of pattens nceases. That s, afte a cetan numbe of pattens the AMD and ndectly the stoage capacty of the scheme s not affected by the sze of the patten space. Moeove, Fg. 5.4 demonstates the supeoty of method 3, snce t povdes always moe confdent esults (smalle AMD). The next set of expements s concened wth the obustness of all methods unde the pesence of vaous pecentages of mxed type (both dlatve and eosve) nose. Mxed nose was andomly appled on each bnay patten. The nose pecentage s computed by countng the numbe of the alteed (nosy) pxels and dvde them wth the total numbe of mage pxels. Fgue 5.5 shows thee examples (one fo each method) of the oveall ecall pocedue, when a coupted by % mxed nose patten appeas n the nput of the poposed 3-step ecall scheme. 156 ComSIS Vol. 8, No. 1, Januay 11

17 Aveage mnmum Hammng dstance A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay method 1 method 2 method Numbe of pattens Fg Aveage mnmum Hammng dstance fo the thee fequency based kenel methods n espect to the sze of the patten space. Fg Steps of successful patten ecall of a coupted patten accodng to the pocedue of Fg. 4.4 usng the thee fequency based kenel methods. (a) ecall usng method 1, (b) ecall usng method 2, (c) ecall usng method 3. Fom left to ght: 1 st column coupted nput patten, 2 nd column - kenel ecall usng (4.2), 3 d column - patten ecall usng (4.3), 4 th column bnazaton of column 3 ecall usng smple thesholdng, 5 th column fnal ecall afte computng the mnmum Hammng dstance. The vaous ecall stages ae smla wth those appeang n Fg. 5.3, howeve the effect of nose s now evdent n the ntemedate esults. It s also clea that method 2 s moe obust to nose than method 1, because the ntemedate esults ae close to the actual ones. Smlaly, method 3 pefoms much bette than the othe two. Fnally, Fg. 5.6 depcts the obustness of each method n mxed nose. The falue ecall ate of each method s dsplayed n espect to the pecentage of the mxed nose. Snce the nose s andomly appled, n ode to have statstcally elable esults, each expement coespondng to a dffeent nose pecentage was caed out 50 tmes and the aveage falue ecall ate s actually ecoded and dsplayed. It s evdent that method 3 s fa moe obust than the othe two methods and method 2 s sgnfcantly moe obust than method 1. Theefoe, although all fequency based kenel methods do not pesent the patcula nose defcency of tadtonal kenel methods, they pesent sgnfcant dffeences egadng the nose obustness. Ths n tun may pompt fo futue seekng of altenatve ComSIS Vol. 8, No. 1, Januay

18 Falue ate (%) Yanns.S. Boutals fequency based kenel constucton methods wth bette pefomance n ecall of nosy pattens. 90 method 1 80 method 2 method Mxed nose (%) Fg Falue ecall ates of the thee fequency based kenel vecto methods n espect to mxed nose pecentage. 6. Concluson A new method fo constuctng kenel vectos was poposed n ths pape to be used fo ecallng assocatons between bnay pattens. The need fo a new kenel defnton aose fom a specal nose defcency of the conventonal bnay kenel vectos of the elevant lteatue. The new kenels ae not bnay but gay, because they contan elements wth values n the nteval [0, 1]. These values ae detemned by the fequency of appeaance of nonzeo elements of the nput patten vectos. Altenatve schemes of poducng kenels based on fequency wee pesented and t was shown, both theoetcally and by chaacte ecall examples that the new kenel vectos cay the good popetes of conventonal kenel vectos and, at the same tme, they can be easly computed. Moeove, they do not suffe fom the patcula nose defcency of the conventonal kenel vectos. Expements, pefomed on lage set of bnay pattens coupted by vaous degees of mxed nose demonstate the obustness and the lmts of the poposed appoach. Futue extenson of ths wok mght extend the poposed appoach to cove moe fequency dependent kenel altenatves as well as an nvestgaton egadng the applcablty of the poposed concepts n gay and possbly colo patten assocatons. Acknowledgement.The autho wants to acknowledge the contbuton of M. S. Chatzchstofs n pefomng the expements caed out. 158 ComSIS Vol. 8, No. 1, Januay 11

19 Refeences A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay 1. Pete Sussne and Macos Eduado Valle, Mophologcal and cetan fuzzy mophologcal assocatve memoes fo classfcaton and pedcton. In Vassls Kabulasos and Gehad Rtte, (eds), Computatonal Intellgence Based on Lattce Theoy, chapte 8, Spnge-Velag, Hedelbeg, Gemany, , (07). 2. J.L.Davdson, G.X.Rtte, A theoy of mophologcal neual netwoks, n: Dgtal Optcal Computng II, Vol. 1215, Poc. SPIE, , (July 1990). 3. J.J.Hopfeld, Neual netwoks and physcal systems wth emegent collectve computatonal abltes, Vol. 79, Poc. of the Natonal Academy of Scences, U.S.A., , (Apl 1982). 4. J.J.Hopfeld, Neuons wth gaded esponse have collectve computatonal popetes lke those of two-state neuons, Vol. 81, Poc. of the Natonal Academy of Scences, U.S.A., 88 92, (May 1984). 5. J.L.Davdson, Smulated annealng and mophologcal neual netwoks, n: Image Algeba and Mophologcal Image Pocessng III, Vol. 1769, Poc. SPIE, San Dego, , (1992). 6. J.L.Davdson, F.Humme, Mophology neual netwoks: an ntoducton wth applcatons, Ccuts, Systems and Sgnal Pocessng, Vol. 12, No. 2, 177 2, (1993). 7. C.P.Suaez Aauo, Novel neual netwok models fo computng homothetc nvaances: an mage algeba notaton, Jounal of Mathematcal Imagng and Vson, Vol. 7, No. 1, 69 83, (1997). 8. Y. Won, P. D. Gade, Mophologcal shaed weght neual netwok fo patten classfcaton and automatc taget detecton, In Poc. of the IEEE Intenatonal Confeence on Neual Netwoks, Peth, Austala, , (Novembe 1995). 9. P. D. Gade, M. Khabou, and A. Koldobsky, Mophologcal egulazaton neual netwoks, Patten Recognton., Specal Issue on Mathematcal Mophology and Its Applcatons, Vol. 33, No. 6, , (00).. L. Pessoa and P. Maagos, Neual netwoks wth hybd mophologcal/ ank/lnea nodes: A unfyng famewok wth applcatons to handwtten chaacte ecognton, Patten Recognton, Vol. 33, , (00). 11. Handbook of Neual Computaton, E. Fesle and R. Beale, (Eds)., IOP Publshng and Oxfod Unvesty Pess, pp. C1.8:1 C1.8:14. W. Amstong, M. Thomas, Adaptve logc netwoks, (1997). 12. B. Raducanu, M. Gaña, and X. F. Albzu, Mophologcal scale spaces and assocatve mophologcal memoes: Results on obustness and pactcal applcatons, J. Math. Imagng and Vson, Vol. 19, No. 2, , (03). 13. M. Gaña, J. Gallego, F. J. Toealdea, and A. D Anou, On the applcaton of assocatve mophologcal memoes to hypespectal mage analyss, Lectue Notes n Compute Scence, Vol. 2687, , (03). 14. G.X.Rtte, P.Sussne, J.L.Daz de Leon, Mophologcal assocatve memoes, IEEE Tans. Neual Netwoks, Vol. 9, No. 2,, , (1998). 15. W.K. Taylo. Eletcal smulaton of some nevous system functonal actvtes, Infomaton Theoy, Vol. 3, , ( 1956). 16. K. Stenbuch. De lenmatx. Kybenetck, Vol. 1, 36 45, (1961). 17. J. A. Andeson and E. Rosenfeld, (Eds), Neuocomputng: Foundatons of Reseach, Vol. 1, MIT Pess, Cambdge, MA, (1989). 18. T.Kohonen, Coelaton matx memoy, IEEE Tans. Comput. Vol. 21, , (1972). ComSIS Vol. 8, No. 1, Januay

20 Yanns.S. Boutals 19. James A. Andeson, Andas Pellonsz, and Edwad Rosenfeld, (Eds). Neuocomputng: Dectons fo Reseach, Vol. 2, MIT Pess, Cambdge, MA, (1990).. Toshyuk Tanaka, Shnsuke Kakya, and Yoshyuk Kabashma, Capacty Analyss of Bdectonal Assocatve Memoy, In Poc. Seventh Int. Conf. Neual Infomaton Pocessng, Taeon, Koea, Vol. 2,, , (Nov. 00). 21. G. X. Rtte and P. Sussne. An ntoducton to mophologcal neual netwoks, In Poceedngs of the 13th Intenatonal Confeence on Patten Recognton, Venna, Austa, , (1996). 22. G. X. Rtte and P. Sussne, Mophologcal neual netwoks In Intellgent Systems: A Semotc Pespectve, In Poceedngs of the 1996 Intenatonal Multdscplnay Confeence, Gathesbug, Mayland, , G. Costantn, D. Casal, and R. Pefett, Neual assocatve memoy stong gay-coded gay-scale mages, IEEE Tans. Neual Netwoks, Vol. 14, No. 3, , (03). 24. P. Sussne and M. E. Valle, Gay-Scale Mophologcal Assocatve Memoes, IEEE Tans. Neual Netwoks, Vol. 17, No. 3, , (06). 25. P. Sussne, Genealzng opeatons of bnay mophologcal autoassocatve memoes usng fuzzy set theoy, J. Math. Imagng and Vson, Specal Issue on Mophologcal Neual Netwoks, Vol. 9, No. 2, 81 93, (03). 26. P. Sussne, A elatonshp between bnay autoassocatve mophologcal memoes and fuzzy set theoy, In Poceedngs of the Int. Jont Conf. on Neual Netwoks, Washngton DC, (01). 27. P. Sussne, A Fuzzy autoassocatve mophologcal memoy, In Poceedngs of the Int. Jont Conf. on Neual Netwoks, Potland OR, (03). 28. G. Ucd, J.A. Neves-V., and C.A. Reyes-G, Enhanced fuzzy autoassocatve mophologcal memoy fo bnay patten ecall, In Poceedngs 4th IASTED Int. Conf. on Sgnal Pocessng, Patten Recognton, and Applcatons, Innsbuck, Austa, (07). 29. Robeto A. Vazquez and H. Sossa, Behavo of mophologcal assocatve memoes wth tue-colo mage pattens, Neuocomputng, Vol. 73, N0. 1-3, , (09).. M.E. Valle: A Class of Spasely Connected Autoassocatve Mophologcal Memoes fo Lage Colo Images, IEEE Tansactons on Neual Netwoks, Vol., No. 6, 45 50, (09). 31. H. Sossa, R. Baon and Robeto A. Vazquez, New assocatve memoes to ecall eal-valued pattens, Lectue Notes n Compute Scence, Spnge, Vol. 3287, 195-2, (04). 32. Robeto A. Vazquez and H. Sossa, A new assocatve model wth dynamcal synapses, Neual Pocessng Lettes, Vol. 28, No. 3, 189-7, (08). 33. Robeto A. Vazquez and H. Sossa, A bdectonal heteoassocatve memoy fo tue-colo pattens, Neual Pocessng Lettes, Vol. 28, No. 3, , (08). 34. G.X.Rtte, J.L.Daz de Leon and P.Sussne, Mophologcal bdectonal assocatve memoes, Neual Netwoks, Vol. 12, , (1999). 35. P. Sussne, Obsevatons on mophologcal assocatve memoes and the kenel method, Neuocomputng, Vol. 31, , (00). 36. P. Sussne, Assocatve mophologcal memoes based on vaatons of the kenel and dual kenel methods, Neual Netwoks, Vol. 16, No. 5, , (03). 37. G.X. Rtte, G.Ucd, and L. Iancu, Reconstucton of nosy pattens usng mophologcal assocatve memoes, Jounal of Mathematcal Imagng and Vson, Vol. 19, , (03). 160 ComSIS Vol. 8, No. 1, Januay 11

21 A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay 38. [G. Ucd and G.X. Rtte, Kenel computaton n mophologcal assocatve memoes fo gayscale mage ecollecton, In Poceedngs of 5th IASTED Int. Conf. on Sgnal and Image Pocessng, Honolulu, Hawa, (03). 39. G.X. Rtte and P. Gade, Fxed Ponts of Lattce Tansfoms and Lattce Assocatve Memoes, n P. Hawkes (Ed.) Advances n Imagng and Electon Physcs Elseve, Vol. 144, San Dego, Calfona, 06.. G. Ucd, G.X. Rtte, L. Iancu, Kenel computaton n mophologcal bdectonal assocatve memoes, Pogess n Patten Recognton, Speech, and Image Analyss, Spnge LNCS 2905 Poceedngs, , (03). 41. T. Ida, S. Ueda, M. Kashma, T. Fuchda and S. Muashma, On a method to decde kenel pattens of mophologcal assocatve memoy, Systems and Computes n Japan, Vol. 33, No. 7, 85-94, (02). 42. M. Hatto, A. Fuku and H. Ito, A fast method of constuctng kenel pattens fo mophologcal assocatve memoy, In Poceedngs of 9th Intenatonal Confeence on Neual Infomaton Pocessng, 58-63, (Sngapoe 02). 43. H. Hashguch and M. Hatto, Robust mophologcal assocatve memoy usng multple kenel pattens, In Poceedngs th Intenatonal Confeence on Neual Infomaton Pocessng, (03). 7. Appendx (Poof of Theoems) Notaton: In the followng theoems an element of a conventonal bnay kenel vecto s sad to be a kenel pont f ts value s 1. An element of a new, gay kenel vecto s sad to be a kenel pont f ts value s > 0. Poof of Theoem 3.1. To pove the theoem we stat fom the fomula of computng the elements of Mzz. Accodng to equaton (2.2) the elements m of Mzz ae computed by p 1 m ( z z ), 1,..., n 1,..., n (A.1) whee n s the length of kenel vecto z. In geneal the ntenal tem ( z z ) can take the followng values (a) z z 0. Ths happens when fo a specfc both kenel ponts o both ae not kenel ponts (b) z z 1 Ths happens when fo a specfc z s not a kenel ponts and (c) z z 1 Ths happens when fo a specfc z s a kenel pont z and z ae z s a kenel ponts and z s not a kenel pont Takng now nto account that (A.1) s computed by takng the maxmum of all the ntenal tems ( z z ) fo 1 p, we conclude the followng. ComSIS Vol. 8, No. 1, Januay

22 Yanns.S. Boutals (1) If ndex does not coespond to any kenel pont of any kenel vecto then z 0,. Consequently, fo each ( z z ), 1 p takes the values 0 and 1. Theefoe, the maxmum of these values s 0 and theefoe m 0,. (2) In case ndex equals the ndex of a kenel pont n any kenel vecto z, then takng nto account stuaton (b) above, m 1, except when z 1 (that s stuaton (a) above holds) and smultaneously z z 0,, whee m 0. Ths means that when the kenel ponts of a kenel vecto do not concde wth the kenel ponts of anothe kenel vecto (o othewse kenel ponts appea only once) (whch holds tue due to condton (3.2)), then m 0 when both and coespond to kenel ponts. Poof of Theoem 3.2. We take nto account that n computng equaton (2.5), that s, M zz x z, the th element of z s computed usng the elements of the th ow of Mzz accodng to equaton (2.4) as follows n ( z ), 1,..., m x n 1 We dstngush the followng cases 1. Index of lne,, of Mzz does not coespond to any kenel pont of any kenel vecto. In ths case accodng to Theoem 3.1 m 0,, and theefoe n n m x x 1 1 ( ) 0. The last equaton holds because thee s the plausble assumpton that at least one element of the nput vecto x s of zeo value. 2. Index of lne,, of Mzz coesponds to a kenel pont of kenel vecto z. In ths case, accodng to Theoem 3.1, ( m 1, ), except when the column ndex () coesponds to a kenel pont of the same kenel vecto z. In ths case m 0.Theefoe, n ( m ) x 1 0 f x 0 : ke npont s ( (1 x), (0 x) ) ke npo nt s ke npo nt s 1 othewse In the above notaton an ndex,, s sad to belong to the kenel ponts f the element of the kenel vecto havng the same ndex,, s a kenel pont. The above equaton poves that a kenel vecto z can be ecalled by equaton (2.5) only f all the elements of the nput vecto x, whch coespond to kenel ponts, have the value 1. In othe wods, f even one element of the nput vecto, whch coesponds to a kenel pont, s ht by eosve nose then equaton (2.5) ecalls nothng and so does equaton (2.9). 162 ComSIS Vol. 8, No. 1, Januay 11

23 A new method fo constuctng kenel vectos n mophologcal assocatve memoes of bnay Poof of Theoem 4.1. To pove the theoem we stat fom the fomula (A.1), whch computes the elements of Mzz. Now, the new kenel vectos ae used. In geneal the ntenal tem ( z z ) can take values fom the set {-1, - 0.8, -0.7, -0.6, -0.4, -0.2, -0.1, 0,, 0.1, 0.2, 0.3, 0.4, 0.6, 0.8, 1} wth the exteme values to appea as follows (a) z z 0. Ths happens when fo a specfc both z and z ae kenel ponts of the same value (stength). (b) z z 1 Ths happens when fo a specfc z s one of the stongest kenel ponts (value 1) and and z s not a kenel pont (value 0) (c) z z 1 Ths happens when fo a specfc z s one of the stongest kenel ponts z s not a kenel ponts Takng now nto account that (A.1) s computed by takng the maxmum of all the ntenal tems ( z z ) fo 1 pwe conclude the followng. (1) If ndex does not coespond to any kenel pont of any kenel vecto then z 0,. Consequently, fo each ( z z ), 1 p takes the values 0, -0.4, -0.7, -0.8, 1. Theefoe, the maxmum of these values s 0 and theefoe m 0,. (2) If ndex coesponds to a kenel pont wth value z 1 (fequency 1), then m I 1 1, 0.6, 0.3, 0.2, 0 wth the value m 1 beng the most fequent. It has to be noted that the values of m ae fomed by ( z z ) of kenel only. The values ( z z ), ae always smalle snce z 0 (Fequency 1 means only z 1) The values of m ae esolved as follows: m 1, f z 0, m 0.6, f z 0.4, m 0.3, f z 0.7, m 0.2, f z 0.8, m 0, f z 1 (3) If ndex coesponds to a kenel pont wth value z 0.8 (fequency 2), then m I 2 0.8, 0.4, 0.1, 0 wth the value m 0.8 beng the most fequent. Fo the fomaton of m only two kenel vectos ae actually esponsble, whch have z 0.8. We call ths set of (two) kenels as fomng se and denote t as F. The values of ( z z ), F ae always smalle snce z 0 F (Fequency 2 means only two z 0.8, F ) The values of m ae esolved as follows: m 0.8 f z 0,at least fo one F m 0.4 f z 0.4, at least fo one F and fo the emanng z 0.4 ComSIS Vol. 8, No. 1, Januay

Distinct 8-QAM+ Perfect Arrays Fanxin Zeng 1, a, Zhenyu Zhang 2,1, b, Linjie Qian 1, c

Distinct 8-QAM+ Perfect Arrays Fanxin Zeng 1, a, Zhenyu Zhang 2,1, b, Linjie Qian 1, c nd Intenatonal Confeence on Electcal Compute Engneeng and Electoncs (ICECEE 15) Dstnct 8-QAM+ Pefect Aays Fanxn Zeng 1 a Zhenyu Zhang 1 b Lnje Qan 1 c 1 Chongqng Key Laboatoy of Emegency Communcaton Chongqng

More information

Set of square-integrable function 2 L : function space F

Set of square-integrable function 2 L : function space F Set of squae-ntegable functon L : functon space F Motvaton: In ou pevous dscussons we have seen that fo fee patcles wave equatons (Helmholt o Schödnge) can be expessed n tems of egenvalue equatons. H E,

More information

Multistage Median Ranked Set Sampling for Estimating the Population Median

Multistage Median Ranked Set Sampling for Estimating the Population Median Jounal of Mathematcs and Statstcs 3 (: 58-64 007 ISSN 549-3644 007 Scence Publcatons Multstage Medan Ranked Set Samplng fo Estmatng the Populaton Medan Abdul Azz Jeman Ame Al-Oma and Kamaulzaman Ibahm

More information

Exact Simplification of Support Vector Solutions

Exact Simplification of Support Vector Solutions Jounal of Machne Leanng Reseach 2 (200) 293-297 Submtted 3/0; Publshed 2/0 Exact Smplfcaton of Suppot Vecto Solutons Tom Downs TD@ITEE.UQ.EDU.AU School of Infomaton Technology and Electcal Engneeng Unvesty

More information

APPLICATIONS OF SEMIGENERALIZED -CLOSED SETS

APPLICATIONS OF SEMIGENERALIZED -CLOSED SETS Intenatonal Jounal of Mathematcal Engneeng Scence ISSN : 22776982 Volume Issue 4 (Apl 202) http://www.mes.com/ https://stes.google.com/ste/mesounal/ APPLICATIONS OF SEMIGENERALIZED CLOSED SETS G.SHANMUGAM,

More information

8 Baire Category Theorem and Uniform Boundedness

8 Baire Category Theorem and Uniform Boundedness 8 Bae Categoy Theoem and Unfom Boundedness Pncple 8.1 Bae s Categoy Theoem Valdty of many esults n analyss depends on the completeness popety. Ths popety addesses the nadequacy of the system of atonal

More information

Rigid Bodies: Equivalent Systems of Forces

Rigid Bodies: Equivalent Systems of Forces Engneeng Statcs, ENGR 2301 Chapte 3 Rgd Bodes: Equvalent Sstems of oces Intoducton Teatment of a bod as a sngle patcle s not alwas possble. In geneal, the se of the bod and the specfc ponts of applcaton

More information

P 365. r r r )...(1 365

P 365. r r r )...(1 365 SCIENCE WORLD JOURNAL VOL (NO4) 008 www.scecncewoldounal.og ISSN 597-64 SHORT COMMUNICATION ANALYSING THE APPROXIMATION MODEL TO BIRTHDAY PROBLEM *CHOJI, D.N. & DEME, A.C. Depatment of Mathematcs Unvesty

More information

If there are k binding constraints at x then re-label these constraints so that they are the first k constraints.

If there are k binding constraints at x then re-label these constraints so that they are the first k constraints. Mathematcal Foundatons -1- Constaned Optmzaton Constaned Optmzaton Ma{ f ( ) X} whee X {, h ( ), 1,, m} Necessay condtons fo to be a soluton to ths mamzaton poblem Mathematcally, f ag Ma{ f ( ) X}, then

More information

3. A Review of Some Existing AW (BT, CT) Algorithms

3. A Review of Some Existing AW (BT, CT) Algorithms 3. A Revew of Some Exstng AW (BT, CT) Algothms In ths secton, some typcal ant-wndp algothms wll be descbed. As the soltons fo bmpless and condtoned tansfe ae smla to those fo ant-wndp, the pesented algothms

More information

Physics 2A Chapter 11 - Universal Gravitation Fall 2017

Physics 2A Chapter 11 - Universal Gravitation Fall 2017 Physcs A Chapte - Unvesal Gavtaton Fall 07 hese notes ae ve pages. A quck summay: he text boxes n the notes contan the esults that wll compse the toolbox o Chapte. hee ae thee sectons: the law o gavtaton,

More information

The Greatest Deviation Correlation Coefficient and its Geometrical Interpretation

The Greatest Deviation Correlation Coefficient and its Geometrical Interpretation By Rudy A. Gdeon The Unvesty of Montana The Geatest Devaton Coelaton Coeffcent and ts Geometcal Intepetaton The Geatest Devaton Coelaton Coeffcent (GDCC) was ntoduced by Gdeon and Hollste (987). The GDCC

More information

Generating Functions, Weighted and Non-Weighted Sums for Powers of Second-Order Recurrence Sequences

Generating Functions, Weighted and Non-Weighted Sums for Powers of Second-Order Recurrence Sequences Geneatng Functons, Weghted and Non-Weghted Sums fo Powes of Second-Ode Recuence Sequences Pantelmon Stăncă Aubun Unvesty Montgomey, Depatment of Mathematcs Montgomey, AL 3614-403, USA e-mal: stanca@studel.aum.edu

More information

Scalars and Vectors Scalar

Scalars and Vectors Scalar Scalas and ectos Scala A phscal quantt that s completel chaacteed b a eal numbe (o b ts numecal value) s called a scala. In othe wods a scala possesses onl a magntude. Mass denst volume tempeatue tme eneg

More information

Tian Zheng Department of Statistics Columbia University

Tian Zheng Department of Statistics Columbia University Haplotype Tansmsson Assocaton (HTA) An "Impotance" Measue fo Selectng Genetc Makes Tan Zheng Depatment of Statstcs Columba Unvesty Ths s a jont wok wth Pofesso Shaw-Hwa Lo n the Depatment of Statstcs at

More information

UNIT10 PLANE OF REGRESSION

UNIT10 PLANE OF REGRESSION UIT0 PLAE OF REGRESSIO Plane of Regesson Stuctue 0. Intoducton Ojectves 0. Yule s otaton 0. Plane of Regesson fo thee Vaales 0.4 Popetes of Resduals 0.5 Vaance of the Resduals 0.6 Summay 0.7 Solutons /

More information

Groupoid and Topological Quotient Group

Groupoid and Topological Quotient Group lobal Jounal of Pue and Appled Mathematcs SSN 0973-768 Volume 3 Numbe 7 07 pp 373-39 Reseach nda Publcatons http://wwwpublcatoncom oupod and Topolocal Quotent oup Mohammad Qasm Manna Depatment of Mathematcs

More information

A. Thicknesses and Densities

A. Thicknesses and Densities 10 Lab0 The Eath s Shells A. Thcknesses and Denstes Any theoy of the nteo of the Eath must be consstent wth the fact that ts aggegate densty s 5.5 g/cm (ecall we calculated ths densty last tme). In othe

More information

Machine Learning. Spectral Clustering. Lecture 23, April 14, Reading: Eric Xing 1

Machine Learning. Spectral Clustering. Lecture 23, April 14, Reading: Eric Xing 1 Machne Leanng -7/5 7/5-78, 78, Spng 8 Spectal Clusteng Ec Xng Lectue 3, pl 4, 8 Readng: Ec Xng Data Clusteng wo dffeent ctea Compactness, e.g., k-means, mxtue models Connectvty, e.g., spectal clusteng

More information

SOME NEW SELF-DUAL [96, 48, 16] CODES WITH AN AUTOMORPHISM OF ORDER 15. KEYWORDS: automorphisms, construction, self-dual codes

SOME NEW SELF-DUAL [96, 48, 16] CODES WITH AN AUTOMORPHISM OF ORDER 15. KEYWORDS: automorphisms, construction, self-dual codes Факултет по математика и информатика, том ХVІ С, 014 SOME NEW SELF-DUAL [96, 48, 16] CODES WITH AN AUTOMORPHISM OF ORDER 15 NIKOLAY I. YANKOV ABSTRACT: A new method fo constuctng bnay self-dual codes wth

More information

Energy in Closed Systems

Energy in Closed Systems Enegy n Closed Systems Anamta Palt palt.anamta@gmal.com Abstact The wtng ndcates a beakdown of the classcal laws. We consde consevaton of enegy wth a many body system n elaton to the nvese squae law and

More information

Thermodynamics of solids 4. Statistical thermodynamics and the 3 rd law. Kwangheon Park Kyung Hee University Department of Nuclear Engineering

Thermodynamics of solids 4. Statistical thermodynamics and the 3 rd law. Kwangheon Park Kyung Hee University Department of Nuclear Engineering Themodynamcs of solds 4. Statstcal themodynamcs and the 3 d law Kwangheon Pak Kyung Hee Unvesty Depatment of Nuclea Engneeng 4.1. Intoducton to statstcal themodynamcs Classcal themodynamcs Statstcal themodynamcs

More information

Engineering Mechanics. Force resultants, Torques, Scalar Products, Equivalent Force systems

Engineering Mechanics. Force resultants, Torques, Scalar Products, Equivalent Force systems Engneeng echancs oce esultants, Toques, Scala oducts, Equvalent oce sstems Tata cgaw-hll Companes, 008 Resultant of Two oces foce: acton of one bod on anothe; chaacteed b ts pont of applcaton, magntude,

More information

Optimization Methods: Linear Programming- Revised Simplex Method. Module 3 Lecture Notes 5. Revised Simplex Method, Duality and Sensitivity analysis

Optimization Methods: Linear Programming- Revised Simplex Method. Module 3 Lecture Notes 5. Revised Simplex Method, Duality and Sensitivity analysis Optmzaton Meods: Lnea Pogammng- Revsed Smple Meod Module Lectue Notes Revsed Smple Meod, Dualty and Senstvty analyss Intoducton In e pevous class, e smple meod was dscussed whee e smple tableau at each

More information

ON THE FRESNEL SINE INTEGRAL AND THE CONVOLUTION

ON THE FRESNEL SINE INTEGRAL AND THE CONVOLUTION IJMMS 3:37, 37 333 PII. S16117131151 http://jmms.hndaw.com Hndaw Publshng Cop. ON THE FRESNEL SINE INTEGRAL AND THE CONVOLUTION ADEM KILIÇMAN Receved 19 Novembe and n evsed fom 7 Mach 3 The Fesnel sne

More information

Experimental study on parameter choices in norm-r support vector regression machines with noisy input

Experimental study on parameter choices in norm-r support vector regression machines with noisy input Soft Comput 006) 0: 9 3 DOI 0.007/s00500-005-0474-z ORIGINAL PAPER S. Wang J. Zhu F. L. Chung Hu Dewen Expemental study on paamete choces n nom- suppot vecto egesson machnes wth nosy nput Publshed onlne:

More information

Khintchine-Type Inequalities and Their Applications in Optimization

Khintchine-Type Inequalities and Their Applications in Optimization Khntchne-Type Inequaltes and The Applcatons n Optmzaton Anthony Man-Cho So Depatment of Systems Engneeng & Engneeng Management The Chnese Unvesty of Hong Kong ISDS-Kolloquum Unvestaet Wen 29 June 2009

More information

Correspondence Analysis & Related Methods

Correspondence Analysis & Related Methods Coespondence Analyss & Related Methods Ineta contbutons n weghted PCA PCA s a method of data vsualzaton whch epesents the tue postons of ponts n a map whch comes closest to all the ponts, closest n sense

More information

GENERALIZATION OF AN IDENTITY INVOLVING THE GENERALIZED FIBONACCI NUMBERS AND ITS APPLICATIONS

GENERALIZATION OF AN IDENTITY INVOLVING THE GENERALIZED FIBONACCI NUMBERS AND ITS APPLICATIONS #A39 INTEGERS 9 (009), 497-513 GENERALIZATION OF AN IDENTITY INVOLVING THE GENERALIZED FIBONACCI NUMBERS AND ITS APPLICATIONS Mohaad Faokh D. G. Depatent of Matheatcs, Fedows Unvesty of Mashhad, Mashhad,

More information

Test 1 phy What mass of a material with density ρ is required to make a hollow spherical shell having inner radius r i and outer radius r o?

Test 1 phy What mass of a material with density ρ is required to make a hollow spherical shell having inner radius r i and outer radius r o? Test 1 phy 0 1. a) What s the pupose of measuement? b) Wte all fou condtons, whch must be satsfed by a scala poduct. (Use dffeent symbols to dstngush opeatons on ectos fom opeatons on numbes.) c) What

More information

Integral Vector Operations and Related Theorems Applications in Mechanics and E&M

Integral Vector Operations and Related Theorems Applications in Mechanics and E&M Dola Bagayoko (0) Integal Vecto Opeatons and elated Theoems Applcatons n Mechancs and E&M Ι Basc Defnton Please efe to you calculus evewed below. Ι, ΙΙ, andιιι notes and textbooks fo detals on the concepts

More information

A Brief Guide to Recognizing and Coping With Failures of the Classical Regression Assumptions

A Brief Guide to Recognizing and Coping With Failures of the Classical Regression Assumptions A Bef Gude to Recognzng and Copng Wth Falues of the Classcal Regesson Assumptons Model: Y 1 k X 1 X fxed n epeated samples IID 0, I. Specfcaton Poblems A. Unnecessay explanatoy vaables 1. OLS s no longe

More information

VISUALIZATION OF THE ABSTRACT THEORIES IN DSP COURSE BASED ON CDIO CONCEPT

VISUALIZATION OF THE ABSTRACT THEORIES IN DSP COURSE BASED ON CDIO CONCEPT VISUALIZATION OF THE ABSTRACT THEORIES IN DSP COURSE BASED ON CDIO CONCEPT Wang L-uan, L Jan, Zhen Xao-qong Chengdu Unvesty of Infomaton Technology ABSTRACT The pape analyzes the chaactestcs of many fomulas

More information

Amplifier Constant Gain and Noise

Amplifier Constant Gain and Noise Amplfe Constant Gan and ose by Manfed Thumm and Wene Wesbeck Foschungszentum Kalsuhe n de Helmholtz - Gemenschaft Unvestät Kalsuhe (TH) Reseach Unvesty founded 85 Ccles of Constant Gan (I) If s taken to

More information

An Approach to Inverse Fuzzy Arithmetic

An Approach to Inverse Fuzzy Arithmetic An Appoach to Invese Fuzzy Athmetc Mchael Hanss Insttute A of Mechancs, Unvesty of Stuttgat Stuttgat, Gemany mhanss@mechaun-stuttgatde Abstact A novel appoach of nvese fuzzy athmetc s ntoduced to successfully

More information

Efficiency of the principal component Liu-type estimator in logistic

Efficiency of the principal component Liu-type estimator in logistic Effcency of the pncpal component Lu-type estmato n logstc egesson model Jbo Wu and Yasn Asa 2 School of Mathematcs and Fnance, Chongqng Unvesty of Ats and Scences, Chongqng, Chna 2 Depatment of Mathematcs-Compute

More information

CS649 Sensor Networks IP Track Lecture 3: Target/Source Localization in Sensor Networks

CS649 Sensor Networks IP Track Lecture 3: Target/Source Localization in Sensor Networks C649 enso etwoks IP Tack Lectue 3: Taget/ouce Localaton n enso etwoks I-Jeng Wang http://hng.cs.jhu.edu/wsn06/ png 006 C 649 Taget/ouce Localaton n Weless enso etwoks Basc Poblem tatement: Collaboatve

More information

PHYS 705: Classical Mechanics. Derivation of Lagrange Equations from D Alembert s Principle

PHYS 705: Classical Mechanics. Derivation of Lagrange Equations from D Alembert s Principle 1 PHYS 705: Classcal Mechancs Devaton of Lagange Equatons fom D Alembet s Pncple 2 D Alembet s Pncple Followng a smla agument fo the vtual dsplacement to be consstent wth constants,.e, (no vtual wok fo

More information

4 SingularValue Decomposition (SVD)

4 SingularValue Decomposition (SVD) /6/00 Z:\ jeh\self\boo Kannan\Jan-5-00\4 SVD 4 SngulaValue Decomposton (SVD) Chapte 4 Pat SVD he sngula value decomposton of a matx s the factozaton of nto the poduct of thee matces = UDV whee the columns

More information

Re-Ranking Retrieval Model Based on Two-Level Similarity Relation Matrices

Re-Ranking Retrieval Model Based on Two-Level Similarity Relation Matrices Intenatonal Jounal of Softwae Engneeng and Its Applcatons, pp. 349-360 http://dx.do.og/10.1457/sea.015.9.1.31 Re-Rankng Reteval Model Based on Two-Level Smlaty Relaton Matces Hee-Ju Eun Depatment of Compute

More information

Dirichlet Mixture Priors: Inference and Adjustment

Dirichlet Mixture Priors: Inference and Adjustment Dchlet Mxtue Pos: Infeence and Adustment Xugang Ye (Wokng wth Stephen Altschul and Y Kuo Yu) Natonal Cante fo Botechnology Infomaton Motvaton Real-wold obects Independent obsevatons Categocal data () (2)

More information

Ranks of quotients, remainders and p-adic digits of matrices

Ranks of quotients, remainders and p-adic digits of matrices axv:1401.6667v2 [math.nt] 31 Jan 2014 Ranks of quotents, emandes and p-adc dgts of matces Mustafa Elshekh Andy Novocn Mak Gesbecht Abstact Fo a pme p and a matx A Z n n, wte A as A = p(a quo p)+ (A em

More information

Research Article Incremental Tensor Principal Component Analysis for Handwritten Digit Recognition

Research Article Incremental Tensor Principal Component Analysis for Handwritten Digit Recognition Hndaw Publshng Copoaton athematcal Poblems n Engneeng, Atcle ID 89758, 0 pages http://dx.do.og/0.55/04/89758 Reseach Atcle Incemental enso Pncpal Component Analyss fo Handwtten Dgt Recognton Chang Lu,,

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 151 Lectue 18 Hamltonan Equatons of Moton (Chapte 8) What s Ahead We ae statng Hamltonan fomalsm Hamltonan equaton Today and 11/6 Canoncal tansfomaton 1/3, 1/5, 1/10 Close lnk to non-elatvstc

More information

Constraint Score: A New Filter Method for Feature Selection with Pairwise Constraints

Constraint Score: A New Filter Method for Feature Selection with Pairwise Constraints onstant Scoe: A New Flte ethod fo Featue Selecton wth Pawse onstants Daoqang Zhang, Songcan hen and Zh-Hua Zhou Depatment of ompute Scence and Engneeng Nanjng Unvesty of Aeonautcs and Astonautcs, Nanjng

More information

Links in edge-colored graphs

Links in edge-colored graphs Lnks n edge-coloed gaphs J.M. Becu, M. Dah, Y. Manoussaks, G. Mendy LRI, Bât. 490, Unvesté Pas-Sud 11, 91405 Osay Cedex, Fance Astact A gaph s k-lnked (k-edge-lnked), k 1, f fo each k pas of vetces x 1,

More information

Chapter 23: Electric Potential

Chapter 23: Electric Potential Chapte 23: Electc Potental Electc Potental Enegy It tuns out (won t show ths) that the tostatc foce, qq 1 2 F ˆ = k, s consevatve. 2 Recall, fo any consevatve foce, t s always possble to wte the wok done

More information

Machine Learning 4771

Machine Learning 4771 Machne Leanng 4771 Instucto: Tony Jebaa Topc 6 Revew: Suppot Vecto Machnes Pmal & Dual Soluton Non-sepaable SVMs Kenels SVM Demo Revew: SVM Suppot vecto machnes ae (n the smplest case) lnea classfes that

More information

q-bernstein polynomials and Bézier curves

q-bernstein polynomials and Bézier curves Jounal of Computatonal and Appled Mathematcs 151 (2003) 1-12 q-bensten polynomals and Béze cuves Hall Ouç a, and Geoge M. Phllps b a Depatment of Mathematcs, Dokuz Eylül Unvesty Fen Edebyat Fakültes, Tınaztepe

More information

Bayesian Assessment of Availabilities and Unavailabilities of Multistate Monotone Systems

Bayesian Assessment of Availabilities and Unavailabilities of Multistate Monotone Systems Dept. of Math. Unvesty of Oslo Statstcal Reseach Repot No 3 ISSN 0806 3842 June 2010 Bayesan Assessment of Avalabltes and Unavalabltes of Multstate Monotone Systems Bent Natvg Jøund Gåsemy Tond Retan June

More information

Vibration Input Identification using Dynamic Strain Measurement

Vibration Input Identification using Dynamic Strain Measurement Vbaton Input Identfcaton usng Dynamc Stan Measuement Takum ITOFUJI 1 ;TakuyaYOSHIMURA ; 1, Tokyo Metopoltan Unvesty, Japan ABSTRACT Tansfe Path Analyss (TPA) has been conducted n ode to mpove the nose

More information

Learning the structure of Bayesian belief networks

Learning the structure of Bayesian belief networks Lectue 17 Leanng the stuctue of Bayesan belef netwoks Mlos Hauskecht mlos@cs.ptt.edu 5329 Sennott Squae Leanng of BBN Leanng. Leanng of paametes of condtonal pobabltes Leanng of the netwok stuctue Vaables:

More information

Contact, information, consultations

Contact, information, consultations ontact, nfomaton, consultatons hemsty A Bldg; oom 07 phone: 058-347-769 cellula: 664 66 97 E-mal: wojtek_c@pg.gda.pl Offce hous: Fday, 9-0 a.m. A quote of the week (o camel of the week): hee s no expedence

More information

4 Recursive Linear Predictor

4 Recursive Linear Predictor 4 Recusve Lnea Pedcto The man objectve of ths chapte s to desgn a lnea pedcto wthout havng a po knowledge about the coelaton popetes of the nput sgnal. In the conventonal lnea pedcto the known coelaton

More information

VParC: A Compression Scheme for Numeric Data in Column-Oriented Databases

VParC: A Compression Scheme for Numeric Data in Column-Oriented Databases The Intenatonal Aab Jounal of Infomaton Technology VPaC: A Compesson Scheme fo Numec Data n Column-Oented Databases Ke Yan, Hong Zhu, and Kevn Lü School of Compute Scence and Technology, Huazhong Unvesty

More information

Chapter Fifiteen. Surfaces Revisited

Chapter Fifiteen. Surfaces Revisited Chapte Ffteen ufaces Revsted 15.1 Vecto Descpton of ufaces We look now at the vey specal case of functons : D R 3, whee D R s a nce subset of the plane. We suppose s a nce functon. As the pont ( s, t)

More information

Observer Design for Takagi-Sugeno Descriptor System with Lipschitz Constraints

Observer Design for Takagi-Sugeno Descriptor System with Lipschitz Constraints Intenatonal Jounal of Instumentaton and Contol Systems (IJICS) Vol., No., Apl Obseve Desgn fo akag-sugeno Descpto System wth Lpschtz Constants Klan Ilhem,Jab Dalel, Bel Hadj Al Saloua and Abdelkm Mohamed

More information

COMPLEMENTARY ENERGY METHOD FOR CURVED COMPOSITE BEAMS

COMPLEMENTARY ENERGY METHOD FOR CURVED COMPOSITE BEAMS ultscence - XXX. mcocd Intenatonal ultdscplnay Scentfc Confeence Unvesty of skolc Hungay - pl 06 ISBN 978-963-358-3- COPLEENTRY ENERGY ETHOD FOR CURVED COPOSITE BES Ákos József Lengyel István Ecsed ssstant

More information

Physics Exam 3

Physics Exam 3 Physcs 114 1 Exam 3 The numbe of ponts fo each secton s noted n backets, []. Choose a total of 35 ponts that wll be gaded that s you may dop (not answe) a total of 5 ponts. Clealy mak on the cove of you

More information

On Maneuvering Target Tracking with Online Observed Colored Glint Noise Parameter Estimation

On Maneuvering Target Tracking with Online Observed Colored Glint Noise Parameter Estimation Wold Academy of Scence, Engneeng and Technology 6 7 On Maneuveng Taget Tacng wth Onlne Obseved Coloed Glnt Nose Paamete Estmaton M. A. Masnad-Sha, and S. A. Banan Abstact In ths pape a compehensve algothm

More information

A Study about One-Dimensional Steady State. Heat Transfer in Cylindrical and. Spherical Coordinates

A Study about One-Dimensional Steady State. Heat Transfer in Cylindrical and. Spherical Coordinates Appled Mathematcal Scences, Vol. 7, 03, no. 5, 67-633 HIKARI Ltd, www.m-hka.com http://dx.do.og/0.988/ams.03.38448 A Study about One-Dmensonal Steady State Heat ansfe n ylndcal and Sphecal oodnates Lesson

More information

CEEP-BIT WORKING PAPER SERIES. Efficiency evaluation of multistage supply chain with data envelopment analysis models

CEEP-BIT WORKING PAPER SERIES. Efficiency evaluation of multistage supply chain with data envelopment analysis models CEEP-BIT WORKING PPER SERIES Effcency evaluaton of multstage supply chan wth data envelopment analyss models Ke Wang Wokng Pape 48 http://ceep.bt.edu.cn/englsh/publcatons/wp/ndex.htm Cente fo Enegy and

More information

Pearson s Chi-Square Test Modifications for Comparison of Unweighted and Weighted Histograms and Two Weighted Histograms

Pearson s Chi-Square Test Modifications for Comparison of Unweighted and Weighted Histograms and Two Weighted Histograms Peason s Chi-Squae Test Modifications fo Compaison of Unweighted and Weighted Histogams and Two Weighted Histogams Univesity of Akueyi, Bogi, v/noduslód, IS-6 Akueyi, Iceland E-mail: nikolai@unak.is Two

More information

Robust Feature Induction for Support Vector Machines

Robust Feature Induction for Support Vector Machines Robust Featue Inducton fo Suppot Vecto Machnes Rong Jn Depatment of Compute Scence and Engneeng, Mchgan State Unvesty, East Lansng, MI4884 ROGJI@CSE.MSU.EDU Huan Lu Depatment of Compute Scence and Engneeng,

More information

Optimal System for Warm Standby Components in the Presence of Standby Switching Failures, Two Types of Failures and General Repair Time

Optimal System for Warm Standby Components in the Presence of Standby Switching Failures, Two Types of Failures and General Repair Time Intenatonal Jounal of ompute Applcatons (5 ) Volume 44 No, Apl Optmal System fo Wam Standby omponents n the esence of Standby Swtchng Falues, Two Types of Falues and Geneal Repa Tme Mohamed Salah EL-Shebeny

More information

Pattern Analyses (EOF Analysis) Introduction Definition of EOFs Estimation of EOFs Inference Rotated EOFs

Pattern Analyses (EOF Analysis) Introduction Definition of EOFs Estimation of EOFs Inference Rotated EOFs Patten Analyses (EOF Analyss) Intoducton Defnton of EOFs Estmaton of EOFs Infeence Rotated EOFs . Patten Analyses Intoducton: What s t about? Patten analyses ae technques used to dentfy pattens of the

More information

V. Principles of Irreversible Thermodynamics. s = S - S 0 (7.3) s = = - g i, k. "Flux": = da i. "Force": = -Â g a ik k = X i. Â J i X i (7.

V. Principles of Irreversible Thermodynamics. s = S - S 0 (7.3) s = = - g i, k. Flux: = da i. Force: = -Â g a ik k = X i. Â J i X i (7. Themodynamcs and Knetcs of Solds 71 V. Pncples of Ievesble Themodynamcs 5. Onsage s Teatment s = S - S 0 = s( a 1, a 2,...) a n = A g - A n (7.6) Equlbum themodynamcs detemnes the paametes of an equlbum

More information

Part V: Velocity and Acceleration Analysis of Mechanisms

Part V: Velocity and Acceleration Analysis of Mechanisms Pat V: Velocty an Acceleaton Analyss of Mechansms Ths secton wll evew the most common an cuently pactce methos fo completng the knematcs analyss of mechansms; escbng moton though velocty an acceleaton.

More information

Molecular Dynamic Simulations of Nickel Nanowires at Various Temperatures

Molecular Dynamic Simulations of Nickel Nanowires at Various Temperatures Intenatonal Jounal of Scentfc and Innovatve Mathematcal Reseach (IJSIMR Volume 2, Issue 3, Mach 204, PP 30-305 ISS 2347-307X (Pnt & ISS 2347-342 (Onlne www.acounals.og Molecula Dynamc Smulatons of ckel

More information

On the Latency Bound of Deficit Round Robin

On the Latency Bound of Deficit Round Robin Poceedngs of the Intenatonal Confeence on Compute Communcatons and Netwoks Mam, Floda, USA, Octobe 4 6, 22 On the Latency Bound of Defct Round Robn Sall S. Kanhee and Hash Sethu Depatment of ECE, Dexel

More information

Transport Coefficients For A GaAs Hydro dynamic Model Extracted From Inhomogeneous Monte Carlo Calculations

Transport Coefficients For A GaAs Hydro dynamic Model Extracted From Inhomogeneous Monte Carlo Calculations Tanspot Coeffcents Fo A GaAs Hydo dynamc Model Extacted Fom Inhomogeneous Monte Calo Calculatons MeKe Ieong and Tngwe Tang Depatment of Electcal and Compute Engneeng Unvesty of Massachusetts, Amhest MA

More information

Backward Haplotype Transmission Association (BHTA) Algorithm. Tian Zheng Department of Statistics Columbia University. February 5 th, 2002

Backward Haplotype Transmission Association (BHTA) Algorithm. Tian Zheng Department of Statistics Columbia University. February 5 th, 2002 Backwad Haplotype Tansmsson Assocaton (BHTA) Algothm A Fast ult-pont Sceenng ethod fo Complex Tats Tan Zheng Depatment of Statstcs Columba Unvesty Febuay 5 th, 2002 Ths s a jont wok wth Pofesso Shaw-Hwa

More information

LASER ABLATION ICP-MS: DATA REDUCTION

LASER ABLATION ICP-MS: DATA REDUCTION Lee, C-T A Lase Ablaton Data educton 2006 LASE ABLATON CP-MS: DATA EDUCTON Cn-Ty A. Lee 24 Septembe 2006 Analyss and calculaton of concentatons Lase ablaton analyses ae done n tme-esolved mode. A ~30 s

More information

A Method of Reliability Target Setting for Electric Power Distribution Systems Using Data Envelopment Analysis

A Method of Reliability Target Setting for Electric Power Distribution Systems Using Data Envelopment Analysis 27 กก ก 9 2-3 2554 ก ก ก A Method of Relablty aget Settng fo Electc Powe Dstbuton Systems Usng Data Envelopment Analyss ก 2 ก ก ก ก ก 0900 2 ก ก ก ก ก 0900 E-mal: penjan262@hotmal.com Penjan Sng-o Psut

More information

A NOTE ON ELASTICITY ESTIMATION OF CENSORED DEMAND

A NOTE ON ELASTICITY ESTIMATION OF CENSORED DEMAND Octobe 003 B 003-09 A NOT ON ASTICITY STIATION OF CNSOD DAND Dansheng Dong an Hay. Kase Conell nvesty Depatment of Apple conomcs an anagement College of Agcultue an fe Scences Conell nvesty Ithaca New

More information

N = N t ; t 0. N is the number of claims paid by the

N = N t ; t 0. N is the number of claims paid by the Iulan MICEA, Ph Mhaela COVIG, Ph Canddate epatment of Mathematcs The Buchaest Academy of Economc Studes an CECHIN-CISTA Uncedt Tac Bank, Lugoj SOME APPOXIMATIONS USE IN THE ISK POCESS OF INSUANCE COMPANY

More information

Budding yeast colony growth study based on circular granular cell

Budding yeast colony growth study based on circular granular cell Jounal of Physcs: Confeence Sees PAPER OPEN ACCESS Buddng yeast colony gowth study based on ccula ganula cell To cte ths atcle: Dev Apant et al 2016 J. Phys.: Conf. Se. 739 012026 Vew the atcle onlne fo

More information

Using DP for hierarchical discretization of continuous attributes. Amit Goyal (31 st March 2008)

Using DP for hierarchical discretization of continuous attributes. Amit Goyal (31 st March 2008) Usng DP fo heachcal dscetzaton of contnos attbtes Amt Goyal 31 st Mach 2008 Refeence Chng-Cheng Shen and Yen-Lang Chen. A dynamc-pogammng algothm fo heachcal dscetzaton of contnos attbtes. In Eopean Jonal

More information

A Novel Ordinal Regression Method with Minimum Class Variance Support Vector Machine

A Novel Ordinal Regression Method with Minimum Class Variance Support Vector Machine Intenatonal Confeence on Mateals Engneeng and Infomaton echnology Applcatons (MEIA 05) A ovel Odnal Regesson Method wth Mnmum Class Vaance Suppot Vecto Machne Jnong Hu,, a, Xaomng Wang and Zengx Huang

More information

Event Shape Update. T. Doyle S. Hanlon I. Skillicorn. A. Everett A. Savin. Event Shapes, A. Everett, U. Wisconsin ZEUS Meeting, October 15,

Event Shape Update. T. Doyle S. Hanlon I. Skillicorn. A. Everett A. Savin. Event Shapes, A. Everett, U. Wisconsin ZEUS Meeting, October 15, Event Shape Update A. Eveett A. Savn T. Doyle S. Hanlon I. Skllcon Event Shapes, A. Eveett, U. Wsconsn ZEUS Meetng, Octobe 15, 2003-1 Outlne Pogess of Event Shapes n DIS Smla to publshed pape: Powe Coecton

More information

Chapter I Matrices, Vectors, & Vector Calculus 1-1, 1-9, 1-10, 1-11, 1-17, 1-18, 1-25, 1-27, 1-36, 1-37, 1-41.

Chapter I Matrices, Vectors, & Vector Calculus 1-1, 1-9, 1-10, 1-11, 1-17, 1-18, 1-25, 1-27, 1-36, 1-37, 1-41. Chapte I Matces, Vectos, & Vecto Calculus -, -9, -0, -, -7, -8, -5, -7, -36, -37, -4. . Concept of a Scala Consde the aa of patcles shown n the fgue. he mass of the patcle at (,) can be epessed as. M (,

More information

Network Coding for Unicast: Exploiting Multicast Subgraphs to Achieve Capacity in 2-User Networks

Network Coding for Unicast: Exploiting Multicast Subgraphs to Achieve Capacity in 2-User Networks Netwok Codng fo Uncast: xplotng Multcast Subgaphs to Acheve Capacty n -Use Netwoks Jennfe Pce Taa Javd Depatment of lectcal Compute ngneeng Unvesty of Calfona, San Dego La Jolla, CA 9093 jenn-pce@ucsd.edu,

More information

Unconventional double-current circuit accuracy measures and application in twoparameter

Unconventional double-current circuit accuracy measures and application in twoparameter th IMEKO TC Wokshop on Techncal Dagnostcs dvanced measuement tools n techncal dagnostcs fo systems elablty and safety June 6-7 Wasaw Poland nconventonal double-cuent ccut accuacy measues and applcaton

More information

Physics 11b Lecture #2. Electric Field Electric Flux Gauss s Law

Physics 11b Lecture #2. Electric Field Electric Flux Gauss s Law Physcs 11b Lectue # Electc Feld Electc Flux Gauss s Law What We Dd Last Tme Electc chage = How object esponds to electc foce Comes n postve and negatve flavos Conseved Electc foce Coulomb s Law F Same

More information

(8) Gain Stage and Simple Output Stage

(8) Gain Stage and Simple Output Stage EEEB23 Electoncs Analyss & Desgn (8) Gan Stage and Smple Output Stage Leanng Outcome Able to: Analyze an example of a gan stage and output stage of a multstage amplfe. efeence: Neamen, Chapte 11 8.0) ntoducton

More information

PARAMETER ESTIMATION FOR TWO WEIBULL POPULATIONS UNDER JOINT TYPE II CENSORED SCHEME

PARAMETER ESTIMATION FOR TWO WEIBULL POPULATIONS UNDER JOINT TYPE II CENSORED SCHEME Sept 04 Vol 5 No 04 Intenatonal Jounal of Engneeng Appled Scences 0-04 EAAS & ARF All ghts eseed wwweaas-ounalog ISSN305-869 PARAMETER ESTIMATION FOR TWO WEIBULL POPULATIONS UNDER JOINT TYPE II CENSORED

More information

New problems in universal algebraic geometry illustrated by boolean equations

New problems in universal algebraic geometry illustrated by boolean equations New poblems in univesal algebaic geomety illustated by boolean equations axiv:1611.00152v2 [math.ra] 25 Nov 2016 Atem N. Shevlyakov Novembe 28, 2016 Abstact We discuss new poblems in univesal algebaic

More information

A Tutorial on Low Density Parity-Check Codes

A Tutorial on Low Density Parity-Check Codes A Tutoal on Low Densty Paty-Check Codes Tuan Ta The Unvesty of Texas at Austn Abstact Low densty paty-check codes ae one of the hottest topcs n codng theoy nowadays. Equpped wth vey fast encodng and decodng

More information

9/12/2013. Microelectronics Circuit Analysis and Design. Modes of Operation. Cross Section of Integrated Circuit npn Transistor

9/12/2013. Microelectronics Circuit Analysis and Design. Modes of Operation. Cross Section of Integrated Circuit npn Transistor Mcoelectoncs Ccut Analyss and Desgn Donald A. Neamen Chapte 5 The pola Juncton Tanssto In ths chapte, we wll: Dscuss the physcal stuctue and opeaton of the bpola juncton tanssto. Undestand the dc analyss

More information

THE REGRESSION MODEL OF TRANSMISSION LINE ICING BASED ON NEURAL NETWORKS

THE REGRESSION MODEL OF TRANSMISSION LINE ICING BASED ON NEURAL NETWORKS The 4th Intenatonal Wokshop on Atmosphec Icng of Stuctues, Chongqng, Chna, May 8 - May 3, 20 THE REGRESSION MODEL OF TRANSMISSION LINE ICING BASED ON NEURAL NETWORKS Sun Muxa, Da Dong*, Hao Yanpeng, Huang

More information

Physics 202, Lecture 2. Announcements

Physics 202, Lecture 2. Announcements Physcs 202, Lectue 2 Today s Topcs Announcements Electc Felds Moe on the Electc Foce (Coulomb s Law The Electc Feld Moton of Chaged Patcles n an Electc Feld Announcements Homewok Assgnment #1: WebAssgn

More information

Some Approximate Analytical Steady-State Solutions for Cylindrical Fin

Some Approximate Analytical Steady-State Solutions for Cylindrical Fin Some Appoxmate Analytcal Steady-State Solutons fo Cylndcal Fn ANITA BRUVERE ANDRIS BUIIS Insttute of Mathematcs and Compute Scence Unvesty of Latva Rana ulv 9 Rga LV459 LATVIA Astact: - In ths pape we

More information

Physica A 392 (2013) Contents lists available at SciVerse ScienceDirect. Physica A. journal homepage:

Physica A 392 (2013) Contents lists available at SciVerse ScienceDirect. Physica A. journal homepage: Physca A 392 (2013) 1318 1335 Contents lsts avalable at ScVese ScenceDect Physca A jounal homepage: www.elseve.com/locate/physa Themodynamcs n the lmt of evesble eactons A.N. Goban a,, E.M. Mkes b, G.S.

More information

The Backpropagation Algorithm

The Backpropagation Algorithm The Backpopagaton Algothm Achtectue of Feedfowad Netwok Sgmodal Thehold Functon Contuctng an Obectve Functon Tanng a one-laye netwok by teepet decent Tanng a two-laye netwok by teepet decent Copyght Robet

More information

Theo K. Dijkstra. Faculty of Economics and Business, University of Groningen, Nettelbosje 2, 9747 AE Groningen THE NETHERLANDS

Theo K. Dijkstra. Faculty of Economics and Business, University of Groningen, Nettelbosje 2, 9747 AE Groningen THE NETHERLANDS RESEARCH ESSAY COSISE PARIAL LEAS SQUARES PAH MODELIG heo K. Djksta Faculty of Economcs and Busness, Unvesty of Gonngen, ettelbosje, 9747 AE Gonngen HE EHERLADS {t.k.djksta@ug.nl} Jög Hensele Faculty of

More information

Closed-loop adaptive optics using a CMOS image quality metric sensor

Closed-loop adaptive optics using a CMOS image quality metric sensor Closed-loop adaptve optcs usng a CMOS mage qualty metc senso Chueh Tng, Mchael Gles, Adtya Rayankula, and Pual Futh Klpsch School of Electcal and Compute Engneeng ew Mexco State Unvesty Las Cuces, ew Mexco

More information

A New Approach for Deriving the Instability Potential for Plates Based on Rigid Body and Force Equilibrium Considerations

A New Approach for Deriving the Instability Potential for Plates Based on Rigid Body and Force Equilibrium Considerations Avalable onlne at www.scencedect.com Poceda Engneeng 4 (20) 4 22 The Twelfth East Asa-Pacfc Confeence on Stuctual Engneeng and Constucton A New Appoach fo Devng the Instablty Potental fo Plates Based on

More information

Approximate Abundance Histograms and Their Use for Genome Size Estimation

Approximate Abundance Histograms and Their Use for Genome Size Estimation J. Hlaváčová (Ed.): ITAT 2017 Poceedngs, pp. 27 34 CEUR Wokshop Poceedngs Vol. 1885, ISSN 1613-0073, c 2017 M. Lpovský, T. Vnař, B. Bejová Appoxmate Abundance Hstogams and The Use fo Genome Sze Estmaton

More information

19 The Born-Oppenheimer Approximation

19 The Born-Oppenheimer Approximation 9 The Bon-Oppenheme Appoxmaton The full nonelatvstc Hamltonan fo a molecule s gven by (n a.u.) Ĥ = A M A A A, Z A + A + >j j (883) Lets ewte the Hamltonan to emphasze the goal as Ĥ = + A A A, >j j M A

More information

CSU ATS601 Fall Other reading: Vallis 2.1, 2.2; Marshall and Plumb Ch. 6; Holton Ch. 2; Schubert Ch r or v i = v r + r (3.

CSU ATS601 Fall Other reading: Vallis 2.1, 2.2; Marshall and Plumb Ch. 6; Holton Ch. 2; Schubert Ch r or v i = v r + r (3. 3 Eath s Rotaton 3.1 Rotatng Famewok Othe eadng: Valls 2.1, 2.2; Mashall and Plumb Ch. 6; Holton Ch. 2; Schubet Ch. 3 Consde the poston vecto (the same as C n the fgue above) otatng at angula velocty.

More information