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

Size: px
Start display at page:

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

Transcription

1 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 Luoyu Road, Wuhan, Chna, @qq.com,( ychwan, Commsson V, WG V/3 KEY WORDS:Terrestral Laser Scannng, deformaton montorng, subway tunnel, hgh precson, movng least squares ABSTRACT: Wth the mprovement of the accuracy and effcency of laser scannng technology, hgh-resoluton terrestral laser scannng (TLS) technology can obtan hgh precse ponts-cloud and densty dstrbuton and can be appled to hgh-precson deformaton montorng of subway tunnels and hgh-speed ralway brdges and other felds. In ths paper, a new approach usng a ponts-cloud segmentaton method based on vectors of neghbor ponts and surface fttng method based on movng least squares was proposed and appled to subway tunnel deformaton montorng n Tanjn combned wth a new hgh-resoluton terrestral laser scanner (Regl VZ-400). There were three man procedures. Frstly, a ponts-cloud conssted of several scannng was regstered by lnearzed teratve least squares approach to mprove the accuracy of regstraton, and several control ponts were acqured by total statons (TS) and then adjusted. Secondly, the regstered ponts-cloud was resampled and segmented based on vectors of neghbor ponts to select sutable ponts. Thrdly, the selected ponts were used to ft the subway tunnel surface wth movng least squares algorthm. Then a seres of parallel sectons obtaned from temporal seres of fttng tunnel surfaces were compared to analyss the deformaton. Fnally, the results of the approach n z drecton were compared wth the fber optcal dsplacement sensor approach and the results n x, y drectons were compared wth TS respectvely, and comparson results showed the accuracy errors of x, y, z drectons were respectvely about 1.5mm, 2mm, 1mm. Therefore the new approach usng hgh-resoluton TLS can meet the demand of subway tunnel deformaton montorng. 1. Introducton Wth the development of laser scannng technque, ts accuracy keeps enhancng. The sngle-pont accuracy of phase laser scanner has reached 1mm, and whch of the VZ-400 scanner from Regl Company has reached 2mm. Because of ths mprovement, n the hghly precse deformaton montorng felds, more projects trend to use laser scanner. If combnng TLS and hghly precse TS, the errors of laser scanner wll be corrected and the observaton accuracy wll be further mproved. Ths combnaton can be appled to some hghly precse deformaton montorng n such felds as brdges, tunnels, hgh buldngs, dams and so on. Addtonal measurements of deformaton montorng are carred out by explorng sngle-pont trangulaton to measure the coordnates of control ponts n dfferent tme. Ths montorng method costs long observaton tme and ntense labor, s poor n automatc aspects and s constraned by the layout of the control ponts, resultng n that t can only reflect the local deformaton not the entre deformaton and the observaton accuracy s easly nfluenced by observaton condtons. TLS can quckly acqure the entre pont cloud nformaton of the objects whose deformaton wll be montored n a short tme and then through processng data the entre deformaton of these montored objects can be analyzed. So ths approach has become hot n deformaton montorng. At present, some nternal scholars have started such researches, but most of them are focused on the applcaton of TLS to the deformaton montorng of those projects that requre not very hgh accuracy such as landsldes, ground subsdence, debrs flow, buldngs and so on. TLS has been appled to the deformaton montorng of landsldes (XU et al., 2010), n whch TLS can get the nformaton of many natural objects on the landsldes as montored ponts, combnng t wth the data of these ponts acqured by GPS and TS to montor the deformaton. Ths research ddn t gve the defnte accuracy. The buldng deformaton was studed by applyng pont cloud data acqured by TLS to ft the surface of the buldng (CAI et al., 2010). The applcaton of TLS technque to the deformaton montorng s wdely studed abroad. Stuart Gordon analyzed the accuracy of the deformaton of surfaces montored by TLS through comparng the results of two tests. The comparson results showed that n the vertcal drecton the accuracy of TLS s 6 to 12 tmes hgher than the nomnal accuracy of nstruments and the hghest accuracy can reach 0.5 mm, whch has met the hghly precse requrement of the deformaton montorng. Whle these researches were carred out n the deal condtons, t could not present the results generated n general condtons (Gordon et al., 2004). H.S. Park appled TLS to the deformaton montorng of buldngs and mproved the accuracy through establshng deformaton modals by the measured data (Park et al., 2007). G. Btell also studed the deformaton montorng of landsldes by usng ths technque and contrasted the results wth the results montored by photogrammetry approaches. The contrast results showed that TLS can quckly and effcently montor the deformaton of landsdes, ts accuracy s precse and t needs less control ponts compared wth photogrammetry. TLS approach s smple, useful and effcent for ths applcaton (Btell et al., 2004). A Correspondng author. 223

2 pont cloud segmentaton method to extract sutable pont from the pont cloud acqured by TLS was employed to montor the deformaton of a 100 m long tunnel and mprove the accuracy of deformaton montorng (Lndenbergh et al., 2005). A deformaton of a cylndrcal tunnel was montored by frstly fttng the cylndrcal model and then explotng the statstcal tests method to statstcally analyze the deformaton montorng data of the tunnel (Van Goslga et al., 2006). Accordng to these researches some problems exsted n the deformaton montorng of tunnels by usng TLS: frstly, because of lacks of some necessary control strateges, the regstraton accuracy of the pont cloud data acqured n a few adjacent statons n the tunnel s a lttle low, so t needs to be mproved; secondly, TLS can acqure magnanmty pont cloud data causng that t s dffcult to search out the homologous pont n the scannng data acqured n dfferent tme, so there stll s not a good approach to montor dynamcally just by usng the orgnal pont cloud data. To solute the above problems, ths paper proposed some solutons whch combned the data acqured by TLS, TS and levels to regster the data of adjacent statons and mprove the regstraton accuracy. 2. The algorthm based on the normal vectors of pont cloud Because of the large amount of pont cloud data, there s much redundancy nformaton. Hence t s crucal to quckly extract relable feature nformaton from such dense pont cloud data. Ths paper proposed a pont cloud segmentaton algorthm whch can retan the feature of pont cloud based on the varance of normal vectors of pont cloud. Ths algorthm extracts the features of the pont cloud accordng to the angle varance of the normal vectors of the pont cloud, retans more ponts n those places where the feature s obvous but retans fewer ponts where the feature s not obvous. In the pont cloud data, the normal vector of a pont P s defned as a normal vector of a tangent plane that goes through P on a curved surface F(x,y,z)=0 conssted of P and ts adjacent ponts. The key to construct the curved surface based on the adjacent ponts s to fnd the dstrbuton of the trangular surface conssted of the adjacent ponts of P. Then the dstrbuton of the normal vector of P can be calculated by these trangular surfaces. Fgure 1 llustrates the normal vectors of ponts on the curved surfaces. condton). Then the frst trangle s found. At the same tme ths pont s removed from ths array, t wll not partcpate n the next calculaton. Step 3 - Calculate Q s n whch drecton of Q, f t s n the clockwse drecton, then contnue searchng the next trangle n the clockwse drecton; Otherwse, the search wll be carred on n the antclockwse drecton. Step 4 - Then change the start edge to PQ and traverse the array n the drecton whch s gven n the thrd step to fnd the next pont that satsfes these condtons to construct the next trangle. Keep on ths teraton calculaton untl all the trangular surfaces that satsfed the condtons are found and store them n an ndex array. In ths algorthm, the tangent plane of a pont P s defned as a surface whch s ftted by the N ponts closest to P, and a vertcal lne gong through ths pont of the tangent plane s recorded as the normal vector of ths pont. Because all the ponts adjacent to P may not be located n one plane completely, t s necessary to convert ts tangent plane to mnmze the value descrbed n Eq.1. mn ( p p )( p p ) p Nd ( p ) Another llustraton of Eq.1 s to calculate a symmetrcal sem-defnte matrx as descrbed n Eq.2. For a pont n 3D space, the sze of the matrx s 3 3. Cv ( p p )( p p ) p Nd ( p ) T Here, Nd(p) s a set of ponts adjacent to P. Calculate three egenvalues of Cv and ther responsble egenvectors. Then the egenvector whch s responded to the mnmum postve egenvalue can reflect approxmately as the vertcal lne of the tny tangent plane or the normal vector of ths pont. The angle of the normal vectors of adjacent ponts can be calculated by Eq.3: Cos n( p) n( p ) n( p) n( p ) T (1) (2) (3) Fgure1. The normal vectors of ponts on the curved surfaces Step 1 - Fnd the closest pont to P, and assume t s Q, jon P and Q to compose an edge of the frst trangular surface. Step 2 - Traverse other k ponts closest to P (except Q), assume the traversal pont s Q, calculate each angle QPQ. Set an angle threshold and select the Q that corresponds to the shortest edge from those angles whch satsfes the condton as one pont of the frst trangular surface (PQ are the ponts on the shortest edge among those edges whch satsfes the Where, n(p) and n(p ) represent the normal vector of P and p respectvely. The hgher the value of cosθ s, the more smlar two vectors are; the lower the value of cosθ s, the bgger the dfference of these two ponts s and they may be the ponts located on the edge of the features. Then through settng some sutable thresholds pont cloud can be dvded nto dfferent segments. The concrete mplementaton steps are llustrated as followng: Step 1 - Frst select a pont P, and fnd K ponts p (=1, 2,, K) closest to P; Step 2 - Calculate the angles of the normal vectors n(p )between P and ths K ponts p (=1, 2,, K) respectvely; Step 3 - If the value of cosθ s greater than 0.95, label ts correspondng pont p and classfy t and P nto the same class; Step 4 - If all the ponts p (=1, 2,, K) are n the same class wth P, then select a pont farthest away from P as the next P to contnue the above three steps. Among the K ponts, f there s any pont whch s n other classes dfferent from the class whch P s n, t wll be the start pont n the next teraton. 224

3 Step 5 - Cluster the pont cloud data whch have been classfed already agan, and then resample these pont cloud. The orgnal pont cloud data acqured n one staton s llustrated n Fgure 2. The pont cloud data processed by the clusterng and segmentaton algorthm s shown n Fgure 3 where dfferent colors represent dfferent classes. Fgure 4 llustrates the pont cloud after resampled. Fgure 4. Pont cloud data after resampled 3.1 Test flow 3. Experments and analyss Fgure 2. Orgnal pont cloud data In ths test, the deformaton of a 100m long subway tunnel whch s located n the conjuncton part between the Tanjn No.1 subway tunnel and the Tanjn west ralway staton was montorng. Because the west ralway staton s n constructon, the excavatng and constructon n the place above the No.1 subway tunnel led to ts deformaton. When the deformaton exceeds defnte extent, t wll affect the safety of the subway. Therefore, t s sgnfcant to montor the deformaton of ths secton of the subway. Three dfferent montorng methods by optc fbre dsplacement meter (OFDM), the TS and TLS have been adopted nto the deformaton montorng of ths secton of the subway tunnel. The deformaton montorng flow by usng TLS s llustrated n Fgure 5. Fgure 3. Pont cloud data processed by clusterng and segmentaton Set the control ponts and staton ponts Acqure the pont cloud data by TLS n dfferent tme Acqure the coordnates of the control ponts measured by total statons n dfferent tme Acqure the elevatons of the control ponts measured by levels n dfferent tme Regster and flter the data precsely Check the control ponts to reduce the errors Adjust these data acqured by total statons and levels n dfferent tme Smplfy the pont cloud based on ther normal vectors Construct the Delaunay network of the pont cloud and analyze the deformaton Comparson and analyss Analyze the deformaton of the sgnal pont Analyze the deformaton montorng through the data measured by OFDM Fgure 5. The deformaton montorng flow The entre process of the deformaton montorng conssted of three parts: data acquston, data processng and comparson and analyss of the test results. Data processng manly ncluded the regstraton and fltraton of the pont cloud data, 225

4 the tangent planes extracton of the pont cloud data and the constructon of the model of the entre tunnel, and the adjustment of the data acqured by TS and levels. 3.2 Data collecton and regstraton Four groups of test data were acqured n four dfferent tme perod. The pont cloud data nformaton of subway tunnel s shown n Table 6. Accordng to these data the deformaton of the subway tunnel can be montored. In the experment a Vz-400 scanner and the Leca TS30 were used to acqure test data. The angle observaton accuracy of TS30 can reach 0.5s, and ts dstance observaton accuracy n the prsm pattern can get to the 0.6mm+1ppm, whch n the speculum pattern s 1mm+1ppm. Because the accuracy of the TS s hgher than TLS and hghly precse levels were also adopted to acqure hghly precse elevaton of these control ponts, ths combnaton can correct the coordnate errors of those control ponts measured by TLS. In the experment 4 targets at least were placed as control ponts n each staton. In the process of the data acquston and processng, owng to nfluence of the errors of the nstruments themselves, the subjectve factors of the observers and the atmospherc temperature factor, there are devatons between the observed data and the real data. Only through adoptng strct requrement n every step to mprove the accuracy can the errors of the observed data be mnmzed. Especally for those control data measured by TS and levels, generally the same control pont need to be measured repeatedly and these repeat observatons would be adjusted to calculate the fnal results. Date Perod of scannng tme Number of scannng statons Data sze Scannng range of sngle staton ( ) Scannng resoluton of sngle staton ( ) Scannng tme n sngle staton Number of ponts n sngle staton Feb.17 23:30(P.M)-3:30(A.M) 4 4*680.5M 100* Fed.18 23:30(P.M)-3:30(A.M) 4 3*680.5M 100* Feb.19 23:30(P.M)-3:30(A.M) 4 3*680.5M 100* Feb.22 23:30(P.M)-3:30(A.M) 4 4*680.5M 100* Table 6. The pont cloud data nformaton of the subway tunnel The data of control ponts measured by TS and levels were adopted to regster the overlapped data acqured from dfferent statons. Ths method can greatly mprove the regstraton accuracy. Table 7 shows the regstraton accuracy of each staton. If wthout the control of the data acqured by usng TS and levels, the standard devaton of regstraton s about 4mm, whle f adopted them, the error s controlled wthn 1mm. The regstraton accuracy s mproved sgnfcantly. Because t nfluences the followng data processng, for whch t s crucal to mprove the regstraton accuracy. Avg.radal Devaton Avg.theta Devaton Avg.ph Devaton Standard Devaton Scan Scan Scan Table 7. Regstraton accuracy between the adjacent statons 3.3 Analyss of the deformaton of the subway tunnel The pont cloud data of the subway tunnel acqured n dfferent tme perod were contnued to be smplfed after regstered and pre-processed. Then the number of pont was reduced from 1 mllon to 200 thousand whch meant the number of remanng ponts was only about 20% of the number of orgnal ponts. However they stll retaned the features of orgnal pont cloud and mproved the speed of the constructon of the trangulaton. Drect constructon of Delaunay trangulaton retaned the orgnal nformaton of the tunnel and they can reflect the curve surface condton of the tunnel. Hence the analyss result of the deformaton would be more accurate. Through establshng the models of the pont cloud data acqured by scannng more than twce respectvely, the deformaton of the tunnel can be analysed contnually. Two datasets of the same place were supermposed together to compare ther dfference whch can reflect the tendency of the deformaton of the tunnel. Ths reflecton s vsual but there stll lacks an exact standard to measure the deformaton. Snce the dfference of the elevatons between two models can reflect the concrete tendency and degree of deformaton more exactly, t would provde more enough proof to support the determnaton. A model of the tunnel after one scannng s llustrated n Fgure 8. An ntegrated model constructed by supermposng two models whch were constructed respectvely by two dfferent pont cloud datasets of the same tunnel acqured n dfferent tme s llustrated n Fgure 9, n whch the data of blue color represents the model acqured n the frst tme and the orange data s the second model. From ths Fgure, t s obvously vsual that the elevaton n the second model s lower than the frst model n the roof, whch means there s some deformaton n the roof. Then a curve on behalf of the dfference between the elevatons of the two models s llustrated n Fgure 10. It reflects the deformaton of about 70m subway tunnel, n whch the most serous deformaton located n a place of the tunnel between 50 m and 60 m and the dfference reached 0.11 m. Fgure 8. A model of the tunnel after one scannng 226

5 Fgure 9. Comparson of two models constructed by two datasets acqured n dfferent tme Fgure 10. The curve of the dfference of the elevatons between two models The results montored by the method proposed n ths paper were respectvely compared to the results montored by TS and OFDM, as the Table 11 llustrates. Pont ID Observatons of the OFDM Observatons of the TS Observatons of the TLS Dfferences of the observatons between the TLS and the OFDM Dfferences of the observatons between the TLS and the TS J J J J J J J J J J Table 11. Comparson of three knds of results montored by dfferent methods The comparson n the table 3 llustrates that there were small dfferences between the ponts coordnates measured by TLS and the TS that was because the pont cloud data acqured by TLS was corrected by the coordnates of those control ponts measured by the TS, whle the dfferences between TLS and OFDM were a lttle bg and the maxmum error reached 3.4 mm. Although ths error dd not exceed the constraned error of 5mm, t was too bg for deformaton. The montorng result of OFDM s more precse, but due to ths measurement needed to put the nstrument nsde body of the tunnel whch cost too much and caused destructon of the tunnel, t s not an optmal method. If the accuracy of the deformaton montorng by TLS can be mproved further, the TLS wll be a better choose for deformaton montorng. 4. Concluson At present, the applcaton of employng TLS on the deformaton montorng of the subway tunnel s stll n the stage of researchng. Ths paper analyzed the problems that exsted n ths applcaton ncludng low effcency, low 227

6 accuracy and hard to transform the coordnates as well as other problems, then proposed a method of mprovng the accuracy of regstraton accuracy and solvng the problem of the transformaton of the coordnates by combnng the TLS, the TS and the level. In addton, the pont cloud was smplfed va a segmentaton algorthm based on ther normal vectors meanwhle ther features were stll reserved. At last a few models of the tunnel constructed by the pont cloud data acqured n dfferent tme were exploted to montor ts whole deformaton. A few experments based on these theores were carred out to analyze the accuracy and feasblty of the applcaton of montorng the deformaton of the subway tunnel by TLS. In contrast wth OFDM, the results show that the accuracy of TLS stll needs to be mproved to apply to the deformaton montorng of the subway tunnel. Ths problem n these felds needs to solve based on more researches. References XU, J., WANG, H., LUO, Y., WANG, S., YAN, X., Deformaton montorng and data processng of landslde based on 3D laser scannng [J]. Rock and Sol Mechancs, 31(7), pp CAI, L., WU, K., ZHANG, S., Applcaton of pont cloud plan fttng to deformaton montorng usng 3D laser scanner. Scence of Surveyng and Mappng, 35(5), pp Gordon, S., Lcht, D., Stewart, M., Franke, J., Modelng pont clouds for precse structural deformaton measurement. Internatonal Archves of Photogrammetry and Remote Sensng 35. Park, H., Lee, H., Adel, H., Lee, I., A new approach for health montorng of structures: terrestral laser scannng. Computer Aded Cvl and Infrastructure Engneerng 22, pp Btell, G., Dubbn, M., Zanutta, A., Terrestral laser scannng and dgtal photogrammetry technques to montor landslde bodes. Internatonal Archves of Photogrammetry, Remote Sensng and Spatal Informaton Scences, 35(Part B5), pp Lndenbergh, R., Pfefer, N., Rabban, T., Accuracy analyss of the Leca HDS3000 and feasblty of tunnel deformaton montorng. In: Proceedngs of the ISPRS Workshop, Laser scannng, Vol. XXXVI(3/W3), Enschede, The Netherlands, pp Van Goslga, R., Lndenbergh, R., Pfefer, N., Deformaton analyss of a bored tunnel by means of terrestral laser scannng. Proceedngs of Internatonal Archves of Photogrammetry, Remote Sensng and Spatal Informaton Scences, 36( Part 5), pp

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

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

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

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

Research Note MODELING OF VERTICAL MOVEMENTS OF BUILDINGS WITH MAT FOUNDATION * C. T. CELIK * *

Research Note MODELING OF VERTICAL MOVEMENTS OF BUILDINGS WITH MAT FOUNDATION * C. T. CELIK * * Iranan Journal of Scence & Technology, Transacton B, Engneerng, Vol. 32, No. B5, pp 543-548 Prnted n The Islamc Republc of Iran, 28 Shraz Unversty Research Note MODELING OF VERTICAL MOVEMENTS OF BUILDINGS

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

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

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

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

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

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

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

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

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

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

A fast algorithm for color image segmentation

A fast algorithm for color image segmentation Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

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

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

ESTIMATION OF INTERIOR ORIENTATION AND ECCENTRICITY PARAMETERS OF A HYBRID IMAGING AND LASER SCANNING SENSOR

ESTIMATION OF INTERIOR ORIENTATION AND ECCENTRICITY PARAMETERS OF A HYBRID IMAGING AND LASER SCANNING SENSOR ESTIMATION OF INTERIOR ORIENTATION AND ECCENTRICITY PARAMETERS OF A HYBRID IMAGING AND LASER SCANNING SENSOR A. Wendt a, C. Dold b a Insttute for Appled Photogrammetry and Geonformatcs, Unversty of Appled

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

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

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

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

Modular PCA Face Recognition Based on Weighted Average

Modular PCA Face Recognition Based on Weighted Average odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract

More information

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School

More information

Research and Application of Fingerprint Recognition Based on MATLAB

Research and Application of Fingerprint Recognition Based on MATLAB Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department

More information

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng

More information

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water. Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent

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

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama

More information

Design of Structure Optimization with APDL

Design of Structure Optimization with APDL Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

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

A Clustering Algorithm for Key Frame Extraction Based on Density Peak

A Clustering Algorithm for Key Frame Extraction Based on Density Peak Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao

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

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

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

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 Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

A new segmentation algorithm for medical volume image based on K-means clustering

A new segmentation algorithm for medical volume image based on K-means clustering Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based

More information

Clustering Algorithm of Similarity Segmentation based on Point Sorting

Clustering Algorithm of Similarity Segmentation based on Point Sorting Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan

More information

THE RENDERING OF BUILDING TEXTURE FROM LAND-BASED VIDEO

THE RENDERING OF BUILDING TEXTURE FROM LAND-BASED VIDEO THE RENDERING OF BUILDING TEXTURE FROM LAND-BASED VIDEO Zuxun Zhang, Zhzhong Kang School o Remote Sensng and Inormaton Engneerng, Wuhan Unv., Wuhan 40079, P.R. Chna - (zxzhang, zzkang)@supresot.com.cn

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

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

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

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent

More information

A Deflected Grid-based Algorithm for Clustering Analysis

A Deflected Grid-based Algorithm for Clustering Analysis A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan

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

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

The Nottingham eprints service makes this work by researchers of the University of Nottingham available open access under the following conditions.

The Nottingham eprints service makes this work by researchers of the University of Nottingham available open access under the following conditions. Da, Wujao and Lu, Bn and Meng, Xaoln and Huang, D. () Spato-temporal modellng of dam deformaton usng ndependent component analyss. Survey Revew, 6 (9). pp. 7-. ISSN 7-76 Access from the Unversty of Nottngham

More information

Object-Based Techniques for Image Retrieval

Object-Based Techniques for Image Retrieval 54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the

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

Research on laser tracker measurement accuracy and data processing. Liang Jing IHEP,CHINA

Research on laser tracker measurement accuracy and data processing. Liang Jing IHEP,CHINA Research on laser tracker measurement accuracy and data processng Lang Jng IHEP,CHINA 214.1 1 Outlne 1. Accuracy test experment for laser tracker In the transversal drecton In the longtudnal drecton In

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

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

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization Suppresson for Lumnance Dfference of Stereo Image-Par Based on Improved Hstogram Equalzaton Zhao Llng,, Zheng Yuhu 3, Sun Quansen, Xa Deshen School of Computer Scence and Technology, NJUST, Nanjng, Chna.School

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

Fast Feature Value Searching for Face Detection

Fast Feature Value Searching for Face Detection Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com

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

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Feature-Area Optimization: A Novel SAR Image Registration Method

Feature-Area Optimization: A Novel SAR Image Registration Method Feature-Area Optmzaton: A Novel SAR Image Regstraton Method Fuqang Lu, Fukun B, Lang Chen, Hao Sh and We Lu Abstract Ths letter proposes a synthetc aperture radar (SAR) mage regstraton method named Feature-Area

More information

DIRECT SENSOR-ORIENTED CALIBRATION OF THE PROJECTOR IN CODED STRUCTURED LIGHT SYSTEM

DIRECT SENSOR-ORIENTED CALIBRATION OF THE PROJECTOR IN CODED STRUCTURED LIGHT SYSTEM DIRECT SENSOR-ORIENTED CALIBRATION OF THE PROJECTOR IN CODED STRUCTURED LIGHT SYSTEM M. Saadatseresht a, A. Jafar b a Center of Excellence for Surveyng Eng. and Dsaster Management, Unverstf Tehran, Iran,

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

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

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

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

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

Video Object Tracking Based On Extended Active Shape Models With Color Information

Video Object Tracking Based On Extended Active Shape Models With Color Information CGIV'2002: he Frst Frst European Conference Colour on Colour n Graphcs, Imagng, and Vson Vdeo Object rackng Based On Extended Actve Shape Models Wth Color Informaton A. Koschan, S.K. Kang, J.K. Pak, B.

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES Laser dffracton s one of the most wdely used methods for partcle sze analyss of mcron and submcron sze powders and dspersons. It s quck and easy and provdes

More information

Remote Sensing Image Retrieval Algorithm based on MapReduce and Characteristic Information

Remote Sensing Image Retrieval Algorithm based on MapReduce and Characteristic Information Remote Sensng Image Retreval Algorthm based on MapReduce and Characterstc Informaton Zhang Meng 1, 1 Computer School, Wuhan Unversty Hube, Wuhan430097 Informaton Center, Wuhan Unversty Hube, Wuhan430097

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION

A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION Mhaela Gordan *, Constantne Kotropoulos **, Apostolos Georgaks **, Ioanns Ptas ** * Bass of Electroncs Department,

More information

Feature Estimation and Registration of Point Clouds in Reverse Engineering

Feature Estimation and Registration of Point Clouds in Reverse Engineering Amercan Journal of Mechancal and Materals Engneerng 017; 1(4): 83-87 http://www.scencepublshnggroup.com/j/ajmme do: 10.11648/j.ajmme.0170104.15 Feature Estmaton and Regstraton of Pont Clouds n Reverse

More information

A Frame Packing Mechanism Using PDO Communication Service within CANopen

A Frame Packing Mechanism Using PDO Communication Service within CANopen 28 A Frame Packng Mechansm Usng PDO Communcaton Servce wthn CANopen Mnkoo Kang and Kejn Park Dvson of Industral & Informaton Systems Engneerng, Ajou Unversty, Suwon, Gyeongg-do, South Korea Summary The

More information

Structure from Motion

Structure from Motion Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

An Improved Image Segmentation Algorithm Based on the Otsu Method

An Improved Image Segmentation Algorithm Based on the Otsu Method 3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,

More information

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids) Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Shape-adaptive DCT and Its Application in Region-based Image Coding

Shape-adaptive DCT and Its Application in Region-based Image Coding Internatonal Journal of Sgnal Processng, Image Processng and Pattern Recognton, pp.99-108 http://dx.do.org/10.14257/sp.2014.7.1.10 Shape-adaptve DCT and Its Applcaton n Regon-based Image Codng Yamn Zheng,

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

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Face Recognition using 3D Directional Corner Points

Face Recognition using 3D Directional Corner Points 2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,

More information

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Development of an Active Shape Model. Using the Discrete Cosine Transform

Development of an Active Shape Model. Using the Discrete Cosine Transform Development of an Actve Shape Model Usng the Dscrete Cosne Transform Kotaro Yasuda A Thess n The Department of Electrcal and Computer Engneerng Presented n Partal Fulfllment of the Requrements for the

More information