ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES

Size: px
Start display at page:

Download "ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES"

Transcription

1 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 Commissio III/1 KEY WORDS: Sesor orietatio, comparative aalysis, accuracy assessmet, matchig ABSTRACT: This paper presets a empirical ivestigatio ito the quality of automatic relative orietatio procedures. The results of a i-house developed automatic orietatio software called AURELO (Läbe ad Förster, 006) are evaluated. For this evaluatio a recetly proposed cosistecy measure for two sets of orietatio parameters (Dickscheid et al., 008) ad the ratio of two covariaces matrices is used. Thus we evaluate the cosistecy of budle block adjustmets ad the precisio level achievable. We use differet sets of orietatio results related to the same set of images but computed uder differig coditios. As referece datasets results o a much higher image resolutio ad groud truth data from artificial images redered with computer graphics software are used. Six differet effects are aalysed: varyig results due to radom procedures i AURELO, computatios o differet image pyramid levels ad with or without with oly two or three observatios, the effect of replacig the used SIFT operator with a approximatio of SIFT features, called SURF, repetitive patters i the scee ad remaiig o-liear distortios. These experimets show uder which coditios the budle adjustmet results reflect the true errors ad thus give valuable hits for the use of automatic relative orietatio procedures ad possible improvemets of the software. 1 INTRODUCTION Orietig images is oe of the basic tasks i photogrammetry. For aerial images the full automatio of this task ca be cosidered as solved, but for close rage photogrammetry full automatic orietatio still is a vital research area (cf. the work of Pollefeys (Siha ad Pollefeys, 004), Nister (Egels et al., 006), Zisserma ad Schaffalitzky (Schaffalitzky ad Zisserma, 00)). Due to errors itroduced while solvig the recogitio task, special ivestigatios ito the factors ifluecig the accuracy which are ot relevat i classical o-automatic budle adjustmet have to be cosidered, e.g. texture, repetitive structures, rotatio of the images, use of all or less i the adjustmet. Depedig o the used algorithms, there are various parameters which have a ifluece o the accuracy of the result. This paper ivestigates the quality of automatic budle orietatio software, especially the effect of various factors oto the quality of the result. As there is o geeral method for automatic mesuratio of cotrol, we ivestigate the relative orietatio of multiple images istead. The fidigs ca be geeralized for a wide rage of scearios ad applicatios. METHOD FOR QUALITY CHECK To evaluate the result of a automatic orietatio procedure we eed to compare the orietatio parameters betwee two datasets directly. Automatic methods may be stochastic or determiistic, depedig o whether they call a radom umber geerator, e. g. for a RANSAC procedure, or ot. I case the algorithm cotais a stochastic compoet, we caot use the 3D object, as differet rus may choose differet ad we ivestigate i relative orietatio procedures without a subsequet absolute orietatio. Therefore we follow the approach of (Dickscheid et al., 008) which compares the orietatio parameters directly. The measures may be used (1) for evaluatig the variatios due to the radomess of the algorithm ad () for comparig a budle adjustmet result with a referece dataset or with each other. A referece dataset i this cotext is a dataset with superior accuracy ad thus may be a result of just the same algorithm, e.g. o 37 a image pyramid level with a higher resolutio. The approach itroduces a so-called cosistecy measure c: The two parameter sets should differ by a spatial similarity trasformatio. This trasformatio is estimated ad the square root of the variace factor of the fial estimatio is the cosistecy measure c = Ω/R with the Mahalaobis distace Ω of the two datasets i a commo coordiate system ad with the redudacy R, which is 6N 7 for sets with N images. The full possibly sigular covariace matrices of the orietatio parameters of both datasets are rigorously take ito accout i this cogruece test. The advatage of this approach is that the compariso is summarized i a sigle scalar value. A value of c = 1 meas that the differeces of the two sets are (o average) cosistet with the precisio give by the orietatio procedures. If c < 1, the accuracies are too pessimistic, if c > 1, the accuracies are too optimistic. Note that the reliability of the cosistecy measure depeds o the redudacy i the estimatio of the trasformatio parameters. Therefore we expect reliable cosistecy estimates for datasets with more tha three or four images. We give the cosistecy measure for every experimet we describe i this paper. I additio to c, we use p ad r max from (Dickscheid et al., 008): The two values compare two covariace matrices ad both deped o the geeralized eigevalues λ i. We compare the two covariace matrices of the two datasets after applyig the estimated spatial similarity trasformatio. Thus both covariace matrices are i the same coordiate system ad ca be compared. p is the average ratio of the covariace matrices. If p = 1, the covariace matrices are idetical, if p > 1 there is a (average) deviatio i precisio. Note that, as p is a metric, p >= 1 ad p is symmetrically. Thus p gives o iformatio about which covariace matrix is smaller, i other words, which accuracies are better. The secod value r max is the maximum ratio of the stadard deviatios: r max max i λ i ad thus idicates the maximum differece betwee the matrices. Note that r max is ot symmetric: if r max < 1 the the precisio of the secod covari-

