Position Determination of a Robot End-Effector Using a 6D-Measurement System Based on the Two-View Vision

Size: px
Start display at page:

Download "Position Determination of a Robot End-Effector Using a 6D-Measurement System Based on the Two-View Vision"

Transcription

1 Ope Joural of Applied Scieces, 203, 3, Published Olie November 203 ( Positio Determiatio of a Robot Ed-Effector Usig a 6D-Measuremet System Based o the wo-view Visio Aleej Jaz, Christia Pape, Eduard Reithmeier Istitute of Measuremet ad Automatic Cotrol, Leibiz Uiversität Haover, Haover, Germay aleej.jaz@imr.ui-haover.de Received September 6, 203; revised October, 203; accepted October 2, 203 Copyright 203 Aleej Jaz et al. his is a ope access article distributed uder the Creative Commos Attributio Licese, which permits urestricted use, distributio, ad reproductio i ay medium, provided the origial work is properly cited. ABSRAC A mechatroic system based o the micro-macro-kiematic cosists of a idustrial robot ad a piezoelectric stage mouted o the robot s ed-effector ad has to carry out operatios like micro-assembly or micro-millig. he piezoelectric stage has to compesate the positioig error of the robot. herefore, the positio of the robot s ed-effector has to be measured with high accuracy. his paper presets a high accuracy 6D-measuremet system, which is used to determie the positio ad orietatio of the robot s ed-effector. We start with the descriptio of the operatioal cocept ad compoets of the measuremet system. he we look at image processig methods, camera calibratio ad recostructio methods ad choose the most accurate oes. We apply the well-kow pi-hole camera model to calibrate sigle cameras. he we apply the epipolar geometry to describe the relatioship betwee two cameras ad calibrate them as a stereo visio system. A distortio model is also applied to ehace the accuracy of the system. he measuremet results are preseted i the ed of the paper. Keywords: 6D-Measuremet System; High Speed Camera; Image Processig; Recostructio; Essetial Matri; Fudametal Matri; Camera Projectio Matri. Itroductio he project Micro-Macro-Kiematics, which is curretly ruig at the Istitute of Measuremet ad Automatic Cotrol of the Leibiz Uiversität Haover, deals with the developmet ad aalysis of a robotic system, which is able to maipulate micro-objects with a accuracy of - 2 micrometers i a 3D-workspace of 0 cubic millimeters. For this purpose it is ecessary to determie the positio ad orietatio of the robot ed-effector with high accuracy ad i real time. At the begiig of the project we looked at various measurig systems, e.g., the Laser racker from Leica or the Laser RACER from Etalo AG. Such systems are able to carry out cotactless high accuracy measuremets i large workspaces. However, they are very epesive ad have several characteristics, for eample, the relatively high weight of the retro-reflector, which make them very difficult to use with the robot i this project the maimal load the robot ca carry is 700 grams. herefore, it was iitially decided to reduce the requiremets for the size of the workspace ad use a measuremet system based o two high-speed cameras. I order to preset this measuremet system, we will describe its cocept ad compoets i this paper. We will also take a look at the methods for image processig, cameras calibratio ad 3D-data recostructio, choose the most accurate oe ad eplai our choice. 2. Cocept ad Compoets of the System It is always ecessary to give clear requiremets of the measuremet system such as cotact-free measuremet of the 3D-positio ad orietatio of the robot ed-effector, measuremet accuracy of - 2 micrometers, workspace of at least 0 cubic cetimeters, real-time ability (oscillatios o the ed-effector of the robot are up to 50 Hz). he geeral cocept of the measuremet system is preseted i Figure. wo high speed moochrome cameras M20 Falco from DALSA are used i it. Both cameras have a resolutio of [h w] = piels with a piel size p = 7.4 micrometers. Both cameras are also coected to the frame grabber Xcelera-CL PX4 Dual, which has a trigger fuctio ad ca take up to 22 frames per secod simultaeously. Each camera has the

2 394 A. JANZ E AL. Figure. Geeral cocept of the measuremet system. bi-telecetric les C2336 from Opto-Egieerig with a magificatio k = hese bi-telecetric leses simplify image processig, because the dimesios of the objects remai early costat. he maimal image size of every camera ca be calculated based o the camera resolutio, piel size ad les magificatio: h p w p mm 3 mm. () k k I order to determie the positio ad orietatio of the robot ed effector, the 3D-mark a black plate with three white balls is fied o it. It is possible to determie the 3D-positio by usig oly a sigle ball. wo other balls are ecessary to determie the orietatio of the mark ad the ed-effector. I order to choose the size of the balls ad the offsets betwee them, oe has to cosider the image size, the desired workspace, the sub-piel accuracy ad agular accuracy. It is obvious that the sub-piel accuracy ca be icreased by makig the white balls bigger. However, the bigger the balls are, the smaller the real workspace becomes, because every ball must appear completely o the image for the successful image processig. he agular accuracy ca be improved by icreasig the offsets betwee white balls; however, oe should ot forget that the use of three balls reduces the real workspace. akig ito accout these properties, the diameter of the balls was set to 2.5 millimeters, ad the offset betwee the balls to 8 millimeters. It allows to measure the positio ad orietatio i the workspace of about 2 cubic cetimeters, with agular icliatio up to 60 as well, ad sub-piel accuracy of about 0.05 piels. I order to get more stable image processig, for eample, to elimiate the ifluece of the eteral illumiatio, the system has its ow light sources. At the very begiig of the project we have used rigs with white LED. Ufortuately, this solutio caused ihomogeeous illumiated image. For this reaso two rigs of red ad gree LEDs are used ow, see Figure 2. he red ad gree light filters are also mouted i the telecetric leses. his solutio elimiates ay ifluece of cameras o each other. 3. Image Processig wo cameras ca shoot two idepedet moochrome Figure 2. Illumiatio of the 3D-mark. images simultaeously with a frame frequecy of 22 Hz. herefore, the image processig must be fast ad simple. For that reaso images are ot processed completely. It is oly ecessary to process the regio of iterest (ROI) with size.5 times larger tha that of a white ball. However, the whole image area must be processed at first to idetify ad separate white balls from aother white object that could appear o the image. I order to fid ay white object o the image, all processed piels are grouped to white oes ad black oes with the help of a grey-level threshold which must be automatically foud for each sigle ROI or the first image. he method for global thresholdig, described i [], is used to fid this threshold. It cosists of: Defiitio of the iitial grey level threshold Divisio of the image usig threshold o two parts white ad black Computig of the average grey-level values i both parts Computig of the ew threshold: ew 2 0.5, (2) where μ, μ 2 are average grey-level values from the previous step Repeatig the last three steps util the differece betwee the ew ad the old threshold becomes smaller tha the predefied Δ. As we have already metioed above, the very first frame has to be processed completely. It meas that we have to fid the global grey level threshold first. he every sigle white object o this image must be aalyzed usig this threshold the roudess coefficiet must be computed: 4π S k 2, (3) P where S is the area of the object, ad P the perimeter or the legth of the object s cotour. If the roudess coefficiet is larger tha 0.85, the aalyzed object is treated as a white object. he ROI positio ad size are

3 A. JANZ E AL. 395 the computed for it. Furthermore, oly these ROIs will be processed. Figure 3 shows a eample of the first frame. White objects foud i ROIs will o loger be aalyzed with the roudess coefficiet. he fittig to circle method is used i order to fid the ceter of the circle o the image. First of all, a cotour of the circle must be foud. Oly eighbor piels are scaed to reduce the processig time to a miimum. he sca rus clockwise util the cotour is closed. his way the followig equatio is true for every poit of the cotour (see Figure 4): c c, y y R (4) where ad y are the coordiates of ay cotour poit, c ad y c the ukow coordiates of the circle ceter, R the ukow radius of the circle. he Equatio (4) ca also be epressed as: Figure 3. Fragmet of the first image. Figure 4. Fittig to the circle. or y 2 2 c y c yc yc R 0, A B C (5) AByC 2 y 2. (6) o use all poits of the cotour, Equatio (6) is epressed i the matri form: 2 2 ABy C y y A 2 2 A2 By2 C 2 y2 2 y2 B (7) C 2 2 A By C y y ABC XY or XY ABC Q (8) he ukow matri ABC ca be computed with the help of the followig equatio: ABC XY Q, (9) where (XY) is the pseudo iverse matri of the matri XY. he coordiates of the circle ceter c ad y c ca be easily foud from the two first elemets of the matri ABC. 4. Camera Calibratio o determie the positio of the robot s ed-effector i a 3D-workspace it is ot sufficiet to have the 2D image coordiates of the balls measured by the two cameras. he 2D-data from the two cameras has to be fused to get the 3D-data. o do so, the relatioship betwee the two cameras must be eactly determied. I order to fid this relatioship, it is ecessary to carry out a measuremet, i which the two cameras measure the image positios of a set of objects i the well-kow 3D-positio. Furthermore, parameters of each camera which cause systematic measuremet errors ca also be determied i this measuremet. his procedure is called camera matchig ad calibratio. Various camera calibratio methods were described i [2-4]. hey are mostly based o the pi-hole camera model, where the 3D-poits are projected to the image through a sigle poit called camera ceter. he accuracy of the camera calibratio ca be icreased if the distortio of the camera image, caused by leses mouted o the camera is cosidered. Most popular models of the les distortio ca be foud i [5-7]. he calibratio of a multiple view camera system is more comple, because the itrisic ad etrisic parameters of the sigle camera as well as the relatioship (relative positio ad orietatio) betwee two (or more) cameras must be foud. Q

4 396 A. JANZ E AL. Computatio of the multiple view geometry is described i [8]. he descriptio of the two view geometry ca be foud i [9-]. 4.. Camera Model he most ofte used ad well-kow camera model is the pi-hole camera model [8]. his model is described with the help of the projectio matri P of the camera: P K R RC, (0) where R is rotatio matri of the camera i the world coordiate system, C coordiates of the camera ceter i the absolute coordiate system, K the camera calibratio matri. he camera calibratio matri K icludes parameters such as focal legth f ad positio of the pricipal poit p, p y i the coordiate system of the image f K f p p y. 0 ω iwi yw i i P ωiwi 0 W i i P2 0, i i i i 0 yw W P3 () he projectio matri P is used for triagulatio ad computig of the 3D-data from the 2D image data, because it epresses the relatioship betwee the world poits W ad their correspodig image poits w: w PW, (2) where w, y, ad W X, Y, Z, Idepedet Calibratio As idepedet calibratio of two cameras or simply idepedet calibratio i this paper we have applied a calibratio method, i which a set of 3D poits with eact positios are shot with two cameras simultaeously. he projectio matri is the computed from the 3D world data ad the 2D image. he 3D data ca be recostructed with help of the computed projectio matri ad the image data of both cameras ad the geometric recostructio error ca be foud. If the recostructio accuracy does ot satisfy the requiremets of the measuremet system, the projectio matrices ca be refied by iteratively miimizig the geometric recostructio error (for eample, Leveberg-Marquardt algorithm). he computatio of iitial projectio matrices is based o the direct liear trasformatio (DL). Accordig to [8], for each correspodece W i w i the followig relatioship ca be derived: A P (3) where w, y, ω are ormalized image poits, W ormalized 3D data, P, P 2 ad P 3 rows of projectio matri P i a ormalized form ad i ide of the poit. he projectio matri P ca be foud after havig obtaied the sigular value decompositio (SVD) of the matri A for all the give poits. So if A = UDV, the the solutio is the last colum of the matri V. Whe projectio matrices of both cameras are computed, the 3D world poit ca be recostructed. For this purpose, the triagulatio [8] from the correspodig image poits w ad w' of both cameras ad projectio matrices P ad P' (also based o the DL) is used: where w PW 0 AW 0, w PW 0 P3 P yp3 P2 A P P yp P (4) (5) he 3D data ca be recostructed with the help of the SVD of the matri A by computig the projectio matrices, like i the solutio above. I order to miimize the geometric error, projectio matrices must be refied usig the Leveberg-Marquardt (LM) miimizatio method. For this purpose both projectio matrices are composed to a optimizatio matri ad the LM-algorithm rus util the geometric error reaches a miimum. Oce the geometric error is miimized, the projectio matrices stay costat for further measuremets util some mechaical parameters (for eample, camera orietatio) are chaged Fudametal ad Essetial Matrices I the previous chapter, the projectio matrices were matched to each other with the help of the LM-algorithm i order to obtai the miimal recostructio error. Aother method based o the computatio of the fudametal matri, i.e. a matri, which cotais the relatioship betwee two cameras, their etrisic ad itrisic parameters. he fudametal matri is defied by the equatio w Fw 0, (6) where F is fudametal matri, w ad w' correspodig image poits. From (6) it follows that the fudametal matri ca be computed whe havig oly the correspodig image poits. o do so, the (6) must be trasformed to

5 A. JANZ E AL. 397 y y y y Af yy y y f 0, (7) y y y y where [, y, ], [', y', ] are correspodig image coordiates of a sigle poit, vector f represets the fudametal matri F ad is the umber of correspodig poits. Usig the least squares solutio i (7), oe ca easily compute the fudametal matri. It is also importat to use the sigularity costrait after the computatio of the iitial fudametal matri [8]. Projectios matrices ca be directly etracted from the fudametal matri. Ufortuately, the use of the fudametal matri i this work did ot provide a stable recostructio of the 3D data, therefore it will ot be further cosidered. However, the solutio with the fudametal matri was ot a complete failure either. Istead of the fudametal matri we ca use its specificatio to the case of the ormalized image coordiates the essetial matri [8], which is defied as: ˆ ˆ 0, w Ew w K EK w (8) where ŵ' ad ŵ are ormalized image poits, w' ad w origial image poits, K' ad K camera calibratio matrices, E the essetial matri. he computatio of this matri differs from the computatio of the fudametal matri oly i the sigularity costrai ad ormalizatio of the image data with the help of calibratio matrices. hus, if the sigular values decompositio of the iitial essetial matri is E USV, (9) the the fial essetial matri usig the sigularity costrait is E Udiag,, 0 V. (20) o etract projectio matrices of the cameras from the essetial matri, the projectio matri of the first camera is assumed to be P = [I 0]. It meas that all the recostructed data is epressed i the coordiate system of the first camera. Four possible solutios eist for the secod camera. hese solutios are based o the two possible choices of the rotatio matri R ad the offset t betwee the ceters of the two cameras, E t R (2) where [t] is the skew-symmetric matri of the vector t defied by 0 t3 t2 t t3 0 t. (22) t2 t 0 hese four solutios are:, P UOV t (23) P UOV t, (24) P UO V t, (25) P UO V t. (26) Here U ad V are matrices from (20), t radius vector to the ceter of the ceter of the secod camera i the coordiate system of the first camera t U0,0, ad a orthogoal matri 0 0 O 0 0. (27) 0 0 he choice of the right solutio depeds o the 3D recostructio usig computed projectio matrices. First, the projectio matri, the recostructio data of which look correct, is chose. o refie the recostructio accuracy it is ecessary to apply the LM-algorithm. As i chapter 4.2, the re-projectio error should be miimized by usig the essetial matri as a optimizatio parameter. he essetial matri ad fudametal matri ca be very useful, if oe does ot have the eact 3D data. However, two camera calibratio matrices are ecessary for the computatio of the essetial matri, which ca be foud with the help of the decompositio of the projectio matrices from the chapter 4.. It meas that camera calibratio with the use of the eact 3D data is oly ecessary at first. Later, if itrisic camera parameters do ot chage, the matchig of the coordiate systems of both cameras ca be doe usig the computatio of the essetial matri Image Distortio he calibratio methods described above are based o the pi-hole camera model, which meas, that poits i the world frame are projected to the image plae through a straight lie. However the les surfaces i the real optical systems always have deviatios from the desiged form. hese deviatios cause geometric distortios of the image. Several ways to estimate the distortio are described i [2-4]. he most popular distortio model ca

6 398 A. JANZ E AL. be described with followig equatio p Δp kr kr kr p, d t k p k d p pr pr pr 2 ΔP2 P23 k 3 K 3 (28) where p d is the distorted image poit, Δp t vector of tagetial distortio, p ormalized distortio-free image poit, k, k 2 ad k 3 are coefficiets of radial distortio, r the legth of the radius vector from the pricipal poit to the image poit p. he tagetial distortio is commoly caused by the lack of aligmet of the leses. he deviatio of the leses surfaces from the desiged form causes the radial distortio. Simplifyig the (28) by igorig the tagetial distortio term ad epressig it i matri form for a set of poits we get or (29) Δ P PK, (30) where is the umber of image poits. Usig this epressio we ca compute the radial distortio coefficiets usig the pseudo iverse matri from P K P P Δ. (3) he re-projected image poits are used as ormalized distortio-free poits p to compute radial distortio coefficiets. Usig the computed values of the radial distortio as a iitial guess the Leveberg-Marquardt Algorithm should be used to refie the distortio coefficiets Ihomogeeous Distributio of the Light Itesity Not oly ca the radial ad tagetial distortio ifluece o the measuremet accuracy, but the ihomogeeous distributio of the light itesity ca also decrease the measuremet accuracy locally. For eample LEDs i our illumiatio system ca be aliged slightly asymmetric like i Figure 5. It will be fie for the measuremet mark positioed i oe certai poit, but the displacemet of this mark i the directio of the camera optical ais ca cause more light o oe side of the mark tha o aother. his will shift the measured positio of the white ball i directio of the more illumiated area. It is also importat to metio, that due to the spectral sesitivity of the camera the camera with gree illumiatio will be more affected by the ihomogeeous distributio of light. he Figure 6 illustrates the effect described above. A set of poits distributed i a cube i the world frame was Figure 5. Light distributio. shot by both cameras. Measured image poits are show i figure as gree poits. I the right part of Figure 6 the projectio of these poits to the sesor of the camera #2 is show. here is o sig of a radial distortio i this projectio. However lookig closely at poits o the lie, which is approimately parallel to the optical ais of the camera, it becomes obvious, that these poits sigificatly deviate from the straight lie. So i the left part of Figure 6 measured poits draw a bow as the 3D-mark moves i the world frame aloe a straight lie away from the camera. his behavior of the measuremet system is reproducible after several movemets i the world frame alog optical ais of the camera measured poits draw the same patter. I differet areas of the camera field of view measured poits are drawig differet patters. his ca sigificatly reduce the accuracy of the measuremet system ad ca oly be corrected usig look-up tables. Sice the coordiates of poits i the world frame ad their correspodig image poits are kow a look-up table ca be computed for each camera, where the correctio vector for image poits depeds o the correspodig world coordiates. For this purpose the correctio vector has to be foud for each image poit as a ormal vector from the actual image poit to the approimated lie. he approimated lie is show i the Figure 6 as the black lie. Correctio vectors are show as blue lies. Red poits describe corrected poits. o fid correctio vectors for poits i each aial lie the followig operatios have to be doe. First of all, the middle poit of the lie has to be foud with the help of the equatio N p i i M, (32) where M is the [2 ]-vector with coordiates of the midpoit, p is the [2 N]-matri with coordiates of poits i the lie, N umber of poits alog the lie. he vectors from the midpoit to poits o the lie have N

7 A. JANZ E AL. 399 Figure 6. Set of poits for the estimatio of the light distributio. to be computed, X p M (33) where X is the matri of size [N 2]. From this matri the sample covariace matri ca be computed N C, X X X X (34) jk ij j ik k N i where C is the matri of size [N N]. Usig sigular value decompositio of the covariace matri C USRl the orietatio of the approimated lie ca be computed as the rotatio matri R l. he average value of rotatio matri R has to be computed to force the same orietatio of approimated lies i the whole measurig volume. Usig this rotatio matri ad matri X the correctio vectors ca be computed ad d Δ RX Δy Δ, Δy R (35) (36) where d is the [2 N]-matri with correctio vectors for C Figure 7. riliear iterpolatio. 2 y,, z C, y, z C 2 C 2 2, y, z, 2 y,, z C, y, z C 2 2 2, y, z, each poit o the lie. 2 Cy,, z C, y, z After correctio vectors have bee computed for each measured poit the 3D-look-up table is created. o correct image poits durig a olie measuremet the 3Dpositio of the mark has to be recostructed. Usig this pre-computed 3D-positio ad look-up table the eight earest eighbor correctio vectors must be picked up from the table. o fid the correctio vector C(, y, z) for pre-computed positio [ y z] the triliear iterpolatio (Figure 7) is used. First of all, correctio vectors are iterpolated alog the -ais C or i matri form C 2 2 2, y, z, 2, y, z C, y, z C 2, y, z (37) (38) (39) (40)

8 400 A. JANZ E AL. C y,, z Cy, 2, z y,, z Cy,, z C C C 2 C y z y z, y, z C2, y, z,, C,, C 2 C y z y z, y2, z C2, y2, z,, C,, (4) After the iterpolatio alog -ais the iterpolatio alog y-ais usig computed matri C follows y2 y y2 y Cy C (42) y y y2 y Ad the the correctio vector for the pre-computed positio results the from the iterpolatio alog z-ais z2 z y2 y z2 z z z y y z z yz C C C 2 2 2,, y. zz y y zz z2 z y2 y z2 z (43) Usig iterpolated values of the correctio vector o image poits the 3D-positio will fially be recostructed. 5. Results of the 3D Data Recostructio I order to test the accuracy of the described measuremet system ad to compare the suggested camera calibratio methods, the 3D mark was mouted o the ed effector of the coordiate-measurig machie (CMM) Werth VCIP 3D. he tested measuremet system was placed o the table of the CMM. he measuremet ucertaity of this CMM ca be assumed i the workspace of 20 millimeters as.5 micrometers. he measuremet volume of the CMM is millimeters, which is more tha eough for the test. he complete test setup is preseted i Figure 8. he 3D mark o the ed effector of the CMM was moved i the 3D cubic space of millimeters ad shot by two cameras simultaeously. o elimiate the ifluece of the piel oise, the positio of the 3D mark was measured i test poits, where the mark had to stay still for two secods i order to get a average value of the measured positio. o get more precise camera calibratio, we measured 267 poits. he offset betwee the eighborig poits i X-, Y- ad Z-directios Figure 8. est of the measuremet system with the CMM. is millimeter. 5.. Recostructio with Projectio Matrices After the actual measuremet procedure had bee completed, the 3D poits from the CMM ad the correspodig 2D image poits were available for the aalysis. First, both cameras were idepedetly calibrated i order to get projectio ad calibratio matrices. he, usig the computed projectio matrices, the 3D-poits were recostructed from the image poits ad the recostructio error was determied for each poit as the geometric deviatio of the recostructed positio from the real oe. he results of the recostructio usig idepedet calibratio (chapter 4.2) without ad with the correctio of the light ihomogeeity are preseted i Figure 9 ad i Figure 0 respectively. It is obvious from these two cases, that whe usig the correctio of the light ihomogeeity described i chapter 4.5, the accuracy improvemet of up to - 3 µm ca be achieved. At the same time the estimatio of the radial distortio has show, that the distortio of the used leses is very small ad the correctio of the distortio does ot lead to ay accuracy improvemet. For that reaso it has ot bee used i further eperimets. he average value of the recostructio error for the idepedet calibratio with the light ihomogeeity correctio is 3.5 micrometers. he recostructio error gets less i the middle of the show poit cube, where the optical aes of the cameras cross each other. After the idepedet calibratio the camera calibratio matrices ca be etracted from the projectio matrices. he essetial matri ca be computed usig the calibratio matrices. his way, the calibratio of the whole stereo video measuremet system was carried out by oly usig the essetial matri. he 3D data was recostructed with the help of the projectio matrices etracted from the essetial matri. he recostructio error was

9 A. JANZ E AL. 40 Figure 9. Recostructio usig the idepedet calibratio. Figure. Recostructio usig the essetial matri. Figure 0. Recostructio usig the idepedet calibratio ad light ihomogeeity correctio. aalyzed i the way described above. he results of the recostructio usig calibratio with the essetial matri (chapter 4.3) are preseted i Figure without light ihomogeeity correctio ad i Figure 2 with light ihomogeeity correctio. Similar to the eperimet with the idepedet calibratio the light ihomogeeity correctio improves accuracy of the system i case of the essetial matri method up to µm. he average value of the recostructio error for this method is 0.05 micrometers. Like i the previous method the recostructio error gets less i the middle of the poits cube, but the distributio of this error i the workspace is much steadier. It is obvious that the recostructio results become much more accurate after the system has bee calibrated usig the essetial matri. It ca be eplaied by the fact that the essetial matri describes ot oly the itrisic parameters but also the positio ad orietatio of both cameras relatively to each other. Ulike it, a simple idepedet computatio of the projectio matrices oly describes the relatioship betwee the world poits ad the camera image. herefore, the calibratio with the Figure 2. Recostructio usig the essetial matri ad the light ihomogeeity correctio. essetial matri ca better match the coordiate systems of the two cameras tha the idepedet calibratio Affie Recostructio I respect to the fact that both cameras have telecetric leses, their camera models ca be approimated to the affie camera model all projectio lies are assumed to be parallel to each other ad the last row of the projectio matri has the form (0, 0, 0, ). Usig this assumptio, the affie recostructio ca be implemeted to get the 3D data from the correspodig image poits. he recostructio ca be carried out with the help of the factorizatio algorithm described i [8] (the algorithm 8.). First of all, the origi of every image must be traslated to the ceter of poits i this image. he traslatio vector t for the camera with the ide i is the i i t w, (44) j where w i are poits o the image i, j ide of the poit, umber of poits o the image. he traslatio is de- j

10 402 A. JANZ E AL. fied by the equatio i i i wˆ w mt, (45) where w i are origial image poits i the image i, ŵ i ew or traslated poits i the image i, m the vector of size [ ], all the elemets of which are equal. he the measuremet matri M of size [4 ] is composed from the ew image coordiates ŵ i : wˆ wˆ2 wˆ M (46) w ˆ ˆ ˆ w 2 w he from its SVD M = UDV the 3D ormalized poits are obtaied from the first three colums of V. As described above, the affie recostructio was tested usig the same measuremet data as used i chapter 5.; the geometric recostructio error was aalyzed as well. he results of the affie recostructio are preseted i Figure 3 without the light ihomogeeity correctio ad i Figure 4 with the light ihomogeeity correctio. he average value of the recostructio error for this method is approimately 3.25 micrometers. Ulike the recostructio usig the idepedet calibratio ad essetial matri, the affie recostructio does ot require the computatio of the camera projectio matrices. he recostructio occurs directly from the image data; at least four correspodig poits are required though. However, this recostructio method caot be used for a olie-measuremet of the 3D-positio due to the computatio effort caused by a large data volume. 6. Coclusios he recostructio results ad the measuremet accuracy ca be aalyzed more carefully. Figure 5 depicts a distributio of the recostructio error for all the three described methods. Here the whole error area is divided ito 50 itervals. he umber of poits with the recostructio error is foud i every iterval ad the preseted as poit-marks o the graphic. he average value of the error for all poit is preseted as a lie. It is obvious from the figure that the distributio of the recostructio error is similar to the affie recostructio ad the recostructio usig idepedet calibratio. he distributio of the error for the recostructio usig the essetial matri is very small i compariso to the other two methods. Furthermore, the average value of the recostructio error i case of the essetial matri is sigificatly smaller tha i the other two cases. herefore, the calibratio usig the essetial matri will be used for the calibratio of the system as the stadard method. he idepedet calibratio will be oly used to compute the iitial values of the calibratio matrices if the itrisic parameters have somehow chaged. Figure 3. Affie recostructio. Figure 4. Affie recostructio usig correctio of the light ihomogeeity. Figure 5. Distributio of the recostructio error. Note that i order to estimate the accuracy of the measuremet system, the image processig accuracy of.5 micrometers (the piel oise was strogly suppressed for the calibratio measuremet) must be added to the recostructio error. hus, if the average value of the recostructio error usig essetial matri is about 0.05 micrometers, the accuracy of the measuremet system is.55 micrometers.

11 A. JANZ E AL. 403 REFERENCES [] R. C. Gozalez ad R. E. Woods, Digital Image Processig, 2d Editio, Pretice Hall, Upper Saddle River, [2] J. Heikkilä, Geometric Camera Calibratio Usig Circular Cotrol Poits, IEEE rasactio o Patter Aalysis ad Machie Itelligece, Vol. 22, No. 0, 2000, pp [3] Z. Zhag, Fleible Camera Calibratio by Viewig a Plae from Ukow Orietatios, Proceedigs of the Iteratioal Coferece o Computer Visio ICCV, Kerkyra, September 999, pp [4] R. Y. sai, A Versatile Camera Calibratio echique for High-Accuracy 3D Machie Visio Metrology Usig Off-the-Shelf V Cameras ad Leses, IEEE Joural of Robotics ad Automatio, Vol. 3, No. 4, 987, pp [5] C. Ricolfe-Viala ad A.-J. Saches-Salmero, Les Distortio Models Evaluatio, Applied Optics, Vol. 49, No. 30, 202, pp [6] Z. Zhag, A Fleible New echique for Camera Cali- bratio, IEEE rasactio o Patter Aalysis ad Machie Itelligece, Vol. 22, No., 2000, pp [7] R. Hartley ad S. B. Kag, Parameter-free Radial Distortio Correctio with Cetre of Distortio Estimatio, Proceedig of the 0th IEEE Iteratioal Coferece o Computer Visio ICCV 05, Beijig, 7-2 October 2005, pp. -8. [8] R. Hartley ad A. Zisserma, Multiple View Geometry i Computer Visio, 2d Editio, Cambridge Uiversity Press, Cambridge, [9] R. Hartley ad C. Silpa-Aa, Recostructio from wo Views Usig Approimate Calibratio, Proceedigs of the 5th Asia Coferece o Computer Visio ACCV 02, Melboure, Jauary 2004, pp. -6. [0] B. Albouy, S. reuillet, Y. Lucas ad D. Birov, Fudametal Matri Estimatio Revisited hrough a Global 3D Recostructio Framework, Proceedigs of the Advaced Cocepts for Itelliget Visio Systems ACIVS 2004, Brussels, 3 August-3 September 2004, pp [] K. Kaatai ad Y. Sugaya, Compact Fudametal Matri Computatio, Proceedigs of the 3rd Pacific Rim Symposium of Image ad Video echology, okyo, 3-6 Jauary 2009, pp

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

Two View Geometry Part 2 Fundamental Matrix Computation

Two View Geometry Part 2 Fundamental Matrix Computation 3D Computer Visio II Two View Geometr Part Fudametal Matri Computatio Nassir Navab based o a course give at UNC b Marc Pollefes & the book Multiple View Geometr b Hartle & Zisserma November 9, 009 Outlie

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

ANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES

ANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES ANALSIS OF RATIONAL FUNCTION DEPENDENC TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES M. Hosseii, Departmet of Geomatics Egieerig, Faculty of

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Stone Images Retrieval Based on Color Histogram

Stone Images Retrieval Based on Color Histogram Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

The measurement of overhead conductor s sag with DLT method

The measurement of overhead conductor s sag with DLT method Advaces i Egieerig Research (AER), volume 7 2d Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 206) he measuremet of overhead coductor s sag with DL method Fag Ye,

