Control Camera and Light Source Positions using Image Gradient Information

Size: px
Start display at page:

Download "Control Camera and Light Source Positions using Image Gradient Information"

Transcription

1 IEEE Int. Conf. on Rootics nd Automtion, ICRA'7 Rom, Itli, April 27 Control Cmer nd Light Source Positions using Imge Grdient Informtion Eric Mrchnd Astrct In this pper, we propose n originl pproch to control cmer position nd/or lighting conditions in n environment using imge grdient informtion. Our gol is to ensure good viewing condition nd good illumintion of n oject to perform vision-sed tsk (recognition, trcking, etc.). Within the visul servoing frmework, we propose solutions to two different issues: mximizing the rightness of the scene nd mximizing the contrst in the imge. Solutions re proposed to consider either sttic light nd moving cmer, eitheror moving light nd sttic/moving cmer. The proposed method is independent of the structure, color nd spect of the ojects. Experimentl results on oth synthetic nd rel imges re finlly presented. I. OVERVIEW In this pper we investigte the prolem of reltive plcement etween n oject, cmer nd light source. Ensuring n optiml plcement of the cmer or of light source is n essentil step in the development of industril vision systems. Indeed good lighting conditions ensure good imge qulity nd thus enle to simplify or improve reliility of vision lgorithms. Most of the reserch regrding illumintion re focused on shpe from shding (eg, [24], light source position estimtion (eg, [9]), trcking (eg, [14], [7]). Some of these works ssume the conservtion of the point luminnce over the imge sequence [12] ut most of them ssume more complex illumintion models such s the Phong model [19] or the Torrnce-Sprrow model [22]. Nevertheless, few works hve considered lighting conditions, nd especilly illumintion control or cmer control wrt. illumintion conditions, within rootics tsks or ctive vision. Skne nd Sto [2] present n utomtic plnning method of light source nd cmer plcement to minimize shdow cused y the surrounding environment. Cown et l. [2][4] extend the CAD-sed system presented in [3] in order to mintin the rightness of the oject surfce within the dynmic rnge of the cmer [2] (the surfce must not e either too right or too drk). Furthermore light plcement hs to e optimized for edge detection [4]. The method presented in [3] is used to synthesize 3-D regions of cceptle cmer loctions for the specified tsk. Ech criterion (sptil resolution, field of view, visiility, edge contrst, cmer dynmic rnge, etc.) llows to define 3-D regions which provide the spce of possile viewpoints when they intersect. The system ICE presented in [23] determines the est cmer view nd light source loction to optimlly Author is with INRIA, IRISA, Lgdic project, F-3 Rennes, Frnce; emil: Eric.Mrchnd@iris.fr oserve given edge nd to mximize the ccurcy of its position. The cmer nd light positions re chosen such tht mesurements dt cn e otined with minimum uncertinty. Minly contrst on the edge is considered nd the system is sed on the illumintion model descried in [22]. Murse nd Nyr [17] used n eigenspce-sed method to determine the illumintion for which the ojects re most distinguishle for recognition purpose. More recently Eltoft et l. [] proposed system thn cn optimlly enhnce imge fetures such s edges or points y ctive scene illumintion. More complex illumintion models re considered [11], [21]. Let us not tht in most of these systems good knowledge of the oject or of the environment hs to e known in order to evlute off-line the vrious criteri relted to the specified tsk nd to determine the est lightsource nd cmer loction. In the different context of 2D trcking, Hger et l.[8] derive the interction mtrix tht link the time vrition of imge intensity to the 2D motion of n oject. In this pper, we lso consider models used in motion nlysis nd determine the vrition of imge intensity due to cmer or light source motion. Oviously the underlying model, sed on the derivtion of the opticl flow constrint eqution (OFCE) is, pprently, very restrictive. Nevertheless, experimentl results show tht it remins usle in mny cses. This pper presents method to control cmer position with respect to light source. Our gol is to ensure good illumintion of n oject or good cmer loction to e le to perform efficiently vision-sed tsks. Within the visul servoing frmework, we propose solutions to two different issues: mximizing the rightness of the scene nd mximizing the contrst or grdient in the imge. Solutions re proposed to consider either sttic light nd moving cmer, or moving light nd sttic/moving cmer. Thnks to the simplicity of the illumintion model sed on the OFCE, the proposed method is independent of the structure, color nd spect of the ojects. Two different goodness functions my e proposed to chieve this gol: one is directly sed on the intensity within the imge while the second is sed on the intensity grdient. To outline the issue, our primry gol will e to move the cmer while the lighting remins sttic (see Figure 1.). Then, we will propose to move the lighting while the cmer remins sttic (see Figure 1.). In the reminder of this pper we first recll the opticl flow constrint eqution nd show how it cn e used to control moving cmer in Section II. Goodness functions sed on rightness re shown in Section III nd their integrtion

