Comparison for Edge Detection of Colony Images

Size: px
Start display at page:

Download "Comparison for Edge Detection of Colony Images"

Transcription

1 IJCSNS Inernaional Journal of Compuer Science and Nework Securiy, VOL.6 No.9A, Sepemer Comparison for Edge Deecion of Colony Images Wang Luo Universiy of Elecronic Science and Technology of China, Chengdu, China and Jinggangshan Universiy, Jiangxi, China Summary The exracion of feaures such as edges and curves from an image is useful for many purposes. Feaures, such as edges and curves are useful in i) exure analysis ii) 3-D surface resrucuring iii) segmenaion iv) image maching. Edges are imporan feaures in an image since hey represen significan local inensiy changes. They provide imporan clues o separae regions wihin an ojec or o idenify changes in illuminaion. Mos remoe sensing applicaions use edge deecion as a preprocessing sage for feaure exracion. Real images, such as remoe sensing images, can e corruped wih poin noise. The real prolem is how o enhance noisy remoe sensing images and simulaneously exrac he edges. Using he implemened Canny edge deecor for feaures exracion and as an enhancemen ool for remoe sensing images, he resul was rous wih a very high enhancemen level. Oherwise, he idea of using oh inensiies and spaial informaion has een considered o ake ino accoun local informaion used in human percepion. The approach proposed here is srongly relaed o his idea. The search sraegy is ased on a Geneic Algorihm (GA) ha allows us o find suiale approximaed soluions reaing he prolem as a gloal opimizaion echnique. Key words: Canny edge deecor, Edge deecion, geneic algorihm 1. Inroducion A large numer of edge deecion echniques have een proposed. The common approach is o apply he firs (or second) derivaive o he smoohed image and hen find he local maxima (or zero-crossings). An imporan issue in edge deecion is he scale of deecion filer. Small-scaled filers are sensiive o edge signals u also prone o noise, whereas large-scaled filers are rous o noise u could filer ou fine deails. Muliple scales could e employed o descrie and synhesize he varieies of edge srucures. Malla [1] illusraed mahemaically ha signals and noise have differen singulariies and edge srucures presen oservale magniudes along he scales, while noise decreases rapidly. Wih his oservaion, Xu e al. [2] proposed a wavele-ased spaially selecive filering echnique y muliplying he adjacen scales. Sadler and Swami [3] applied he wavele-muliscale-producs o sep deecion and esimaion and Bao and Zhang [4] presened a denoising scheme y hresholding he muliscale producs. Canny [5] firs presened he well-known hree crieria of edge deecors: good deecion, good localizaion, and low spurious response and showed ha he opimal deecor for an isolaed sep edge should e he firs derivaive of Gaussian. Edge deecion of images does no admi a unique soluion ecause sujeciveness and cones may ake par in he decision phase. I follows ha general soluions are no possile and each proposed echnique can only e used o solve a class of prolems. The approach proposed in [6] ased on Geneic algorihms considers he prolem of exracing he larges image regions ha saisfy uniformiy es in he inensiy-spaial domain. 2. Tradiional edge deecors An edge defined in an image as a oundary or conour a which a significan change occurs in some physical aspec of he image. Edge deecion is a mehod as significan as hreshold. Four differen edge deecor operaors are examined and i is shown ha he Soel

2 212 IJCSNS Inernaional Journal of Compuer Science and Nework Securiy, VOL.6 No.9A, Sepemer 2006 edge deecor provides very hick and someimes very inaccurae edges, especially when applied o noisy images. The LoG operaor provides slighly eer resuls. Tradiional edge deecors were ased on a raher small 3x3 neighorhood, which only examined each pixel s neares neighor. This may work well u due o he size of he neighorhood ha is eing examined, here are limiaions o he accuracy of he final edge. These local neighorhoods will only deec local disconinuiies, and i is possile ha his may cause false edges o e exraced. A more powerful approach is o use a se of firs or second difference operaors ased on neighorhoods having a range of sizes (e.g. increasing y facors of 2) and comine heir oupus, so ha disconinuiies can e deeced a many differen scales. Edges can e deeced in many ways such as Laplacian Roers, Soel and gradien. In oh inensiy and color, linear operaors can deec edges hrough he use of masks ha represen he ideal edge seps in various direcions. They can also deec lines and curves in much he same way. Gradien operaors, Laplacian operaors, and zero-crossing operaors are usually used for edge deecion. The gradien operaors compue some quaniy relaed o he magniude of he slope of he underlying image gray one inensiy surface of which he oserved image pixel values are noisy discreized samples. The Laplacian operaors compue some quaniy relaed o he Laplacian of he underlying image gray one inensiy surface. The zero-crossing operaors deermine wheher or no he digial Laplacian or he esimaed second direcion derivaive has a zero-crossing wihin he pixel. There are many ways o perform edge deecion. However, he mos may e grouped ino hree caegories, gradien (Approximaions of he firs derivaive), Laplacian (Zero crossing deecors) and Image approximaion algorihms. Edge deecors ased on gradien concep are he Soel, Roers and Prewi Fig. 2 (), 2 (c), 2 (d) show he effec of hese filers on he remoe sensing images. The major drawack of such an operaor in segmenaion is he fac ha deermining he acual locaion of he edge, slope urnovers poin, is difficul. A more effecive operaor is he Laplacian Fig. 2 (d), which uses he second derivaive in deermining he edge. Fig. 1 colony image (a) () (c) (d) Fig. 2 (a) Edge map using Soel operaor () Edge map using Roers operaor (c) Edge map using Prewi operaor (d) Edge map using Laplace operaor The gradien of an image f(x, y) a locaion (x, y) is defined as he vecor f G x x (1) f = = Gy f y and he magniude and direcion of he gradien are:

