AUTOMATING POST-PROCESSING OF TERRESTRIAL LASER SCANNING POINT CLOUDS FOR ROAD FEATURE SURVEYS

Size: px
Start display at page:

Download "AUTOMATING POST-PROCESSING OF TERRESTRIAL LASER SCANNING POINT CLOUDS FOR ROAD FEATURE SURVEYS"

Transcription

1 Internatonal Archves of Photogrammetry, Remote Sensng and Spatal Informaton Scences, Vol. XXXVIII, Part 5 Commsson V Symposum, Newcastle upon Tyne, UK AUTOMATING POST-PROCESSING OF TERRESTRIAL LASER SCANNING POINT CLOUDS FOR ROAD FEATURE SURVEYS Davd Belton*, Kwang-Ho Bae Cooperatve Research Centre for Spatal nformaton (CRCSI), Department of Spatal Scences, Curtn Unversty of Technology, Perth, WA, Australa d.belton@curtn.edu.au, k.h.bae@curtn.edu.au Commsson V, WG V/3 KEY WORDS: Segmentaton, Classfcaton, Terrestral Laser Scanners, 3D pont clouds ABSTRACT: Terrestral Laser Scanner (TLS) have seen ncreasng use n survey practces as a means of fast capturng large volumes of pont data, wth one such practce beng the surveyng of as-bult features for roads. Ths paper presents methods to automate some of the processng of road scenes. The method focuses prmarly on the automaton of the dentfcaton and extracton process of kerbs and surroundng dscrete geometrc features, such as sgnage. The process s done n multple stages. The frst stage s to solate the road surface and ground ponts usng smple local classfcaton and segmentaton technques. From ths, t allows the localty of the ponts sampled from the kerb and road features to be approxmated. For defnng the kerb feature, the orentaton of the kerb s found locally, and a 2D cross-secton s extracted and examned to fnd the profle. The adacent kerb profles can then be oned to defne a lne representaton along the kerb. For features adacent to the road, ponts defned off the road surface are selected as canddate ponts. A regon growng method s appled to group adacent canddate ponts together to form group of ponts sampled from the same feature. Ths allows for the extracton of features such as sgnage, lghts and poles from the scene. 1. INTRODUCTION Terrestral Laser Scanners (TLS) are not a new nnovaton wthn the surveyng ndustry. Whle they are not wdely utlsed yet, they are seeng ncreasng adopton n use for tradton surveyng and photogrammetrc applcatons. Ths ncrease s due to the contnung development n terms of data capture speed, accuracy and densty of pont data obtaned from TLS technology. One such area that s startng to see ncreasng use of TLS s on road surveys. There are several benefts of usng TLS that makes t attractve for surveyng of assets and nfrastructure, such there s no drect contact requred wth a feature of nterest durng data capture, whch reduces the nteracton tme between the surveyor and a busy road, and the large volume of pont data that can be captured from a sngle setup. Fgure 1. 3D Pont cloud of a road and surroundng structures Some examples of utlsng laser scannng for the surveyng and recordng the data from roads and adacent structures such as buldngs are presented n Kretschmer et al. (2004), whle Lcht et al. (2005) presents a comparson of accuracy between TLS and tradtonal methods, wth respect to Australan survey standards for such obs. Intally, extractng data to the requred accuracy was a problem; however recent scanners provde the requred resoluton and accuracy of poston to make road surveys of all features by TLS vable. The capture of data can by done several methods such as by statonary TLS, stop and go methods, and vehcle mounted LDAR or lne scannng systems. The beneft of a lne scannng system s that the vehcle poston s known and can be used for nformaton on the roads locaton and orentaton, as well as scan-lne processng technques can be appled to smplfy some of the processng (Jang and Bunke, 1994). Stop and go s smlar to TLS, but wth the beneft that the vehcles poston may gve addton nformaton, as wth lne scannng systems. As such, statonary TLS can be more dffcult to automatcally process. The dffcultes n automatng the extracton of salent features comes from the complex data captured n the pont data, combnaton of multple data sources, unorgansed pont nature, nconsstent samplng, occluson of road features by the very features of mportance (such as kerbs), and no pror nformaton of the poston and orentaton of the road. General problems come from fndng non-geometrcal features (lne-markngs) that requre addtonal spectral nformaton to solve, sparser samplng at the extents of the scan and the large volumes of ponts that need to be examned and dealt wth. The post-processng stage normally ncludes steps such as removng unwanted nformaton and nose, dentfyng and solatng the salent features of a scene, and calculatng and/or modellng the propertes of each feature. Because of the length of post-processng tme compared to the fast acquston tme, a large focus of the research n the area of TLS has been amed at automatng these processes to reduce cost nvolved at ths stage and ncrease the overall effcency of utlsng TLS (Belton, 2008; Bae, 2007; Lcht et al., 2005). Ths paper ams at automatng some of the processng of road scenes. Specfcally, t deals wth automatng the process of cleanng up the data, defnng the road and solatng geometrc * Correspondng author. 74