2 sttic light light R moving cmer sttic cmer Fig. 1. Controlling lighting conditions. () sttic light/moving cmer () moving light/sttic cmer within visul servoing control lw presented in Section IV. Finlly, experimentl results showing the vlidity of our pproch re presented. II. TEMPORAL VARIATION OF THE LIGHTING INFORMATION ) Opticl flow constrint eqution: The sic hypothesis ssumes the temporl constncy of the rightness for physicl point etween two imges. This hypothesis leds to the so-clled opticl flow constrint eqution (OFCE) tht links the temporl vrition of the luminnce to the imge point motion. More precisely, ssuming tht the point hs displcement (dx, dy) T in the time intervl dt, the previous hypothesis leds to: I(x + dx, y + dy, t + dt) = I(x, y, t). (1) A first order Tylor expnsion of this eqution gives: I x dx + I y I dy + dt =. (2) t Denoting dx dt = ẋ nd dy dt = ẏ the motion of the point in the imge nd I x = I x nd I y = I y the sptil grdient of the intensity nd I t = I the temporl vrition of the luminnce, we finlly otin the opticl flow constrint eqution given y: I = I x ẋ I y ẏ (3) ) Interction mtrix ssocited to the luminnce: Our gol is to link the temporl vrition of the luminnce to the time vrition of the cmer pose (or kinemtic screw v = (v, ω) where v is the instntneous liner velocity nd ω is the instntneous ngulr cmer velocity). This is in fct strightforwrd knowing the interction mtrix ssocited to the point. We indeed hve: ẋ = ( 1/Z x/z xy (1 + x 2 ) y ) v (4) tht we cn rewrite ẋ = L x v nd ẏ = ( 1/Z y/z 1 + y 2 xy x ) v () tht we rewrite ẏ = L y v. Using these equtions nd the OFCE we hve I t = I dr dt or: I = ( I x L x + I y L y ) = L I(x,y) v (6) L I(x,y) is the interction mtrix ssocited to the luminnce of point in the cse of moving point nd sttic cmer. III. CONTROLLING LIGHTING CONDITIONS As lredy stted, our gol is to control the illumintion of n oject. We will then consider two informtions relted to the lighting condition: the intensity in the imge. For such tsk, our gol will e to mximize the perceived luminnce of the oject in the imge. the contrst. Mximizing the luminnce is not lwys significnt. Indeed, for some oject, too much light my suppress some informtion (due, for exmple to speculrities). Therefore, in second time we will try to mximize the vlue of the intensity grdients in the imge (which is relted to contrst informtion). With respect to these specifictions of good lighting condition, we cn propose two cost functions tht reflect these ehviors. A. Mximizing the luminnce Our gol is to position the cmer wrt. the enlightened spect of the oject. We therefore wnt to mximize the quntity of light (re)emitted y the oject of interest nd perceived y the cmer to ensure good lighting condition. Applying the proposed methodology, we wnt to mximize the following cost function: h s = I(x, y) (7) where I(x, y) is the intensity of the 2D point (x, y). The vrition of the cost function h s due to cmer motion, tht will e used to control cmer or light source motion (see Section IV), is then given y = x y I(x, y) (8)

3 where r denote the cmer pose (trnsltion nd rottion). I(x,y) is nothing ut the interction mtrix L I(x,y) s defined in (6). Considering eqution (6) we got: = ( I x L x + I y L y ). (9) B. Mximizing the contrste. If our gol is to mximize the contrst within the imge, good criterion is to mximize the sum of the components of the sptil intensity grdient within the imge. The corresponding cost function is given y: h s = [ I 2 x + I 2 ] y. (1) As in Section III-A We therefore need to compute the grdient hs tht is in fct given y: = ( hs x L x + h ) s y L y (11) with nd ( 2 ) x = 2 I I x 2 x + 2 I I x y y ( 2 ) y = 2 I I x y x + 2 I I y 2 y After some rewriting, we finlly get: = 2 [( 2 ) I x 2 I x + 2 I y x I y L x ( 2 ] I + x y I x + 2 I y 2 I y )L y (12) IV. INTRODUCING ILLUMINATION CONSTRAINTS IN VISUAL SERVOING In this section we study how to use the constrints presented in Section III to control the cmer or the light source position. In oth cses the method relies on the well known visul servoing pproch nd tkes dvntge of the redundncy frmework. A. Positionning Cmer wrt. Visul Trgets The imge-sed visul servoing consists in specifying tsk s the regultion in the imge of set of visul fetures[6][1]. A good review nd introduction to visul servoing cn e found in [13]. Let us denote s the set of selected visul fetures used in the visul servoing tsk. To ensure the convergence of s to its desired vlue s, we need to know the interction mtrix L s tht links the motion of the oject in the imge to the cmer motion. It is defined y the clssicl eqution [6]: ṡ = L s (s, Z) v (13) where ṡ is the time vrition of s (the motion of s in the imge) due to the cmer motion v. The prmeters Z involved in L s represent the depth informtion of the considered ojects expressed in the cmer frme. A vision-sed tsk e 1 is defined y: e 1 = C(s s ) (14) where s is the desired vlue of the selected visul fetures, s is their current vlue (mesured from the imge t ech itertion of the control lw), nd C, clled comintion mtrix, hs to e chosen such tht CL s is full rnk. It cn e defined s C = L + s (s,p). For mking e 1 exponentilly decreses nd then ehves like first order decoupled system, the cmer velocity given s input to the root controller is given y: v = λe 1 (1) where λ is the proportionl coefficient involved in the exponentil convergence of e. B. Introducing constrints within the positioning tsk If the vision-sed tsk does not constrin ll the n root degrees of freedom, secondry tsk cn e performed nd we otin the following tsk function: where e = W + We 1 + (I 6 W + W)e 2 (16) e 2 is secondry tsk. Usully e 2 is defined s the grdient of cost function h s to e minimized (e 2 = hs ). This cost function is minimized under the constrint tht e 1 is relized. W + nd I 6 W + W re two projection opertors which gurntee tht the cmer motion due to the secondry tsk is comptile with the regultion of s to s. Indeed, thnks to the choice of mtrix W, I 6 W + W elongs to Ker L s, which mens tht the reliztion of the secondry tsk will hve no effect on the vision-sed tsk. The control is now given y: v = λe (I 6 W + W) e 2 t (17) Considering redudncy in visul servoing hs een lredy considered [1], [18] ut usuly relted to root mnipulility. Informtion directly extrcted from the imges hve een lso considered (eg, in [1] for occlusion voidnce). C. Eye-in-hnd versus Eye-to-light control To control the cmer/light source reltive position, we will consider two cses. In the former one, the cmer is controlled nd focused on the oject while the light remins sttic. This experimentl context is not lwys the most interesting one. Indeed, if the cmer is moving the spect of the oject will chnge with time. It is often more interesting to control the light position nd orienttion while the cmer remins sttic. This is the second cse tht is considered. Deling with the former cse, the cmer is focused to the oject of interest using clssicl visul servoing tsk. If s = (x, y) defined the oject center of grvity, s is defined