3 IJCSNS Inernaional Journal of Compuer Science and Nework Securiy, VOL.6 No.9A, Sepemer G G x + G y 2 2 = (2) where he angle is measured wih respec o he x-axis. The direcion of an edge a (x, y) is perpendicular o he direcion of he gradien vecor a ha poin. 3. Canny edge deecion of colony image (a) () The Canny edge deecor [2] is ased on compuing he squared gradien magniude. Local maxima of he gradien magniude ha are aove some hreshold are hen idenified as edges. This hreshold local peak deecion mehod is called non-maximum suppression, or NMS. The moivaion for Canny's edge operaor was o derive an opimal operaor in he sense ha minimizes he proailiy of muliply deecing an edge, minimizes he proailiy of failing o deec an edge and minimizes he disance of he repored edge from he rue edge. The firs wo of hese crieria address he issue of deecion, ha is, given ha an edge is presen will he edge deecor find ha edge (and no oher edges). The hird crierion addresses he issue of localizaion, which is how accuraely he posiion of an edge is repored. There is a radeoff eween deecion and localizaion -- he more accurae he deecor he less accurae he localizaion and vice-versa. The ojecive funcion was designed o achieve he following opimizaion consrains: (i) Maximize he signal o noise raio o give perfec deecion. This favours he marking of rue posiives. (ii) Achieve perfec localizaion o accuraely mark edges. (iii) Minimize he numer of responses o a single edge. This favours he idenificaion of rue negaives, ha is, non-edges are no marked. These crieria seem o e reasonale candidaes for filers comparison. Fig. 3 shows a comparison eween edge maps using differen Canny edge deecor Fig. 3 (a) Edge map using Canny operaor which sigma is 0.6 () Edge map using Canny operaor which sigma is An applicaion of GAs o edge deecion of colony image Deecion of he edge in he colony image wih randomness is very difficul and imporan ask. A mehod proposed in [7] using geneic algorihms formulae he edge deecion prolem as a cominaorial opimizaion prolem and deecion of he edge is execued according o he variance of exure feaure in he local area. Firs, we elec he candidae edge regions and hen apply GAs in order o decide he opimum edge regions. This mehod using GAs has an advanage ha arrangemen of he edge regions is fulfilled y very simple archiecure and i does no need much processing ime. The geneic algorihm used o find he es weighing parameers may e skeched as follows: Program Ga_research Se up a random populaion of chromosomes ( ) = { ( 0), ( 0),..., ( 0) }; 0; P m Iniialize in P ( 0) ; While <G wih he value of he es chromosome for each ( ) P( ) evaluae f ( () ) i find he es chromosome () P() i if f ( ( ) ) f ( ) hen ( )

4 214 IJCSNS Inernaional Journal of Compuer Science and Nework Securiy, VOL.6 No.9A, Sepemer 2006 Apply crossover and muaion o he curren populaion P(), according o crossover proailiy (pc) and muaion proailiy (pm); Apply inary ournamen selecion o he emporary populaion Oained from he previous insrucion; +1; end no usually reached. The edge deecion resul shows in Fig.4. Give an inpu image, I (i, j), of size n m. The geneic chromosome α i, j is coded y a 32 i inary sring ha codes he pixel-lael, λ in he 8 less significan is and he pixel posiion (i, j) in he 24 mos significan is. Here, λ idenifies he clusers o which he pixel elongs. Each chromosome can e denoed wih he ordered 1 pair η ( X, Y ) = ( X ( λ), Y ( k) ), where, λ ( η) 1 he pixel in posiion ( i, j) Y ( η) = X and. Each segmen P j is characerized y he mean value, mv j, of he gray levels: mv The finess funcion: j = δ Pj I ( X ( η) ) P ( ) ( η) = ρ η, mv 1 X ( η ) j 1 (3) f (4) The similariy funcion, ρ, compued eween a given chromosome η ( X,Y ) and he corresponding segmen P λ. The classical single poin crossover wih i muaion has een used o evolve he sysem. Random laels are assigned o he saring populaion of chromosomes. The geneic operaor and he selecion process are applied unil a haling condiion which is ased on he K convergence of he oal variance ( Vr = σ ( k) ) is saisfied: Hal compuaion if V 1 V ε, where, ( k) r r k σ is he inernal variance of he cluser k a he ieraion and ε 0, value of ε is deermined y he ε min r 1 r. The condiion ε = 0 is heurisics ( V, V ) Fig. 4 Edge map using GAs edge deecor for Fig.1 5. Comparison for Canny and GAs edge deecion of colony images The Canny operaor works in a muli-sage process. Firs of all he image is smoohed y Gaussian convoluion. Then a simple 2-D firs derivaive operaor is applied o he smoohed image o highligh regions of he image wih high firs spaial derivaives. Edges give rise o ridges in he gradien magniude image. The algorihm hen racks along he op of hese ridges and ses o zero all pixels ha are no acually on he ridge op so as o give a hin line in he oupu, a process known as non-maximal suppression. The racking process exhiis hyseresis conrolled y wo hresholds: TI and T2 wih TI > T2. Tracking can only egin a a poin on a ridge higher han TI. Tracking hen coninues in oh direcions ou from ha poin unil he heigh of he ridge falls elow T2. This hyseresis helps o ensure ha noisy edges are no roken up ino muliple edge fragmens. Comparing o Canny edge deecion mehod, he edge deecion mehod using GAs has some feaures as follows: (i) I is effecive o he edge deecion for he exure image wih randomness ecause of no using he pixel daa u using he local exure feaure, and he arrangemen of he edge regions is accomplished ased on he simple idea ha he shores individual wihin he candidae edge regions is he opimum edge regions. (ii) To decrease and eliminae noise of he colony images, i should increase he value of Canny edge deecor. Bu for he edge deecion mehod using GAs, i should