2 The Iteratioal Archives of the Photogrammetry, Remote Sesig ad Spatial Iformatio Scieces. Vol. XXXVII. Part B3b. Beijig 008 ace matrix is better, otherwise it is worse for some fuctio of the parameters. If c 6= 1 the covariace matrices are ot cosistet with the differeces of the two datasets. Whe arguemetig with p ad rmax i this case it is reasoable ot oly to compare the give covariace matrices, but to also take the observed differeces ito accout. Thus pb = b c p ad b rmax = b c rmax are also used i these cases. These values represet the actual occurred accuracies. b rmax is maximum stadard deviatio of arbitrary fuctio of parameters assumig the estimate b c for c to be realistic. 3 ORIENTATION SOFTWARE For our ivestigatios we use a i-house developed orietatio software for the wide-baselie case of calibrated cameras called AURELO. The followig paragraph gives a brief overview of the software. Details ca be foud i (La be ad Fo rster, 006). The first step i AURELO is the extractio of feature o all give images. The SIFT-descriptor (Lowe, 004) or the SURF-descriptor (Bay et al., 006) ca be used to describe ad match the of a image pair. The SURF descriptor is a fast adaptio of the SIFT-descriptor. We use the implemetatio of D. Lowe for the SIFT descriptor 1 ad the implemetatio of the ETH Zurich, Switzerlad, for SURF. Because the descriptors are rotatio- ad scale-ivariat, a large umber of possible cofiguratios ca be hadled. No prior iformatio about the overlappig parts or the sequece of the images eed to be give. Therefore a matchig is doe betwee all possible image pairs. Relative orietatios for each pair of images are computed with the help of a RANSAC procedure based o the 5-poit solutio proposed by D. Nister (Nister, 004). It should be oted that, as RANSAC uses a radom umber geerator, multiple rus of the software may lead to differet results. The best pairwise relative orietatios are liked together to geerate a iput for a cocludig budle adjustmet. Thus the resultig orietatio parameters are give with a full covariace matrix. Note that by default all are used i this adjustmet, idepedet of the umber of observatios per object poit dataset A # img. 6 B 6 C 4 D1 1 D 9 E F 3 5 descriptio etrace of a large buildig with stairs, medium texture outdoor stairs with rich texture, matches i backgroud which are far away from cameras poster ad box o a table, differet perspectives ad rotatios of the camera facade with rich texture, oe strip with early parallel viewig directios ad high overlap (ca. 90%) same cofiguratio as D1, but with less overlap (ca.75%) idoor scee with a regular grid o the wall redered images with 1 Megapixel image size: two walls with texture o it. The texture varies betwee artificial repetitive patters ad real texture. Table 1: Overview of the datasets used i the experimets. I the tables we give additioal results as give by the orietatio procedure: the umber of object ad image of the fial budle block adjustmet. the outlier rate of the matches: Due to the relative orietatio of a image pair computed i the RANSAC loop, outliers i the matched of this image pair are detected. The average rate of these outliers over all image pairs is give i the tables. σx0 : average precisio of the image coordiates i pixel. As all image observatios curretly are used with the same weight ad thus the weight matrix for the observatios is the uit matrix ad σapriori = 1, σx0 = σ b0, with σ b0 beig the square root of the variace factor of the budle adjustmet. σxo : The average precisio of the projectio cetres over all N images (usig σ bp equa0 ad the iverse of the ormal /N. Note + σy + σz = σx tio matrix): σx 0 that all datasets have a arbitrary scale, because o absolute orietatio has bee doe. The uit of the object coordiate system is defied by the distace from the first to the secod camera. All datasets of oe ivestigatio have bee scaled to the same scale to esure that the values ca be compared to each other. σωφκ : average precisio of the orietatio agles i go. σobj, σobj,m AX : average ad maximal precisio of the object due to the budle adjustmet result. Also scaled to the same scale i oe table. EXPERIMENTAL RESULTS Descriptio of the Datasets ad Experimets We use a wide rage of datasets i our experimets because may effects are highly depedet o the geometric cofiguratio ad o the amout of texture i the images. Due to the limited space, oly a part of the results ca be preseted i this paper, but we verified the observed effects i a umber of further, upublished experimets. The datasets we used for the data here are summarized i Table 1, see also Figure 1. Two cameras were used to take the images: Niko D70s with a 0mm les (6 Megapixel images, datasets A,B,D) ad HP photosmart 435 (3 Megapixel, datasets C,E). 4. Cosistecy over Multiple Rus Due to the fact that a radom procedure for the geeratio of approximate orietatio values is used i AURELO, the user gets differet results whe startig the program multiple times with idetical parameter settigs ad iput images. The variatios of the orietatio parameters should be small compared to their accuracies. We calibrated the cameras ad corrected the oliear distortio by rectifyig the images. All experimets are doe with the same settigs for the cotrol parameters, uless otherwise oted. The stadard parameters imply that the feature extractio is doe with the operator by D. Lowe. To test the ifluece of the radom procedure, we ru 5 datasets yieldig 10-4 samples. The results of these tests ca be foud i Table. The variatios of the orietatio parameters over multiple rus are show by their stadard deviatio X0 ad ωφκ with XX 1 X0 = Xs X N (S 1) Figure 1: Sample images of datasets B,E,F (from left to right). ad 1 lowe/key surf ωφκ XX 1 = N (S 1) 38 s s ωs ω φs φ κs κ!