4 s s = (, ) nd the tsk function tht enforces the focusing tsk nd ensures good lighting of the oject is given y: e = W + WL + s (s s ) + (I W + W) (18) where hs is given y either eqution (9) or (12). Considering the second cse, oject is sttic in the imge (cquired y cmer C 1 ) nd we wnt to mximize rightness or contrst y moving the light-source. Here gin we consider the visul servoing frmework to point the light towrd the oject of interest nd to chieve good conditions. We first dd to the light second cmer C 2 whose opticl xis is ligned with the light direction. The min tsk is specified s simple focusing tsk tht constrins the virtul cmer/light system (two dof re constrined). We then consider the redundncy to control the cmer/light system to impose correct illumintion of the oject within the imge cquired y the other cmer. The tsk function is then defined s: e = W + W L + s (s s ) }{{} min focusing tsk ( +(I W + R R[ R W) T t] ) hs R }{{} secondry tsk defined wrt. to the other cmer (19) with R nd t denotes the rottionl nd trnsltionl mpping of the fixed cmer frme R C1 onto the moving cmer/light frme R C2. Let us note here tht if the cmer C 1 is now moving, the prolem remins exctly the sme s long s we know the trnsformtion R nd t etween the cmer nd the light (see Result in prgrph V-B). V. EXPERIMENTAL RESULTS Results otined in this section hs een otined either in simultion using Open GL simultion tools or rel rootics cell t IRISA. The system hs een implemented using the ViSP softwre [16]. A. Eye-in-hnd coordintion 1) Simultion: The gol of this first simultion is to vlidte our pproch on simple scene. The gol is to perform positioning tsk wrt. sphere nd to control the cmer in order to see this sphere under good lighting condition (criterion (7) is considered). In this experiment the light-source is sttic nd the cmer is moving s descried y Figure 1. Control lw presented in eqution (18) is considered. The dvntge of the sphere is tht its spect remins the sme whtever the cmer position. Only the sphere luminnce will e modified. In this experiment we considered positionl light source. Results of this positioning tsk re presented on Figure 2.. It is worth noting tht the verge intensity increses very smoothly (see Figure 2.). We lso plot the distnce etween the cmer nd the oject-light xis (see Figure 2.c). We cn note tht this distnce tends towrds zero, i.e. t the end of the positioning tsk, the cmer is locted etween the sphere nd the light s cn e expected (see Figure 2.d). z cost optimizing lighting conditions x distnce cmer loction trget light 1 y c Fig. 2. [Simultion] Positioning wrt. sphere under good lighting conditions: () scene oserved y the cmer (illumintion increses) () verge intensity in the imge (c) distnce to sphere-light xis (d) cmer/sphere/light position over time 2) Rel Experiments: ) Mximizing luminnce on sphere: The sme experiment ws crried out on our experimentl setup. A white ll is lighted y spot. As in the previous section the cmer mounted on the root end-effector is focused on the ll nd controlled using eqution (18) in order to mximize the ll luminnce. As expected, the luminnce increses (see Figure 3--c nd plot 4.c) until the cmer/root moves etween the ll nd the light-source creting lighting occlusion (see Figure 3.d nd the lst itertion of plot 4.c). As expected, the ehvior of the system is very similr to simultion results presented in the previous prgrph. Similr results for this oject is otined when the contrst goodness function is considered. ) Mximizing luminnce on complex oject: Sme experiment cn e done with more complex oject (see Figures. nd.). Although the shpe of the oject is modified during the experiment, the verge luminnce increses s specified in the tsk (see Figure 6 tht is relted to imges in Figure.). c) Mximizing contrst on complex oject: In Figure 7 we consider the goodness function sed on the contrst informtion (tht is mximize the norm of the grdient in the imge). As cn e seen on Figure 7, the d