5 IJCSNS Inernaional Journal of Compuer Science and Nework Securiy, VOL.6 No.9A, Sepemer increase he lengh of he iniial populaion. (iii) The processing ime of his mehod is a lile more han ha of he Canny edge deecion mehod. 6. Conclusions and fuure work Tradiional edge deecors mehods such as Roers Cross, he Soel Operaor and Prewi operaor failed o perform adequaely in such applicaions due o he noisy naure of remoely sensed daa. They are no ale o deec he edges of he ojec while removing all he noise in he image. The implemened Canny edge deecor presened he es performance oh visually and quaniaively ased on he measures such as mean square disance, error edge map and signal o noise raio. Using he implemened Canny edge deecor as an enhancemen ool for remoe sensing images, he resul was rous and achieved a very high enhancemen level. The advanage of he edge deecion mehod using GAs is inelligen. I is effecive o he edge deecion for he colony image wih randomness ecause of no using he pixel daa u using he local exure feaure, and he arrangemen of he edge regions is accomplished ased on he simple idea ha he shores individual wihin he candidae edge regions is he opimum edge regions. The fuure work is o decrease he processing ime of he edge deecion mehod using GAs. Thresholding, IEEE Trans. Medical Imaging, vol. 22, pp , Sep [5]. J. Canny, A Compuaional Approach o Edge Deecion, IEEE Trans. Paern Analysis and Machine Inelligence, vol. 8, pp , A [6]. Yoshimura, M. and Oe, S., Edge deecion of exure image using geneic algorihms SICE '97. Proceedings of he 36h SICE Annual Conference. Inernaional Session Papers,29-31 July 1997 Page(s): [7]. Lo Bosco, G. A geneic algorihm for image segmenaion, Image Analysis and Processing, Proceedings. 11h Inernaional Conference on,26-28 Sep Page(s): Wang Luo received he B.S. degrees in Jiangxi Universiy of science and echnology in During , he worked in Jinggangshan Universiy o each and research. He is now a suden of School of Elecronic Engineering Universiy of Elecronic Science and Technology of China o achieve he M.S. degree. His research ineres is image processing. Acknowledgmen Thanks o Prof. Wang for his valuale advice. References [1]. S. Malla, A Wavele Tour of Signal Processing. Academic Press, [2]. Y. Xu e al., Wavele Transform Domain Filers: A Spaially Selecive Noise Filraion Technique, IEEE Trans. Image Processing, vol.3, pp , Nov [3]. B.M. Sadler and A. Swami, Analysis of Muliscale Producs for Sep Deecion and Esimaion, IEEE Trans. Informaion Theory, vol. 45, pp , Apr [4]. P. Bao and L. Zhang, Noise Reducion for Magneic Resonance Image via Adapive Muliscale Producs

Numerical Dispersion

Numerical Dispersion eview of Linear Numerical Sabiliy Numerical Dispersion n he previous lecure, we considered he linear numerical sabiliy of boh advecion and diffusion erms when approimaed wih several spaial and emporal

More information

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints IJCSI Inernaional Journal of Compuer Science Issues, Vol 9, Issue 1, No 1, January 2012 wwwijcsiorg 18 Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Capaciy

More information

Article from. Predictive Analytics and Futurism. July 2016 Issue 13

Article from. Predictive Analytics and Futurism. July 2016 Issue 13 Aricle from Predicive Analyics and Fuurism July 6 Issue An Inroducion o Incremenal Learning By Qiang Wu and Dave Snell Machine learning provides useful ools for predicive analyics The ypical machine learning

More information

Georey E. Hinton. University oftoronto. Technical Report CRG-TR February 22, Abstract

Georey E. Hinton. University oftoronto.   Technical Report CRG-TR February 22, Abstract Parameer Esimaion for Linear Dynamical Sysems Zoubin Ghahramani Georey E. Hinon Deparmen of Compuer Science Universiy oftorono 6 King's College Road Torono, Canada M5S A4 Email: zoubin@cs.orono.edu Technical

More information

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he

More information

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology

More information

Particle Swarm Optimization

Particle Swarm Optimization Paricle Swarm Opimizaion Speaker: Jeng-Shyang Pan Deparmen of Elecronic Engineering, Kaohsiung Universiy of Applied Science, Taiwan Email: jspan@cc.kuas.edu.w 7/26/2004 ppso 1 Wha is he Paricle Swarm Opimizaion

More information

Single-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems

Single-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems Single-Pass-Based Heurisic Algorihms for Group Flexible Flow-shop Scheduling Problems PEI-YING HUANG, TZUNG-PEI HONG 2 and CHENG-YAN KAO, 3 Deparmen of Compuer Science and Informaion Engineering Naional

More information

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model Modal idenificaion of srucures from roving inpu daa by means of maximum likelihood esimaion of he sae space model J. Cara, J. Juan, E. Alarcón Absrac The usual way o perform a forced vibraion es is o fix

More information

A Video Vehicle Detection Algorithm Based on Improved Adaboost Algorithm Weiguang Liu and Qian Zhang*

A Video Vehicle Detection Algorithm Based on Improved Adaboost Algorithm Weiguang Liu and Qian Zhang* A Video Vehicle Deecion Algorihm Based on Improved Adaboos Algorihm Weiguang Liu and Qian Zhang* Zhongyuan Universiy of Technology, Zhengzhou 450000, China lwg66123@163.com, 2817343431@qq.com *The corresponding

More information

Sequential Importance Resampling (SIR) Particle Filter

Sequential Importance Resampling (SIR) Particle Filter Paricle Filers++ Pieer Abbeel UC Berkeley EECS Many slides adaped from Thrun, Burgard and Fox, Probabilisic Roboics 1. Algorihm paricle_filer( S -1, u, z ): 2. Sequenial Imporance Resampling (SIR) Paricle

More information

Final Spring 2007

Final Spring 2007 .615 Final Spring 7 Overview The purpose of he final exam is o calculae he MHD β limi in a high-bea oroidal okamak agains he dangerous n = 1 exernal ballooning-kink mode. Effecively, his corresponds o

More information

An introduction to the theory of SDDP algorithm

An introduction to the theory of SDDP algorithm An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, 2014 1 / 21 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking

More information

STATE-SPACE MODELLING. A mass balance across the tank gives:

STATE-SPACE MODELLING. A mass balance across the tank gives: B. Lennox and N.F. Thornhill, 9, Sae Space Modelling, IChemE Process Managemen and Conrol Subjec Group Newsleer STE-SPACE MODELLING Inroducion: Over he pas decade or so here has been an ever increasing

More information

Vehicle Arrival Models : Headway

Vehicle Arrival Models : Headway Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where

More information

Testing for a Single Factor Model in the Multivariate State Space Framework

Testing for a Single Factor Model in the Multivariate State Space Framework esing for a Single Facor Model in he Mulivariae Sae Space Framework Chen C.-Y. M. Chiba and M. Kobayashi Inernaional Graduae School of Social Sciences Yokohama Naional Universiy Japan Faculy of Economics

More information

3.1 More on model selection