2 Internatonal Archves of Photogrammetry, Remote Sensng and Spatal Informaton Scences, Vol. XXXVIII, Part 5 Commsson V Symposum, Newcastle upon Tyne, UK features of the kerbs and surroundng nearby salent features. It wll also be assumed that the data was captured by statonary TLS setups (although other capturng methods can be used, t s the one of prmary use and focus of the proect). In addton, the road scenes used n ths paper of the type that have clearly defne extents at the edges of the road n terms of geometrc propertes. Ths processng of the pont cloud s performed n the followng steps: Fndng canddate ground ponts Segmentng the ground ponts nto common regons. Determnng the road and ts scanned extents. Extractng kerb profles to sectons where they exst. Isolatng common groups of ponts nto common features present n the road scene. Ths paper does not look at features such as lne markngs and covers, as they requre spectral nformaton, and are often better extracted from 2D magery, and overlad onto the 3D pont data. 2. DATA STORAGE One of the bggest dffcultes n post-processng of 3D pont clouds s dealng wth the large volume of unorgansed pont data, wth common applcatons resultng n bllons of ponts beng sampled. Due to the amount of the data to be processed, there has been much research emphass on the development of automaton procedures for 3D pont clouds. One of obstacles for these effort, n most cases, exhaustve search and localcalculaton processes are requred to nterrogate every data pont to evaluate whch (geometrc) propertes t exhbts and whch feature t was sampled from. Because of ths, the method for storng the pont data s mportant to ensure low processng costs, by balancng fast access tmes of ponts and ts surroundng nformaton, wth ntalsaton tme and memory space. Some common methods nclude kd-trees, oct-trees or voxels (Vosselman and Maas, 2010). Fortunately, 3D pont clouds for road scenes have some advantages over general pont clouds, whch help us to develop new storage and processng methods. The frst s that most of the salent features are related to the scene and each other n prmarly 2D, such as kerbs wll be adacent to the road, a footpath/verge wll be next to the road, and a sgn wll manly connect to one of these, but not the road. Ths provdes a huge beneft of accessng each pont n the horzontal plane,.e. wellestmated ground, whch provdes a possblty of dealng 3D pont n a 2D doman. Also re-enforcng ths concept s that most of the mportant nformaton, such as the road, the base of poles and sgns, and kerbng, s located at ground level. Addtonal, the maorty of the targeted salent features are consstent over large area, such as roads, walls, poles, and sgns. Locally, ponts sampled from these features wll have very smlar propertes wth lttle to no change n structure. Takng n the aforementoned consderatons, t was determned that the pont cloud would be ordered and stored nto a 2D grd structure. The spacng of the grds s set large enough to contan a sgnfcant number of ponts, but small enough the only a very small number of salent features would be present. Each pont s then assgned a grd number such that: x mod( x mn( x), s) grd _ num _ x s (1) y mod( y mn( y), s) grd _ num _ y s wth x and y denotng the x and y values of pont, mn(x) and mn(y) denotng the respectve mnmum values of the x and y coordnates, mod beng the modulus operator and s s the grd spacng. The ponts are then ordered usng the sorted by the frstly grd_num_x, then grd_num_y, and fnally by pont heghts. All ponts n the same cell are located together n the array n sequence of heght. The count-sort algorthm s used for sortng the grd numbers because of ther nteger nature, and the speed of the algorthm when used on such values (Knuth, 1999, vol. 3). The ndex of the start of each cell, and the numbers of ponts contaned wthn are then stored to allow for fast retreval of the ponts Once ths s done, each grd cell can be examned ndependently to reduce the examnng of the pont cloud nto smaller subexamnatons. Dependng on the spacng of the grd, each cell should only contan a few features of nterest, and can be easly separated. Addtonal nformaton from neghbourng grd cells can be compared and ncorporated to see f common features or propertes exst across the cell, or f ponts are deemed to belong to a feature n a neghbourng cell. Ths also hghlghts the reason for the 2D horzontal grd, snce salent features wll be ether contaned n prmarly one cell (such as poles and sgns), or be related to each other by the horzontal poston (roads, kerbs, verges and footpaths). Furthermore, because of the orderng method, not only can ndvdual cells and ther ponts be access drectly, but the nearest neghbourhood method can be approxmated easly, f not wth as much effcency as a dedcated structure (.e. kdtree). The benefts of storng the ponts n ths way for ths applcaton wll be further hghlghted n the followng sectons. 3. FINDING THE POINTS ON THE GROUND The frst step n the process s, for each cell, fndng those ponts that are deemed have been sampled from the ground. Ground ponts are defned n ths case as the ponts on the lowest, smooth, nomnally horzontal surface. Methods for extractng DSM from ALS can be appled, and s part of the reason for storng data nto a 2D grd (Vosselman and Maas, 2010). One such smple method s to defne the lowest pont n the data set as the ground. The cell that belongs to and any adacent cells whose lowest pont s wth a set heght dfference are then labelled as contanng ground ponts. The ground can then be nterpolated between the lowest ponts n these ground cells, and any ponts that nomnally agreed wth the nterpolated surface are then labelled as belongng to the ground. Ths method, whle useful to elmnate a cast maorty of non-ground ponts, wll not necessarly flter out ponts belongng to small non horzontal changes, such as the step from the road up a kerb. Another opton s to examne each ndvdual cell for the lowest horzontal surface. Ths can be acheved by separatng the surface features n each ndvdual cell by RANSAC (Fschler and Bolles, 1981), Hough transform (Shapro and Stockman, 2001) or varatonal surfaces technques (Wu and Kobbelt, 2005), and solatng the one that s most lkely representng the ground. In a smlar manner, snce the focus s n lowest nomnally horzontal surface, a planar can be fttng through the 75