3 The Iteratioal Archives of the Photogrammetry, Remote Sesig ad Spatial Iformatio Scieces. Vol. XXXVII. Part B3b. Beijig 008 dataset plev #rus R ɛ X0 ɛ ωφκ [go] σ X0 σ ωφκ [go] ɛ X0 / σ X0 ɛ ωφκ / σ ωφκ max. c mea c A B C D D Table : Compariso of multiple rus of AURELO with idetical parameter settigs. Plev: pyramid level o which the orietatio has bee computed (0: origial images, 1: first pyramid level,...). R: redudacy for the similarity trasformatio betwee the samples, R = 6N 7 with N images. ɛ X0,ɛ ωφκ : stadard deviatio of the projectio cetres ad the orietatio agles calculated over the multiple rus. σ X0, σ ωφκ : average precisio for projectio cetres ad orietatio agles due to the covariace matrix of the orietatio parameters over all samples. Max. c, mea c: Maximal ad mea cosistecy measure of all cosistecy measures betwee all samples (pairwise). computed over S multiple rus. Note that all results of a dataset are trasformed to the same datum i order allow a compariso. The ratio of the stadard deviatios ɛ X0, ɛ ωφκ ad the mea accuracies σ X0, σ ωφκ should be small, at least less tha 1.0. (These two values ca be combied to oe value c s, see (Dickscheid et al., 008).) This is fulfilled for most of the tests, except for dataset B o pyramid level 0 ad dataset C. These uexpected results ca be explaied with the weak treatmet of outliers i AURELO: The decisio about ilier ad outlier is doe oly with the epipolar geometry calculated from the approximate orietatio values. These values are computed i the RANSAC loop with oly 5 homologous ad thus a wrog decisio cocerig outlier/ilier is possible. No robust adjustmet is used, so that small outliers still may preset i the fial result. This result thus reveals a deficiecy of the algorithm: it does ot always yield reliable results due to its radomess, especially o a high precisio level. This eeds a clarificatio of the causes, which e. g. could be the o-robustess of the fial budle adjustmet. 4.3 Orietatio Parameters o Differet Pyramid Levels A importat factor for the computatio time ad memory cosumptio of the orietatio procedure is the size of the iput images. Therefore we ivestigate the decrease of accuracy whe calculatig the whole orietatio procedure o a higher image pyramid level istead o the origial image. All thresholds used i AURELO remai costat durig the tests. Table 3 shows the results of two datasets which ca be regarded represetative for the coclusios draw. All pyramid levels where we got a useful result are listed. I these two datasets the umber of images which could be coected by the orietatio procedure early remais the same over all levels. If a dataset icludes parts with low overlap of the images, a decrease i the umber of images ca occur i lower pyramid levels as i the two give examples. The umber of object decreases from pyramid level to pyramid level with the same factor as the umber of image (ot listed i the table). Thus, as to be expected due to the idetical geometry, the distributio of the umber of observatios per object poit is idepedet of the pyramid level. The cosistecy measure betwee the first ad all other image pyramid levels is ot higher tha 1.8, the cosistecy values betwee all the levels (ot listed i the table) are i the same rage. Thus the chage of the orietatio parameters from level to level are i the order of the assumed precisio or slightly higher. There is o evidece ot to trust the iteral precisio values, especially whe comparig them to each other. The evaluatio of the chage i precisio whe chagig the pyramid level eeds to be compared with the theoretical expectatio: I higher levels we expect a loss i precisio for two factors: loss of ad. less accurate due to the reduced resolutio. We thus expect the stadard deviatio of the orietatio parameters to icrease with the same factor as the measuremet accuracy (give with the same pixel size!) ad to decrease with the square root of the ratio of the umber of object-/image. So a reasoable theoretical factor betwee two image pyramid levels l ad m is f oσ = (σ 0,l /σ 0,m) N m/n l ) with N l, N m i pyramid levels l ad m. This factor ca be compared to the average ratio p of the two covariaces matrices of the orietatio parameters. The table shows that the two values are early the same. This validates the use of p for practical cases. Without takig ito accout the type of poit operator, oe could assume a factor of i the measuremet accuracy betwee level l ad l +1 ad a factor of 1/4 i the umber of observatios. Thus a reasoable theoretical factor betwee levels l ad l + 1 is 4 = 4. The table shows that there are sometimes sigificat differeces to that value. The icrease i the stadard deviatios is smaller betwee the origial image ad the first pyramid image (max..1). This is also the smallest value. This pheomeo ca be observed with other datasets, too. From a practical poit of view this is a importat fidig, because it allows the use of the first image pyramid level without a big loss i accuracy. The large value of p=10.1 of dataset D1 from level 1 to level may be explaied by a loss of texture: A large area of the image has the same texture. If o level this texture is ot visible ay more, the is a high loss i the umber of extracted image. 4.4 Ifluece of Twofold ad Threefold Poits o the Result To reduce the computatio time of the budle adjustmet, we may cosider to reduce the umber of observatios used for the recostructio. Oe simple possibility would be to igore object with a small umber of observatios, especially object with oly two observatios. The cosistecy of twofold ca t be tested very well, because the secod observatio may lie at every positio o the epipolar lie iduced by the first observatio. Thus there may be udetected false matches, especially whe repeated patters occur alog the epipolar lies. These false matches may lead to ustable or at least to less accurate solutios i the budle adjustmet. Thus, if the object are used i further applicatios, twofold may be deleted after the adjustmet or ot used at all i the adjustmet. This is of course oly possible if there are eough other -fold, >, available. To test the ifluece of -fold, we have computed the budle adjustmet with all ad with all but the - ad 3- fold, respectively. The results of three datasets are show i Table 4. First we wat to compare datasets D1 ad D, as they cosists of images of the same object. The orietatio parame-