3.1 More on model selection 3. More on Model selecion 3. Comparing models AIC, BIC, Adjused R squared. 3. Over Fiing problem. 3.3 Sample spliing. 3. More on model selecion crieria Ofen afer model fiing you are lef wih a handful of

More information

Structural Break Detection in Time Series Models

Structural Break Detection in Time Series Models Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by: Naional

More information

A Hop Constrained Min-Sum Arborescence with Outage Costs

A Hop Constrained Min-Sum Arborescence with Outage Costs A Hop Consrained Min-Sum Arborescence wih Ouage Coss Rakesh Kawara Minnesoa Sae Universiy, Mankao, MN 56001 Email: Kawara@mnsu.edu Absrac The hop consrained min-sum arborescence wih ouage coss problem

More information

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,

More information

PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD

PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD HAN XIAO 1. Penalized Leas Squares Lasso solves he following opimizaion problem, ˆβ lasso = arg max β R p+1 1 N y i β 0 N x ij β j β j (1.1) for some 0.

More information

KINEMATICS IN ONE DIMENSION

KINEMATICS IN ONE DIMENSION KINEMATICS IN ONE DIMENSION PREVIEW Kinemaics is he sudy of how hings move how far (disance and displacemen), how fas (speed and velociy), and how fas ha how fas changes (acceleraion). We say ha an objec

More information

ONLINE EVALUATION OF TRACKING ALGORITHM PERFORMANCE

ONLINE EVALUATION OF TRACKING ALGORITHM PERFORMANCE ONLINE EVALUATION OF TRACKING ALGORITHM PERFORMANCE Duc Phu CHAU, François BREMOND and Monique THONNAT Pulsar eam, INRIA, 2004 roue des Lucioles, 06560 Valbonne, France {Duc-Phu.Chau, Francois.Bremond,

More information

MATH 5720: Gradient Methods Hung Phan, UMass Lowell October 4, 2018

MATH 5720: Gradient Methods Hung Phan, UMass Lowell October 4, 2018 MATH 5720: Gradien Mehods Hung Phan, UMass Lowell Ocober 4, 208 Descen Direcion Mehods Consider he problem min { f(x) x R n}. The general descen direcions mehod is x k+ = x k + k d k where x k is he curren

More information

Block Diagram of a DCS in 411

Block Diagram of a DCS in 411 Informaion source Forma A/D From oher sources Pulse modu. Muliplex Bandpass modu. X M h: channel impulse response m i g i s i Digial inpu Digial oupu iming and synchronizaion Digial baseband/ bandpass

More information

Particle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems

Particle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems Paricle Swarm Opimizaion Combining Diversificaion and Inensificaion for Nonlinear Ineger Programming Problems Takeshi Masui, Masaoshi Sakawa, Kosuke Kao and Koichi Masumoo Hiroshima Universiy 1-4-1, Kagamiyama,

More information

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid

More information

Notes on Kalman Filtering

Notes on Kalman Filtering Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren

More information

Dimitri Solomatine. D.P. Solomatine. Data-driven modelling (part 2). 2

Dimitri Solomatine. D.P. Solomatine. Data-driven modelling (part 2). 2 Daa-driven modelling. Par. Daa-driven Arificial di Neural modelling. Newors Par Dimiri Solomaine Arificial neural newors D.P. Solomaine. Daa-driven modelling par. 1 Arificial neural newors ANN: main pes

More information

THE DISCRETE WAVELET TRANSFORM

THE DISCRETE WAVELET TRANSFORM . 4 THE DISCRETE WAVELET TRANSFORM 4 1 Chaper 4: THE DISCRETE WAVELET TRANSFORM 4 2 4.1 INTRODUCTION TO DISCRETE WAVELET THEORY The bes way o inroduce waveles is hrough heir comparison o Fourier ransforms,

More information

Robotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1.

Robotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1. Roboics I April 11, 017 Exercise 1 he kinemaics of a 3R spaial robo is specified by he Denavi-Harenberg parameers in ab 1 i α i d i a i θ i 1 π/ L 1 0 1 0 0 L 3 0 0 L 3 3 able 1: able of DH parameers of

More information

Rev. Téc. Ing. Univ. Zulia. Vol. 39, Nº 1, , 2016

Rev. Téc. Ing. Univ. Zulia. Vol. 39, Nº 1, , 2016 Rev. Téc. Ing. Univ. Zulia. Vol. 39, Nº 1, 358-363, 216 doi:1.21311/1.39.1.41 Face Deecion and Recogniion Based on an Improved Adaboos Algorihm and Neural Nework Haoian Zhang*, Jiajia Xing, Muian Zhu,

More information

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),

More information

CHAPTER 2 Signals And Spectra

CHAPTER 2 Signals And Spectra CHAPER Signals And Specra Properies of Signals and Noise In communicaion sysems he received waveform is usually caegorized ino he desired par conaining he informaion, and he undesired par. he desired par

More information

Keywords Digital Infinite-Impulse Response (IIR) filter, Digital Finite-Impulse Response (FIR) filter, DE, exploratory move

Keywords Digital Infinite-Impulse Response (IIR) filter, Digital Finite-Impulse Response (FIR) filter, DE, exploratory move Volume 5, Issue 7, July 2015 ISSN: 2277 128X Inernaional Journal of Advanced Research in Compuer Science and Sofware Engineering Research Paper Available online a: www.ijarcsse.com A Hybrid Differenial

More information

15. Vector Valued Functions

15. Vector Valued Functions 1. Vecor Valued Funcions Up o his poin, we have presened vecors wih consan componens, for example, 1, and,,4. However, we can allow he componens of a vecor o be funcions of a common variable. For example,

More information

MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS

MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS 1 MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS INTRODUCTION Mos real world opimizaion problems involve complexiies like discree, coninuous or mixed variables, muliple conflicing objecives, non-lineariy,

More information

INTRODUCTION TO MACHINE LEARNING 3RD EDITION

INTRODUCTION TO MACHINE LEARNING 3RD EDITION ETHEM ALPAYDIN The MIT Press, 2014 Lecure Slides for INTRODUCTION TO MACHINE LEARNING 3RD EDITION alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/i2ml3e CHAPTER 2: SUPERVISED LEARNING Learning a Class

More information