5 c d grdient in the imge increses which is due to oth the light nd the modifiction in the oject spect due to the cmer motion. It is cler tht the lst imge of the oject is etter suitle, due the presence of importnt grdient, for tsk such s recognition or trcking. Fig. 3. [Rel experiment] Positioning wrt. sphere () first imge (c) luminnce increses (d) the cmer is now etween the sphere nd the light (tht is the ctul expected position ut tht in prctise crete light occlusion ) 16 1 cost function hs hs.dt h_s Fig. 4. [Rel experiment] Positioning wrt. sphere :cost function h s tht reflects ll luminnce Fig. 7. Scotch experiment: mximizing grdient/contrst () imges of the sequence () evolution of the goodness function h s In this prgrph we considered moving cmer nd sttic light-source. The consequence of such configurtion is tht it implies modifictions in the spect of the scene which is not lwys suitle. In the next experiment we consider sttic cmer nd moving light source. B. Eye-in-hnd/Eye-to-light coordintion Fig Mximizing luminnce on more complex oject cost function hs hs.dt As regrds this issue, we first perform positioning experiment involving complex oject. We consider, in simultion, model of the Venus of Milo. In this experiment we first consider sttic cmer nd moving light s depicted in Figure 1. In second time, when minimum of the cost function is reched, we impose n ritrry motion to the cmer. The light must then move in order to mintin correct lighted of the sttue. The results presented (see Figure 8) show the vlidity of our pproch for oth goodness function (luminnce on Figure 8 nd contrst on Figure 8). One cn see tht the light trjectories round the sttue on Figure V-B Fig. 6. Mximizing luminnce (correspond to the experiments presented on [Figure ]) : goodness function h s VI. CONCLUSION We presented method to ensure correct viewing or illumintion of n oject using visul servoing scheme nd only luminnce or grdient informtion. The illumintion model considered in this is indeed very corse nd is in mny cses flse. Nevertheless, it llows to servo the cmer or the light source in order to chieve good illumintion

6 Fig. 8. Illuminting the Venus of Milo () mximizing the venus luminnce () Mximizing the contrst. In the three first columns the cmer remin fixed then n ritrry motion is given to the cmer. The light source moves to ensure the specified tsk. z cmer loction light position (intensity) light position (contrste) trget initil 12 light loction initil cmer loction Fig x optimizing lighting condition 1 Illuminting the Venus of Milo : Cmer nd light trjectory of the scene (t lest wrt. the considered criteri). Experimentl results in simultion or on rel scenes show the vlidity of the pproch. Nevertheless, it is well known tht imge luminnce of scene depend of the ojects (ledo, reflectnce,...), of reltive surfce cmer orienttion, nd of the cmer/oject/light source position. Future work will e devoted to study more complex illumintion models. This my require either more informtion out the scene (3D model nd surfce informtion), or the estimtion of the unknown prmeters (such light source position). REFERENCES [1] F. Chumette, E. Mrchnd. A redundncy-sed itertive scheme for voiding joint limits: Appliction to visul servoing. IEEE Trns. on Rootics nd Automtion, 17():719 73, Octoer 21. [2] C.K. Cown, A. Bergmn. Determining the cmer nd light source loction for visul tsk. IEEE Int. Conf. on Rootics nd Automtion, ICRA 89, pp. 9 14, Scottsdle, My [3] C.K. Cown, P.D. Kovesi. Automtic sensor plcement from vision tsk requirements. IEEE Trns. on Pttern Anlysis nd Mchine intelligence, 1(3):47 416, My [4] C.K. Cown, B. Modyur. Edge-sed plcement of cmer nd light source for oject recognition nd loction. IEEE Int. Conf. on Rootics nd Automtion, ICRA 93, volume 2, pp , y [] T. Eltoft, R.J.P. de Figueiredo. Illumintion control s mens of enhncing imge fetures in ctive vision systems. IEEE Trns. on Imge Processing, 4(11):12 13, Novemer 199. [6] B. Espiu, F. Chumette, P. Rives. A new pproch to visul servoing in rootics. IEEE T. on Rootics nd Automtion, 8(3): , [7] M. Gouiffès, C. Collewet, C. Fernndez-Mloigne, A. Trémeu. Feture point trcking : roustness to speculr highlights nd lighting vritions. ECCV 26, pp , Grz, My 26. [8] G. Hger, P. Belhumeur. Efficient region trcking with prmetric models of geometry nd illumintion. IEEE Trns. on Pttern Anlysis nd Mchine Intelligence, 2(1):12 139, Octoer [9] K. Hr, K. Nishino, K. Ikeuchi. Light source position nd reflectnce estimtion from single view without the distnt illumintion ssumption. IEEE Trns. on Pttern Anlysis nd Mchine Intelligence, 27(4):493, April 2. [1] K. Hshimoto, editor. Visul Servoing : Rel Time Control of Root Mnipultors Bsed on Visul Sensory Feedck. World Scientific Series in Rootics nd Automted Systems, Vol 7, World Scientific Press, Singpor, [11] B. Horn. Root Vision. MIT Press, Cmridge, [12] B.K.P. Horn, B.G. Schunck. Determining opticl flow. Artificil Intelligence, 17(1-3):18 23, August [13] S. Hutchinson, G. Hger, P. Corke. A tutoril on visul servo control. IEEE T. on Rootics nd Automtion, 12():61 67, [14] H. Jin, P. Fvro, S. Sotto. Rel-Time feture trcking nd outlier rejection with chnges in illumintion. ICCV, pp , July 21. [1] E. Mrchnd, G.-D. Hger. Dynmic sensor plnning in visul servoing. IEEE Int. Conf. on Rootics nd Automtion, volume 3, pp , Leuven, Belgium, My [16] E. Mrchnd, F. Spindler, F. Chumette. ViSP for visul servoing: generic softwre pltform with wide clss of root control skills. IEEE Rootics nd Automtion Mgzine, 12(4):4 2, Dec 2. [17] H. Murse, S.K. Nyr. Illumintion plnning for oject recognition using prmetric eigenspces. IEEE Trns. on Pttern Anlysis nd Mchine Intelligence, 16(12): , [18] B. Nelson, P.K. Khosl. tegrting sensor plcement nd visul trcking strtegies. IEEE ICRA 94, pp , Sn Diego, My [19] B.T. Phong. Illumintion for computer generted pictures. Communiction of the ACM, 18(6): , June 197. [2] S. Skne, T. Sto. Automtic plnning of light source nd cmer plcement for n ctive photometric stereo system. IEEE ICRA 91, pp , Scrmento, April [21] H.D. Tgre, R.J.P. DeFigueiredo. A frmework for the construction of reflectnce mps for mchine vision. Computer Vision, Grphics, nd Imge Processing, 7(3):26 282, [22] K.E. Torrnce, E.M. Sprrow. Theory for off-speculr reflection from roughened surfcesw. J. of the Opticl Society of Americ, 7: , [23] S.K. Yi, R.M. Hrlick, L.G. Shpiro. Optiml sensor nd light-source positioning for mchine vision. CVIU, 61(1): , Jnury 199. [24] R. Zhng, P.S. Tsi, J.E. Cryer, M. Shh. Shpe-from-shding: survey. IEEE PAMI, 21(8):69 76, August 1999.

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 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 information