More information

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag

More information

Auto-recognition Method for Pointer-type Meter Based on Binocular Vision

Auto-recognition Method for Pointer-type Meter Based on Binocular Vision JOURNAL OF COMPUTERS, VOL. 9, NO. 4, APRIL 204 787 Auto-recogitio Method for Poiter-type Meter Based o Biocular Visio Biao Yag School of Istrumet Sciece ad Egieerig, Southeast Uiversity, Najig 20096, Chia

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

COMP 558 lecture 6 Sept. 27, 2010

COMP 558 lecture 6 Sept. 27, 2010 Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout

More information

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural

More information

Handwriting Stroke Extraction Using a New XYTC Transform

Handwriting Stroke Extraction Using a New XYTC Transform Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

Dimension Reduction and Manifold Learning. Xin Zhang

Dimension Reduction and Manifold Learning. Xin Zhang Dimesio Reductio ad Maifold Learig Xi Zhag eeizhag@scut.edu.c Cotet Motivatio of maifold learig Pricipal compoet aalysis ad its etesio Maifold learig Global oliear maifold learig (IsoMap) Local oliear

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.

. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed. MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.161 Moder Optics Project Laboratory 6.637 Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics

More information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Structure from motion

Structure from motion Structure from motio Digital Visual Effects Yug-Yu Chuag with slides by Richard Szeliski, Steve Seitz, Zhegyou Zhag ad Marc Pollefyes Outlie Epipolar geometry ad fudametal matrix Structure from motio Factorizatio

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