Shiva Akhtarian MSc Student, Department of Computer Engineering and Information Technology, Payame Noor University, Iran

Shiva Akhtarian MSc Student, Department of Computer Engineering and Information Technology, Payame Noor University, Iran Curren Trends in Technology and Science ISSN : 79-055 8hSASTech 04 Symposium on Advances in Science & Technology-Commission-IV Mashhad, Iran A New for Sofware Reliabiliy Evaluaion Based on NHPP wih Imperfec

More information

Non-parametric techniques. Instance Based Learning. NN Decision Boundaries. Nearest Neighbor Algorithm. Distance metric important

Non-parametric techniques. Instance Based Learning. NN Decision Boundaries. Nearest Neighbor Algorithm. Distance metric important on-parameric echniques Insance Based Learning AKA: neares neighbor mehods, non-parameric, lazy, memorybased, or case-based learning Copyrigh 2005 by David Helmbold 1 Do no fi a model (as do LDA, logisic

More information

Content-Based Shape Retrieval Using Different Shape Descriptors: A Comparative Study Dengsheng Zhang and Guojun Lu

Content-Based Shape Retrieval Using Different Shape Descriptors: A Comparative Study Dengsheng Zhang and Guojun Lu Conen-Based Shape Rerieval Using Differen Shape Descripors: A Comparaive Sudy Dengsheng Zhang and Guojun Lu Gippsland School of Compuing and Informaion Technology Monash Universiy Churchill, Vicoria 3842

More information

Some Basic Information about M-S-D Systems

Some Basic Information about M-S-D Systems Some Basic Informaion abou M-S-D Sysems 1 Inroducion We wan o give some summary of he facs concerning unforced (homogeneous) and forced (non-homogeneous) models for linear oscillaors governed by second-order,

More information

Task-based Configuration Optimization of Modular and Reconfigurable Robots using a Multi-solution Inverse Kinematics Solver

Task-based Configuration Optimization of Modular and Reconfigurable Robots using a Multi-solution Inverse Kinematics Solver CARV 2007 Task-based Configuraion Opimizaion of Modular and Reconfigurable Robos using a Muli-soluion Inverse Kinemaics Solver S. Tabandeh 1, C. Clark 2, W. Melek 3 Absrac: Modular and Reconfigurable Robos

More information

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Space

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Space Inernaional Journal of Indusrial and Manufacuring Engineering Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Space Vichai Rungreunganaun and Chirawa Woarawichai

More information

The Rosenblatt s LMS algorithm for Perceptron (1958) is built around a linear neuron (a neuron with a linear

The Rosenblatt s LMS algorithm for Perceptron (1958) is built around a linear neuron (a neuron with a linear In The name of God Lecure4: Percepron and AALIE r. Majid MjidGhoshunih Inroducion The Rosenbla s LMS algorihm for Percepron 958 is buil around a linear neuron a neuron ih a linear acivaion funcion. Hoever,

More information

Structural Break Detection in Time Series Models

Structural Break Detection in Time Series Models Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by an IBM faculy

More information

Time series Decomposition method

Time series Decomposition method Time series Decomposiion mehod A ime series is described using a mulifacor model such as = f (rend, cyclical, seasonal, error) = f (T, C, S, e) Long- Iner-mediaed Seasonal Irregular erm erm effec, effec,

More information

CE 395 Special Topics in Machine Learning

CE 395 Special Topics in Machine Learning CE 395 Special Topics in Machine Learning Assoc. Prof. Dr. Yuriy Mishchenko Fall 2017 DIGITAL FILTERS AND FILTERING Why filers? Digial filering is he workhorse of digial signal processing Filering is a

More information

SOLUTIONS TO ECE 3084

SOLUTIONS TO ECE 3084 SOLUTIONS TO ECE 384 PROBLEM 2.. For each sysem below, specify wheher or no i is: (i) memoryless; (ii) causal; (iii) inverible; (iv) linear; (v) ime invarian; Explain your reasoning. If he propery is no

More information

Macroeconomic Theory Ph.D. Qualifying Examination Fall 2005 ANSWER EACH PART IN A SEPARATE BLUE BOOK. PART ONE: ANSWER IN BOOK 1 WEIGHT 1/3

Macroeconomic Theory Ph.D. Qualifying Examination Fall 2005 ANSWER EACH PART IN A SEPARATE BLUE BOOK. PART ONE: ANSWER IN BOOK 1 WEIGHT 1/3 Macroeconomic Theory Ph.D. Qualifying Examinaion Fall 2005 Comprehensive Examinaion UCLA Dep. of Economics You have 4 hours o complee he exam. There are hree pars o he exam. Answer all pars. Each par has

More information

A Framework for Efficient Document Ranking Using Order and Non Order Based Fitness Function

A Framework for Efficient Document Ranking Using Order and Non Order Based Fitness Function A Framework for Efficien Documen Ranking Using Order and Non Order Based Finess Funcion Hazra Imran, Adii Sharan Absrac One cenral problem of informaion rerieval is o deermine he relevance of documens

More information

12: AUTOREGRESSIVE AND MOVING AVERAGE PROCESSES IN DISCRETE TIME. Σ j =

12: AUTOREGRESSIVE AND MOVING AVERAGE PROCESSES IN DISCRETE TIME. Σ j = 1: AUTOREGRESSIVE AND MOVING AVERAGE PROCESSES IN DISCRETE TIME Moving Averages Recall ha a whie noise process is a series { } = having variance σ. The whie noise process has specral densiy f (λ) = of

More information

Stable block Toeplitz matrix for the processing of multichannel seismic data

Stable block Toeplitz matrix for the processing of multichannel seismic data Indian Journal of Marine Sciences Vol. 33(3), Sepember 2004, pp. 215-219 Sable block Toepliz marix for he processing of mulichannel seismic daa Kiri Srivasava* & V P Dimri Naional Geophysical Research

More information

Rapid Termination Evaluation for Recursive Subdivision of Bezier Curves

Rapid Termination Evaluation for Recursive Subdivision of Bezier Curves Rapid Terminaion Evaluaion for Recursive Subdivision of Bezier Curves Thomas F. Hain School of Compuer and Informaion Sciences, Universiy of Souh Alabama, Mobile, AL, U.S.A. Absrac Bézier curve flaening

More information

1. VELOCITY AND ACCELERATION

1. VELOCITY AND ACCELERATION 1. VELOCITY AND ACCELERATION 1.1 Kinemaics Equaions s = u + 1 a and s = v 1 a s = 1 (u + v) v = u + as 1. Displacemen-Time Graph Gradien = speed 1.3 Velociy-Time Graph Gradien = acceleraion Area under

More information

Increase Our Learning Horizon with Evolving Technology

Increase Our Learning Horizon with Evolving Technology Increase Our Learning Horizon wih Evolving Technology Wei-Chi Yang Radford Universiy Radford, Virginia 24142, USA e-mail: wyang@radford.edu Asrac. In his shor noe, we demonsrae how evolving echnological

More information

Announcements. Recap: Filtering. Recap: Reasoning Over Time. Example: State Representations for Robot Localization. Particle Filtering

Announcements. Recap: Filtering. Recap: Reasoning Over Time. Example: State Representations for Robot Localization. Particle Filtering Inroducion o Arificial Inelligence V22.0472-001 Fall 2009 Lecure 18: aricle & Kalman Filering Announcemens Final exam will be a 7pm on Wednesday December 14 h Dae of las class 1.5 hrs long I won ask anyhing

More information

CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING

CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING ISPRS Commission VII Mid-erm Symposium "Remoe Sensing: From Pixels o Processes", Enschede, he Neherlands, 8-11 May 2006 CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING Sharaf Alkheder,

More information

Problem Set 5. Graduate Macro II, Spring 2017 The University of Notre Dame Professor Sims

Problem Set 5. Graduate Macro II, Spring 2017 The University of Notre Dame Professor Sims Problem Se 5 Graduae Macro II, Spring 2017 The Universiy of Nore Dame Professor Sims Insrucions: You may consul wih oher members of he class, bu please make sure o urn in your own work. Where applicable,

More information

Class Meeting # 10: Introduction to the Wave Equation

Class Meeting # 10: Introduction to the Wave Equation MATH 8.5 COURSE NOTES - CLASS MEETING # 0 8.5 Inroducion o PDEs, Fall 0 Professor: Jared Speck Class Meeing # 0: Inroducion o he Wave Equaion. Wha is he wave equaion? The sandard wave equaion for a funcion

More information

Analyze patterns and relationships. 3. Generate two numerical patterns using AC

Analyze patterns and relationships. 3. Generate two numerical patterns using AC envision ah 2.0 5h Grade ah Curriculum Quarer 1 Quarer 2 Quarer 3 Quarer 4 andards: =ajor =upporing =Addiional Firs 30 Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 andards: Operaions and Algebraic Thinking

More information

( ) Eight geological shape curvature classes are defined in terms of the Gaussian and mean normal curvatures as follows: perfect saddle, plane

( ) Eight geological shape curvature classes are defined in terms of the Gaussian and mean normal curvatures as follows: perfect saddle, plane Geological Shape Curvaure Principal normal curvaures, and, are defined a any poin on a coninuous surface such ha:, + and + () The Gaussian curvaure, G, and he mean normal curvaure, M, are defined in erms

More information

An recursive analytical technique to estimate time dependent physical parameters in the presence of noise processes

An recursive analytical technique to estimate time dependent physical parameters in the presence of noise processes WHAT IS A KALMAN FILTER An recursive analyical echnique o esimae ime dependen physical parameers in he presence of noise processes Example of a ime and frequency applicaion: Offse beween wo clocks PREDICTORS,

More information

Západočeská Univerzita v Plzni, Czech Republic and Groupe ESIEE Paris, France

Západočeská Univerzita v Plzni, Czech Republic and Groupe ESIEE Paris, France ADAPTIVE SIGNAL PROCESSING USING MAXIMUM ENTROPY ON THE MEAN METHOD AND MONTE CARLO ANALYSIS Pavla Holejšovsá, Ing. *), Z. Peroua, Ing. **), J.-F. Bercher, Prof. Assis. ***) Západočesá Univerzia v Plzni,