Machine vision system for surface inspection on brushed industrial parts.

Machine vision system for surface inspection on brushed industrial parts. Mchine vision system for surfce inspection on rushed industril prts. Nicols Bonnot, Rlph Seulin, Frederic Merienne Lortoire Le2i, CNRS UMR 5158, University of Burgundy, Le Creusot, Frnce. ABSTRACT This

More information

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES

GENERATING 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 information

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis 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 43006 Trrgon, Spin Emil: lrre@etse.urv.es

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete 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 information

USING HOUGH TRANSFORM IN LINE EXTRACTION

USING 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 information

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search. CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke

More information

Presentation Martin Randers

Presentation 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 information

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System Modeling nd Simultion of Short Rnge 3D Tringultion-Bsed Lser Scnning System Theodor Borngiu Anmri Dogr Alexndru Dumitrche April 14, 2008 Abstrct In this pper, simultion environment for short rnge 3D lser

More information

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. General Tree Search. Uniform Cost. Lecture 3: A* Search 9/4/2007

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. General Tree Search. Uniform Cost. Lecture 3: A* Search 9/4/2007 CS 88: Artificil Intelligence Fll 2007 Lecture : A* Serch 9/4/2007 Dn Klein UC Berkeley Mny slides over the course dpted from either Sturt Russell or Andrew Moore Announcements Sections: New section 06:

More information

Slides for Data Mining by I. H. Witten and E. Frank

Slides 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 information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 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 information

The Greedy Method. The Greedy Method

The Greedy Method. The Greedy Method Lists nd Itertors /8/26 Presenttion for use with the textook, Algorithm Design nd Applictions, y M. T. Goodrich nd R. Tmssi, Wiley, 25 The Greedy Method The Greedy Method The greedy method is generl lgorithm

More information

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE

CHAPTER 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 information

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it. 6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted

More information

Spectral Analysis of MCDF Operations in Image Processing

Spectral 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 information

Chapter 2 Sensitivity Analysis: Differential Calculus of Models

Chapter 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 information

LETKF compared to 4DVAR for assimilation of surface pressure observations in IFS

LETKF compared to 4DVAR for assimilation of surface pressure observations in IFS LETKF compred to 4DVAR for ssimiltion of surfce pressure oservtions in IFS Pu Escrià, Mssimo Bonvit, Mts Hmrud, Lrs Isksen nd Pul Poli Interntionl Conference on Ensemle Methods in Geophysicl Sciences Toulouse,

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before 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 information

An Integrated Simulation System for Human Factors Study

An Integrated Simulation System for Human Factors Study An Integrted Simultion System for Humn Fctors Study Ying Wng, Wei Zhng Deprtment of Industril Engineering, Tsinghu University, Beijing 100084, Chin Foud Bennis, Dmien Chblt IRCCyN, Ecole Centrle de Nntes,

More information

Qubit allocation for quantum circuit compilers

Qubit allocation for quantum circuit compilers Quit lloction for quntum circuit compilers Nov. 10, 2017 JIQ 2017 Mrcos Yukio Sirichi Sylvin Collnge Vinícius Fernndes dos Sntos Fernndo Mgno Quintão Pereir Compilers for quntum computing The first genertion

More information

Geometric transformations

Geometric transformations Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22

More information

Stained Glass Design. Teaching Goals:

Stained 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 information

MTH 146 Conics Supplement

MTH 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 information

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. Example: Pancake Problem. Example: Pancake Problem

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. Example: Pancake Problem. Example: Pancake Problem Announcements Project : erch It s live! Due 9/. trt erly nd sk questions. It s longer thn most! Need prtner? Come up fter clss or try Pizz ections: cn go to ny, ut hve priority in your own C 88: Artificil

More information

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl

More information

What are suffix trees?

What are suffix trees? Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl

More information

Lily Yen and Mogens Hansen

Lily 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 information

15. 3D-Reconstruction from Vanishing Points

15. 3D-Reconstruction from Vanishing Points 15. 3D-Reconstruction from Vnishing Points Christin B.U. Perwss 1 nd Jon Lseny 2 1 Cvendish Lortory, Cmridge 2 C. U. Engineering Deprtment, Cmridge 15.1 Introduction 3D-reconstruction is currently n ctive