4 The Iteratioal Archives of the Photogrammetry, Remote Sesig ad Spatial Iformatio Scieces. Vol. XXXVII. Part B3b. Beijig 008 dataset pyramid level #images i result [%] outliers of matches [%] # object σ x σ XO σ ωφκ c f oσ p r max rich texture (D1) medium texture (A) Table 3: Quality of the orietatio o differet image pyramid levels. Cosistecy measure c: Measure betwee image pyramid level 0 (origial images) ad all other levels. p, r max: average/maximal ratio of stadard deviatios betwee level l ad level l 1. f oσ: theoretical factor for the decrease of accuracy, f oσ = (σ 0,l /σ 0,l 1 ) N l 1 /N l ), l =pyramid level, N l object o level l. dataset used # object # image σ x σ XO σ ωφκ σ OBJ σ OBJ,MAX c p r max D1 all without -fold without,3-fold D all without -fold without,3-fold B all without -fold without,3-fold Table 4: Quality of the Orietatio without with two or three observatios. All orietatios have bee doe o the origial images. Cosistecy measure: Measure betwee orietatio with all ad with less. p, r max: average ad maximal factor betwee covariace matrices of orietatio with all ad with less. ters of D1 ad D do ot vary sigificatly with respect to their accuracy: the cosistecy measure is below 1.5. The accuracy of the image coordiates (σ x ) remais costat: All lie o a facade with very good texture ad thus the observatios of - fold ad 3-fold have the same accuracy as the other. The umber of object ad image ad hece the computatio time for the budle adjustmet decreases sigificatly, e.g. by a factor of 4 whe comparig all ad without -fold of D. The average ratio of the covariace matrices betwee all ad without -fold is 1. (dataset D1) ad 1.4 (dataset D) which may be a acceptable accuracy loss i most applicatios. The ratio for without,3-fold of D1 may be also acceptable, but for D the value shows a loss i accuracy. Here the maximal ratio has a large value (14.8). This i a idicatio that without - ad 3-fold some images could ot be orieted with good accuracy. As the images cosist of oe strip ad D has less overlap, the orietatio of the images at the begiig ad ed of the strip are difficult without 3-fold. We coclude from this observatio that for sigle strips a geeral deletio of - ad 3-fold tie may be problematic, for circular arragemets of images this problem would ot occur. Dataset B shows a differet behaviour. The cosistecy measures betwee the orietatio with all ad without -fold or - ad 3-fold is 10.6 ad 7.9, thus the orietatio parameters chage with respect to their high accuracy level. The average accuracy of the image becomes slightly better (σ x decreases from 0.8 to 0.5 ad 0.4). These two aspects allow the assumptio that most outliers were amog the - ad 3-fold. A visualizatio of the object (ot show here) idicates that may twofold which are far away ad lie o twigs of a tree have bee deleted. There are remaiig which are very far away, explaiig the high maximal value for the stadard deviatio of the object. Dataset B has also 40 show high cosistecy values for multiple rus (see Table ). Here agai we ca draw the coclusio that for this dataset a better outlier detectio has to be implemeted. The results of the orietatio without twofold may be more accurate due to outliers eve though the average ratio p of the covariace matrices is Usig Differet Feature Extractors If the iput images are large, e.g. greater tha 5 Megapixel, the time for poit extractio is a importat part of the overall computatio time. Therefore we itegrated SURF as a alterative to the SIFT operator by D.Lowe. SURF speeds up also the matchig by a factor of, because the legth of the descriptor of a feature poit is oly 64 compared to 18 whe usig the origial operator. Both operators double the image size before extractig the. Both operators were used with their stadard parameters. Table 5 summarizes a test which shows the ifluece of the operators. The examples show that SURF delivers less i all cases, sometimes oly 1/3 of the umber of Lowe. The matched SURF also cotai more outliers tha the Lowe i all cases. The accuracy of the is worse i datasets A ad B whe usig SURF, so that the average accuracy decreases by a factor of about 4 i these two datasets. This is theoretically the same loss which occurs whe usig the ext image pyramid level (see chapter 4.3). This loss i accuracy must be compared to the computatio time: I our tests SURF is faster with a factor of about 4-8, 4-5 o the smaller images of datasets A ad E. As the same factor (4-5) ca be expected whe calculatig the Lowe SIFT- o the ext pyramid level, a alterative for these two datasets with the same loss of accuracy to SURF would be to use the ext pyramid level with the SIFT operator by D. Lowe. However, there is still the speedup by a factor of durig