More information

Non-parametric techniques. Instance Based Learning. NN Decision Boundaries. Nearest Neighbor Algorithm. Distance metric important

Non-parametric techniques. Instance Based Learning. NN Decision Boundaries. Nearest Neighbor Algorithm. Distance metric important on-parameric echniques Insance Based Learning AKA: neares neighbor mehods, non-parameric, lazy, memorybased, or case-based learning Copyrigh 2005 by David Helmbold 1 Do no fi a model (as do LTU, decision

More information

WATER LEVEL TRACKING WITH CONDENSATION ALGORITHM

WATER LEVEL TRACKING WITH CONDENSATION ALGORITHM WATER LEVEL TRACKING WITH CONDENSATION ALGORITHM Shinsuke KOBAYASHI, Shogo MURAMATSU, Hisakazu KIKUCHI, Masahiro IWAHASHI Dep. of Elecrical and Elecronic Eng., Niigaa Universiy, 8050 2-no-cho Igarashi,

More information

A Dynamic Model of Economic Fluctuations

A Dynamic Model of Economic Fluctuations CHAPTER 15 A Dynamic Model of Economic Flucuaions Modified for ECON 2204 by Bob Murphy 2016 Worh Publishers, all righs reserved IN THIS CHAPTER, OU WILL LEARN: how o incorporae dynamics ino he AD-AS model

More information

Overview. COMP14112: Artificial Intelligence Fundamentals. Lecture 0 Very Brief Overview. Structure of this course

Overview. COMP14112: Artificial Intelligence Fundamentals. Lecture 0 Very Brief Overview. Structure of this course OMP: Arificial Inelligence Fundamenals Lecure 0 Very Brief Overview Lecurer: Email: Xiao-Jun Zeng x.zeng@mancheser.ac.uk Overview This course will focus mainly on probabilisic mehods in AI We shall presen

More information

Unsteady Flow Problems

Unsteady Flow Problems School of Mechanical Aerospace and Civil Engineering Unseady Flow Problems T. J. Craf George Begg Building, C41 TPFE MSc CFD-1 Reading: J. Ferziger, M. Peric, Compuaional Mehods for Fluid Dynamics H.K.

More information

The ROC-Boost Design Algorithm for Asymmetric Classification

The ROC-Boost Design Algorithm for Asymmetric Classification The ROC-Boos Design Algorihm for Asymmeric Classificaion Guido Cesare Deparmen of Mahemaics Universiy of Genova (Ialy guido.cesare@gmail.com Robero Manduchi Deparmen of Compuer Engineering Universiy of

More information

SPH3U: Projectiles. Recorder: Manager: Speaker:

SPH3U: Projectiles. Recorder: Manager: Speaker: SPH3U: Projeciles Now i s ime o use our new skills o analyze he moion of a golf ball ha was ossed hrough he air. Le s find ou wha is special abou he moion of a projecile. Recorder: Manager: Speaker: 0

More information

Solution: b All the terms must have the dimension of acceleration. We see that, indeed, each term has the units of acceleration

Solution: b All the terms must have the dimension of acceleration. We see that, indeed, each term has the units of acceleration PHYS 54 Tes Pracice Soluions Spring 8 Q: [4] Knowing ha in he ne epression a is acceleraion, v is speed, is posiion and is ime, from a dimensional v poin of view, he equaion a is a) incorrec b) correc