More information

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration Derivatio of perspective stereo projectio matrices with depth, shape ad magificatio cosideratio Patrick Oberthür Jauary 2014 This essay will show how to costruct a pair of stereoscopic perspective projectio

More information

An Efficient Image Rectification Method for Parallel Multi-Camera Arrangement

An Efficient Image Rectification Method for Parallel Multi-Camera Arrangement Y.-S. Kag ad Y.-S. Ho: A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet 141 A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet Yu-Suk Kag ad Yo-Sug Ho, Seior

More information

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets

More information

MathematicModelandKinematicAnalysisforRoboticArm

MathematicModelandKinematicAnalysisforRoboticArm Global Joural of esearches i Egieerig: J Geeral Egieerig Volume 15 Issue 6 Versio 1.0 Tpe: Double Blid Peer eviewed Iteratioal esearch Joural Publisher: Global Jourals Ic. (USA Olie ISSN: 22494596 & Prit

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

EE 584 MACHINE VISION

EE 584 MACHINE VISION METU EE 584 Lecture Notes by A.Aydi ALATAN 0 EE 584 MACHINE VISION Itroductio elatio with other areas Image Formatio & Sesig Projectios Brightess Leses Image Sesig METU EE 584 Lecture Notes by A.Aydi ALATAN

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

Neural Networks A Model of Boolean Functions

Neural Networks A Model of Boolean Functions Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Designing a learning system

Designing a learning system CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please

More information

Research Article Kinematics Analysis and Modeling of 6 Degree of Freedom Robotic Arm from DFROBOT on Labview

Research Article Kinematics Analysis and Modeling of 6 Degree of Freedom Robotic Arm from DFROBOT on Labview Research Joural of Applied Scieces, Egieerig ad Techology 13(7): 569-575, 2016 DOI:10.19026/rjaset.13.3016 ISSN: 2040-7459; e-issn: 2040-7467 2016 Maxwell Scietific Publicatio Corp. Submitted: May 5, 2016

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

Dimensionality Reduction PCA

Dimensionality Reduction PCA Dimesioality Reductio PCA Machie Learig CSE446 David Wadde (slides provided by Carlos Guestri) Uiversity of Washigto Feb 22, 2017 Carlos Guestri 2005-2017 1 Dimesioality reductio Iput data may have thousads

More information

Position and Velocity Estimation by Ultrasonic Sensor

Position and Velocity Estimation by Ultrasonic Sensor Positio ad Velocity Estimatio by Ultrasoic Sesor N Ramarao 1, A R Subramayam 2, J Chara Raj 2, Lalith B V 2, Varu K R 2 1 (Faculty of EEE, BMSIT & M, INDIA) 2 (Studets of EEE, BMSIT & M, INDIA) Abstract:

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

More information

Texture Mapping. Jian Huang. This set of slides references the ones used at Ohio State for instruction.

Texture Mapping. Jian Huang. This set of slides references the ones used at Ohio State for instruction. Texture Mappig Jia Huag This set of slides refereces the oes used at Ohio State for istructio. Ca you do this What Dreams May Come Texture Mappig Of course, oe ca model the exact micro-geometry + material

More information

ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES

ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES Thomas Läbe, Timo Dickscheid ad Wolfgag Förster Istitute of Geodesy ad Geoiformatio, Departmet of Photogrammetry, Uiversity of Bo laebe@ipb.ui-bo.de,

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

Lenses and imaging. MIT 2.71/ /10/01 wk2-a-1

Lenses and imaging. MIT 2.71/ /10/01 wk2-a-1 Leses ad imagig Huyges priciple ad why we eed imagig istrumets A simple imagig istrumet: the pihole camera Priciple of image formatio usig leses Quatifyig leses: paraial approimatio & matri approach Focusig

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour Diego Nehab A Trasformatio For Extractig New Descriptors of Shape Locus of poits equidistat from cotour Medial Axis Symmetric Axis Skeleto Shock Graph Shaked 96 1 Shape matchig Aimatio Dimesio reductio

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

Vision & Perception. Simple model: simple reflectance/illumination model. image: x(n 1,n 2 )=i(n 1,n 2 )r(n 1,n 2 ) 0 < r(n 1,n 2 ) < 1

Vision & Perception. Simple model: simple reflectance/illumination model. image: x(n 1,n 2 )=i(n 1,n 2 )r(n 1,n 2 ) 0 < r(n 1,n 2 ) < 1 Visio & Perceptio Simple model: simple reflectace/illumiatio model Eye illumiatio source i( 1, 2 ) image: x( 1, 2 )=i( 1, 2 )r( 1, 2 ) reflectace term r( 1, 2 ) where 0 < i( 1, 2 ) < 0 < r( 1, 2 ) < 1

More information

Fast algorithm for skew detection. Adnan Amin, Stephen Fischer, Tony Parkinson, and Ricky Shiu

Fast algorithm for skew detection. Adnan Amin, Stephen Fischer, Tony Parkinson, and Ricky Shiu Fast algorithm for skew detectio Ada Ami, Stephe Fischer, Toy Parkiso, ad Ricky Shiu School of Computer Sciece ad Egieerig Uiversity of New South Wales, Sydey NSW, 2052 Australia ABSTRACT Documet image

More information

Optimized Aperiodic Concentric Ring Arrays

Optimized Aperiodic Concentric Ring Arrays 24th Aual Review of Progress i Applied Computatioal Electromagetics March 30 - April 4, 2008 - iagara Falls, Caada 2008 ACES Optimized Aperiodic Cocetric Rig Arrays Rady L Haupt The Pesylvaia State Uiversity

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

Wavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)

Wavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual) Wavelet Trasform CSE 49 G Itroductio to Data Compressio Witer 6 Wavelet Trasform Codig PACW Wavelet Trasform A family of atios that filters the data ito low resolutio data plus detail data high pass filter

More information

GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT

GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT 6th Iteratioal DAAAM Baltic Coferece INDUSTRIAL ENGINEERING 24-26 April 2008, Talli, Estoia GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT Rahayem, M.; Kjellader,

More information

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Title: Robust Registration of Multimodal Remote Sensing Images Based on Structural Similarity.

Title: Robust Registration of Multimodal Remote Sensing Images Based on Structural Similarity. 7 IEEE. Persoal use of this material is permitted. Permissio from IEEE must be obtaied for all other uses, i ay curret or future media, icludig repritig/republishig this material for advertisig or promotioal

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P. Aalborg Uiversitet Idetificatio of the Swiss Z24 Highway Bridge by Frequecy Domai Decompositio Bricker, Rue; Aderse, P. Published i: Proceedigs of IMAC 2 Publicatio date: 22 Documet Versio Publisher's

More information

A New Mechanism for High Acceleration Wafer Transfer Based on Position and Orientation Adjustment

A New Mechanism for High Acceleration Wafer Transfer Based on Position and Orientation Adjustment A New Mechaism for High Acceleratio Wafer Trasfer Based o Positio ad Orietatio Adjustmet Fag SONG 1,Jiag CHENG 1,Yogjia GONG 1, Tao CHEN 2, Liig SUN 2 1 Laboratory of Itelliget Cotrol ad Robotics, Shaghai

