Registration of Multiple Laser Scans Based on 3D Contour Features

Size: px
Start display at page:

Download "Registration of Multiple Laser Scans Based on 3D Contour Features"

Transcription

1 Regstato of Multple Lase Scas Based o 3D Cotou Featues st Shaoxg HU, d Hogb ZHA, 3 d Awu ZHANG st School of Mechacal Egeeg & Automato, Beg Uvesty of Aeoautcs ad Astoautcs, Beg 83, d Natoal Laboatoy o Mache Pecepto, Peg Uvesty Beg 87, 3 d Msty of Educato of Key Laboatoy o 3D Ifomato Acqusto ad Applcato, Captal Nomal Uvesty, Beg 37 husx@buaa.edu.c, zhagaw63@63.com Abstact Whe 3D lase scae captues age data of eal scees, oe of most mpotat poblems s how to alg all age data to a commo coodate system. I ths pape, we popose a algothm of egstato of multple age data fom eal scees usg 3D cotou featues. Fstly, 3D cotou featues ae extacted usg self-adaptve cuve fttg, ad a seachg stuctue of octee s bult fom the 3D cotou featues. Secodly, usg mahalaobs dstace, the leaf odes ae matched betwee two scas to compute ogal tasfom matx, ad the tasfom matx s efed step by step though ICP utl a best tasfom matx s obtaed. Lastly, a ew global egstato stategy s gve based o the eaby pcple. The expemets of multple age data egstato fom doo scees, outdoo scees ad acet buldgs ae doe, ad the esults show the poposed algothm s obust. Keywods---lase scae, cotou featue, mahalaobs dstace, matchg, egstato.. Itoducto The techque of lase scag also called "eal scee epoducto techology", t ca dectly captues age data fom eal scees, ad t s useful a vaety of felds such as uclea powe plat, cultual elc, achaeology, achtectue, aeospace, avato, shppg, maufactue, mltay, taffc, publc secuty ad so o. The basc pocessg of lase age data cludg age data segmetato, egstato of age data, modelg, ad egstato s the most ey wo. At peset, age data egstato maly depeds o 5 appoaches: poecto appoach, taget appoach, cougate appoach, exteal coopeato appoach, suface match appoach. Poecto appoach, fo example, Zhao et al. poposed z- mage method [,], egstato s completed usg z- mage. It educes the complexty of algothm, but t fals to eep the 3D featue, ad the pecso of egstato s low. Taget appoach [3], t places the tagets the ovelap ego of the eghbog scas, the usg lase eflecto chaactestcs to the tagets, the tagets ae ecogzed automatcally. Supposed thee ae thee o moe tagets ovelap ego, we ca obta the coodates tasfom betwee the eghbog scas. Howeve, sometmes t s dffcult to ecogze tagets f thee ae some egos wth the same eflectve featue as tagets o agle betwee lase beam ad the taget plae s lttle small. Cougate appoach [4], by the teactve way, the plae s fomed fom pots of coplaa (o close to the coplaa, the coodate tasfom s computed by moe tha thee upaallel cougate plaes. Ths method must loo fo moe tha thee upaallel cougate plaes the ovelap ego, othewse, egstato fals. The exteal coopeato appoach [5], t use GPS to help egstato. But GPS ca t accept the sgal whee the buldgs ae hgh ad the aveues ae aow. Suface match appoach [6], f the measued obect has suface wth the ups ad dows, the egstato ca be completed though matchg suface the ovelap ego, ad suface match ca ot be fully automated geeally. These poblems let us to develop automatc egstato method wthout ay addtoal devces. Ths pape poposes a fast egstato algothm fo 3D lage-scale scee usg cotou featues. Fstly, cotou featues ae extacted usg self-adaptve cuve fttg, ad a seachg stuctue of octee s bult fom the 3D cotou featues. Secodly, usg mahalaobs dstace, the ogal tasfom s computed by matchg leaf odes betwee two scas, ad the tasfom s efed step by step though ICP utl a best tasfom s obtaed. Lastly, a ew global egstato stategy s gve based o the eaby pcple.. Cotou featue extacto I the secto, the decto mages (X-mage, Y- mage, Z-mage ae defed based o the scag featues of lase scae ad the dexes of the lase pots, edges ae detected fom decto mages Poceedgs of the Ifomato Vsualzato (IV /6 $. 6 IEEE

2 espectvely, ad the the edges ae tegated to cotou cuves... Decto mage We use Cyax-p5 to captue age data of the scee. See fom the scag pocess, the ow ad colum values of evey sca ae gve accodg to accuacy demad befoe scag. Lase samplg pots ae ogased o D gd. Evey gd pot (, coespods to 3D pot ( x(,, y(,, z(,, ust le fgue. Accodg to the dexes of lase samplg pots, (,, x(, foms X-mage, (,, y(, foms Y-mage, (,, z(, foms Z-mage. X-mage, Y-mage, ad Z- mage ae called decto mage. Xo Y o Z x(,(o y(, o z(, Fgue : The elatoshp betwee D gd pots ad 3D pots.. Self-adaptve local fttg Supposed each sca le ca be cosdeed as a pecewse smooth cuve ad the pots of decto mages ae samplg pots wth ose o these pecewse smooth cuves, the (, L(, ( s fxed We choose a teval D(,, ad local quadatc cuve fttg s doe. fˆ (, a a a ( Whee, f ca be X, Y, Z a,a,a s coeffcet. Geeal speag, the least squae method ca calculate coeffcets a, a, a but the least squae method s ot sestve to ose ad outles, so f the fttg teval cludes outles, we caot obta the best fttg esults. Howeve, befoe fttg we caot ecogze ad emove outles, ad the sze of the teval s fxed oce the teval s selected. So we employ the method of self-adaptve cuve fttg wth weght [] to compute the coeffcets of the fttg cuve because t oly fts the pots o the same smooth cuve ad does ot ft those dscotuous pots ad outles. We defe the cuve fttg eo fucto as follow, E, f (, fˆ(, w(, ( ( whee (, D(,, ad t s mmzed fo computg the coeffceta, a, a w(, s weght fucto, whch descbe elablty of each pot the fttg teval D(,. The weght of the elable pot s cosdeed as, ad the weght of the uelable pot s assg to vey small value. We choose teatve appoach to mpove the weght of evey pot cotuously to elmate the effects of outles. Supposed the coeffcets the tme ae a, a, a, how the coeffcets of the tme a, a, a s computed? Fst we calculate fttg esdual eo ad weght of the tme. ˆ e (, f (, f (, (3 E (, bs w (, b (4 s E (, b s E (, wheew (, Usg (3 ad (4 costatly mpove the weght of evey pot utl fttg esdual eo meet demad. Meawhle, these pots coespodg vey small weght ae cosdeed as outles ad emoved..3. Edge detecto Evey pot ad the pots ts coespodg fttg teval fom a cuve, ad the fo the eghbog pots ( l,, f ( l, ad (,, f (,, two cuves exst, they ae ecoded as ˆ fl (, al a l al, (, L( l, (5 ˆ f (, a a a, (, L(, (6 If al a thesh, the eghbog pots ae depth dscotuous pots; If al a thesh, but al a thesh, the thee s a omal dscotuous pot betwee the eghbog pots. We calculate the pot of tesecto ( c,, f fomed by fˆ l (,. If ( ˆ l,, fl ( l, ( c,, f (7,, fˆ (, ( c,, f, the the left pot s omal dscotuous, o the ght pot s omal dscotuous..4. Edge tegato Usg the method descbed secto. ad secto.3 to pocess X-mage, Y-mge ad Z-mage, we obta the edge maps. They descbe the dscotuty of thee dectos of 3D scee espectvely. We fuse the edge maps to descbe cotou featues of 3D scee. Poceedgs of the Ifomato Vsualzato (IV /6 $. 6 IEEE

3 3. Local egstato algothm Accodg to the pcple of octee, we establsh a seachg stuctue of the cotou featues. Usg mahalaobs dstace, a ogal tasfom s obtaed though matchg the leaf odes betwee two scas, ad the tasfom s efed step by step though ICP utl the best tasfom s obtaed. 3.. Mahalaobs dstace betwee pot sets Mahalaobs dstace s avalable to defe the dstace fom ay pot to a pot set. Compaed wth Eucldea dstace, Mahalaobs dstace descbes ot oly the elatve dstbuto of pot sets, but the ow dstbuto of pot sets [8, 9]. Mahalaobs dstace betwee pot p ad the th pot set g s defed as m( p ( p m C g ( p m (8 T Whee p ( x, y, z ; m s the mea vecto of the N th pot set g, m ; g s pot vecto of N th pot set g ; C g s covaace matx of th pot set g. T C g E[( m ( m ] (9 Mahalaobs dstace betwee two pot sets ae defed as m( m, m ( m m Cg ( m m ( I ode to eep the geealty we emove the coelato of locato ad sze of pot set, matx A fomed by pot set s omalzed. x x x A y y y ( z z z Afte omalzato x x A y y z z x y z x x y y z z Whee x y z x x y y z z ( ( x x ( y y ( z z ( x, y, z s the cete of pot set, s aveage dstace fom pot ( x, y, z 3.. Octee seachg stuctue to the cete the pot set.. The pocess of establshg octee seachg stuctue s the pocess of ecusve subdvso of cotou featues. Befoe establshg octee seachg stuctue, we eed to desgate the theshold codto to cotol subdvso. The theshold codtos ae gve by the followg ways: Deteme whethe each ode cotas pots ae collea, f they ae collea, stop subdvdg. Judge each ode cotas pots ae less tha the Max pot umbe, f less tha, stop subdvdg. We gve the algothm of octee of the cotou featues as follows: Vst all data, deve the smallest cube cotag all pots ad ecod fomato of the cube, establsh oot ode, the push t to the stac ad set t as the cuet ode. Judge the cuet ode meets theshold codtos o ot, f meetg, the cuet ode s pushed out the stac. If the stac s ot ull, the top ode of the stac s set as the cuet ode, ad etu ; f the stac s ull, stop. If the cuet ode does t meet theshold codtos, etu 3. 3 Let the cuet ode dvde equally to 8 subcubes the thee coodates axs decto, push the subcubes stac, add the fomato elated to seveal subodes to cuet ode. Set top ode of the stac s the cuet ode, to Leaf ode matchg Leaf odes of octee cota some cotou featue pots. Accodg smlates betwee a ode of sca A ad evey ode of octee of sca B by Mahalaobs dstace, the coespodg leaf odes ae seached fom top to bottom. The smlates of the two odes s defed as S( m, m (3 m( m, m Whee m( m, m s Mahalaobs dstace betwee two odes. scaa, s leaf ode, f S( m A, m Bl max S( m, m LeapThesh, the leaf ode s A B smla wth leaf ode l of sca B. A leaf ode of sca A may coespod to two o moe tha two leaf odes of sca B, we choose oe pa of leaf odes wth the lagest smlates Optmal egstato Accodg to the metoed appoach, pas of leaf odes ae matched betwee two scas. A ogal tasfom ca be calculated by the cetes of thee pas of leaf odes. If pas of leaf odes ae composed 3 3 accodg to C, we wll get C ogal tasfoms. Accodg to the degee of matchg, we do optmal egstato by the followg two steps. Hee, the degee of matchg s computed accodg to the umbe of matchg pots. The fst step of optmal egstato, cotou featues of two scas ae tasfeed to the same Poceedgs of the Ifomato Vsualzato (IV /6 $. 6 IEEE

4 coodate system by the ogal tasfom, the the degee of matchg s calculated ad the ogal tasfom whch matchg degee s moe tha theshold MacthThesh s ecoded. O the bass of them, usg of ICP algothms, the tasfoms ae mpoved. The secod step of optmal egstato, accodg to the mpoved tasfoms of the fst step, all pots of two scas ae alged to the commo coodate system, the the degee of match s calculates. The mpoved tasfom of the fst step whch matchg degee s moe tha theshold MacthThesh s ecoded. O the bass of the fst step, ICP algothm s executed fo all the pots. Fally, the tasfom whch matchg degee s lagest s selected as the fal tasfom. If matchg degee of the tasfoms ae equal, the aveage dstace of coespodg pots s calculate, the tasfom whch the aveage dstace s the most shot s employed. Dug Optmal egstato pocessg, the value of theshold s 7% of matchg pots of the best tasfom. 4. Global egstato stategy I a typcal scag sesso, tes ad hudeds of age scas must be egsteed. What method do we employ to egste all age scas? We developed a global egstato based o the eaby pcple. Ths method ca solve the dawbacs of sequetal ad smultaeous stateges. Afte all ovelappg age scas ae put to ou system, we fst execute the local egstato, ad the use the eaby pcple to buld a topologcal gaph of global egstato. Oe of scas s chose to be the acho sca S a fom the topologcal gaph, ad all othe scas S ae egsteed wth espect to the acho S a based o the topologcal gaph. The steps of ceatg the topologcal gaph ae showed as follow: Regste all pas of ovelappg scas, compute tasfomato T [ R, t ] ad degee of egstato g( T (t s the umbe of pots that ae matched. Regad the age sca S as a ode, ad egad as coectg weght betwee two odes, the a g( T weghted udected gaph s ceated G V, E. Whee V s ode, E s edge wth weght, ad e E. g( T 3 Based o e E usg MST, ceate g( T MST compute a topologcal gaph GLR. GLR cludes all age scas ad descbes the best egstato path of all age scas. Fgue shows the ceatg pocessg of a topologcal gaph. G LR step step step step3 step4 step5 Fgue :The topologcal gaph of global egstato 5. Results We tested ou methods o scas fom doo scees, outdoo scees ad acet buldgs ad so o. A age sca of outdoo scees clude may omeasued obects ad outles, t s the best way to test the egstato algothm. Fg.3a s the mage of Shaoyua of Peg Uvesty. Fg.3b shows cotou featues, Fg.3c shows the egstato esult of a pa of ovelappg age scas. Fg.3d s the global egstato esult of 5 age scas. We ca see fom the fgues that the egstato algothm poposed by us ca ot oly detect ch cotou featues but also mae may age scas bette togethe to the commo coodate system. The most of doo scees ae moe composed of obects wth smple stuctue, ad less ose ad outles, they ae easly egsteed togethe the shot tme. Fg.4a ad 4b ae the egstato esults of two age scas of the compute house of scetfc fomato cete of Peg Uvesty. Fg.5a ad 5b ae espectvely the egstato esults of two ad thee age scas of the fst oc cave of Yugag gotto. Fg.6 employs the global egstato method poposed ths pape to alg age scas of Ql the fot of offce buldg of Peg Uvesty. Fom these egstato esults, they show: we ca obta pefect egstato esults fom age scas of acet achtectues, ad they test that the egstato method poposed by us s obust ad t ca be used the complex achtectues. 4. Cocluso We have descbed a fully automated method fo the egstato of lage-scale scees. Ou algothm s based o cotou featues that educes complexty of egstato ad solve pactcal poblem of egstato of lage-scale scees, the ma cotbutos of ths pape ae as follows: Use self-adaptve cuve fttg techques to extact cotou featues fom age scas so that egstato algothm s ot oly adapted to the scee composed of smple stuctues, but also adapted to the scees composed of complex stuctues. Poceedgs of the Ifomato Vsualzato (IV /6 $. 6 IEEE

5 (a (b (c (d Fgue3: The egstato esults of Shaoyua of Peg Uvesty (a (b Fgue4: The egstato esults of doo scees (a (b Fgue 5: The egstato esults of Yugag gotto Poceedgs of the Ifomato Vsualzato (IV /6 $. 6 IEEE

6 (a Fgue 6: The egstato esults of Ql the fot of offce buldg of Peg Uvesty. (b Itoduce mahalaobs dstace to descbe the dstbuto law of pots the pot set. 3 Establsh octee seachg stuctue to ot oly povde matchg ut but also speed up matchg. 4 Employ egstato mode fom bottom to up: cotou featues of scees leaf odes all pots of scees, step by step, ad avod fallg to local mma. Refeeces [] Hug Zhao, Ryosue Shbas. A obust method fo egsteg goud based lase age mages of uba outdoo obects. I Photogammetc Egeeg & Remote Sesg,, 67 (: [] Hug Zhao, Ryosue Shbasa. Recostuctg Uba 3D Model usg Vehcle-boe Lase Rage Scaes. I Poc. of 3D Dgtal Imagg ad Modelg,, 49~356. [3] Cya Techologes: [4] Multple Rage Data Set Regstato: edu/~b/poects/multple/ [5] 3D Imagg Seso LMS-Z4: [6] Yamay.S.M, Faag.A.A. Suface sgatues: a oetato depedet fee-fom suface epessetato scheme fo the pupose of obects egstato ad matchg, I Patte Aalyss ad Mache Itellgece, IEEE Tasactos o, 4(8: 5 ~. Acowledgemets The pape s suppoted by Pogam fo Iovatve Reseach Team Uvesty ad Natoal Key Techologes R&D Pogam (4BA8B. [7] T. Padla ad L. Va Gool. Matchg of 3-D cuves usg sem-dffeetal vaats. I 5th Iteatoal Cofeece o Compute Vso, IEEE Compute Socety Pess, Cambdge, MA,995, 39~395. [8] Xua Guoog. The Optmal Chaactestcs of Mahalaobs dstace a featue selecto. I Poc of th teatoal Cofeece Compute ad applcato, Beg: CCF ad Compute Socety of IEEE, 987(6: [9] Zhag Jume, J Shmg ad L Ha. Applcato of vaat Theoy to Geomety-pat Recogto. I Mechacal & electcal egeeg magaze, 999(5: 6~64. [] R.Begev, M.Soucy, H.Gago, ad D. Lauedeau. Towads a geeal mult-vew egstato techque. IEEE Tas. PAMI. 996, 8(5:54~547. [] D. Hube ad M. Hebet. Fully Automatc Regstato of Multple 3D Data Sets, IEEE Compute Socety Woshop o Compute Vso Beyod the Vsble Spectum (CVBVS, Decembe, Poceedgs of the Ifomato Vsualzato (IV /6 $. 6 IEEE

Optically adjustable display color gamut in time-sequential displays using LED/Laser light sources

Optically adjustable display color gamut in time-sequential displays using LED/Laser light sources Optcall adjustale dspla colo amut tme-sequetal dsplas us LE/Lase lht souces splas vol. 7 006 Moo-Cheol Km School of Electcal Eee ad Compute Scece Kupook Natoal Uv. Astact evelopmet of vaous wde colo amut

More information

RECOGNITION OF COMMON BUILDINGS IN CARTOGRAPHIC FILES

RECOGNITION OF COMMON BUILDINGS IN CARTOGRAPHIC FILES RECOGITIO OF COMMO BUIIGS I CRTOGRPHIC FIES Ha-We Hsao, Kam W. Wog epatmet of Cvl Egeeg Uvesty of Illos at Ubaa-Champag 5. Mathews ve. Ubaa, Illos 68, US Emal: h-hsao@studets.uuc.edu, -wog@staff.uuc.edu

More information

SOLVING METHOD FOR FUZZY MULTIPLE OBJECTIVE INTEGER OPTIMIZATION

SOLVING METHOD FOR FUZZY MULTIPLE OBJECTIVE INTEGER OPTIMIZATION SOLVING METHOD FOR FUZZY MULTIPLE OBJECTIVE INTEGER OPTIMIZATION BOGDANA POP Taslvaa Uvesty of Basov Romaa Abstact Statg fom the dea of Wag ad Lao (00 fo solvg fuzzy o-lea tege ogammg oblem ad tag to accout

More information

A Proactive Fault-detection Mechanism in Large-scale Cluster Systems

A Proactive Fault-detection Mechanism in Large-scale Cluster Systems A Poactve Fault-detecto Mechasm age-scale Cluste Systems Wu pg Meg Da Gao We ad Zha Jafeg Isttute of Computg Techology Chese Academy of Sceces Bejg Cha {wlp md gw jfzha}@cc.ac.c Gaduate School of the Chese

More information

Visually Built Task Models for Robot Teams in Unstructured Environments Abstract 1. Introduction

Visually Built Task Models for Robot Teams in Unstructured Environments Abstract 1. Introduction Vsuall Bult as Models fo Robot eams Ustuctued Evomets Vve A. Suja ad Steve Dubows (vasuja dubows@mt.edu} Depatmet of Mechacal Egeeg Massachusetts Isttute of echolog Cambdge, MA 039 Abstact I feld evomets

More information

Risk Evaluation in Auto Spare Parts Transport Based on the

Risk Evaluation in Auto Spare Parts Transport Based on the MAEC Web of Cofeeces 100, 05060 Rsk Evaluato Auto Spae Pats aspot Based o the AHP Method Rog Zeg 1 ad Chag Xu 2 1 Wuha Huaxa Uvesty of echology, Wuha, Cha 2 Wuha Uvesty of echology, Wuha, Cha Abstact By

More information

The Search for Coalition Formation in Costly Environments 1

The Search for Coalition Formation in Costly Environments 1 The Seach fo Coalto Fomato Costly Evomets 1 Davd Sae 1 ad Sat Kaus 1,2 1 Depatmet of Compute Scece, Ba-Ila Uvesty, Ramat-Ga, 52900 Isael {saed, sat} @ macs.bu.ac.l 2 Isttute fo Advaced Compute Studes Uvesty

More information

For all questions, answer choice E) NOTA" means none of the above answers is correct. A) 50,500 B) 500,000 C) 500,500 D) 1,001,000 E) NOTA

For all questions, answer choice E) NOTA means none of the above answers is correct. A) 50,500 B) 500,000 C) 500,500 D) 1,001,000 E) NOTA For all questos, aswer choce " meas oe of the above aswers s correct.. What s the sum of the frst 000 postve tegers? A) 50,500 B) 500,000 C) 500,500 D),00,000. What s the sum of the tegers betwee 00 ad

More information

Adaptive Naïve Bayesian Anti-Spam Engine

Adaptive Naïve Bayesian Anti-Spam Engine Wold Academy of Scece, Egeeg ad Techology 7 2005 Adaptve Naïve Bayesa At-Spam Ege Wojcech P. Gajewsk Abstact The poblem of spam has bee seously toublg the Iteet commuty dug the last few yeas ad cuetly

More information

A Multi-Categorization Method of Text Documents using Fuzzy Correlation Analysis

A Multi-Categorization Method of Text Documents using Fuzzy Correlation Analysis Poceedg of the 0th WE Iteatoal Cofeece o PPLIED MTHEMTIC, Dalla, Texa, U, Novembe -3, 006 9 Mult-Categozato Method of Text Documet ug Fuzzy Coelato aly NNCY P. LIN, HO-EN CHUEH Deatmet of Comute cece ad

More information

Mixture Model of the Exponential, Gamma and Weibull Distributions to Analyse Heterogeneous Survival Data

Mixture Model of the Exponential, Gamma and Weibull Distributions to Analyse Heterogeneous Survival Data Joual of Scetfc Reseach & Repots 5: -9, 05; Atcle o.jsrr.05.080 ISSN: 0-07 SCIENCEDOMAIN teatoal www.scecedoma.og Mxtue Model of the Expoetal, Gamma ad Webull Dstbutos to Aalyse Heteogeeous Suvval Data

More information

Bezier curves. 1. Defining a Bezier curve. A closed Bezier curve can simply be generated by closing its characteristic polygon

Bezier curves. 1. Defining a Bezier curve. A closed Bezier curve can simply be generated by closing its characteristic polygon Curve represetato Copyrght@, YZU Optmal Desg Laboratory. All rghts reserved. Last updated: Yeh-Lag Hsu (--). Note: Ths s the course materal for ME55 Geometrc modelg ad computer graphcs, Yua Ze Uversty.

More information

Fuzzy Probability Approximation Space and Its Information Measures

Fuzzy Probability Approximation Space and Its Information Measures Fuzzy Pobablty Appomato Space ad Its Ifomato Measues Qghua Hu, Dae Yu Hab Isttute of Techology, Cha Abstact ough set theoy has attacted much atteto modelg wth mpecse ad complete fomato A geealzed appomato

More information

Local vs. Global Illumination & Radiosity

Local vs. Global Illumination & Radiosity Local vs. Global Illumato & Radosty Last Tme? Ray Castg & Ray-Object Itesecto Recusve Ray Tacg Dstbuted Ray Tacg A ealy applcato of adatve heat tasfe stables. Local Illumato BRDF Ideal Dffuse Reflectace

More information

arxiv: v1 [math.co] 21 Jan 2016

arxiv: v1 [math.co] 21 Jan 2016 PROOF OF BIJECTION FOR COMBINATORIAL NUMBER SYSTEM axv:60.05794v [math.co] Jan 06 ABU BAKAR SIDDIQUE, SAADIA FARID, AND MUHAMMAD TAHIR Abstact. Combnatoal numbe system epesents a non-negatve natual numbes

More information

Computer Technology MSIS 22:198:605 Homework 1

Computer Technology MSIS 22:198:605 Homework 1 Compute Techology MSIS 22:198:605 Homewok 1 Istucto: Faid Alizadeh Due Date: Moday Septembe 30, 2002 by midight Submissio: by e-mail See below fo detailed istuctios) last updated o Septembe 27, 2002 Rules:

More information

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012 2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo

More information

Fitting. We ve learned how to detect edges, corners, blobs. Now what? We would like to form a. compact representation of

Fitting. We ve learned how to detect edges, corners, blobs. Now what? We would like to form a. compact representation of Fttg Fttg We ve leared how to detect edges, corers, blobs. Now what? We would lke to form a hgher-level, h l more compact represetato of the features the mage b groupg multple features accordg to a smple

More information

Research of Education Evaluation Information Mining Technology Based on Gray Clustering Analysis and Fuzzy Evaluation Method

Research of Education Evaluation Information Mining Technology Based on Gray Clustering Analysis and Fuzzy Evaluation Method Compute a Ifomato Scece Reseach of Eucato Evaluato Ifomato Mg Techology Base o Gay Clusteg Aalyss a Fuzzy Evaluato Metho Yag Lu College of Compute a Automatzato, Taj Polytechc Uvesty Taj, 30060, Cha E-mal:

More information

Bidding Strategies for Generation Companies in a Day-ahead Market using Fuzzy Adaptive Particle Swarm Optimization

Bidding Strategies for Generation Companies in a Day-ahead Market using Fuzzy Adaptive Particle Swarm Optimization J. Vaya Kuma, D. M. Vod Kuma, K. Eduodalu Bddg Stateges fo Geeato Compaes a Day-ahead Maet usg Fuzzy Adaptve Patcle Swam Optmzato J. VIJAYA KUMAR *, D. M. VINOD KUMAR ad K EDUKONDALU Depatmet of Electcal

More information

COMSC 2613 Summer 2000

COMSC 2613 Summer 2000 Programmg II Fal Exam COMSC 63 Summer Istructos: Name:. Prt your ame the space provded Studet Id:. Prt your studet detfer the space Secto: provded. Date: 3. Prt the secto umber of the secto whch you are

More information

A Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components

A Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components A Neual Netwok Model fo Stong and Reteving 2D Images of Rotated 3D Object Using Pncipal Components Tsukasa AMANO, Shuichi KUROGI, Ayako EGUCHI, Takeshi NISHIDA, Yasuhio FUCHIKAWA Depatment of Contol Engineeng,

More information

CS 2710 Foundations of AI Lecture 22. Machine learning. Machine Learning

CS 2710 Foundations of AI Lecture 22. Machine learning. Machine Learning CS 7 Foudatos of AI Lecture Mache learg Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Mache Learg The feld of mache learg studes the desg of computer programs (agets) capable of learg from past eperece

More information

1-D matrix method. U 4 transmitted. incident U 2. reflected U 1 U 5 U 3 L 2 L 3 L 4. EE 439 matrix method 1

1-D matrix method. U 4 transmitted. incident U 2. reflected U 1 U 5 U 3 L 2 L 3 L 4. EE 439 matrix method 1 -D matrx method We ca expad the smple plae-wave scatterg for -D examples that we ve see to a more versatle matrx approach that ca be used to hadle may terestg -D problems. The basc dea s that we ca break

More information

A New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE

A New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE 5th Intenational Confeence on Advanced Mateials and Compute Science (ICAMCS 2016) A New and Efficient 2D Collision Detection Method Based on Contact Theoy Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai

More information

Robust Proper Clustering Structure Fuzzy Modeling for Function Approximation

Robust Proper Clustering Structure Fuzzy Modeling for Function Approximation Robust Pope lusteng Stuctue Fuzzy Modelng fo Functon Appoxmaton hh-hng Hsao Depatment of Electcal Engneeng Kao Yuan Unvesty Kaohsung ounty,tawan RO hsao@ooneentustedutw Shun-Feng Su Depatment of Electcal

More information

Effectiveness evaluation of electronic warfare command and control system based on grey AHP method

Effectiveness evaluation of electronic warfare command and control system based on grey AHP method Avalable onlne www.jocp.com Jounal of hemcal and Phamaceutcal Reseach, 014, 6(7):535-54 Reseach Atcle ISSN : 0975-7384 ODEN(USA) : JPR5 Effectveness evaluaton of electonc wafae command and contol system

More information

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management

More information

Pairwise comparisons in the analysis of carcinogenicity data *

Pairwise comparisons in the analysis of carcinogenicity data * Vol4, No1, 91-918 (1) http://xoog/1436/health141139 ealth Pawse compasos the aalyss of cacogecty ata Mohamma A Rahma 1#, Ram C Twa 1 Dvso of Bometcs-6, Offce of Bostatstcs, Cete fo Dug Evaluato a Reseach,

More information

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension 17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach

More information

Detection and Recognition of Alert Traffic Signs

Detection and Recognition of Alert Traffic Signs Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives

More information

DE-STRIPING FOR TDICCD REMOTE SENSING IMAGE BASED ON STATISTICAL FEATURES OF HISTOGRAM

DE-STRIPING FOR TDICCD REMOTE SENSING IMAGE BASED ON STATISTICAL FEATURES OF HISTOGRAM Te Iteatoal Acves of te Potogammety, Remote Sesg ad Spatal Ifomato Sceces, Volume XLI-B, 26 XXIII ISPRS Cogess, 2 9 July 26, Pague, Czec Republc DE-STRIPIN FOR TDICCD REMOTE SENSIN IMAE BASED ON STATISTICAL

More information

An Object Based Auto Annotation Image Retrieval System

An Object Based Auto Annotation Image Retrieval System Poceedngs of the 5th WSEAS Intenatonal Confeence on Telecommuncatons and Infomatcs, Istanbul, Tukey, May 27-29, 2006 (pp509-54) An Obect Based Auto Annotaton Image Reteval System Pe-Cheng Cheng, Been-Chan

More information

A modal estimation based multitype sensor placement method

A modal estimation based multitype sensor placement method A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;

More information

Reliable Surface Extraction from Point-Clouds using Scanner-Dependent Parameters

Reliable Surface Extraction from Point-Clouds using Scanner-Dependent Parameters 1 Relable Surface Extracto from Pot-Clouds usg Scaer-Depedet Parameters Hrosh Masuda 1, Ichro Taaka 2, ad Masakazu Eomoto 3 1 The Uversty of Tokyo, masuda@sys.t.u-tokyo.ac.jp 2 Tokyo Dek Uversty, taaka@cck.deda.ac.jp

More information

A Two-stage and Parameter-free Binarization Method for Degraded Document Images

A Two-stage and Parameter-free Binarization Method for Degraded Document Images A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and

More information

ITEM ToolKit Technical Support Notes

ITEM ToolKit Technical Support Notes ITEM ToolKt Notes Fault Tree Mathematcs Revew, Ic. 2875 Mchelle Drve Sute 300 Irve, CA 92606 Phoe: +1.240.297.4442 Fax: +1.240.297.4429 http://www.itemsoft.com Page 1 of 15 6/1/2016 Copyrght, Ic., All

More information

FUNDAMENTALS OF RADIOMETRY

FUNDAMENTALS OF RADIOMETRY 1 FUNDAMENTALS OF RADIOMETRY Lectue 5 Radomety 2 Quanttatve measuement of the popetes of EM adaton nteacton wth matte o emsson fom t Radomety deals wth total EM adaton We extend the concept of adans n

More information

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30.

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30. Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. COS 31 Dscrete Math 1 Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. Nobody seems to care. Chage oce hours? Tuesday, 8 PM

More information

A SAS Macro for Finding Optimal k-means Clustering in One Dimension with Size Constraints

A SAS Macro for Finding Optimal k-means Clustering in One Dimension with Size Constraints Pape SD-02 A SAS Maco fo Fndng Optmal k-means Clusteng n One Dmenson wth Sze Constants Fengao Hu, Geoga Regents Unvesty; Robet E. Johnson, Vandeblt Unvesty ABSTRACT Wang and Song (2011) poposed a k-means

More information

Region Matching by Optimal Fuzzy Dissimilarity

Region Matching by Optimal Fuzzy Dissimilarity Rego Matchg by Optmal Fuzzy Dssmlarty Zhaggu Zeg, Ala Fu ad Hog Ya School of Electrcal ad formato Egeerg The Uversty of Sydey Phoe: +6--935-6659 Fax: +6--935-3847 Emal: zzeg@ee.usyd.edu.au Abstract: Ths

More information

Controlled Information Maximization for SOM Knowledge Induced Learning

Controlled Information Maximization for SOM Knowledge Induced Learning 3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity

More information

Chapter 3 Descriptive Statistics Numerical Summaries

Chapter 3 Descriptive Statistics Numerical Summaries Secto 3.1 Chapter 3 Descrptve Statstcs umercal Summares Measures of Cetral Tedecy 1. Mea (Also called the Arthmetc Mea) The mea of a data set s the sum of the observatos dvded by the umber of observatos.

More information

A ROI Focusing Mechanism for Digital Cameras

A ROI Focusing Mechanism for Digital Cameras A ROI Focusing Mechanism fo Digital Cameas Chu-Hui Lee, Meng-Feng Lin, Chun-Ming Huang, and Chun-Wei Hsu Abstact With the development and application of digital technologies, the digital camea is moe popula

More information

Bilateral Filter Based Selective Unsharp Masking Using Intensity and/or Saturation Components

Bilateral Filter Based Selective Unsharp Masking Using Intensity and/or Saturation Components Intenational Jounal of Electonics and Electical Engeeg ol. 1, No. 1, Mach 013 Bilateal Filte Based Selective Unshap Maskg Usg Intensity and/o Satuation Components Noiaki Suetake, Yohei Kuamoto, and Eii

More information

Gray-level Texture Characterization Based on a New Adaptive Nonlinear Auto-Regressive Filter

Gray-level Texture Characterization Based on a New Adaptive Nonlinear Auto-Regressive Filter Electoc Lettes o Comute Vso ad Image Aalss 7:40-53 008 Ga-level Textue Chaactezato Based o a Ne Adatve Nolea Auto-Regessve Flte Mou Saad * Sam Saa * Fahat Faech * ad Mohamed Cheet * SICISI Ut ESSTT 5 Av.

More information

Last Time: PCA. Unsupervised vs Supervised. Image Manifold. Statistical Multilinear Models: TensorFaces

Last Time: PCA. Unsupervised vs Supervised. Image Manifold. Statistical Multilinear Models: TensorFaces Last Time: PCA Statistical Multiliea Models: TesoFaces PCA idetifies a m dimesioal eplaatio of dimesioal data whee m

More information

Chap 5: Product-Form Queuing Networks (QN)

Chap 5: Product-Form Queuing Networks (QN) CPU disk Chap 5: Poduct-Fom Queuig Netwoks (QN) Etities: ) sevice cetes with diffeet sevice disciplies ) customes (obs) sigle class multiple classes (each/w a diffeet wokload) ) liks coectig sevice cetes

More information

Soochow University: Description and Analysis of the Chinese Word Sense Induction System for CLP2010

Soochow University: Description and Analysis of the Chinese Word Sense Induction System for CLP2010 Soochow Unvesty: Descpton and Analyss of the Chnese Wod Sense Inducton System fo CLP2010 Hua Xu Bng Lu Longhua Qan Guodong Zhou Natual Language Pocessng Lab School of Compute Scence and Technology Soochow

More information

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using

More information

Speeding- Up Fractal Image Compression Using Entropy Technique

Speeding- Up Fractal Image Compression Using Entropy Technique Avalable Ole at www.jcsmc.com Iteratoal Joural of Computer Scece ad Moble Computg A Mothly Joural of Computer Scece ad Iformato Techology ISSN 2320 088X IMPACT FACTOR: 5.258 IJCSMC, Vol. 5, Issue. 4, Aprl

More information

Heterogeneous Isotropic BRDFs. Homogeneous BRDF. Spatially Varying BRDF. Approaches - Sampling. Approaches - Illumination

Heterogeneous Isotropic BRDFs. Homogeneous BRDF. Spatially Varying BRDF. Approaches - Sampling. Approaches - Illumination Couse 0 Realistic Mateials in Compute Gaphics Heteogeneous Isotopic s Henik P.A. Lensch Stanfo Univesity Homogeneous Spatially Vaying Appoaches - Sampling Appoaches - Illumination ense sampling fo each

More information

Eight Solved and Eight Open Problems in Elementary Geometry

Eight Solved and Eight Open Problems in Elementary Geometry Eght Solved ad Eght Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew eght prevous proposed ad solved problems of elemetary

More information

Accurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen

Accurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen Accuate Diffaction Efficiency Contol fo Multiplexed Volume Hologaphic Gatings Xuliang Han, Gichel Kim, and Ray T. Chen Micoelectonic Reseach Cente Depatment of Electical and Compute Engineeing Univesity

More information

Positioning of a robot based on binocular vision for hand / foot fusion Long Han

Positioning of a robot based on binocular vision for hand / foot fusion Long Han 2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,

More information

CLUSTERING ASSISTED FUNDAMENTAL MATRIX ESTIMATION

CLUSTERING ASSISTED FUNDAMENTAL MATRIX ESTIMATION CLUSERING ASSISED FUNDAMENAL MARIX ESIMAION Hao Wu ad Y Wa School of Iformato Scece ad Egeerg, Lazhou Uversty, Cha wuhao1195@163com, wayjs@163com ABSRAC I computer vso, the estmato of the fudametal matrx

More information

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition

More information

A Comparison of Univariate Smoothing Models: Application to Heart Rate Data Marcus Beal, Member, IEEE

A Comparison of Univariate Smoothing Models: Application to Heart Rate Data Marcus Beal, Member, IEEE A Comparso of Uvarate Smoothg Models: Applcato to Heart Rate Data Marcus Beal, Member, IEEE E-mal: bealm@pdx.edu Abstract There are a umber of uvarate smoothg models that ca be appled to a varety of olear

More information

Color Correction Using 3D Multiview Geometry

Color Correction Using 3D Multiview Geometry Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,

More information

On a Sufficient and Necessary Condition for Graph Coloring

On a Sufficient and Necessary Condition for Graph Coloring Ope Joural of Dscrete Matheatcs, 04, 4, -5 Publshed Ole Jauary 04 (http://wwwscrporg/joural/ojd) http://dxdoorg/0436/ojd04400 O a Suffcet ad Necessary Codto for raph Colorg Maodog Ye Departet of Matheatcs,

More information

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences Ameican Jounal of ata ining and Knowledge iscovey 27; 2(4): 2-8 http://www.sciencepublishinggoup.com//admkd doi:.648/.admkd.2724.2 Genealized Gey Taget ecision ethod Based on ecision akes Indiffeence Attibute

More information

Illumination methods for optical wear detection

Illumination methods for optical wear detection Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical

More information

Computation of DFT. point DFT. W has a specific structure and because

Computation of DFT. point DFT. W has a specific structure and because DSP 5 Spig Computatio of DFT CTU EE Computatio of DFT Efficiet algoithms fo computig DFT Fast Fouie Tasfom. a Compute oly a few poits out of all poits b Compute all poits hat ae the efficiecy citeia? umbe

More information

Eight Solved and Eight Open Problems in Elementary Geometry

Eight Solved and Eight Open Problems in Elementary Geometry Eght Solved ad Eght Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew eght prevous proposed ad solved problems of elemetary

More information

APPLICATION OF CLUSTERING METHODS IN BANK S PROPENSITY MODEL

APPLICATION OF CLUSTERING METHODS IN BANK S PROPENSITY MODEL APPLICATION OF CLUSTERING METHODS IN BANK S PROPENSITY MODEL Sergej Srota Haa Řezaková Abstract Bak s propesty models are beg developed for busess support. They should help to choose clets wth a hgher

More information

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits

More information

Einführung in Visual Computing

Einführung in Visual Computing Eführug Vsual Computg 868 Global Illumato Werer Purgathofer Surface-Rederg Methods polygo rederg methods ray tracg global llumato evromet mappg teture mappg bump mappg Werer Purgathofer Global Illumato

More information

AUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY

AUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY AUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY Chistophe Waceman (1), William G. Pichel (2), Pablo Clement-Colón (2) (1) Geneal Dynamics Advanced Infomation Systems, P.O. Box 134008 Ann Abo

More information

Computation of DFT. W has a specific structure and because

Computation of DFT. W has a specific structure and because DSP 7 Computatio of DFT CTU EE Computatio of DFT Efficiet algoithms fo computig DFT Fast Fouie Tasfom. a Compute oly a few poits out of all poits b Compute all poits hat ae the efficiecy citeia? umbe of

More information

A Comparison of the Optimal Classification Rule and Maximum Likelihood Rule for Binary Variables

A Comparison of the Optimal Classification Rule and Maximum Likelihood Rule for Binary Variables Joual of Mathematcs Reseach; Vol. 6 No. 4; 04 ISSN 96-9795 E-ISSN 96-9809 Publshed by Caada Cete of Scece ad Educato A Comaso of the Otmal Classfcato Rule ad Mamum Lelhood Rule fo ay Vaables I. Egbo S.

More information

Recursion. Announcements. Follow-up from yesterday. Recursion Overview. A Recursive Program. The Factorial Function (n!)

Recursion. Announcements. Follow-up from yesterday. Recursion Overview. A Recursive Program. The Factorial Function (n!) Aoucemets Recusio Lectue CS Summe 7 Fo exta Java help Lots of cosultig/office-hous available Ca set up idividual meetigs with TAs via email Check soo that you ae i CMS Academic Itegity Note Assigmet #

More information

Optimal Allocation of Complex Equipment System Maintainability

Optimal Allocation of Complex Equipment System Maintainability Optmal Allocato of Complex Equpmet System ataablty X Re Graduate School, Natoal Defese Uversty, Bejg, 100091, Cha edcal Protecto Laboratory, Naval edcal Research Isttute, Shagha, 200433, Cha Emal:rexs841013@163.com

More information

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,

More information

APR 1965 Aggregation Methodology

APR 1965 Aggregation Methodology Sa Joaqu Valley Ar Polluto Cotrol Dstrct APR 1965 Aggregato Methodology Approved By: Sged Date: March 3, 2016 Araud Marjollet, Drector of Permt Servces Backgroud Health rsk modelg ad the collecto of emssos

More information

Moving Foreground Detection Based On Spatio-temporal Saliency

Moving Foreground Detection Based On Spatio-temporal Saliency IJCSI Iteratoal Joural of Computer Scece Issues Vol. 10 Issue 1 No 3 Jauary 013 ISSN (Prt): 1694-0784 ISSN (Ole): 1694-0814 www.ijcsi.org 79 Movg Foregroud Detecto Based O Spato-temporal Salecy Yag Xa

More information

A Genetic K-means Clustering Algorithm Applied to Gene Expression Data

A Genetic K-means Clustering Algorithm Applied to Gene Expression Data A Geetc K-meas Clusterg Algorthm Appled to Gee Expresso Data Fag-Xag Wu, W. J. Zhag, ad Athoy J. Kusal Dvso of Bomedcal Egeerg, Uversty of Sasatchewa, Sasatoo, S S7N 5A9, CANADA faw34@mal.usas.ca, zhagc@egr.usas.ca

More information

A Novel Automatic White Balance Method For Digital Still Cameras

A Novel Automatic White Balance Method For Digital Still Cameras A Novel Automatic White Balance Method Fo Digital Still Cameas Ching-Chih Weng 1, Home Chen 1,2, and Chiou-Shann Fuh 3 Depatment of Electical Engineeing, 2 3 Gaduate Institute of Communication Engineeing

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications /03/ Mache Learg: Algorthms ad Applcatos Florao Z Free Uversty of Boze-Bolzao Faculty of Computer Scece Academc Year 0-0 Lecture 3: th March 0 Naïve Bayes classfer ( Problem defto A trag set X, where each

More information

Real Time Face Recognition Using Polynomial Regression and Sub-region Color Component Distribution

Real Time Face Recognition Using Polynomial Regression and Sub-region Color Component Distribution Real Tme Face Recognton Usng Polynomal Regesson and Sub-egon Colo Component Dstbuton Manshanka Mondal, Md. Almas Hossan, Md. Matu Rahman, Kamul Hasan Talukde* Compute Scence and Engneeng Dscplne Khulna

More information

Transmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design

Transmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design Tansmission Lines Modeling Based on Vecto Fitting Algoithm and RLC Active/Passive Filte Design Ahmed Qasim Tuki a,*, Nashien Fazilah Mailah b, Mohammad Lutfi Othman c, Ahmad H. Saby d Cente fo Advanced

More information

Searching the Optimal Threshold for Voxel Coloring in 3D Reconstruction

Searching the Optimal Threshold for Voxel Coloring in 3D Reconstruction Searchg the Optmal Threshold or oxel Colorg D Recostructo Youg-Youl Y, Hyo-Sug Km, Soo-Youg Ye, K-Go Nam Departmet o Electroc Egeerg, Pusa Natoal Uversty Emal: mustapha@pusa.ac.r Abstract oxel colorg s

More information

Nine Solved and Nine Open Problems in Elementary Geometry

Nine Solved and Nine Open Problems in Elementary Geometry Ne Solved ad Ne Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew e prevous proposed ad solved problems of elemetary D geometry

More information

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet

More information

arxiv: v2 [physics.soc-ph] 30 Nov 2016

arxiv: v2 [physics.soc-ph] 30 Nov 2016 Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity

More information

Extract Object Boundaries in Noisy Images using Level Set. Final Report

Extract Object Boundaries in Noisy Images using Level Set. Final Report Extact Object Boundaies in Noisy Images using Level Set by: Quming Zhou Final Repot Submitted to Pofesso Bian Evans EE381K Multidimensional Digital Signal Pocessing May 10, 003 Abstact Finding object contous

More information

Fast quality-guided flood-fill phase unwrapping algorithm for three-dimensional fringe pattern profilometry

Fast quality-guided flood-fill phase unwrapping algorithm for three-dimensional fringe pattern profilometry Univesity of Wollongong Reseach Online Faculty of Infomatics - Papes (Achive) Faculty of Engineeing and Infomation Sciences 2010 Fast quality-guided flood-fill phase unwapping algoithm fo thee-dimensional

More information

Fuzzy Partition based Similarity Measure for Spectral Clustering. Xi an , China Abstract

Fuzzy Partition based Similarity Measure for Spectral Clustering. Xi an , China Abstract Iteratoal Joural of Sgal Processg, Image Processg ad Patter Recogto Vol.9, No., (6), pp.47-48 http://dx.do.org/.457/sp.6.9..39 Fuzzy Partto based Smlarty Measure for Spectral Clusterg Yfag Yag ad Yupg

More information

CC-MODELER: A TOPOLOGY GENERATOR FOR 3-D CITY MODELS

CC-MODELER: A TOPOLOGY GENERATOR FOR 3-D CITY MODELS D. Frtsch, M. Eglch & M. Sester, eds, 'IAPRS', Vol. 32/4, ISPRS Commsso IV Symposum o GIS - Betwee Vsos ad Applcatos, Stuttgart, Germay. CC-MODELER: A TOPOLOGY GENERATOR FOR 3-D CITY MODELS Arm Grue Xhua

More information

All lengths in meters. E = = 7800 kg/m 3

All lengths in meters. E = = 7800 kg/m 3 Poblem desciption In this poblem, we apply the component mode synthesis (CMS) technique to a simple beam model. 2 0.02 0.02 All lengths in metes. E = 2.07 10 11 N/m 2 = 7800 kg/m 3 The beam is a fee-fee

More information

DUe to the recent developments of gigantic social networks

DUe to the recent developments of gigantic social networks Exploing Communities in Lage Pofiled Gaphs Yankai Chen, Yixiang Fang, Reynold Cheng Membe, IEEE, Yun Li, Xiaojun Chen, Jie Zhang 1 Abstact Given a gaph G and a vetex q G, the community seach (CS) poblem

More information

A COMPARISON OF MULTIVARIATE DISCRIMINATION OF BINARY DATA

A COMPARISON OF MULTIVARIATE DISCRIMINATION OF BINARY DATA Iteatoal Joual of Mathematcs ad Statstcs Studes Vol.No.4.40-6 Setembe 04 Publshed by Euoea Cete fo eseach Tag ad Develomet UK www.eaouals.og A COMPAISON OF MULTIVAIATE DISCIMINATION OF INAY DATA. I. Egbo;.

More information

A Comparison of Heuristics for Scheduling Spatial Clusters to Reduce I/O Cost in Spatial Join Processing

A Comparison of Heuristics for Scheduling Spatial Clusters to Reduce I/O Cost in Spatial Join Processing Edth Cowa Uversty Research Ole ECU Publcatos Pre. 20 2006 A Comparso of Heurstcs for Schedulg Spatal Clusters to Reduce I/O Cost Spatal Jo Processg Jta Xao Edth Cowa Uversty 0.09/ICMLC.2006.258779 Ths

More information

EDGE- ODD Gracefulness of the Tripartite Graph

EDGE- ODD Gracefulness of the Tripartite Graph EDGE- ODD Graceuless o the Trpartte Graph C. Vmala, A. Saskala, K. Ruba 3, Asso. Pro, Departmet o Mathematcs, Peryar Maamma Uversty, Vallam, Thajavur Post.. Taml Nadu, Ida. 3 M. Phl Scholar, Departmet

More information

SVM Classification Method Based Marginal Points of Representative Sample Sets

SVM Classification Method Based Marginal Points of Representative Sample Sets P P College P P College P Iteratoal Joural of Iformato Techology Vol. No. 9 005 SVM Classfcato Method Based Margal Pots of Represetatve Sample Sets Wecag ZhaoP P, Guagrog JP P, Ru NaP P, ad Che FegP of

More information

Prof. Feng Liu. Winter /24/2019

Prof. Feng Liu. Winter /24/2019 Prof. Feg Lu Wter 209 http://www.cs.pd.edu/~flu/courses/cs40/ 0/24/209 Last Tme Feature detecto 2 Toda Feature matchg Fttg The followg sldes are largel from Prof. S. Lazebk 3 Wh etract features? Motvato:

More information

Input Layer f = 2 f = 0 f = f = 3 1,16 1,1 1,2 1,3 2, ,2 3,3 3,16. f = 1. f = Output Layer

Input Layer f = 2 f = 0 f = f = 3 1,16 1,1 1,2 1,3 2, ,2 3,3 3,16. f = 1. f = Output Layer Using the Gow-And-Pune Netwok to Solve Poblems of Lage Dimensionality B.J. Biedis and T.D. Gedeon School of Compute Science & Engineeing The Univesity of New South Wales Sydney NSW 2052 AUSTRALIA bbiedis@cse.unsw.edu.au

More information

Point-Biserial Correlation Analysis of Fuzzy Attributes

Point-Biserial Correlation Analysis of Fuzzy Attributes Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh

More information

3D Head Tracking Based on Recognition and Interpolation Using a Time-Of- Flight Depth Sensor

3D Head Tracking Based on Recognition and Interpolation Using a Time-Of- Flight Depth Sensor 3D Head Tacng Based on Recognton and Intepolaton Usng a Tme-Of- Flght Depth Senso Salh Bua Götü 1 and Calo Tomas 1,2 1 Canesta Inc., 2 Due Unvesty bgotu@canesta.co tomas@cs.due.edu Abstact Ths pape descbes

More information

Lecture 27: Voronoi Diagrams

Lecture 27: Voronoi Diagrams We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the

More information

Enhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching

Enhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching Enhance the Algnment Accuacy of Actve Shape Models Usng Elastc Gaph Matchng Sanqang Zhao 1,, Wen Gao, Shguang Shan, Baoca Yn 1 1) Multmeda and Intellgent Softwae Technology Lab, Beng Unvesty of Technology,

More information