More information

Tracking. Announcements

Tracking. Announcements Tracking Tuesday, Nov 24 Krisen Grauman UT Ausin Announcemens Pse 5 ou onigh, due 12/4 Shorer assignmen Auo exension il 12/8 I will no hold office hours omorrow 5 6 pm due o Thanksgiving 1 Las ime: Moion

More information

Ecological Archives E A1. Meghan A. Duffy, Spencer R. Hall, Carla E. Cáceres, and Anthony R. Ives.

Ecological Archives E A1. Meghan A. Duffy, Spencer R. Hall, Carla E. Cáceres, and Anthony R. Ives. Ecological Archives E9-95-A1 Meghan A. Duffy, pencer R. Hall, Carla E. Cáceres, and Anhony R. ves. 29. Rapid evoluion, seasonaliy, and he erminaion of parasie epidemics. Ecology 9:1441 1448. Appendix A.

More information

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon 3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of

More information

Non-uniform circular motion *

Non-uniform circular motion * OpenSax-CNX module: m14020 1 Non-uniform circular moion * Sunil Kumar Singh This work is produced by OpenSax-CNX and licensed under he Creaive Commons Aribuion License 2.0 Wha do we mean by non-uniform

More information

Kalman filtering for maximum likelihood estimation given corrupted observations.

Kalman filtering for maximum likelihood estimation given corrupted observations. alman filering maimum likelihood esimaion given corruped observaions... Holmes Naional Marine isheries Service Inroducion he alman filer is used o eend likelihood esimaion o cases wih hidden saes such

More information

Lecture 8. Digital Communications Part III. Digital Demodulation

Lecture 8. Digital Communications Part III. Digital Demodulation Lecure 8. Digial Communicaions Par III. Digial Demodulaion Binary Deecion M-ary Deecion Lin Dai (Ciy Universiy of Hong Kong) EE38 Principles of Communicaions Lecure 8 Analog Signal Source SOURCE A-D Conversion

More information

Tournament selection in zeroth-level classifier systems based on. average reward reinforcement learning

Tournament selection in zeroth-level classifier systems based on. average reward reinforcement learning ournamen selecion in zeroh-level classifier sysems based on average reward reinforcemen learning Zang Zhaoxiang, Li Zhao, Wang Junying, Dan Zhiping zxzang@gmail.com; zangzx@hus.edu.cn (Hubei Key Laboraory

More information

Structural Break Detection in Time Series

Structural Break Detection in Time Series Srucural Break Deecion in Time Series Richard A. Davis Thomas ee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures This research suppored in par by an IBM faculy award.

More information

The Potential Effectiveness of the Detection of Pulsed Signals in the Non-Uniform Sampling

The Potential Effectiveness of the Detection of Pulsed Signals in the Non-Uniform Sampling The Poenial Effeciveness of he Deecion of Pulsed Signals in he Non-Uniform Sampling Arhur Smirnov, Sanislav Vorobiev and Ajih Abraham 3, 4 Deparmen of Compuer Science, Universiy of Illinois a Chicago,

More information

1 1 + x 2 dx. tan 1 (2) = ] ] x 3. Solution: Recall that the given integral is improper because. x 3. 1 x 3. dx = lim dx.

1 1 + x 2 dx. tan 1 (2) = ] ] x 3. Solution: Recall that the given integral is improper because. x 3. 1 x 3. dx = lim dx. . Use Simpson s rule wih n 4 o esimae an () +. Soluion: Since we are using 4 seps, 4 Thus we have [ ( ) f() + 4f + f() + 4f 3 [ + 4 4 6 5 + + 4 4 3 + ] 5 [ + 6 6 5 + + 6 3 + ]. 5. Our funcion is f() +.

More information

A Shooting Method for A Node Generation Algorithm

A Shooting Method for A Node Generation Algorithm A Shooing Mehod for A Node Generaion Algorihm Hiroaki Nishikawa W.M.Keck Foundaion Laboraory for Compuaional Fluid Dynamics Deparmen of Aerospace Engineering, Universiy of Michigan, Ann Arbor, Michigan

More information

An EM algorithm for maximum likelihood estimation given corrupted observations. E. E. Holmes, National Marine Fisheries Service

An EM algorithm for maximum likelihood estimation given corrupted observations. E. E. Holmes, National Marine Fisheries Service An M algorihm maimum likelihood esimaion given corruped observaions... Holmes Naional Marine Fisheries Service Inroducion M algorihms e likelihood esimaion o cases wih hidden saes such as when observaions

More information

The field of mathematics has made tremendous impact on the study of

The field of mathematics has made tremendous impact on the study of A Populaion Firing Rae Model of Reverberaory Aciviy in Neuronal Neworks Zofia Koscielniak Carnegie Mellon Universiy Menor: Dr. G. Bard Ermenrou Universiy of Pisburgh Inroducion: The field of mahemaics

More information

Solutions to the Exam Digital Communications I given on the 11th of June = 111 and g 2. c 2

Solutions to the Exam Digital Communications I given on the 11th of June = 111 and g 2. c 2 Soluions o he Exam Digial Communicaions I given on he 11h of June 2007 Quesion 1 (14p) a) (2p) If X and Y are independen Gaussian variables, hen E [ XY ]=0 always. (Answer wih RUE or FALSE) ANSWER: False.