3 Internatonal Archves of Photogrammetry, Remote Sensng and Spatal Informaton Scences, Vol. XXXVIII, Part 5 Commsson V Symposum, Newcastle upon Tyne, UK lowest ponts n the cell and then teratvely adusted by addng or removng ponts that are determned nlers or outlers based on statstcal testng. The method outlne n ths paper s smlar to ths, but the ntal pont selecton s based on the changes of samplng densty of the ponts through the vertcal axes n the cell. does not belong to the plane (such as those ponts mstakenly selected from the kerb). Fgure 4. Ponts n red are chosen as the lowest ground ponts. Fgure 2. Ordered vertcal pont values. The red vertcal lnes denote where a change n vertcal densty s observed. Frst step n ths method s to order the ponts n a cell from the lowest to hghest, as shown n Fgure 2. Lnear regresson s used to ft a lne through these ordered ponts. Where the pont that exhbts the greatest resdual occurs (excludng those ponts at the extremes of the data set), the set of ponts are dvded, and a new lnear regresson model s ftted to both. Ths dvdng method s then repeated on the secton of ponts wth the greatest resdual untl the ordered ponts are dvded nto regons of contnuous samplng densty and the largest resdual s no longer sgnfcant, as seen n Fgure 2. The result of ths subdvdng wth respect to the 3D ponts s dsplayed n Fgure 3. And fnally, ths method wll only target the lowest ground surface, whch s not a sgnfcant problem for 3D road-scene pont clouds. If there are two or more ground surfaces (such as on a kerb or stars), then ether more than one surface can be selected, or the planar surface from surroundng adacent cells can be use to see f any of the remanng ponts agree wth ther surface defnton. The followng secton on segmentaton wll hghlght the last opton when the ground ponts are segmented nto contnuous and smooth surface regons. Fgure 5. Red ponts denote the lowest ground ponts found n the pont cloud. Fgure 3. Ponts splt base on the changes vertcal pont densty. These sets of ponts are examned (from the lowest to hghest) to fnd the lowest one that contans the flattest or most horzontal trend and s chosen as the one contan ponts sampled from the ground. Ths s due to t contanng the ponts whch are the lowest, has the least change of samplng densty n the vertcal drecton, and has a sgnfcant presence wthn the cell, whch reflects the specfed propertes of the ground n ths nstant. A planar surface s then ftted through the selected ponts, and addtonal ponts are added, ore removed based on whether they are determned to be ether nlers or outlers. The fnal result for a sngle cell s presented n Fgure 4. Fgure 5 dsplays the shows the results for the entre pont cloud. There are a couple of lmtatons to ths method. The frst s that t only works for fndng nomnally horzontal surfaces, whch s not an mportant factor n ths case snce the snce ths s not the focus of the problem and the method can excel for elmnatng pont nose caused by traffc for cells contanng the road. Another lmtaton s that the method does not take nto account concave surfaces. For ths applcaton, the maorty of ths occurs where the road cambers off and meets a kerb, where the selected ponts of the lowest regon wll nclude a small secton up to the face of the kerb (snce t only looks at the change n vertcal). Ths can be reduced by havng a small grd sze, and can be handled by fttng a plane though the selected ponts (under the assumpton that the pont on the ground wll be locally planar), and then refnng the pont secton to those that 4. SEGMENTING THE POINTS INTO REGIONS Once the maorty of ground ponts have been dentfed, these ponts are segmented nto contnuous ground regons. To do ths, a smple regon growng method s appled wth respect to the grd cells. The frst step s to dentfy all grd cells that contan ground ponts. Adacent grd cells that contan ground ponts are compared to each other n an teratve manner n order to see f the ground pnts are lkely to have been sampled from the same ground surface. The comparson s performed by lookng at the planar surface ftted to the ground ponts n each cell, to see f they are nomnally algned. Ths means that no large dfference between the normal drectons and the dstance between the planar surfaces are small To look at the dfference between the planar surfaces, the resduals between the mean ground pont of a cell ( ) and the surface normal of an adacent cell ( nˆ ) s examned, where the resduals for two adacent cells and are defned by: r ( ) nˆ r ( ) nˆ These resduals are then examned, and both cells are labelled as contanng ground ponts from the same ground surface segment f they pass the condtons that r and r are smaller than a tolerance. The tolerance comes from an user defned value, a global value for pont devaton, or a t-test on the local surface (2) 76