5 The Iteratioal Archives of the Photogrammetry, Remote Sesig ad Spatial Iformatio Scieces. Vol. XXXVII. Part B3b. Beijig 008 dataset Features #images i result # object outliers of matches [%] σ x σ XO σ ωφκ c p computatio time [sec] B (plevel=0) Lowe SURF A (plevel=1) Lowe SURF E (plevel=0) Lowe SURF Table 5: Quality of the Orietatio calculated with differet poit extractors. Cosistecy measure: Measure betwee orietatios with the two poit extractors. Computatio time: computatio time for feature poit extractios i secods. matchig which may be advatageous whe choosig SURF. Dataset E (repetitive patters) shows a differet behaviour: The measuremet accuracy of SURF is slightly better, the umber of object is oly 13 % smaller. I cotrast, the average distace of the covariace matrices of the orietatio parameters icreases by a factor of.4 whe usig SURF. This may be explaied by the fact that the distributio of the observatios over the images is better whe usig the Lowe SIFT operator. But the cosistecy measure betwee these two orietatios is 10, the orietatio parameters show big differeces that caot be explaied by gaussia oise i the image coordiates. So far the source of this differece is ukow. Further ivestigatios have to be doe to fid out which result is more reliable. 4.6 Results with with Repetitive Patters ad Groud Truth To guaratee that there is o ukow bias i the results of AU- RELO which is ot eve visible whe comparig results o differet image pyramid levels, a compariso with groud truth data is ecessary. Therefore we redered artificial images with a OpeGL program. We combied this experimet with a ivestigatio of differet matchig strategies ad their performace with repetitive patters. Therefore the scee (dataset F) shows two walls (Figure 1). The walls had bee textured partly with a artificial repetitive patter ad partly with rich texture from real images. We varied the amout of the repetitive patters. Table 6 shows experimets with two differet matchig criteria: The first experimets are doe with the stadard criterio: The ratio of the feature vector distace betwee the secod best ad the best match must be below a certai threshold, e.g. 70% i these tests. If there are multiple matches due to repetitive patters, o of the matches will be used i geeral. The secod part of the Table shows experimets with threshold matchig: The distace of the feature vector must be below a defied threshold. Here multiple matches will be used i the RANSAC loop to compute the relative orietatio of a image pair. Thus the relative orietatio is able to use matches of repetitive patters, but must detect the false matches as outliers. I all cases listed the orietatio was able to coect all five images. Tests were also doe with 100% repetitive patters. The orietatio failed completely i this case or give a coectio of two images with very bad accuracies. Best Matchig: The cosistecy measure c of the experimets with best matchig is below 1.8. This shows that there is o bias betwee the groud truth data ad the results of AURELO that is ot i the order of the stadard deviatios of the result. Thus the accuracies give represet the true accuracy situatio whe usig Lowe features ad best matchig i this image setup (large overlap betwee the images, o textured backgroud that is very far away). We ca coclude that the orietatio procedure is able to cope with up to 40% repetitive patters with early the same accuracy ( p betwee 1.6 ad 1.8). As the repetitive patters are equally distributed i the scee, there are eough reliable 41 poit correspodeces left. Due to the matchig criteria o additioal remaiig outliers for the budle adjustmet are to be expected. Eve with 80% repetitive patters the accuracy loss is oly about a factor of compared to the experimets without repetitive patters. I real world scees repetitive patters may cause more problems, because they are ofte ot equally distributed. Threshold Matchig: The experimets with threshold matchig show worse results: Although σ XO ad σ ωφκ have higher values, the errors are larger tha idicated by the accuracies: The cosistecy measure is always greater tha.9 ad oe experimet is clearly wrog: With 40% repetitive patters the cosistecy measure is 840. Tests show that multiple rus i this case show differet results, ofte better oes. As expected, the outlier rate of the matches is higher tha for the best matchig: at least 59% outliers. The results show, that this outlier rate is too high for the curret algorithm to provide reliable results. As p is always much higher tha i the experimets with best matchig, we do ot recommed the use of threshold matchig. With the curret parameter settigs ad simple outlier detectio methods o advatage ca be observed whe there is a high amout of repetitive patters i the observed scee. The same experimets were carried out with the SURF operator. The results of the SURF operator were always worse tha with the Lowe operator. But the SURF results become better with more repetitive patters: The compariso with 80% repetitive patters shows that p SURF / p Lowe is 1.5. Agai, threshold matchig is always worse tha with best matchig whe usig SURF. Figure : Quality of the orietatio with images with o-liear distortio. X-Axis: Amout of maximal distortio i the image i pixel. Y-Axis: cosistecy measure c ad average ratio of covariace matrices betwee dataset without distortio ad dataset with distortio. Used images: dataset A, Niko D70s camera with 0mm les. 4.7 Results with Differet Amouts of Distortios I may practical applicatios, especially whe usig cosumer cameras, the questio whether to correct the o-liear distortios of the images arises. We used existig lookup tables for distortio ad scaled the distortio offsets. These scaled distortio lookup tables were the applied to the already rectified (ad