More information

Lecture 3: Exponential Smoothing

Lecture 3: Exponential Smoothing NATCOR: Forecasing & Predicive Analyics Lecure 3: Exponenial Smoohing John Boylan Lancaser Cenre for Forecasing Deparmen of Managemen Science Mehods and Models Forecasing Mehod A (numerical) procedure

More information

5.2. The Natural Logarithm. Solution

5.2. The Natural Logarithm. Solution 5.2 The Naural Logarihm The number e is an irraional number, similar in naure o π. Is non-erminaing, non-repeaing value is e 2.718 281 828 59. Like π, e also occurs frequenly in naural phenomena. In fac,

More information

Innova Junior College H2 Mathematics JC2 Preliminary Examinations Paper 2 Solutions 0 (*)

Innova Junior College H2 Mathematics JC2 Preliminary Examinations Paper 2 Solutions 0 (*) Soluion 3 x 4x3 x 3 x 0 4x3 x 4x3 x 4x3 x 4x3 x x 3x 3 4x3 x Innova Junior College H Mahemaics JC Preliminary Examinaions Paper Soluions 3x 3 4x 3x 0 4x 3 4x 3 0 (*) 0 0 + + + - 3 3 4 3 3 3 3 Hence x or

More information

ADDITIONAL PROBLEMS (a) Find the Fourier transform of the half-cosine pulse shown in Fig. 2.40(a). Additional Problems 91

ADDITIONAL PROBLEMS (a) Find the Fourier transform of the half-cosine pulse shown in Fig. 2.40(a). Additional Problems 91 ddiional Problems 9 n inverse relaionship exiss beween he ime-domain and freuency-domain descripions of a signal. Whenever an operaion is performed on he waveform of a signal in he ime domain, a corresponding

More information

Speaker Adaptation Techniques For Continuous Speech Using Medium and Small Adaptation Data Sets. Constantinos Boulis

Speaker Adaptation Techniques For Continuous Speech Using Medium and Small Adaptation Data Sets. Constantinos Boulis Speaker Adapaion Techniques For Coninuous Speech Using Medium and Small Adapaion Daa Ses Consaninos Boulis Ouline of he Presenaion Inroducion o he speaker adapaion problem Maximum Likelihood Sochasic Transformaions

More information

!!"#"$%&#'()!"#&'(*%)+,&',-)./0)1-*23)

!!#$%&#'()!#&'(*%)+,&',-)./0)1-*23) "#"$%&#'()"#&'(*%)+,&',-)./)1-*) #$%&'()*+,&',-.%,/)*+,-&1*#$)()5*6$+$%*,7&*-'-&1*(,-&*6&,7.$%$+*&%'(*8$&',-,%'-&1*(,-&*6&,79*(&,%: ;..,*&1$&$.$%&'()*1$$.,'&',-9*(&,%)?%*,('&5

More information

Retrieval Models. Boolean and Vector Space Retrieval Models. Common Preprocessing Steps. Boolean Model. Boolean Retrieval Model

Retrieval Models. Boolean and Vector Space Retrieval Models. Common Preprocessing Steps. Boolean Model. Boolean Retrieval Model 1 Boolean and Vecor Space Rerieval Models Many slides in his secion are adaped from Prof. Joydeep Ghosh (UT ECE) who in urn adaped hem from Prof. Dik Lee (Univ. of Science and Tech, Hong Kong) Rerieval

More information

Resource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques

Resource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Eirini Eleni Tsiropoulou, Iakovos Gialagkolidis, Panagiois Vamvakas, and Symeon Papavassiliou Insiue of Communicaions

More information

INVERSE RESPONSE COMPENSATION BY ESTIMATING PARAMETERS OF A PROCESS COMPRISING OF TWO FIRST ORDER SYSTEMS

INVERSE RESPONSE COMPENSATION BY ESTIMATING PARAMETERS OF A PROCESS COMPRISING OF TWO FIRST ORDER SYSTEMS Inernaional Journal of Informaion Technology and nowledge Managemen July-December 0, Volume 5, No., pp. 433-438 INVERSE RESPONSE COMPENSATION BY ESTIMATING PARAMETERS OF A PROCESS COMPRISING OF TWO FIRST

More information

AN OPTIMISED CELLULAR AUTOMATA MODEL BASED ON ADAPTIVE GENETIC ALGORITHM FOR URBAN GROWTH SIMULATION

AN OPTIMISED CELLULAR AUTOMATA MODEL BASED ON ADAPTIVE GENETIC ALGORITHM FOR URBAN GROWTH SIMULATION The Inernaional Archives of he Phoogrammery, Remoe Sensing and Spaial Informaion Sciences, Vol. 38, Par II AN OPTIMISED CELLULAR AUTOMATA MODEL BASED ON ADAPTIVE GENETIC ALGORITHM FOR URBAN GROWTH SIMULATION

More information

Journal of Chemical and Pharmaceutical Research, 2014, 6(5): Research Article

Journal of Chemical and Pharmaceutical Research, 2014, 6(5): Research Article Available online www.jocpr.com Journal of Chemical and Pharmaceuical Research, 204, 6(5):70-705 Research Aricle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Cells formaion wih a muli-objecive geneic algorihm Jun

More information

CS376 Computer Vision Lecture 6: Optical Flow

CS376 Computer Vision Lecture 6: Optical Flow CS376 Compuer Vision Lecure 6: Opical Flow Qiing Huang Feb. 11 h 2019 Slides Credi: Krisen Grauman and Sebasian Thrun, Michael Black, Marc Pollefeys Opical Flow mage racking 3D compuaion mage sequence

More information

Structural Break Detection in Time Series Models

Structural Break Detection in Time Series Models Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by an IBM faculy

More information

Demodulation of Digitally Modulated Signals

Demodulation of Digitally Modulated Signals Addiional maerial for TSKS1 Digial Communicaion and TSKS2 Telecommunicaion Demodulaion of Digially Modulaed Signals Mikael Olofsson Insiuionen för sysemeknik Linköpings universie, 581 83 Linköping November

More information