More information

Aberrations in Lens & Mirrors (Hecht 6.3)

Aberrations in Lens & Mirrors (Hecht 6.3) Aberratios i Les & Mirrors (Hecht 6.3) Aberratios are failures to focus to a "poit" Both mirrors ad les suffer from these Some are failures of paraxial assumptio 3 5 θ θ si( θ ) = θ + L 3! 5! Paraxial

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

A camcorder for 3D underwater reconstruction of archeological objects

A camcorder for 3D underwater reconstruction of archeological objects A camcorder for 3D uderwater recostructio of archeological objects A. Melie 1, J. riboulet 1,2, ad B. Jouvecel 1 1 LIRMM, Uiversité de Motpellier 2 - CNRS UMR 556 161 rue Ada, 3495 Motpellier Cedex 5,

More information

Normals. In OpenGL the normal vector is part of the state Set by glnormal*()

Normals. In OpenGL the normal vector is part of the state Set by glnormal*() Ray Tracig 1 Normals OpeG the ormal vector is part of the state Set by glnormal*() -glnormal3f(x, y, z); -glnormal3fv(p); Usually we wat to set the ormal to have uit legth so cosie calculatios are correct

More information

CALIBRATING THE ULTRACAM AERIAL CAMERA SYSTEMS, AN UPDATE

CALIBRATING THE ULTRACAM AERIAL CAMERA SYSTEMS, AN UPDATE CALIBRATING THE ULTRACAM AERIAL CAMERA SYSTEMS, AN UPDATE R. Ladstädter a, H. Tschemmeregg, M. Gruber Microsoft Photogrammetry, Azegrubergasse 8, 8010 Graz, Austria a richard.ladstaedter@microsoft.com

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Intro to Scientific Computing: Solutions

Intro to Scientific Computing: Solutions Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile

More information

1. Introduction o Microscopic property responsible for MRI Show and discuss graphics that go from macro to H nucleus with N-S pole

1. Introduction o Microscopic property responsible for MRI Show and discuss graphics that go from macro to H nucleus with N-S pole Page 1 Very Quick Itroductio to MRI The poit of this itroductio is to give the studet a sufficietly accurate metal picture of MRI to help uderstad its impact o image registratio. The two major aspects

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information