6 The Iteratioal Archives of the Photogrammetry, Remote Sesig ad Spatial Iformatio Scieces. Vol. XXXVII. Part B3b. Beijig 008 Matchig rep. parts % # object # image outliers i matches [%] σ x σ XO σ ωφκ c p p Best Threshold Table 6: Quality of the Orietatio accordig to repetitive patters. Dataset used: dataset F (simulated data). The texture cosists of repetitive parts (percetage give i colum ) ad o repetitive parts. Lowe features with best matchig (ratio betwee best ad secod best match as threshold) ad threshold matchig used. The cosistecy measure c is calculated betwee the groud truth data ad the experimet, the average ratio of the covariaces p ad p = cp are calculated betwee the best matchig result with 0% repetitive patters ad all other experimets. therefore declared distortio-free) images ad the impact o the orietatio results was observed. With the help of the distortio scalig we set the maximal distortio successively from 1 to 70 pixel. The result for a Niko D70s camera (dataset A) is visualized i Figure. Here eve with 70 pixel distortio i the images AURELO was able to coect all images. The Figure shows the cosistecy measure ad the average ratio of the covariace matrices with respect to the maximal amout of distortio. The cosistecy icreases approximately liear with the amout of distortio. Eve with small distortios less or equal to 5 pixels the cosistecy measure has values from to 6. That meas that (with low ad with high distortios) the accuracies of the orietatio parameters do ot reflect the shift of the orietatio parameters due to o-liear distortio. For distortios equal or less tha 5 pixels the average ratio p betwee the covariaces is up to 1., so the covariaces i priciple do ot chage. The cosequece for practical applicatios is that (at least with this image setup) it is very difficult to draw coclusios about the remaiig o-liear distortio i the images ad their effect o the accuracy with the help of the statistical results of a budle adjustmet that does ot use ay calibratio parameters. As the loss of accuracy ca be large, e.g. i this experimet for 5 pixels distortio p 5 = c 5 p 5 = 7. ad for 5 pixels distortio, the actual distortio of the used les, p 5 = c 5 p 5 = 80, the o-liear distortios of the camera should always be used if available. 5 SUMMARY AND OUTLOOK The experieces with the tests showed that the cosistecy measure i cojuctio with the average ad maximal ratio of covariace matrices is a useful tool to bechmark differet results of automated relative orietatio procedures. To summarize our fidigs, the followig geeralized coclusios ca be draw: 4 Orietatio procedures which use radom umber geerators, especially RANSAC algorithms, may produce sigificatly differet results whe started multiple times. This is dataset depedet. The accuracy loss whe usig the first image pyramid level istead of the origial images is smaller tha the decrease whe usig the subsequet smaller levels. If there is eough overlap, with oly two or eve with oly three observatios ca be left out with oly a very small loss i accuracy. The SURF feature extractio implemetatio used here rus sigificatly faster tha the classical SIFT operator, but yields much worse results. If performace is ot a mai issue, we thus recommed usig SIFT. If accuracy is o issue, we recommed to use SURF, which is approximately a factor less accurate i stadard deviatio. Matchig SIFT descriptors with a threshold delivers worse results tha matchig with the ratio of best to secod best match. This is at least true whe o other sophisticated outlier detectio is used. Eve for images with large areas of repetitive patters threshold matchig has o advatages. Umodeled o-liear distortio has a sigificat ifluece o the result. A big amout of the errors is ot reflected i the estimated accuracies of the orietatio parameters. Not all iflueces o the quality were take uder cosideratio i this paper, e.g. the ifluece of the geometry (rotated images), the reflectace properties of the object, the lightig coditios ad so o. Nevertheless the fidigs ca help to produce more reliable results ad improve the orietatio procedures. For AURELO the eed for the implemetatio of a more sophisticated outlier detectio method ad/or the use of a robust budle adjustmet became clearly visible. The compariso with other orietatio procedures is also oe objective for our future work. REFERENCES Bay, H., Tuytelaars, T. ad Gool, L. v., 006. Surf: Speeded up robust features. I: Proceedigs of the 9. ECCV. Dickscheid, T., Förster, W. ad Läbe, T., 008. Bechmarkig automatic budle adjustmet results. I: XXI. ISPRS cogress, Beijig, submitted, accepted. Egels, C., Stewéius, H. ad Nistér, D., 006. Budle adjustmet rules. I: Photogrammetric Computer Visio (PCV). Läbe, T. ad Förster, W., 006. Automatic relative orietatio of images. I: Proceedigs of the 5th Turkish-Germa Joit Geodetic Days, Berli, Germay. Lowe, D., 004. Distictive image features from scale-ivariat key. I: Iteratioal Joural of Computer Visio, Vol. 0, pp Nister, D., 004. A efficiet solutio to the five-poit relative pose problem. I: IEEE PAMI, Vol. 0(6), pp Schaffalitzky, F. ad Zisserma, A., 00. Multi-view matchig for uordered image sets. I: Proceedigs of the 7th Europea Coferece o Computer Visio, Lodo, UK, pp Siha, S. ad Pollefeys, M., 004. Camera etwork calibratio from dyamic silhouettes. I: Proc. of IEEE Cof. o Computer Visio ad Patter Recogitio.

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

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

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

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

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

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

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

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

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

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

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

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

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

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

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

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