More information

Statistical classification of spatial relationships among mathematical symbols

Statistical 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 information

Parametric ego-motion estimation for vehicle surround analysis using an omnidirectional camera

Parametric ego-motion estimation for vehicle surround analysis using an omnidirectional camera Mchine Vision nd Applictions (25) 16: 85 95 Digitl Oject Identifier (DOI) 1.17/s138-4-168-z Mchine Vision nd Applictions Prmetric ego-motion estimtion for vehicle surround nlysis using n omnidirectionl

More information

COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION

COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION Hee Ju Prk OLOUR IMAGE MATHING FOR DTM GENERATION AND HOUSE EXTRATION Hee Ju PARK, Petr ZINMMERMANN * Swiss Federl Institute of Technology, Zuric Switzerlnd Institute for Geodesy nd Photogrmmetry heeju@ns.shingu-c.c.kr

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #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 information

Ray surface intersections

Ray surface intersections Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive

More information

A multiview 3D modeling system based on stereo vision techniques

A multiview 3D modeling system based on stereo vision techniques Mchine Vision nd Applictions (2005) 16: 148 156 Digitl Oject Identifier (DOI) 10.1007/s00138-004-0165-2 Mchine Vision nd Applictions A multiview 3D modeling system sed on stereo vision techniques Soon-Yong

More information

Digital approximation to extended depth of field in no telecentric imaging systems

Digital approximation to extended depth of field in no telecentric imaging systems Journl of Physics: Conference Series Digitl pproximtion to extended depth of field in no telecentric imging systems To cite this rticle: J E Meneses nd C R Contrers 0 J Phys: Conf Ser 74 0040 View the

More information

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016)

International 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 information

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course

L. 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 information

CSCI 446: Artificial Intelligence

CSCI 446: Artificial Intelligence CSCI 446: Artificil Intelligence Serch Instructor: Michele Vn Dyne [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.]

More information

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

MATH 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 information

Orthogonal line segment intersection

Orthogonal line segment intersection Computtionl Geometry [csci 3250] Line segment intersection The prolem (wht) Computtionl Geometry [csci 3250] Orthogonl line segment intersection Applictions (why) Algorithms (how) A specil cse: Orthogonl

More information

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016

Solving 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 information

Math 35 Review Sheet, Spring 2014

Math 35 Review Sheet, Spring 2014 Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided

More information

Today. Search Problems. Uninformed Search Methods. Depth-First Search Breadth-First Search Uniform-Cost Search

Today. 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 information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

such that the S i cover S, or equivalently S

such that the S i cover S, or equivalently S MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i

More information

CS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL:

CS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL: CS38: Computer Grphics Modeling Trnsformtions Sung-Eui Yoon ( 윤성의 ) Course URL: http://sgl.kist.c.kr/~sungeui/cg/ Clss Ojectives (Ch. 3.5) Know the clssic dt processing steps, rendering pipeline, for rendering

More information

10.5 Graphing Quadratic Functions

10.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 information

Computer Vision and Image Understanding

Computer Vision and Image Understanding Computer Vision nd Imge Understnding 116 (2012) 25 37 Contents lists ville t SciVerse ScienceDirect Computer Vision nd Imge Understnding journl homepge: www.elsevier.com/locte/cviu A systemtic pproch for

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION Supplementry Figure y (m) x (m) prllel perpendiculr Distnce (m) Bird Stndrd devition for distnce (m) c 6 prllel perpendiculr 4 doi:.8/nture99 SUPPLEMENTARY FIGURE Confirmtion tht movement within the flock

More information

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

4452 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 information

The gamuts of input and output colour imaging media

The gamuts of input and output colour imaging media In Proceedings of IS&T/SPIE Electronic Imging 1 The gmuts of input nd output colour imging medi án Morovic,* Pei Li Sun* nd Peter Morovic * Colour & Imging Institute, University of Dery, UK School of Informtion

More information

II. THE ALGORITHM. A. Depth Map Processing

II. 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 information

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5

CS321 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 information

Midterm 2 Sample solution

Midterm 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 information

Tilt-Sensing with Kionix MEMS Accelerometers

Tilt-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 information

INVESTIGATION OF RESAMPLING EFFECTS ON IRS-1D PAN DATA

INVESTIGATION 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 information

Motion analysis for event detection and tracking with a mobile omnidirectional camera