4 Internatonal Archves of Photogrammetry, Remote Sensng and Spatal Informaton Scences, Vol. XXXVIII, Part 5 Commsson V Symposum, Newcastle upon Tyne, UK propertes. Note that a tolerance of dfference d between planar surfaces when there s a grd spacng of s wll approxmate to angular tolerance between the normal drecton of 2sn -1 (d/s). The process s repeated untl all the cells have been examned wth respect to ther neghbours. Once the cells are labelled, the other ponts n the cell can also be labelled n a smlar manner. For every ground pont n the labelled cell, the pont s gven the segment label as the cell t belongs to. Then for every pont that s not labelled, they are examned wth respect to the propertes of the ground ponts n adacent labelled cells. Ths s done agan by examnng the resdual of the pont to the ftted planar surface of the ground ponts n the adacent labelled cell. If they are deem nlers (ether by the use of the t-test or a user specfed tolerance), then they are labelled as belongng to the same surface segment as the adacent labelled cell. If t s consdered to belong to more than one adacent ftted surface, t s labelled as the one for whch t has the smallest resdual. The segment s smooth and relatvely flat (exhbtng a subtle convex surface produced from the chamber of the road). It s lower than neghbourng surface segments (especally f kerbng s present). User nteracton may also be requred unless addtonal nformaton can be provded. Such addtonal nformaton ncludes f the scanner was mounted on a vehcle, or setup adacent to the road, n whch case the scan orgns wll help to determne the locaton of the road. Fgure 7. Isolated road (red) from the ground ponts (green). 6. FINDING AREAS OF THE ROAD NON ROAD KERBS COINCIDE TO FIND KERBS Fgure 6. Segmented ground ponts, wth each colour denotng a dfferent segment. In ths way, the maorty of the ponts that could be deemed to of been sampled for the nomnally horzontal ground surface are labelled and segmented, as shown n Fgure 6. Care must be taken n specfyng tolerances, as areas such as drveways and footpaths that have a small change n slope may otherwse me mssed. Ths can be helped by ensurng that the spacng s small enough and the tolerances tght enough to detect the slght change n surface orentaton. 5. FINDING THE ROAD Fndng the road should be a straght forward process snce the ground ponts has been determned and segmented. It s smply a matter of determnng whch segment(s) contans ponts sampled from the road surface. In most cases, because the road s the focus of the scene and s one large contnuous and smooth surface, t wll be contaned n the largest segment(s) n the mddle of the pont cloud. Ths s shown n Fgure 7. Problems arse f the road s contaned n multple segments, as s the case f the road s a dual carrage way, dvded n half by a medum strp or dvded due to some other reason such as occluson. If the pont cloud s large enough to encompass an ntersecton, then ths wll not be a problem, however, f ths s not the case, then the largest segments need to be examned to see f more than one exhbts the propertes of the road. These propertes nclude: The segment extends through the complete pont cloud (enterng n one sde and extng out another). After the road surface has been dentfed, the surroundng features can be extracted n relaton to the nformaton. On such feature that s closely related to the locaton of the road surface s the kerbng, whch defnes the extents of the road. To fnd ths feature, the frst step s to locate the cells whch are lkely to contan ponts sampled from a kerb. These cells can be found snce there exhbt certan trats; they wll be located on the edge of the road segment and have the dfference n pont heghts wll be nomnally equvalent to the heght of the kerb. From ths, the frst step n fndng the kerbs s to determne the cells that ponts sampled from the road segment. All cells whch contan road ponts that are also adacent to a cell whch does not, wll be labelled as contanng the extent of the captured road. The dfference n vertcal values of the pont n these cells and ther surroundng cells are then looked at to see f these dfferences are nomnally the same as the heght of a kerb. As mentoned before, f these attrbutes are exhbted, then these cells are the ones lkely to contan kerbs and can then be more rgorous examned ndvdual. For a target cell and ts adacent cells, the ponts are requred to be parttoned such that the top and bottom of the sampled kerb s delneated. To acheve ths, a plane s found whch s parallel to the vertcal drecton, and that dvde the ponts so that the most possble number of ponts on one sde of the plane has a heght greater than the most possble number of the ponts on the other sde of the plane. The frst step s to do ths s to splt the ponts nto those above the mean vertcal heght, and those below such that: 1 f z z b (3) 1 f z z wth z beng the heght of pont and z beng the mean heght value. The best plane that dvdes the ponts above and below the mean that maxmses: 77

