On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis
|
|
- Joanna Ferguson
- 5 years ago
- Views:
Transcription
1 On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin Trrgon, Spin Emil: lrre@etse.urv.es Abstrct. The study presented in this pper is n nlysis for finding wht is the minimum signl-to-noise rtio tht must hve contour in order to llow its detection. For finding this minimum, ll the study hs been bsed on the nlysis of the grdient vector, becuse this kind of lgorithms re those which obtin best results. It cn be concluded tht: ) The nlysis of the grdient vector rgument is more robust thn the module; b) A contour must hve signl-to-noise rtio greter thn 4/5 in order to be detected, if smll opertors re used to obtin the grdient vector, nd so good contour loction be ssured. 1. Introduction Since the beginning of 60's, mny contour extrctor lgorithms hve been developed. A contour in n imge llows to obtin very importnt feture of the objects in the scene: the shpe of these objects. This feture is used to get n object description for its lter recognition [10]. At this moment, there is not generl purpose edge detector lgorithm useful for ny kind of imges independently of the scene chrcteristics. There re mny fctors who ffect the contour obtining process. Now, lgorithms bsed on the 1st derivtive re the most importnt. In [6], Hrlick sttes tht one edge extrctor is better thn nother if reducing the informtion of the imge (tht is, dding noise) preserves its behvior. Hrlick sttes tht ny edge extrctor obtins good results in bsence of noise. The processing of noise is the min problem in modem edge extrction lgorithms. So, Dvis in [4] lists the min fctors dding noise in the imges. These fctors re photon noise, defocusing nd texturl structure of the objects. For this reson the noise immunity of the contour extrctor lgorithms must be one of its most importnt fetures. At present, there re some lgorithms tht permit good contour extrction in noisy imges. These lgorithms re Cnny [3], Deriche [5] nd Mrr-Hildreth [8], ll of them bsed on the grdient vector nd 2nd directionl derivtive nlysis. This work studies when n edge cn be detected in function of its signl-to-noise rtio (SNR) with different lgorithms bsed on the grdient vector nlysis. The section 2 of the pper gives the problem of edge detection depending on the noise nd
2 412 the contrst. In section 3 the influence of noise in the grdient vector is studied. Finlly, in function of this noise, the minimum contrst to be detected is nlyzed. 2. Problem Definition V.S. Nlw [9] defines n edge s locl discontinuity in the illumintion function defining scene. A discontinuity of the nth order is defined s function whose nth derivtive contins delt function. Dvis [4] clssified the edges of scene in three clsses ccording to their profile. These re: lines (discontinuity of order 0), figure l; steps (discontinuity of order 1), figure lb; nd roofs b (discontinuity of order 2), figure lc. The discontinuities of greter orders re not relevnt. The mjority of lgorithms ttempt to ~ e solve the problem of extrcting step edges s these re the ones tht pper most frequently Figure 1 in ny scene. In rel imges, there re some fctors tht produce discontinuities in the illumintion function, nd they re not rel contours. In the imge of figure 2- pper discontinuities ssocited to the noise, there re mny discontinuities but they re very smll. In figure 2-b ppers discontinuities due to chnges in the illumintion of the scene. In figure 2-c, shows discontinuities due to rel contours..'.,,", "... E'. ; "-- " ',~.-.-" ' 2-'." ~.'- '." L I i " "'l-". ",".r-. -~,.,~ "_. --~,., : ;.~,_~-"~, '~.'- ' ~'~.~, -',-,- '_" ~.,;,IA Figure 2 Hrlick sttes tht in imges with very low level of noise, ll the edges cn be detected with ny lgorithm. In this cse contours with very low contrst, cn be detected. An exmple of this sitution ppers in figure 3-. It hs circle t the center of the imge with very low contrst. Figure 3-b shows the contour extrcted with Cnny lgorithm. But when the sme imge hs higher level of noise, like figure 3-c, contours with low contrst re more difficult to detect. Figure 3-d shows tht the circle hs not been detected. This exmple explins tht the detection of contour depends on its SNR.
3 413 ~":"," ' ',',' :'?~:'..~i 9.; e -~, -:_:,,~,.;, ~,,~-,., ~,..'"';_..'..:..~ -. ~',,.~ ~.~ , ~ ~,-,. ',,r..: ~, ", ~ 9 -~ :.,,~ V, ~'.,;" :;~,~'-.;,., : "'.~'..~ Figure 3 This work nlyzes problems introduced by the noise, trying to find the minimum SNR tht rel contour must hve, in order to be detected. d 3. Anlysis of the contour detection A contour in n imge defines discontinuity of the illumintion function. Those rguments of the grdient vectors ner of the contour chnge continuously long the contour nd their modules hve higher vlues thn the rest of the imge. For this reson, contour cn be detected with: ) the nlysis of the grdient vector rguments, b) the nlysis of the grdient vector modules, or c) the nlysis of both, modules nd rguments. Becuse of the objective of this work is looking for the minimum SNR, it studies only stright step edges. For curved edges the SNR will be equl or higher. In order to ssure good loction of the contour, the opertors for the grdient computtion must be smll. In the nlysis mde in this pper, the grdient vectors re obtined with two pirs of opertors: the first pir re 3x3 sized, tht loctes the grdient vectors t the center of ech pixel, nd the second pir re 4x4 sized, tht loctes them t the intersection of every 4 pixels. So, more dense mp of grdient vectors is computed. Ellipticl neighborhoods of different sizes hve been considered for this nlysis. These clss of neighborhoods used in the edge detection lgorithm in [7] hve 7, 13 nd 19 grdient vectors inside them tht re oriented depending on the direction of the centrl grdient vector of the stright edges used for this nlysis. Figure 4 shows these ellipticl neighborhoods for horizontl contours. I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I Figure 4 Different vlues of the SNR hs been considered for this study. The stndrd devition of the noise is fixed to 20, nd the contrsts of the contours nlyzed re 1, 2, 4, 8, 12 nd 16 gry levels per pixel. So, the SNR re defined s 1/20, 1/10, 1/5, 2/5, 3/5 nd 4/5 respectively.
4 414 In order to compre the different nlysis mde in this work, the following qulity fctor is defined: where n: Number of contour pixels detected. n n': Number of contour pixels in the imge. 7/= n'+(n"-n) n": Number of pixels detected s contour (flse detection included). The vlues of n, n' nd n" re obtined s follows n=m.pc(i,n,t) n'= M. C n"= M.[C. pc(i,n,t)+(1-c)pnc(i,n,t)] where M is the number of pixels in the imge, nd C is the rtio of contour pixels in the imge. The vlue of Pc (i, N, t) depends on the nlysis. In the cse of the rgument nlysis Pc (i, N, ) is the probbility tht t lest i rguments of the N I g grdients vectors in the ellipse fulfill Itxj- iq _< c~ when the centrl point of the ellipse is contour pixel, j represents the set of the grdient vector rguments inside the ellipse. In the cse of the module nlysis Pc (i, N, m) is the probbility tht t lest i modules of the N grdients vectors in the ellipse fulfill m) > m when the centrl point of the ellipse is contour pixel, m~ represents the set of the grdient vector modules inside the ellipse. The vlue of P,c q, N, oc) is similr to Pc (/, N,) but it corresponds to the cse when the centrl point of the ellipse is non-contour pixel. These vlues re different for different vlues of SNR. An exmple of these functions re shown in figure 5. Figure 5- represents the probbility function pc (13,13, ) for the rgument nlysis, nd figure 5-b represents the probbility function Pc (13,13,m) for the module nlysis. In both cses the SNR is 3/5 nd they re obtined in heuristic nlysis. The X xis represents the threshold nd m respectively. o02i 002T o.o, I o.o, 1 o.o, 1 o.o, ~ Figure 5 Figure 6 represents n exmple of the qulity fctor. Figure 6- for the rgument condition nd figure 6-b for the module condition. It corresponds to the sme cse s figure 5. The Y xis represents the qulity fctor nd the X xis represents the threshold. A 10% of contour pixels in the imge is ssumed. So, C=0.1. b
5 O ; Figure 6 The most importnt vlue of these functions is the mximum nd their thresholds. So, in the cse of the rgument the best threshold is 86 ~ where the qulity fctor is 0.506, nd the best threshold for the module is 12 where its qulity fctor is These re not the best qulity fctors for the ellipticl neighborhood of size 13. For the rgument the best qulity fctor is when t lest 12 of the 13 grdient vectors Coc(12,13,~z)) fulfill the condition. In this cse the qulity fctor is with threshold of 72 ~ With the module, the best qulity fctor is when t lest 5 of the 13 grdient vectors (Pc(5,13, m)) fulfill the condition. Here, the qulity fctor is with threshold of 6. Tbles 1 shows the bests qulity fctors for different SNR, nd different sizes of the ellipticl neighborhood for the rgument nlysis, the module nlysis, nd the module nd rgument nlysis. In ech cell of the tble there is the best qulity fctor tht belongs to the best threshold, nd in the cse of the rgument nlysis nd the module nlysis how mny grdient vectors must fulfill t lest, the condition. b Argument Anlysis Module Anlysis Argument nd Module Anlysis Ellipse Contrst = 4 Size SNR = 1/ (6 from 7) (9 from 13) (14 from 19) (5 from 7) (5 from 13) (11 from 19) Contrst = 8 SNR = 2/ (6 from 7) (11 from 13) (15 from 19) (2 from 7) (5 from 13) (9 from 19) Contrst = 12 SNR = 3/ (7 from 7) (12from 13) (15 from 19) (2 from 7) (5 from 13) I8 from 19) Contrst = 16 SNR = 4/ (7 from 7) (12 from 13) (16 from 19) (3 from 7) (6 from 13) (9 from Tble 1 The conclusions of the results of this tble re discussed in the next section.
6 Conclusions The most importnt conclusions of this work re the following: - The rgument of the grdient vector is more robust thn the module for the detection of step edges. This mens tht the informtion of the rgument llows to detect contours with lower contrst thn the informtion of the module. - The results of nlyzing module nd rguments together re only little better, but the lgorithm would be more complex thn the other cses. - The detection improves with the number of grdient vectors nlyzed. The number of grdient vectors is limited becuse of the region to be nlyzed must be over the contour. In curved lines the region to be nlyzed must be curved too, in order to follow the sme direction of the contour. - Lrger opertors for the grdient vector obtenfion improve the detection of the contour, but it must be smll to ssure good loction. - Contours with SNR of 2/5 re very difficult to detect. Contours with SNR of 4/5 cn be detected with good results with the rgument or the module informtion nd n ellipticl neighborhood of size 13. References [1] Kim L. Buyer, Sudeep Srkr, "On the Locliztion Performnce Mesure nd Optiml Edge Detection," IEEE Trns. on PAMI Vol. 16 No. 1 ( ) Jnury [2] J. Brin Bums, Allen R. Hnson, Edwrd M. Risemn, "Extrcting Stright Lines," Computer nd Informtion Science Dept. Tech. Rep , Univ. of Msschusetts, December [3] John F. Cnny, "Finding Edges nd Lines in Imges," MIT., Cmbridge, Tech. Rep. 720, June [4] L.S. Dvis, "A Survey of Edge Detection Techniques," Comp. Grph. nd Imge Proc., 4 ( ) [5] R. Deriche, "Using Cnny's Criteri to Derive Recursive Implemented Optiml Edge Detector," The Int. Jour. of Comp. Vision, 1 ( ), [6] Robert M. Hriick, "Digitl Step Edges from Zero Crossing of Second Directionl Derivtives," IEEE Trns. on PAMI Vol. 6 No.1 (58-68) Jn [7] Albert Lrr6, Edurd Montseny, "A Step Edge Detector Algorithm Bsed On Symbolic Anlysis," 12th IAPR Inter. Conf. on Pttern Recognition, Vol. 1 (6-10) October [8] D.C. Mrr, E. Hildreth, "Theory of Edge Detection," Proc. of the Royl Society of London, Series B, Vol [9] V.S. Nlw, T. O. Binford, "On Detecting Edges," IEEE Trns. on PAMI Vol. 8 No.6 ( ) November [10] Azriel Rosenfeld, M. Thurston, Y. Lee, "Edge nd Curve Detection: Further Experiments," IEEE Trns. on Comp., Vol.C-21 No.7 ( ) July [11] Vincent Torre, Tomso Poggio "On edge detection," IEEE Trns.PAMI Vol. 8 No.2 ( ) Februry.1986.
Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.
Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution
More informationClass-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts
Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationL. Yaroslavsky. Fundamentals of Digital Image Processing. Course
L. Yroslvsky. Fundmentls of Digitl Imge Processing. Course 0555.330 Lecture. Imge enhncement.. Imge enhncement s n imge processing tsk. Clssifiction of imge enhncement methods Imge enhncement is processing
More informationMTH 146 Conics Supplement
105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points
More information9.1 apply the distance and midpoint formulas
9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the
More informationComputing offsets of freeform curves using quadratic trigonometric splines
Computing offsets of freeform curves using qudrtic trigonometric splines JIULONG GU, JAE-DEUK YUN, YOONG-HO JUNG*, TAE-GYEONG KIM,JEONG-WOON LEE, BONG-JUN KIM School of Mechnicl Engineering Pusn Ntionl
More informationHyperbolas. Definition of Hyperbola
CHAT Pre-Clculus Hyperols The third type of conic is clled hyperol. For n ellipse, the sum of the distnces from the foci nd point on the ellipse is fixed numer. For hyperol, the difference of the distnces
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationUSING HOUGH TRANSFORM IN LINE EXTRACTION
Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More informationMidterm 2 Sample solution
Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the
More informationStatistical classification of spatial relationships among mathematical symbols
2009 10th Interntionl Conference on Document Anlysis nd Recognition Sttisticl clssifiction of sptil reltionships mong mthemticl symbols Wl Aly, Seiichi Uchid Deprtment of Intelligent Systems, Kyushu University
More informationSolving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016
Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence Winter 2016 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl
More informationCharacter-Stroke Detection for Text-Localization and Extraction
Chrcter-Stroke Detection for Text-Locliztion nd Extrction Krishn Subrmnin ksubrm@bbn.com Prem Ntrjn pntrj@bbn.com Michel Decerbo mdecerbo@bbn.com Dvid Cstñòn Boston University dc@bu.edu Abstrct In this
More informationSystems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits
Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationComplete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li
2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationLecture 10 Evolutionary Computation: Evolution strategies and genetic programming
Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting
More informationThe Reciprocal Function Family. Objectives To graph reciprocal functions To graph translations of reciprocal functions
- The Reciprocl Function Fmil Objectives To grph reciprocl functions To grph trnsltions of reciprocl functions Content Stndrds F.BF.3 Identif the effect on the grph of replcing f () b f() k, kf(), f(k),
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More informationDigital Design. Chapter 6: Optimizations and Tradeoffs
Digitl Design Chpter 6: Optimiztions nd Trdeoffs Slides to ccompny the tetbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by Frnk Vhid, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com
More informationA Comparison of the Discretization Approach for CST and Discretization Approach for VDM
Interntionl Journl of Innovtive Reserch in Advnced Engineering (IJIRAE) Volume1 Issue1 (Mrch 2014) A Comprison of the Discretiztion Approch for CST nd Discretiztion Approch for VDM Omr A. A. Shib Fculty
More informationThe Fundamental Theorem of Calculus
MATH 6 The Fundmentl Theorem of Clculus The Fundmentl Theorem of Clculus (FTC) gives method of finding the signed re etween the grph of f nd the x-xis on the intervl [, ]. The theorem is: FTC: If f is
More information3.5.1 Single slit diffraction
3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke
More informationAnswer Key Lesson 6: Workshop: Angles and Lines
nswer Key esson 6: tudent Guide ngles nd ines Questions 1 3 (G p. 406) 1. 120 ; 360 2. hey re the sme. 3. 360 Here re four different ptterns tht re used to mke quilts. Work with your group. se your Power
More informationCSCI1950 Z Computa4onal Methods for Biology Lecture 2. Ben Raphael January 26, hhp://cs.brown.edu/courses/csci1950 z/ Outline
CSCI1950 Z Comput4onl Methods for Biology Lecture 2 Ben Rphel Jnury 26, 2009 hhp://cs.brown.edu/courses/csci1950 z/ Outline Review of trees. Coun4ng fetures. Chrcter bsed phylogeny Mximum prsimony Mximum
More information1.5 Extrema and the Mean Value Theorem
.5 Extrem nd the Men Vlue Theorem.5. Mximum nd Minimum Vlues Definition.5. (Glol Mximum). Let f : D! R e function with domin D. Then f hs n glol mximum vlue t point c, iff(c) f(x) for ll x D. The vlue
More informationMATH 2530: WORKSHEET 7. x 2 y dz dy dx =
MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl
More information3.5.1 Single slit diffraction
3.5.1 Single slit diffrction Wves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. We will consider this lter.
More informationGENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES
GENEATING OTHOIMAGES FO CLOSE-ANGE OBJECTS BY AUTOMATICALLY DETECTING BEAKLINES Efstrtios Stylinidis 1, Lzros Sechidis 1, Petros Ptis 1, Spiros Sptls 2 Aristotle University of Thessloniki 1 Deprtment of
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationNearest Keyword Set Search in Multi-dimensional Datasets
Nerest Keyword Set Serch in Multi-dimensionl Dtsets Vishwkrm Singh Deprtment of Computer Science University of Cliforni Snt Brbr, USA Emil: vsingh014@gmil.com Ambuj K. Singh Deprtment of Computer Science
More informationChapter 2 Sensitivity Analysis: Differential Calculus of Models
Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls
More informationSlides for Data Mining by I. H. Witten and E. Frank
Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationDynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012
Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.
More informationCSEP 573 Artificial Intelligence Winter 2016
CSEP 573 Artificil Intelligence Winter 2016 Luke Zettlemoyer Problem Spces nd Serch slides from Dn Klein, Sturt Russell, Andrew Moore, Dn Weld, Pieter Abbeel, Ali Frhdi Outline Agents tht Pln Ahed Serch
More informationAVolumePreservingMapfromCubetoOctahedron
Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online
More informationCHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE
CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse
More informationEngineer To Engineer Note
Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit
More informationFunctor (1A) Young Won Lim 8/2/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationMisrepresentation of Preferences
Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationChapter Spline Method of Interpolation More Examples Electrical Engineering
Chpter. Spline Method of Interpoltion More Exmples Electricl Engineering Exmple Thermistors re used to mesure the temperture of bodies. Thermistors re bsed on mterils chnge in resistnce with temperture.
More informationThe Distributed Data Access Schemes in Lambda Grid Networks
The Distributed Dt Access Schemes in Lmbd Grid Networks Ryot Usui, Hiroyuki Miygi, Yutk Arkw, Storu Okmoto, nd Noki Ymnk Grdute School of Science for Open nd Environmentl Systems, Keio University, Jpn
More informationGraphing Conic Sections
Grphing Conic Sections Definition of Circle Set of ll points in plne tht re n equl distnce, clled the rdius, from fixed point in tht plne, clled the center. Grphing Circle (x h) 2 + (y k) 2 = r 2 where
More informationLECT-10, S-1 FP2P08, Javed I.
A Course on Foundtions of Peer-to-Peer Systems & Applictions LECT-10, S-1 CS /799 Foundtion of Peer-to-Peer Applictions & Systems Kent Stte University Dept. of Computer Science www.cs.kent.edu/~jved/clss-p2p08
More informationIntroduction to Integration
Introduction to Integrtion Definite integrls of piecewise constnt functions A constnt function is function of the form Integrtion is two things t the sme time: A form of summtion. The opposite of differentition.
More informationTilt-Sensing with Kionix MEMS Accelerometers
Tilt-Sensing with Kionix MEMS Accelerometers Introduction Tilt/Inclintion sensing is common ppliction for low-g ccelerometers. This ppliction note describes how to use Kionix MEMS low-g ccelerometers to
More informationII. THE ALGORITHM. A. Depth Map Processing
Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A
More informationSolving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence
Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl component
More informationText mining: bag of words representation and beyond it
Text mining: bg of words representtion nd beyond it Jsmink Dobš Fculty of Orgniztion nd Informtics University of Zgreb 1 Outline Definition of text mining Vector spce model or Bg of words representtion
More informationPreserving Constraints for Aggregation Relationship Type Update in XML Document
Preserving Constrints for Aggregtion Reltionship Type Updte in XML Document Eric Prdede 1, J. Wenny Rhyu 1, nd Dvid Tnir 2 1 Deprtment of Computer Science nd Computer Engineering, L Trobe University, Bundoor
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More informationFunctor (1A) Young Won Lim 10/5/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More informationEECS 281: Homework #4 Due: Thursday, October 7, 2004
EECS 28: Homework #4 Due: Thursdy, October 7, 24 Nme: Emil:. Convert the 24-bit number x44243 to mime bse64: QUJD First, set is to brek 8-bit blocks into 6-bit blocks, nd then convert: x44243 b b 6 2 9
More informationIllumination and Shading
Illumintion nd hding In order to produce relistic imges, we must simulte the ppernce of surfces under vrious lighting conditions. Illumintion models: given the illumintion incident t point on surfce, wht
More informationA REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS
A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS Ji-Eun Roh (), Te-Eog Lee (b) (),(b) Deprtment of Industril nd Systems Engineering, Kore Advnced Institute
More informationINVESTIGATION OF RESAMPLING EFFECTS ON IRS-1D PAN DATA
INVESTIGATION OF RESAMPLING EFFECTS ON IRS-D PAN DATA Smpth Kumr P.,*, Onkr Dikshit nd YVS Murthy Geo-Informtics Division, Ntionl Remote Sensing Agency, Hyderd, Indi.-(smpth_k, murthy_yvs)@nrs.gov.in Deprtment
More informationSpectral Analysis of MCDF Operations in Image Processing
Spectrl Anlysis of MCDF Opertions in Imge Processing ZHIQIANG MA 1,2 WANWU GUO 3 1 School of Computer Science, Northest Norml University Chngchun, Jilin, Chin 2 Deprtment of Computer Science, JilinUniversity
More informationbox Boxes and Arrows 3 true 7.59 'X' An object is drawn as a box that contains its data members, for example:
Boxes nd Arrows There re two kinds of vriles in Jv: those tht store primitive vlues nd those tht store references. Primitive vlues re vlues of type long, int, short, chr, yte, oolen, doule, nd flot. References
More informationCone Cluster Labeling for Support Vector Clustering
Cone Cluster Lbeling for Support Vector Clustering Sei-Hyung Lee Deprtment of Computer Science University of Msschusetts Lowell MA 1854, U.S.A. slee@cs.uml.edu Kren M. Dniels Deprtment of Computer Science
More informationRational Numbers---Adding Fractions With Like Denominators.
Rtionl Numbers---Adding Frctions With Like Denomintors. A. In Words: To dd frctions with like denomintors, dd the numertors nd write the sum over the sme denomintor. B. In Symbols: For frctions c nd b
More informationA New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method
A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,
More informationPhysics 152. Diffraction. Difrraction Gratings. Announcements. Friday, February 2, 2007
ics Fri Feb.02. Announcements Diffrction Difrrction Grtings Fridy, Februry 2, 2007 Help sessions: W 9-10 pm in NSC 118 Msteringics WU #5 due Mondy WU #6 due Wednesdy http://www.voltnet.com/ldder/ A bem
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationImproper Integrals. October 4, 2017
Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationParallel Square and Cube Computations
Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu
More informationRevisiting the notion of Origin-Destination Traffic Matrix of the Hosts that are attached to a Switched Local Area Network
Interntionl Journl of Distributed nd Prllel Systems (IJDPS) Vol., No.6, November 0 Revisiting the notion of Origin-Destintion Trffic Mtrix of the Hosts tht re ttched to Switched Locl Are Network Mondy
More informationInternational Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016)
\ Interntionl Conference on Mechnics, Mterils nd tructurl Engineering (ICMME 2016) Reserch on the Method to Clibrte tructure Prmeters of Line tructured Light Vision ensor Mingng Niu1,, Kngnin Zho1, b,
More information1 Quad-Edge Construction Operators
CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationAlignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey
Alignment of Long Sequences BMI/CS 776 www.biostt.wisc.edu/bmi776/ Spring 2012 Colin Dewey cdewey@biostt.wisc.edu Gols for Lecture the key concepts to understnd re the following how lrge-scle lignment
More informationGraph Exploration: Taking the User into the Loop
Grph Explortion: Tking the User into the Loop Dvide Mottin, Anj Jentzsch, Emmnuel Müller Hsso Plttner Institute, Potsdm, Germny 2016/10/24 CIKM2016, Indinpolis, US Who we re Dvide Mottin grph mining, novel
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationTheory of Computation CSE 105
$ $ $ Theory of Computtion CSE 105 Regulr Lnguges Study Guide nd Homework I Homework I: Solutions to the following problems should be turned in clss on July 1, 1999. Instructions: Write your nswers clerly
More information2. What are the types of diffraction and give the differences between them? (June 2005, June 2011)
UNIT-1 b DIFFRACTION Diffrction:A) Distinction between Fresnel nd Frunhofer diffrction, B) diffrction due to single slit, N-slits,C) Diffrction grting experiment. 1 A) Distinction between Fresnel nd Frunhofer
More informationLING/C SC/PSYC 438/538. Lecture 21 Sandiway Fong
LING/C SC/PSYC 438/538 Lecture 21 Sndiwy Fong Tody's Topics Homework 8 Review Optionl Homework 9 (mke up on Homework 7) Homework 8 Review Question1: write Prolog regulr grmmr for the following lnguge:
More informationLily Yen and Mogens Hansen
SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst
More informationChapter 2. 3/28/2004 H133 Spring
Chpter 2 Newton believe tht light ws me up of smll prticles. This point ws ebte by scientists for mny yers n it ws not until the 1800 s when series of experiments emonstrte wve nture of light. (But be
More informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
More informationDYNAMIC DISCRETIZATION: A COMBINATION APPROACH
DYNAMIC DISCRETIZATION: A COMBINATION APPROACH FAN MIN, QIHE LIU, HONGBIN CAI, AND ZHONGJIAN BAI School of Computer Science nd Engineering, University of Electronic Science nd Technology of Chin, Chengdu
More informationToday. Search Problems. Uninformed Search Methods. Depth-First Search Breadth-First Search Uniform-Cost Search
Uninformed Serch [These slides were creted by Dn Klein nd Pieter Abbeel for CS188 Intro to AI t UC Berkeley. All CS188 mterils re vilble t http://i.berkeley.edu.] Tody Serch Problems Uninformed Serch Methods
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationYoplait with Areas and Volumes
Yoplit with Ares nd Volumes Yoplit yogurt comes in two differently shped continers. One is truncted cone nd the other is n ellipticl cylinder (see photos below). In this exercise, you will determine the
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More informationPARALLEL AND DISTRIBUTED COMPUTING
PARALLEL AND DISTRIBUTED COMPUTING 2009/2010 1 st Semester Teste Jnury 9, 2010 Durtion: 2h00 - No extr mteril llowed. This includes notes, scrtch pper, clcultor, etc. - Give your nswers in the ville spce
More informationHW Stereotactic Targeting
HW Stereotctic Trgeting We re bout to perform stereotctic rdiosurgery with the Gmm Knife under CT guidnce. We instrument the ptient with bse ring nd for CT scnning we ttch fiducil cge (FC). Above: bse
More informationSubband coding of image sequences using multiple vector quantizers. Emanuel Martins, Vitor Silva and Luís de Sá
Sund coding of imge sequences using multiple vector quntizers Emnuel Mrtins, Vitor Silv nd Luís de Sá Instituto de Telecomunicções, Deprtmento de Engenhri Electrotécnic Pólo II d Universidde de Coimr,
More informationSection 9.2 Hyperbolas
Section 9. Hperols 597 Section 9. Hperols In the lst section, we lerned tht plnets hve pproimtel ellipticl orits round the sun. When n oject like comet is moving quickl, it is le to escpe the grvittionl
More informationStep-Voltage Regulator Model Test System
IEEE PES GENERAL MEETING, JULY 5 Step-Voltge Regultor Model Test System Md Rejwnur Rshid Mojumdr, Pblo Arboley, Senior Member, IEEE nd Cristin González-Morán, Member, IEEE Abstrct In this pper, 4-node
More information