Motion analysis for event detection and tracking with a mobile omnidirectional camera Multimedi Systems 10: 131 143 (2004) Digitl Oject Identifier (DOI) 10.1007/s00530-004-0146-3 Multimedi Systems Motion nlysis for event detection nd trcking with moile omnidirectionl cmer Trk Gndhi, Mohn

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In 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 information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(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 information

Real-Time Stereo Vision Techniques

Real-Time Stereo Vision Techniques Rel-Time Stereo Vision Techniques Christos Georgouls nd Ionnis Andredis Lortory of Electronics, Deprtment of Electricl nd Computer Engineering Democritus University of Thrce Xnthi 6700, Greece {cgeorg,indred}@ee.duth.gr

More information

CSEP 573 Artificial Intelligence Winter 2016

CSEP 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 information

Dr. D.M. Akbar Hussain

Dr. D.M. Akbar Hussain Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence

More information

Intelligent Assembly/Disassembly System with a Haptic Device for Aircraft Parts Maintenance

Intelligent Assembly/Disassembly System with a Haptic Device for Aircraft Parts Maintenance Intelligent Assemly/Disssemly System with Hptic Device for Aircrft Prts Mintennce Christind nd Jungwon Yoon Mechnicl nd Aerospce Engineering nd ReCAPT, GyeongSng Ntionl University, Jinju, Gyeongnm 660-701,

More information

From Dependencies to Evaluation Strategies

From Dependencies to Evaluation Strategies From Dependencies to Evlution Strtegies Possile strtegies: 1 let the user define the evlution order 2 utomtic strtegy sed on the dependencies: use locl dependencies to determine which ttriutes to compute

More information

MATH 25 CLASS 5 NOTES, SEP

MATH 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 information

A dual of the rectangle-segmentation problem for binary matrices

A dual of the rectangle-segmentation problem for binary matrices A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht

More information

Progressive Transmission of Textured Graphic Model Over IP Networks

Progressive Transmission of Textured Graphic Model Over IP Networks Progressive Trnsmission of Textured Grphic Model Over IP Networks. Reserch Tem Project Leder: Other Fculty: Post Doc(s): Grdute Students: Undergrdute Students: Industril Prtner(s): Prof. C.-C. Jy Kuo,

More information

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin

More information

Tree Structured Symmetrical Systems of Linear Equations and their Graphical Solution

Tree Structured Symmetrical Systems of Linear Equations and their Graphical Solution Proceedings of the World Congress on Engineering nd Computer Science 4 Vol I WCECS 4, -4 October, 4, Sn Frncisco, USA Tree Structured Symmetricl Systems of Liner Equtions nd their Grphicl Solution Jime

More information

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe CSCI 0 fel Ferreir d Silv rfsilv@isi.edu Slides dpted from: Mrk edekopp nd Dvid Kempe LOG STUCTUED MEGE TEES Series Summtion eview Let n = + + + + k $ = #%& #. Wht is n? n = k+ - Wht is log () + log ()

More information

Languages. L((a (b)(c))*) = { ε,a,bc,aa,abc,bca,... } εw = wε = w. εabba = abbaε = abba. (a (b)(c)) *

Languages. L((a (b)(c))*) = { ε,a,bc,aa,abc,bca,... } εw = wε = w. εabba = abbaε = abba. (a (b)(c)) * Pln for Tody nd Beginning Next week Interpreter nd Compiler Structure, or Softwre Architecture Overview of Progrmming Assignments The MeggyJv compiler we will e uilding. Regulr Expressions Finite Stte

More information

Fig.25: the Role of LEX

Fig.25: the Role of LEX The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing

More information

AI Adjacent Fields. This slide deck courtesy of Dan Klein at UC Berkeley

AI Adjacent Fields. This slide deck courtesy of Dan Klein at UC Berkeley AI Adjcent Fields Philosophy: Logic, methods of resoning Mind s physicl system Foundtions of lerning, lnguge, rtionlity Mthemtics Forml representtion nd proof Algorithms, computtion, (un)decidility, (in)trctility

More information

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence

Solving 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 information

HOPC: A NOVEL SIMILARITY METRIC BASED ON GEOMETRIC STRUCTURAL PROPERTIES FOR MULTI-MODAL REMOTE SENSING IMAGE MATCHING

HOPC: A NOVEL SIMILARITY METRIC BASED ON GEOMETRIC STRUCTURAL PROPERTIES FOR MULTI-MODAL REMOTE SENSING IMAGE MATCHING ISPRS Annls of the Photogrmmetry, Remote Sensing nd Sptil Informtion Sciences, Volume III-1, 216 XXIII ISPRS Congress, 12 19 July 216, Prgue, Czech Republic : A NOVEL SILARITY METRIC BASED ON GEOMETRIC

More information

Chinese Academy of Surveying and Mapping, Beijing , China - - (zhangjx, b

Chinese Academy of Surveying and Mapping, Beijing , China - - (zhangjx, b SEMI-AUTOMATIC EXTRACTION OF RIBBON ROADS FORM HIGH RESOLUTION REMOTELY SENSED IMAGERY BY COOPERATION BETWEEN ANGULAR TEXTURE SIGNATURE AND TEMPLATE MATCHING X. G. Lin,,, J. X. Zhng, Z. J. Liu, J. Shen

More information

Agilent Mass Hunter Software

Agilent Mass Hunter Software Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss

More information

Slicer Method Comparison Using Open-source 3D Printer

Slicer Method Comparison Using Open-source 3D Printer IOP Conference Series: Erth nd Environmentl Science PAPER OPEN ACCESS Slicer Method Comprison Using Open-source 3D Printer To cite this rticle: M K A Mohd Ariffin et l 2018 IOP Conf. Ser.: Erth Environ.

More information

CS 430 Spring Mike Lam, Professor. Parsing

CS 430 Spring Mike Lam, Professor. Parsing CS 430 Spring 2015 Mike Lm, Professor Prsing Syntx Anlysis We cn now formlly descrie lnguge's syntx Using regulr expressions nd BNF grmmrs How does tht help us? Syntx Anlysis We cn now formlly descrie

More information

A Study on Eye Gaze Estimation Method Based on Cornea Model of Human Eye

A Study on Eye Gaze Estimation Method Based on Cornea Model of Human Eye A Study on Eye Gze Estimtion Method Bsed on Corne Model of Humn Eye Eui Chul Lee 1 nd Kng Ryoung Prk 2 1 Dept. of Computer Science, Sngmyung University, 7 Hongji-dong, Jongro-Ku, Seoul, Republic of Kore

More information

Multiresolution Interactive Modeling with Efficient Visualization

Multiresolution Interactive Modeling with Efficient Visualization Multiresolution Interctive Modeling with Efficient Visuliztion Jen-Dniel Deschênes Ptrick Héert Philippe Lmert Jen-Nicols Ouellet Drgn Tuic Computer Vision nd Systems Lortory heert@gel.ulvl.c, Lvl University,

More information

Character-Stroke Detection for Text-Localization and Extraction

Character-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 information

Pointwise convergence need not behave well with respect to standard properties such as continuity.

Pointwise convergence need not behave well with respect to standard properties such as continuity. Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples

More information

UT1553B BCRT True Dual-port Memory Interface

UT1553B BCRT True Dual-port Memory Interface UTMC APPICATION NOTE UT553B BCRT True Dul-port Memory Interfce INTRODUCTION The UTMC UT553B BCRT is monolithic CMOS integrted circuit tht provides comprehensive MI-STD- 553B Bus Controller nd Remote Terminl

More information

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.

More information

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer

More information

Approximation of Two-Dimensional Rectangle Packing

Approximation of Two-Dimensional Rectangle Packing pproximtion of Two-imensionl Rectngle Pcking Pinhong hen, Yn hen, Mudit Goel, Freddy Mng S70 Project Report, Spring 1999. My 18, 1999 1 Introduction 1-d in pcking nd -d in pcking re clssic NP-complete

More information

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes

More information

IP: Network Layer. Goals and Tasks. Routing. Switching. Switching (cont.) Datagram v/s Virtual Circuit. Overview Addressing Routing

IP: Network Layer. Goals and Tasks. Routing. Switching. Switching (cont.) Datagram v/s Virtual Circuit. Overview Addressing Routing IP: Network Lyer Overview Addressing Routing Overview Gols nd Tsks Routing Switching Issues Bsic ides TOC IP TOC IP Overview Gols nd Tsks Gols of Network Lyer Guide pckets from source to destintion Use

More information

PPS: User Manual. Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, and Ayush Kanodia

PPS: User Manual. Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, and Ayush Kanodia PPS: User Mnul Krishnendu Chtterjee, Mrtin Chmelik, Rghv Gupt, nd Ayush Knodi IST Austri (Institute of Science nd Technology Austri), Klosterneuurg, Austri In this section we descrie the tool fetures,

More information

Extension of the compressed interferometric particle sizing technique for three component velocity measurements

Extension of the compressed interferometric particle sizing technique for three component velocity measurements Lison, Portugl, -9 June, Extension of the compressed interferometric prticle sizing technique for three component velocity mesurements Disuke Sugimoto 1, Konstntinos Zrogoulidis, Ttsuy Kwguchi 3, Kzuki

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 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 information

A HYDRAULIC SIMULATOR FOR AN EXCAVATOR

A HYDRAULIC SIMULATOR FOR AN EXCAVATOR P-06 Proceedings of the 7th JFPS Interntionl Symposium on Fluid Power TOYAMA 008 September 5-8 008 A HYDRAULIC SIMULATOR FOR AN EXCAVATOR Soon-Kwng Kwon* Je-Jun Kim* Young-Mn Jung* Chn-Se Jung* Chng-Don

More information

CS 221: Artificial Intelligence Fall 2011

CS 221: Artificial Intelligence Fall 2011 CS 221: Artificil Intelligence Fll 2011 Lecture 2: Serch (Slides from Dn Klein, with help from Sturt Russell, Andrew Moore, Teg Grenger, Peter Norvig) Problem types! Fully observble, deterministic! single-belief-stte

More information

Compression Outline :Algorithms in the Real World. Lempel-Ziv Algorithms. LZ77: Sliding Window Lempel-Ziv

Compression Outline :Algorithms in the Real World. Lempel-Ziv Algorithms. LZ77: Sliding Window Lempel-Ziv Compression Outline 15-853:Algorithms in the Rel World Dt Compression III Introduction: Lossy vs. Lossless, Benchmrks, Informtion Theory: Entropy, etc. Proility Coding: Huffmn + Arithmetic Coding Applictions

More information

Lighting Analysis and Texture Modification of 3D Human Face Scans

Lighting Analysis and Texture Modification of 3D Human Face Scans Digitl Imge Computing Techniques n Applictions Lighting Anlysis n Texture Moifiction of 3D Humn Fce Scns Xiozheng Zhng, Snqing Zho n Yongsheng Go Computer Vision n Imge Processing Lbortory, Griffith School

More information

Lecture 7: Integration Techniques

Lecture 7: Integration Techniques Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.

More information

Object and image indexing based on region connection calculus and oriented matroid theory

Object and image indexing based on region connection calculus and oriented matroid theory Discrete Applied Mthemtics 147 (2005) 345 361 www.elsevier.com/locte/dm Oject nd imge indexing sed on region connection clculus nd oriented mtroid theory Ernesto Stffetti, Antoni Gru, Frncesc Serrtos c,

More information

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants A Heuristic Approch for Discovering Reference Models by Mining Process Model Vrints Chen Li 1, Mnfred Reichert 2, nd Andres Wombcher 3 1 Informtion System Group, University of Twente, The Netherlnds lic@cs.utwente.nl

More information