5 Internatonal Archves of Photogrammetry, Remote Sensng and Spatal Informaton Scences, Vol. XXXVIII, Part 5 Commsson V Symposum, Newcastle upon Tyne, UK n b 1 p c gven the constrants 0,0,1 nˆ 0 p c 0,0,1 nˆ 0 nˆ (4) where nˆ s the normal drecton of the plane, c s the centrod of the plane, p s the mean poston of the ponts, and and denote the dot and cross products, respectvely. The drecton along the kerb s specfed as: 0,0,1 nˆ d (6) Once found, the plane wll now also be parallel to the drecton along the kerb. Ths drecton can also be found by examnng the normal drectons of each pont, as descrbed n Jang et al. (2005), or by lookng n the drecton whch s parallel to the vertcal drecton, and the normal drecton of the ftted plane to all the ponts. The problem wth ths method s that the frst method requres a local surface ftted to the nearest neghbourhood of each pont present, and the second method s easly contamnated by nose. (5) kerb n ths cell. These ponts can be connected to the correspondng kerb ponts found n adacent cells to form a lne model. The second s that the top, mddle and bottom sectons (ponts between a and u, u and l, and l and b respectvely) of the kerbs can be modelled separately, and the locaton of the ntersecton between these models can be used as corrected locaton of the kerb. Lastly, f the profle s known beforehand, t can be ftted to the ponts n the 2D cross secton, wth the prevous ponts used as an ntal estmate. The problem wth the frst opton s that the ponts wll not be truly sampled on the extent, and hence wll be slghtly based away from the true locaton, based on samplng densty. The problem wth the second opton s that the mddle secton of the kerb and parts of the lower secton on the road are often occluded, meanng that they often can not be accurately modelled. Fnally, the problem wth the last s that the true profle s not always known. In the future work, a clusterng/votng mechansm wll hopefully be employed, so as to group profles of smlar attrbutes together and overlay them, so that the occluson n one profle wll hopefully be sampled n another, and can be overlad on each other to make up for mssng nformaton. Fgure 10. Defned kerb lne (yellow) of a canddate kerb (blue). Fgure 8. Selected ponts (red) that are used to form a local cross secton. Once ths s acheved, a new plane s found orthogonal to the prevous one, and parallel to the vertcal drecton through the centre of the ponts whch wll nomnally bsect the kerb. All ponts wth +/- small dstance of ths plane (as shown n Fgure 8) are examned and proected onto the plane to create a 2D cross secton. Once the kerb ponts and profles have been defned, they can be lnked to form a lne representaton of the kerb. To do ths, for a canddate cell, the closet kerb profle n the adacent cells s defned as beng the next n the lne sequence (f t exsts). Then from the remanng adacent kerb cells, the one that contans the closest kerb profle that s nomnally n the opposte drecton s defned as beng prevous n the lne sequence. By nomnally opposte, n ths case t s taken that the angle between the lnes formed between the kerb profle n the current cell to the kerb profle n the prevous and next cells s greater than 90 degrees. An example of the results of ths s shown n Fgure FINDING NEIGHBOURING FEATURES Fgure 9. Isolated road (red) from the ground ponts (green). The top and bottom pont of the kerb s determned as depcted n Fgure 9, by the followng: 1. The two furthermost ponts n the cross secton are found and labelled as a and b, wth a beng the hgher of the two. 2. A lne s defned from a to b. 3. The pont at the top of the kerb s defned as the pont furthermost above the lne, labelled as u. 4. The pont at the bottom of the kerb s defned as the pont furthermost below the lne, labelled as l. From here there are a few optons. The frst s that these ponts can then be translated back nto the 3D locatons to defne the Apart from the kerbs, there are also other features that can be delneated The remanng features that wll be extracted are specfed as those that are dsont from each other, or are only connect to other ndependent features by the surface of the ground. Examples of ths are sgns, poles, trees and buldngs, whch wll be consdered as one feature, even f t s made up of several prmtve surface features. Ths defnton s use because the features of hgh mportance are thngs such as sgns, lght poles etc, whch are only prmarly connected to the ground and not wth each others. Other features such as vegetaton and buldngs are often consdered as a sngle entty, and ether use prmarly for colluson detecton. To start the process, canddate seed ponts for a regon growng process are selected based on f there are above the nearest road 78