( 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

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

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

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

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

XIV. Congress of the International Society for Photogrammetry Hamburg 1980

XIV. Congress of the International Society for Photogrammetry Hamburg 1980 XIV. Cogress of the Iteratioal Society for Photogrammetry Hamburg 980 Commissio V Preseted Paper ALTAN, M. O. Techical Uiversity of Istabul Chair of Photograrretry ad Adjustmet A COMPARISON BETWEEN -PARAMETER

More information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

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

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

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

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka O-lie cursive letter recogitio usig sequeces of local miima/maxima Summary Robert Powalka 19 th August 1993 This report presets the desig ad implemetatio of a o-lie cursive letter recogizer usig sequeces

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

Designing a learning system

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

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

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

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

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

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

Image based Cats and Possums Identification for Intelligent Trapping Systems

Image based Cats and Possums Identification for Intelligent Trapping Systems Volume 159 No, February 017 Image based Cats ad Possums Idetificatio for Itelliget Trappig Systems T. A. S. Achala Perera School of Egieerig Aucklad Uiversity of Techology New Zealad Joh Collis School

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

High-Speed Recognition Algorithm Based on BRISK and Saliency Detection for Aerial Images

High-Speed Recognition Algorithm Based on BRISK and Saliency Detection for Aerial Images Research Joural of Applied Scieces, Egieerig ad Techology 5(23): 5469-5473, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scietific Orgaizatio, 2013 Submitted: November 29, 2012 Accepted: Jauary 17,

More information

Orientation. Orientation 10/28/15

Orientation. Orientation 10/28/15 Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy

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

Random Graphs and Complex Networks T

Random Graphs and Complex Networks T Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

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

DATA MINING II - 1DL460

DATA MINING II - 1DL460 DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,

More information

Data diverse software fault tolerance techniques

Data diverse software fault tolerance techniques Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the

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

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

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

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

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits:

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits: Itro Admiistrivia. Sigup sheet. prerequisites: 6.046, 6.041/2, ability to do proofs homework weekly (first ext week) collaboratio idepedet homeworks gradig requiremet term project books. questio: scribig?

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1 ad Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-10559 Berli,

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

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

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

The Magma Database file formats

The Magma Database file formats The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,

More information

Image Analysis. Segmentation by Fitting a Model

Image Analysis. Segmentation by Fitting a Model Image Aalysis Segmetatio by Fittig a Model Christophoros Nikou cikou@cs.uoi.gr Images take from: D. Forsyth ad J. Poce. Computer Visio: A Moder Approach, Pretice Hall, 2003. Computer Visio course by Svetlaa

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

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

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

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

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

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

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

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic. Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig

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

Shape Completion and Modeling of 3D Foot Shape While Walking Using Homologous Model Fitting

Shape Completion and Modeling of 3D Foot Shape While Walking Using Homologous Model Fitting Shape Completio ad Modelig of 3D Foot Shape While Walkig Usig Homologous Model Fittig Yuji YOSHIDA* a, Shuta SAITO a, Yoshimitsu AOKI a, Makiko KOUCHI b, Masaaki MOCHIMARU b a Faculty of Sciece ad Techology,

More information

Improving Face Recognition Rate by Combining Eigenface Approach and Case-based Reasoning

Improving Face Recognition Rate by Combining Eigenface Approach and Case-based Reasoning Improvig Face Recogitio Rate by Combiig Eigeface Approach ad Case-based Reasoig Haris Supic, ember, IAENG Abstract There are may approaches to the face recogitio. This paper presets a approach that combies

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

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

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

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued

More information

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work 200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval

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

UNIVERSITY OF MORATUWA

UNIVERSITY OF MORATUWA UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2014 Itake Semester 2 Examiatio CS2052 COMPUTER ARCHITECTURE Time allowed: 2 Hours Jauary 2016

More information

Our Learning Problem, Again

Our Learning Problem, Again Noparametric Desity Estimatio Matthew Stoe CS 520, Sprig 2000 Lecture 6 Our Learig Problem, Agai Use traiig data to estimate ukow probabilities ad probability desity fuctios So far, we have depeded o describig

More information

CS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1

CS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1 CS200: Hash Tables Prichard Ch. 13.2 CS200 - Hash Tables 1 Table Implemetatios: average cases Search Add Remove Sorted array-based Usorted array-based Balaced Search Trees O(log ) O() O() O() O(1) O()

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

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

Linearising Calibration Methods for a Generic Embedded Sensor Interface (GESI)

Linearising Calibration Methods for a Generic Embedded Sensor Interface (GESI) 1st Iteratioal Coferece o Sesig Techology November 21-23, 2005 Palmersto North, New Zealad Liearisig Calibratio Methods for a Geeric Embedded Sesor Iterface (GESI) Abstract Amra Pašić Work doe i: PEI Techologies,

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

Research Article A DCM Based Attitude Estimation Algorithm for Low-Cost MEMS IMUs

Research Article A DCM Based Attitude Estimation Algorithm for Low-Cost MEMS IMUs Iteratioal Joural of Navigatio ad Observatio Volume 215, Article ID 53814, 18 pages http://dx.doi.org/1.1155/215/53814 Research Article A DCM Based Attitude Estimatio Algorithm for Low-Cost MEMS IMUs Heikki

More information

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

More information

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

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

Evaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis

Evaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 14, No 4 Sofia 2014 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI: 10.1515/cait-2014-0008 Evaluatio of the Software Idustry

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

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

Implementation of Panoramic Image Mosaicing using Complex Wavelet Packets

Implementation of Panoramic Image Mosaicing using Complex Wavelet Packets Available olie www.eaet.com Europea Joural of Advaces i Egieerig ad Techology, 2015, 2(12): 25-31 Research Article ISSN: 2394-658X Implemetatio of Paoramic Image Mosaicig usig Complex Wavelet Packets 1

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

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

Improved Random Graph Isomorphism

Improved Random Graph Isomorphism Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such

More information

15 UNSUPERVISED LEARNING

15 UNSUPERVISED LEARNING 15 UNSUPERVISED LEARNING [My father] advised me to sit every few moths i my readig chair for a etire eveig, close my eyes ad try to thik of ew problems to solve. I took his advice very seriously ad have

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information