6 Internatonal Archves of Photogrammetry, Remote Sensng and Spatal Informaton Scences, Vol. XXXVIII, Part 5 Commsson V Symposum, Newcastle upon Tyne, UK cell by a certan tolerance (n ths case half a metre), to ensure that they were sampled from non ground features. One of these seed ponts s then selected, and put n as the frst element n a lnk-lst data structure (Knuth, 1999). Surroundng ponts wthn a set dstance of the frst pont n the lst (less than the mnmum dstance between features) are added to the end of the lst f: They are also canddate seed ponts. If they are not canddate ponts, then they are not classed as ground ponts prevously, and ther local surface normal s nomnally orthogonal to the vertcal drecton (not havng the same orentaton of the ground). And they have not prevously been labelled as belongng to a segment. The pont frst n the lst s then labelled as belongng to the current feature beng extracted, and removed from the lst. Ths process s contnued, labellng the frst pont and addng ponts to the lst, untl the lst s empty. Once the lst s empty, a new non-labelled canddate seed pont s selected, and a new lst s created for a new feature and the process s repeated. As mentoned prevously, the nearest neghbourhood selecton can be smulated wth the way the ponts are stored n the grd. For each adacent cell, because the ponts are stored n order of vertcal heght, ponts wthn the specfed dstance, wth respect to the vertcal dstance, wll be grouped to together n one contnuous block. Ths means they can all be extracted n a group of ponts, and then quckly examned to remove those that fall outsde dstance threshold based on Eucldean dstance. ground ponts, fttng a kerb profle and onng adacent profles to form a lne representaton, and segmentng above ground ponts nto groups representng an adacent feature to the road. Each step was presented n the paper, as appled to a real world dataset. Further research plans to be conducted to extend the automaton process to delneate addtonal features usng spectral nformaton, such as road markngs. ACKNOWLEDGEMENTS Ths work has been supported by the Cooperatve Research Centre for Spatal Informaton, whose actvtes were funded by the Australan Commonwealth s Cooperatve Research Centres Programme. Thanks also to Man Roads WA (MRWA), McMullen, Nolan and Partners Surveyors (MAPS) and AAM for ther support, knowledge and access to datasets. REFERENCES Belton, D., 2008, Classfcaton and Segmentaton of 3D pont clouds, PhD thess, Department of Spatal Scences, Curtn Unversty of Technology, Perth, Australa., 183 pages Bae K.-H., Belton D., and Lcht D.D., 2007, Pre-processng procedures for raw pont clouds from terrestral laser scanners, Journal of Spatal Scence 52(2), pp Fschler, M. A. and Bolles, R. C., Random sample consensus: a paradgm for model fttng wth applcatons to mage analyss and automated cartography. Communcatons of the Assocaton for Computng Machnery (ACM), 24(6), pp Jang, J., Zhang, Z. and Mng Y., Data segmentaton for geometrc feature extracton from ldar pont clouds. Geoscence and Remote Sensng Symposum, IGARSS 05. Proceedngs IEEE Internatonal 5, pp Jang, X. and Bunke, H., 1994, Fast segmentaton of range mages nto planar regons by scan lne groupng, Machne Vson and Applcatons, 7(2), pp Fgure 11. Isolated near road features. Road s depcted n whte and the dfferent features are denoted by dfferent colours. At the end, all dsont features are delneated nto common segments, as shown n Fgure 11. Large features, such as buldngs, that are made up of several smaller prmtve surface features, can then be segmented further by methods, such as those referenced n Vosselman and Maas (2010), to further defne features f needed, at the beneft of reduce the ponts needed be processed, and talorng the process to the target feature (such as buld facades, trees etc). 8. CONCLUSION There are many advantages of utlsng TLS for the surveyng of roads, as prevously ndcated. The problem s that the processng of such data to extract nformaton n a usable and productve format s costly when compare to the costs of capturng the data. Ths paper amed to reduce ths cost by automatng part of the processng, namely the extracton of kerbs and solatng surroundng geometrc features. The process was acheved by frst solatng the road surface from dentfed Knuth D. E., 1999, The Art of Computer Programmng, Addson Wesley, 896 pages Kretschmer, U., Abmayr, T., Thes, M. and Fröhlch, C., 2004, Traffc constructon analyss by use of terrestral Laser Scannng, Proceedngs of the ISPRS workng group VIII/2: Laser Scanners for Forest and Landscape Assessment 36(Part 8/W2) Lcht, D.D., Franke, J., Cannell, W. and Wheeler, K. D., 2005, The potental of terrestral laser scanners for dgtal ground surveys, Journal of Spatal Scence, 50 (1), pp Shapro L. G. and Stockman G. C, 2001, Computer Vson, Prentce Hall, 608 pages Vosselman G. and Maas H.-G., 2010, Arborne and Terrestral Laser Scannng, Whttles Publshng, 336 pages Wu, J. and Kobbelt, L., Structure recovery va hybrd varatonal surface approxmaton. Computer Graphcs Forum 24 (3), pp

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS Davd Belton Cooperatve Research Centre for Spatal Informaton (CRC-SI) The Insttute for

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros. Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

ALTERNATIVE METHODOLOGIES FOR THE ESTIMATION OF LOCAL POINT DENSITY INDEX: MOVING TOWARDS ADAPTIVE LIDAR DATA PROCESSING

ALTERNATIVE METHODOLOGIES FOR THE ESTIMATION OF LOCAL POINT DENSITY INDEX: MOVING TOWARDS ADAPTIVE LIDAR DATA PROCESSING Internatonal Archves of the Photogrammetry, Remote Sensng and Spatal Informaton Scences, Volume XXXIX-B3, 2012 XXII ISPRS Congress, 25 August 01 September 2012, Melbourne, Australa ALTERNATIVE METHODOLOGIES

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

AUTOMATED REGISTRATION OF UNORGANISED POINT CLOUDS FROM TERRESTRIAL LASER SCANNERS

AUTOMATED REGISTRATION OF UNORGANISED POINT CLOUDS FROM TERRESTRIAL LASER SCANNERS AUTOMATED REGISTRATION OF UNORGANISED POINT CLOUDS FROM TERRESTRIAL LASER SCANNERS Kwang-Ho Bae and Derek D. Lcht Department of Spatal Scences, Curtn Unversty of Technology, GPO Box U1987, Perth, WA, 6845,

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

IMPLEMENTATION OF 3D POINT CLOUDS SEGMENTATION BASED ON PLANE GROWING

IMPLEMENTATION OF 3D POINT CLOUDS SEGMENTATION BASED ON PLANE GROWING IMPLEMENTATION OF 3D POINT CLOUDS SEGMENTATION BASED ON PLANE GROWING METHOD Małgorzata Jarząbek-Rychard 1 Abstract In the recent years we can observe growng demand for the extracton of physcal objects

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection 2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

VOXEL BASED SEGMENTATION OF LARGE AIRBORNE TOPOBATHYMETRIC LIDAR DATA

VOXEL BASED SEGMENTATION OF LARGE AIRBORNE TOPOBATHYMETRIC LIDAR DATA The Internatonal Archves of the Photogrammetry, Remote Sensng and Spatal Informaton Scences, Volume XLII-1/W1, 2017 VOXEL BASED SEGMENTATION OF LARGE AIRBORNE TOPOBATHYMETRIC LIDAR DATA R. Boerner,, L.

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING

A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING L Jan a, Wan Youchuan a,, Gao Xanjun a a School of Remote Sensng and Informaton Engneerng, Wuhan Unversty,129

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION 1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

Self-tuning Histograms: Building Histograms Without Looking at Data

Self-tuning Histograms: Building Histograms Without Looking at Data Self-tunng Hstograms: Buldng Hstograms Wthout Lookng at Data Ashraf Aboulnaga Computer Scences Department Unversty of Wsconsn - Madson ashraf@cs.wsc.edu Surajt Chaudhur Mcrosoft Research surajtc@mcrosoft.com

More information

Snakes-based approach for extraction of building roof contours from digital aerial images

Snakes-based approach for extraction of building roof contours from digital aerial images Snakes-based approach for extracton of buldng roof contours from dgtal aeral mages Alur P. Dal Poz and Antono J. Fazan São Paulo State Unversty Dept. of Cartography, R. Roberto Smonsen 305 19060-900 Presdente

More information

Image Alignment CSC 767

Image Alignment CSC 767 Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances

More information

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm 01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc

More information

Using Fuzzy Logic to Enhance the Large Size Remote Sensing Images

Using Fuzzy Logic to Enhance the Large Size Remote Sensing Images Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract

More information

Pictures at an Exhibition

Pictures at an Exhibition 1 Pctures at an Exhbton Stephane Kwan and Karen Zhu Department of Electrcal Engneerng Stanford Unversty, Stanford, CA 9405 Emal: {skwan1, kyzhu}@stanford.edu Abstract An mage processng algorthm s desgned

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like: Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

POTENTIAL OF DENSE MATCHING FOR THE GENERATION OF HIGH QUALITY DIGITAL ELEVATION MODELS

POTENTIAL OF DENSE MATCHING FOR THE GENERATION OF HIGH QUALITY DIGITAL ELEVATION MODELS POTENTIAL OF DENSE MATCHING FOR THE GENERATION OF HIGH QUALITY DIGITAL ELEVATION MODELS Mathas Rothermel, Norbert Haala Insttute for Photogrammetry (fp), Unversty of Stuttgart, Geschwster-Scholl-Str. 24D,

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS

PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS Po-Lun La and Alper Ylmaz Photogrammetrc Computer Vson Lab Oho State Unversty, Columbus, Oho, USA -la.138@osu.edu,

More information

Scan Conversion & Shading

Scan Conversion & Shading Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

LEAST SQUARES. RANSAC. HOUGH TRANSFORM.

LEAST SQUARES. RANSAC. HOUGH TRANSFORM. LEAS SQUARES. RANSAC. HOUGH RANSFORM. he sldes are from several sources through James Has (Brown); Srnvasa Narasmhan (CMU); Slvo Savarese (U. of Mchgan); Bll Freeman and Antono orralba (MI), ncludng ther

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Scan Conversion & Shading

Scan Conversion & Shading 1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

Accuracy Assessments of Geographical Line Data Sets, the Case of the Digital Chart of the World *

Accuracy Assessments of Geographical Line Data Sets, the Case of the Digital Chart of the World * Accuracy Assessments of Geographcal Lne Data Sets, the Case of the Dgtal Chart of the World * Håvard Tvete Department of Surveyng Agrcultural Unversty of Norway, P.O.Box 5034, 1432 Ås, Norway fax: +47

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon

More information

Machine Learning. Topic 6: Clustering

Machine Learning. Topic 6: Clustering Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess

More information

We Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout

We Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout We 14 15 Two Sesmc Interference Attenuaton Methods Based on Automatc Detecton of Sesmc Interference Moveout S. Jansen* (Unversty of Oslo), T. Elboth (CGG) & C. Sanchs (CGG) SUMMARY The need for effcent

More information

Editorial Manager(tm) for International Journal of Pattern Recognition and

Editorial Manager(tm) for International Journal of Pattern Recognition and Artfcal Intellgence Edtoral Manager(tm) for Internatonal Journal of Pattern Recognton and Manuscrpt Draft Manuscrpt Number: Ttle: TEXT LOCALIZATION IN COMPLEX COLOR DOCUMENTS Artcle Type: Research Paper

More information

Hierarchical Motion Consistency Constraint for Efficient Geometrical Verification in UAV Image Matching

Hierarchical Motion Consistency Constraint for Efficient Geometrical Verification in UAV Image Matching Herarchcal Moton Consstency Constrant for Effcent Geometrcal Verfcaton n UAV Image Matchng San Jang 1, Wanshou Jang 1,2, * 1 State Key Laboratory of Informaton Engneerng n Surveyng, Mappng and Remote Sensng,

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Background Removal in Image indexing and Retrieval

Background Removal in Image indexing and Retrieval Background Removal n Image ndexng and Retreval Y Lu and Hong Guo Department of Electrcal and Computer Engneerng The Unversty of Mchgan-Dearborn Dearborn Mchgan 4818-1491, U.S.A. Voce: 313-593-508, Fax:

More information

Signature and Lexicon Pruning Techniques

Signature and Lexicon Pruning Techniques Sgnature and Lexcon Prunng Technques Srnvas Palla, Hansheng Le, Venu Govndaraju Centre for Unfed Bometrcs and Sensors Unversty at Buffalo {spalla2, hle, govnd}@cedar.buffalo.edu Abstract Handwrtten word

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola

More information

TRAFFIC CLASSIFICATION AND SPEED ESTIMATION IN TIME SERIES OF AIRBORNE OPTICAL REMOTE SENSING IMAGES

TRAFFIC CLASSIFICATION AND SPEED ESTIMATION IN TIME SERIES OF AIRBORNE OPTICAL REMOTE SENSING IMAGES TRAFFIC CLASSIFICATION AND SPEED ESTIMATION IN TIME SERIES OF AIRBORNE OPTICAL REMOTE SENSING IMAGES G. Palubnskas * and P. Renartz German Aerospace Center DLR, 82234 Wesslng, Germany Gntautas.Palubnskas@dlr.de

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay, Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

A New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1

A New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1 A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent

More information