Rapid gravity and gravity gradiometry terrain corrections via an adaptive quadtree mesh discretization

Size: px
Start display at page:

Download "Rapid gravity and gravity gradiometry terrain corrections via an adaptive quadtree mesh discretization"

Transcription

1 CSIRO PUBLISHING Copublished paper, please cite all three: Exploration Geophysics, 211, 42, 88 97; Butsuri-Tansa, 211, 64, 88 97; Jigu-Mulli-wa-Mulli-Tasa, 211, 14, Rapid gravity and gravity gradioetry terrain corrections via an adaptive quadtree esh discretization Kristofer Davis 1,2 M. Andy Kass 1 Yaoguo Li 1 1 Center for Gravity, Electrical, and Magnetic Studies, Departent of Geophysics, Colorado School of Mines, 15 Illinois Street, Golden, CO 841, USA. 2 Corresponding author. Eail: kdavis@eos.ubc.ca Abstract. We present a ethod for odelling the terrain response of gravity gradioetry surveys utilising an adaptive quadtree esh discretization. The data- and terrain-dependent ethod is tailored to provide rapid and accurate terrain corrections for draped and baroetric airborne surveys. The surface used in the odelling of the terrain effect for each datu is discretized autoatically to the largest cell size that will yield the desired accuracy, resulting in uch faster odelling than full-resolution calculations. The largest cell sizes within the odel occur in areas of inial terrain variation and at large distances away fro the datu location. We show synthetic and field exaples for proof of concept. In the presented field exaple, the adaptive quadtree ethod reduces the coputational cost by perforing 351 ties fewer calculations than the full odel would require while retaining an accuracy of one Eötvös for the gradient data. The ethod is also used for the terrain correction of the gravity field and perfored 31 ties faster copared with a calculation of the full digital elevation odel. Key words: gravity, gravity gradioetry, processing, quadtree, terrain correction. Introduction The effect of terrain in gravity gradioetry surveys for petroleu and ining applications is often the predoinant signal easured, because the field decays as distance-cubed (Chen and Macnae, 1997) and the terrain variation is the closest source. Therefore accurate terrain corrections are critical to proper interpretation of the dataset. However, the accuracy of the terrain correction is ost often a function of the resolution of the available digital elevation odel (DEM). As a result, higher and higher resolution DEMs are acquired during gravity gradient surveys. While this results in ore accurate corrections, these high-resolution DEMs have the unfortunate consequence of creating extreely high coputational deands. Current ethods of terrain correction often forward odel the terrain effect with reasonable coarsening of terrain as distance fro the observation location increases. A ajor portion of the terrain is calculated at full resolution. Such an approach can take days and soeties weeks to coplete for large-scale surveys. Much faster algoriths are needed if interpretation of data is required in the field or if results are siply needed quickly. Terrain corrections for gravity data also require high resolution DEMs, especially for ground-based surveys. In addition, a uch larger spatial extent of the DEM is required for gravity surveys as copared to gravity gradient as the field decays as distance-squared. Thus terrain fro greater distances affects the calculation. While the iniu DEM extent and cell size requireents for ground-based gravity surveys are well defined (Haer, 1939), airborne gravity terrain corrections are ore troublesoe and less defined (Haer, 1974). Siilar issues exist with gravity as with airborne gravity gradioetry surveys. Although extreely high resolution DEMs are required in areas with large topographic relief, the resolution requireents can be relaxed as the distance fro the observation point increases. Also, if the characteristics of the terrain change over the survey, the resolution requireents of the DEM ay change as well. Rough or rugose terrain will require finer discretization to accurately represent the rapidly changing elevation. Furtherore, the required resolution is also a function of the flight height and acquisition filters (Reid, 198; Kass and Li, 28). Thus a data-adaptive discretization of the DEM can result in faster coputations and saller storage requireents while ensuring the desired accuracy. In this paper, it is shown that the adaptive quadtree ethod is appropriate for data-dependent discretization of DEMs for terrain corrections. The ethod allows for user-defined error bounds and parallel coputing capability, and reduces the nuber of required calculations by two orders of agnitude in the exaple. We start with the forward odelling calculation of the prisatic odel and then discuss the discretization ethod. Synthetic and field exaples are shown for illustration. Forward odel approach The terrain effect in gravity gradioetry is calculated as the response due to the region of ass bounded above by the terrain and below by a plane that passes through the lowest elevation of the survey area. We discretize this region into vertical priss, each with a constant density, and calculate their individual contributions. We have adopted a Cartesian coordinate syste having its origin at the Earth s surface, x-axis pointing towards grid north, y-axis pointing towards grid east, and z-axis pointing vertically downward. The forward odel of the gravity gradient follows a siilar construction as described in Li (21). As gravitational potential satisfies Laplace s equation, the potentials due to all sources superipose at each observation point and thus the contribution of all priss to the gravity gradient easured at a point is the su of their individual responses. For a ASEG/SEGJ/KSEG /EG /11/188

2 Rapid terrain corrections Exploration Geophysics 89 source at location r with density r, the gravity gradient at an observation point (denoted by vector r o ) is a tensor T with individual coponents represented by ð q q 1 T kl ¼ gr qk ql jr r o j dv for k; l ¼ x; y; z; ð1þ V where V is the volue of the source, g is the gravitational constant, and k and l represent the three orthogonal directions described above. The integral for a rectangular prisatic volue follows the agnetic derivation by Shara (1966) or Zhang et al. (2), with treatent to avoid singularities at observation locations coplanar with the faces of the priss. As the equations are lengthy and not required for understanding of the ethod, we direct the reader to Shara (1966) for a detailed discussion of the integral solution. For source-free regions, this tensor is syetric and traceless, and coonly is written in the for: 2 3 T ¼ 6 4 j¼1 T xx T xy T xz T yy DV j T yz T zz 7 5: ð2þ We can write the expression for the gravity gradient at a datu point, d i,as 8 9 >< ð d i T kl ðr oi Þ¼ XM q q 1 >= g r j >: qx k qx l jr r oi j dv >; ¼ XM j¼1 r j G ij : In this construction, we are suing the response due to M priss, DV j, of constant density r j, having vertical extents fro the surface to the botto plane. The forward odel of the gravity field follows a siilar approach. The field due to a volue source is represented as j¼1 ð g z ðr o Þ¼gr DV j V z z o jr r o j 3 dv; leading to the gravity field at one data point d i due to the su of responses: 8 9 >< ð d i ¼ XM z z >= o g r j >: jr r o j 3 dv >; ¼ XM r j z ij : ð5þ It is iportant to note that the atrix (G or ) can be quite large. However, the forward odelling algorith does not require the foration and storage of the coplete atrix at one tie, but rather only the coputation for one datu at a tie. Furtherore, the discretization of priss varies fro datu to datu and thus the value of M and lengths of the rows of the atrix are constantly changing. This is fundaental to providing rapid calculations with inial storage. It is also iportant to note that the varying length of M and the principle of superposition are the key properties allowing for parallelisation of the coputation using ultiple threads. Algorith Traditional approaches to terrain correction rely on prescribed coarsening of the eleentary approxiation to the terrain as a function of horizontal distance fro the observation location. To extend this approach and reove the change of prescriptions that j¼1 ð3þ ð4þ ay be sub-optial, we propose an adaptive coarsening of the syste based on a quadtree esh discretization of terrain for each observation location. The discretization algorith considers both distance and terrain relief. Quadtrees are a hierarchical representation of inforation. They are priarily used in data structures and data ining (Harrington, 2) to relate details with general headings or inforation in order to save coputation tie or storage space. Quadtree esh discretization has been priarily used in geophysics for reote sensing applications for the storage of iages (e.g. Gerstner, 1999). The iage decreases in size by assebling siilar pixels into groups, yet areas of interest or rapid change retain the original pixels to aintain high resolution. Recently, quadtrees have also found application in 2D DC resistivity inversion (Eso and Oldenburg, 27). DC resistivity odelling incorporates a siilar idea with saller cells grouped into larger cells based on distances between source or observation locations and esh eleents. The quadtree ethod is particularly useful in large scale probles by iniising the nuber of required odel paraeters (Frey and Marechal, 1998; Ascher and Haber, 21). The ethod discretizes the odel ore finely at locations of desired high resolution areas and discretizes coarsely where low resolution is peritted. This type of local grid refineent is used in our application of terrain effect calculation. We adopt an algorith that starts with a low resolution rediscretization of the terrain and iteratively splits paraeters to increase resolution up to the original resolution of the digital elevation odel based on the gravity or gravity gradient response. This is done for each observation location. The esh begins as large prisatic cells (i.e. a esh) that have grouped terrain values of the sallest cell size (e.g. the DEM grid spacing) within the. The forward-odel response of the large cell is calculated first using an average height. Next, the cell is split into quarters and new average heights are used to calculate the cobined response of those cells. If the values differ by ore than a defined local error level, the four cells are kept for further analysis. Otherwise, the large cell first odelled is used. This process continues iteratively until all responses are within the given error level or the resolution has reached the full resolution of the DEM. In this application, we define error as the data difference between the full resolution and quadtree odels. It should be noted that this defined error does not include the inherent errors in the DEM. Thus, the accuracy of the ethod is bounded by both the DEM resolution and the respective errors in the acquisition of the terrain. The error level for the quadtree algorith is noralised by the nuber of cells in the odel creating a local error level for each group of cells. Thus, the user-specified error level is the su of the axiu local error of each odel eleent. Hence, if a cell is split (into four saller cells), the local error threshold for that cell is divided by four in order to preserve the upper bound for the grouped cells. For exaple, if the initial odel is split into 256 cells, then the first local error level is the user-defined error divided by 256. If the initial cell is split into quadrants, the local error for those quadrants is 1/(256 * 4) or 1/124 of the usergiven error. The local error level is a terination echanis for the quadtree esh discretization. Although the error is an upper bound, in practice the true error is uch saller, as shown in the exaples. Selection of the initial discretization has no effect on final accuracy. However, the two end ebers where the discretization is close to the initial DEM interval and where the cell size is half the DEM (e.g. 2 2) should be avoided. We have epirically deterined that a initial discretization is a good starting point in ost cases.

3 9 Exploration Geophysics K. Davis et al. Exaples Gaussian hill We first use a synthetic exaple based on the Gaussian hill odel, presented in Figure 1a, to illustrate the accuracy of the ethod. The function used to generate the DEM is given by: Tðx; yþ ¼3 3 exp x2 3 2 þ y2 3 2 : ð6þ The hill extends fro at ground level to 3 above the ground at its peak and has a positive density contrast of 2.65 g/cc. The total nuber of observation locations was 625. We first calculated the gravity gradient responses of this terrain at 35 above ground level for each coponent and allowed a 1-Eötvös error. The starting cell size is 16 by 16 based on the longest radial wavelength. We show the adaptive discretization of a Gaussian hill for a single observation location directly above the peak of the hill in Figure 1b used in gravity gradioetry calculation. The asyetry seen in the discretization about the x and y axes is a result of the centre of the initial cells before quadtree-splitting not being coincident with the peak of the odel. However, we do observe the appropriate axis of syetry which is rotated 45 degrees above the positive abscissa and through the origin. We copared the gradient response of the Gaussian hill calculated with our adaptive quadtree discretized DEM (Figure 2) to the full resolution calculation based on a regular grid. Although we allowed the algorith as uch as 1-Eötvös error, the axiu difference between the results fro these two approaches was.17 Eötvös (Figure 3). (a) (b) Fig. 1. (a) 3 high Gaussian hill with a density contrast of 2.65 g/cc used as a synthetic test dataset. (b) Autoated adaptive quadtree discretization deterined by the algorith that achieves a iniu of 1-Eötvös accuracy 5 iediately above the peak for all tensor coponents.

4 Rapid terrain corrections Exploration Geophysics Fig. 2. Gravity gradient response for each coponent on a plane 5 above the peak of the 3 -high Gaussian hill odel. Units are in Eötvös

5 92 Exploration Geophysics K. Davis et al Fig. 3. Difference between the gravity gradient terrain effects calculated with the adaptive quadtree ethod versus a full-resolution surface-based ethod. The axiu error threshold between these two odels was 1 Eötvös. Units are in 1/1 of an Eötvös ( 1 to 1 Eötvös colour bar).

6 Rapid terrain corrections Exploration Geophysics 93 We exaine the nuber of calculations perfored in order to evaluate the efficiency of the adaptive algorith. The full resolution odel contains cells, which eans that there are required calculations. Using the 1-Eötvös error level exaple, our ethod ade calculations, 31 ties less than (or.3% of) the full odel. We also use this terrain to deonstrate the ethod for gravity terrain correction. Figure 4 is the odel generated by the adaptive quadtree discretization for a single data location, siilar to the gradioetry odel. The accuracy was set to a axiu of.5 Gal. It took 129 ties fewer calculations than the full odel required ( versus calculations). The data generated fro the odel is shown in Figure 5. The difference between the full odel and quadtree discretized odel is siilar to that of the gravity gradient data. Field dataset To deonstrate the efficiency of the algorith using a realistic scenario, we calculated the terrain corrections for a draped airborne gravity gradient and gravity survey fro an Airborne Gravity Gradioetry test site in Australia (Figure 6). There are 8379 observations locations within a 5 by 5 area. The terrain data is sapled at 1 intervals in a 4 by 4 area. We first exaine the gravity gradioetry response of the terrain, and then the vertical gravity field. The gravity gradient terrain corrections used a density contrast of 2.67 g/cc and allowed a axiu of 1-Eötvös error while the gravity corrections used the sae density contrast and.5 Gal error tolerance. Figure 7a shows the discretization of the DEM for one observation location. The iediate area surrounding the datu is presented in Figure 7b for clarity. The discretization Gal Fig. 4. The quadtree odel discretization for one gravity observation. The quadtree-based calculation resulted in a speed increase of two orders of agnitude over the full resolution calculation. Fig. 5. The odelled vertical gravity terrain correction for synthetic Gaussian hill in Gal. The difference between full and quadtree odels is less than.5 Gal. 1 2 Elevation () Elevation () Fig. 6. Vertically-exaggerated terrain with survey locations shown in white. There are 8379 observation locations and the DEM is 4 4 with 1 cell size.

7 94 Exploration Geophysics K. Davis et al. requiring the iniu cell width (e.g. the DEM interval) is asyetric. This is due to the hill to the east of the datu, which requires finer discretization than the flatter terrain to the west. This exeplifies the utility of the ethod to take into account the response of the terrain, rather than having full dependency on the distance away fro the datu. The gradioetry correction took 351 ties fewer calculations, eaning there were ~.3% of the calculations necessary to produce the corrections as copared to using full-resolution. Figure 8 shows the calculated coponents of the gravity gradient. The terrain correction for an airborne survey of the vertical coponent of the gravity field was calculated in the sae anner. Figure 9 shows the corrections in Gal, which have the expected features. These appear soothed due to the observation elevation and the less decay rate than the gradioetry data. The full resolution odel would require calculations, (a) 6.53e e e e e e e e (b) e Fig. 7. (a) Quadtree odel discretization used for the gravity gradient terrain effect calculation at one observation location. (b) Close up of the quadtree discretization around the data location.

8 Rapid terrain corrections Exploration Geophysics e e e e e e e e e e e e e e e Fig. 8. Gravity gradient tensor terrain effect at the 8179 observation locations. The density used was 2.67 g/cc allowing a axiu of 1-Eötvös error. The quadtree ethod required 351 ties fewer calculations than for the full resolution odel.

9 96 Exploration Geophysics K. Davis et al Gal Fig. 9. Calculated terrain correction for the vertical coponent of the gravity field (units in Gal). The axiu error per datu is.5 Gal. The quadtree ethod required 318 ties fewer calculations than for the full resolution odel. whereas the quadtree discretization only needed to be within the.5 Gal error tolerance. The correction took 318 ties fewer calculations than the full odel, requiring 2 h on a 4.4 GHz dual-core PC. The sae PC ran an industry-standard coercial package for the terrain correction. The calculation was aborted after 4 days, and projected to take 26 days to finish. We understand that the coercial package used in this coparison ay not be optiised for the particular set-up for an airborne gravity survey; however, the draatic difference in coputing ties does highlight the efficiency of the adaptive quadtree ethod. Thus, the new approach offers a valuable alternative to the calculation of terrain correction, which is a requisite step in any gravity processing. Conclusions An efficient algorith has been developed for rapid calculation of terrain effects in airborne gravity and gravity gradioetry surveys. The ethod eploys quadtree esh discretization to represent the DEM adaptively for each datu based on the distance fro the observation point, local ruggedness of the terrain, and a user-specified error tolerance. The algorith achieves a uch higher coputational efficiency than the traditional full calculation of the DEM, and allows for ore accuracy than ethods that use prescribed discretization based on distance alone. Depending on the coplexity and relative relief of the terrain odel, the adaptive quadtree correction ethod can speed up the calculation by two orders of agnitude over the full-resolution calculation and at least one order of agnitude over currently available algoriths. The new algorith is well suited for application in odern airborne surveys that are characterised by a large nuber of observations, highly variable altitude, and accopanying highresolution DEMs such as those generated by light detection and ranging (LiDAR) surveys. Thus, this algorith provides a valuable and efficient alternative for calculating gravity and gravity gradient terrain corrections in odern airborne surveys. Acknowledgeents The authors thank the Korea Resources Corporation and the sponsors of the Gravity and Magnetics Research Consortiu: Anadarko, BGP, BP, Chevron, ConocoPhillips, Marathon, and Vale for funding support. We thank Theo Aravanis, Bob Sith, and Rio Tinto for providing the terrain data. We also thank Trevor Irons and Richard Lane for helpful discussions. References Ascher, U. M., and Haber, E., 21, Grid refineent and scaling for distributed paraeter estiation probles: Inverse Probles, 17, doi:1.188/ /17/3/314 Chen, J., and Macnae, J., 1997, Terrain corrections are critical for airborne gravity gradioeter data: Exploration Geophysics, 28, doi:1.171/eg99721 Eso, R., and Oldenburg, D. W., 27, Efficient 2.5D resistivity odeling using a quadtree discretization: Conference Proceedings, , Syposiu of Applied Geophysics on Engineering and Environental Probles. Frey, P. J., and Marechal, L., 1998, Fast adaptive quadtree esh generation, 7th International Meshing Roundtable: Sandia National Laboratories, 37, Gerstner, T., 1999, Adaptive hierarchical ethods for landscape representation and analysis: Lecture Notes in Earth Sciences, 78, doi:1.17/bfb972 Haer, S., 1939, Terrain corrections for gravieter stations: Geophysics, 4, doi:1.119/ Haer, S., 1974, Topographic and terrain correction for airborne gravity: Geophysics, 39, doi:1.119/ Harrington, J. L., 2, Object-oriented database design: Morgan Kaufann Publishers, Inc. Kass, M., and Li, Y., 28, Practical aspects of terrain correction in airborne gravity gradioetry surveys: Exploration Geophysics, 39, doi:1.171/eg821 Li, Y., 21, 3D inversion of gravity gradioeter data: Expanded Abstracts, , 71st Annual International Meeting, Society of Exploration Geophysicists. Reid, A. B., 198, Aeroagnetic survey design: Geophysics, 45, doi:1.119/ Shara, P. V., 1966, Rapid coputation of agnetic anoalies and deagnetization effects caused by bodies of arbitrary shape: Pure and Applied Geophysics, 64, doi:1.17/bf Zhang, C., Mushayandebvu, M. F., Reid, A. B., Fairhead, J. D., and Odegard, M. E., 2, Euler deconvolution of gravity tensor gradient data: Geophysics, 65, doi:1.119/ Manuscript received 7 July 21; accepted 19 Deceber 21.

10 Rapid terrain corrections Exploration Geophysics 97 四分木メッシュ分割を用いた重力および重力勾配の高速地形補正 Kristofer Davis 1 M. Andy Kass 1 Yaoguo Li 1 1 要旨 : 351 (DEM) 31 キーワード : 重力, 重力勾配, データ処理, 四分木, 地形補正 Kristofer Davis 1 M. Andy Kass 1 Yaoguo Li EU(Eötvös unit) 1/351., DEM 31.

Downloaded 18 Jul 2011 to Redistribution subject to SEG license or copyright; see Terms of Use at

Downloaded 18 Jul 2011 to Redistribution subject to SEG license or copyright; see Terms of Use at Rapid gravity and gravity gradiometry terrain correction via adaptive quadtree mesh discretization Kristofer Davis, M. Andy Kass, and Yaoguo Li, Center for Gravity, Electrical and Magnetic Studies, Colorado

More information

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into

More information

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.

More information

prismatic discretization of the digital elevation model, and their associated volume integration problems. Summary

prismatic discretization of the digital elevation model, and their associated volume integration problems. Summary A new method of terrain correcting airborne gravity gradiometry data using 3D Cauchy-type integrals Michael S. Zhdanov*, University of Utah and TechnoImaging, Glenn A. Wilson, TechnoImaging, and Xiaojun

More information

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3 2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition

More information

A simplified approach to merging partial plane images

A simplified approach to merging partial plane images A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D

More information

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles

More information

Performance Analysis of RAID in Different Workload

Performance Analysis of RAID in Different Workload Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,

More information

Depth Estimation of 2-D Magnetic Anomalous Sources by Using Euler Deconvolution Method

Depth Estimation of 2-D Magnetic Anomalous Sources by Using Euler Deconvolution Method Aerican Journal of Applied Sciences 1 (3): 209-214, 2004 ISSN 1546-9239 Science Publications, 2004 Depth Estiation of 2-D Magnetic Anoalous Sources by Using Euler Deconvolution Method 1,3 M.G. El Dawi,

More information

Ascending order sort Descending order sort

Ascending order sort Descending order sort Scalable Binary Sorting Architecture Based on Rank Ordering With Linear Area-Tie Coplexity. Hatrnaz and Y. Leblebici Departent of Electrical and Coputer Engineering Worcester Polytechnic Institute Abstract

More information

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011 EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction

More information

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13 Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical

More information

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,

More information

Geo-activity Recommendations by using Improved Feature Combination

Geo-activity Recommendations by using Improved Feature Combination Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,

More information

The optimization design of microphone array layout for wideband noise sources

The optimization design of microphone array layout for wideband noise sources PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun

More information

Image Filter Using with Gaussian Curvature and Total Variation Model

Image Filter Using with Gaussian Curvature and Total Variation Model IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.

More information

On the Computation and Application of Prototype Point Patterns

On the Computation and Application of Prototype Point Patterns On the Coputation and Application of Prototype Point Patterns Katherine E. Tranbarger Freier 1 and Frederic Paik Schoenberg 2 Abstract This work addresses coputational probles related to the ipleentation

More information

Analysing Real-Time Communications: Controller Area Network (CAN) *

Analysing Real-Time Communications: Controller Area Network (CAN) * Analysing Real-Tie Counications: Controller Area Network (CAN) * Abstract The increasing use of counication networks in tie critical applications presents engineers with fundaental probles with the deterination

More information

Reconstruction of Time Series using Optimal Ordering of ICA Components

Reconstruction of Time Series using Optimal Ordering of ICA Components Reconstruction of Tie Series using Optial Ordering of ICA Coponents Ar Goneid and Abear Kael Departent of Coputer Science & Engineering, The Aerican University in Cairo, Cairo, Egypt e-ail: goneid@aucegypt.edu

More information

Survivability Function A Measure of Disaster-Based Routing Performance

Survivability Function A Measure of Disaster-Based Routing Performance Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected

More information

Medical Biophysics 302E/335G/ st1-07 page 1

Medical Biophysics 302E/335G/ st1-07 page 1 Medical Biophysics 302E/335G/500 20070109 st1-07 page 1 STEREOLOGICAL METHODS - CONCEPTS Upon copletion of this lesson, the student should be able to: -define the ter stereology -distinguish between quantitative

More information

A Novel Fast Constructive Algorithm for Neural Classifier

A Novel Fast Constructive Algorithm for Neural Classifier A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore

More information

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu

More information

Novel Image Representation and Description Technique using Density Histogram of Feature Points

Novel Image Representation and Description Technique using Density Histogram of Feature Points Novel Iage Representation and Description Technique using Density Histogra of Feature Points Keneilwe ZUVA Departent of Coputer Science, University of Botswana, P/Bag 00704 UB, Gaborone, Botswana and Tranos

More information

Data pre-processing framework in SPM. Bogdan Draganski

Data pre-processing framework in SPM. Bogdan Draganski Data pre-processing fraework in SPM Bogdan Draganski Outline Why do we need pre-processing? Overview Structural MRI pre-processing fmri pre-processing Why do we need pre-processing? What do we want? Reason

More information

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University

More information

Weeks 1 3 Weeks 4 6 Unit/Topic Number and Operations in Base 10

Weeks 1 3 Weeks 4 6 Unit/Topic Number and Operations in Base 10 Weeks 1 3 Weeks 4 6 Unit/Topic Nuber and Operations in Base 10 FLOYD COUNTY SCHOOLS CURRICULUM RESOURCES Building a Better Future for Every Child - Every Day! Suer 2013 Subject Content: Math Grade 3rd

More information

Identifying Converging Pairs of Nodes on a Budget

Identifying Converging Pairs of Nodes on a Budget Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering

More information

Colorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.

Colorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science. Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object

More information

Relief shape inheritance and graphical editor for the landscape design

Relief shape inheritance and graphical editor for the landscape design Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru

More information

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute

More information

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.

More information

A wireless sensor network for visual detection and classification of intrusions

A wireless sensor network for visual detection and classification of intrusions A wireless sensor network for visual detection and classification of intrusions ANDRZEJ SLUZEK 1,3, PALANIAPPAN ANNAMALAI 2, MD SAIFUL ISLAM 1 1 School of Coputer Engineering, 2 IntelliSys Centre Nanyang

More information

A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing

A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada

More information

G045 3D Multiple Attenuation and Depth Imaging of Ocean Bottom Seismic Data

G045 3D Multiple Attenuation and Depth Imaging of Ocean Bottom Seismic Data G045 3D Multiple Attenuation and Depth Iaging of Ocean Botto Seisic Data J. Mispel* (StatoilHydro ASA), B. Arntsen (StatoilHydro ASA), A. Kritski (StatoilHydro ASA), L. Aundsen (StatoilHydro ASA), M. Thopson

More information

Real Time Displacement Measurement of an image in a 2D Plane

Real Time Displacement Measurement of an image in a 2D Plane International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882 Volue 5, Issue 3, March 2016 176 Real Tie Displaceent Measureent of an iage in a 2D Plane Abstract Prashant

More information

CROSSOVER ANALYSIS OF CHANG E-1 LASER ALTIMETER DATA

CROSSOVER ANALYSIS OF CHANG E-1 LASER ALTIMETER DATA ISPRS Workshop on Geospatial Data Infrastructure: fro data acquisition and updating to sarter services CROSSOVER ANALYSIS OF CHANG E- LASER ALTIMETER DATA Wenin Hu, Zongyu Yue, Kaichang Di* Institute of

More information

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The

More information

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints 519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka

More information

Summary. Reconstruction of data from non-uniformly spaced samples

Summary. Reconstruction of data from non-uniformly spaced samples Is there always extra bandwidth in non-unifor spatial sapling? Ralf Ferber* and Massiiliano Vassallo, WesternGeco London Technology Center; Jon-Fredrik Hopperstad and Ali Özbek, Schluberger Cabridge Research

More information

Optimal Route Queries with Arbitrary Order Constraints

Optimal Route Queries with Arbitrary Order Constraints IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL.?, NO.?,? 20?? 1 Optial Route Queries with Arbitrary Order Constraints Jing Li, Yin Yang, Nikos Maoulis Abstract Given a set of spatial points DS,

More information

Efficient Estimation of Inclusion Coefficient using HyperLogLog Sketches

Efficient Estimation of Inclusion Coefficient using HyperLogLog Sketches Efficient Estiation of Inclusion Coefficient using HyperLogLog Sketches Azade Nazi, Bolin Ding, Vivek Narasayya, Surajit Chaudhuri Microsoft Research {aznazi, bolind, viveknar, surajitc}@icrosoft.co ABSTRACT

More information

Designing High Performance Web-Based Computing Services to Promote Telemedicine Database Management System

Designing High Performance Web-Based Computing Services to Promote Telemedicine Database Management System Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,

More information

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented

More information

Planet Scale Software Updates

Planet Scale Software Updates Planet Scale Software Updates Christos Gkantsidis 1, Thoas Karagiannis 2, Pablo Rodriguez 1, and Milan Vojnović 1 1 Microsoft Research 2 UC Riverside Cabridge, UK Riverside, CA, USA {chrisgk,pablo,ilanv}@icrosoft.co

More information

TALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE

TALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE 7. FRESNEL DIFFRACTION ON A ROUND APERTURE. Objective Exaining diffraction pattern on a round aperture, deterining wavelength of light source.. Equipent needed Optical workbench, light source, color filters,

More information

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering

More information

Image Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK.

Image Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK. Iage Processing for fmri John Ashburner Wellcoe Trust Centre for Neuroiaging, 12 Queen Square, London, UK. Contents * Preliinaries * Rigid-Body and Affine Transforations * Optiisation and Objective Functions

More information

Smarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math

Smarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents

More information

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural

More information

THE rapid growth and continuous change of the real

THE rapid growth and continuous change of the real IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa

More information

Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation

Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation Quantitative Coparison of Sinc-Approxiating Kernels for Medical Iage Interpolation Erik H. W. Meijering, Wiro J. Niessen, Josien P. W. Plui, Max A. Viergever Iage Sciences Institute, Utrecht University

More information

A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions *

A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 21, 607-626 (2005) A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Mebership Functions * SHIH-HSU HUANG AND JIAN-YUAN LAI + Departent of

More information

A Method of Generating Multi-Scale Disc-Like Distributions for NDT Registration Algorithm

A Method of Generating Multi-Scale Disc-Like Distributions for NDT Registration Algorithm International Journal of Mechanical Engineering and Robotics Research Vol. 5, o., January 06 A Method of Generating Multi-Scale Disc-Like Distributions for D Registration Algorith Hyunki Hong and Beohee

More information

Collaborative Web Caching Based on Proxy Affinities

Collaborative Web Caching Based on Proxy Affinities Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA

More information

News Events Clustering Method Based on Staging Incremental Single-Pass Technique

News Events Clustering Method Based on Staging Incremental Single-Pass Technique News Events Clustering Method Based on Staging Increental Single-Pass Technique LI Yongyi 1,a *, Gao Yin 2 1 School of Electronics and Inforation Engineering QinZhou University 535099 Guangxi, China 2

More information

Design and Implementation of Business Logic Layer Object-Oriented Design versus Relational Design

Design and Implementation of Business Logic Layer Object-Oriented Design versus Relational Design Design and Ipleentation of Business Logic Layer Object-Oriented Design versus Relational Design Ali Alharthy Faculty of Engineering and IT University of Technology, Sydney Sydney, Australia Eail: Ali.a.alharthy@student.uts.edu.au

More information

Feature Selection to Relate Words and Images

Feature Selection to Relate Words and Images The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University

More information

Set Theoretic Estimation for Problems in Subtractive Color

Set Theoretic Estimation for Problems in Subtractive Color Set Theoretic Estiation for Probles in Subtractive Color Gaurav Shara Digital Iaging Technology Center, Xerox Corporation, MS0128-27E, 800 Phillips Rd, Webster, NY 14580 Received 25 March 1999; accepted

More information

Ming-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University

Ming-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University Rapid Constructions of Circular-Orbit Pinhole SPECT Iaging Syste Matrices by Gaussian Interpolation Method Cobined with Geoetric Paraeter Estiations (GIMGPE Ming-Wei Lee, Wei-Tso Lin, Yu-Ching Ni, Meei-Ling

More information

Different criteria of dynamic routing

Different criteria of dynamic routing Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich

More information

3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search

3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search 436 Journal of Electrical Engineering & Technology, Vol. 3, No. 3, pp. 436~443, 008 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search Dong-Min

More information

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,

More information

Boosted Detection of Objects and Attributes

Boosted Detection of Objects and Attributes L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly

More information

A Discrete Spring Model to Generate Fair Curves and Surfaces

A Discrete Spring Model to Generate Fair Curves and Surfaces A Discrete Spring Model to Generate Fair Curves and Surfaces Atsushi Yaada Kenji Shiada 2 Tootake Furuhata and Ko-Hsiu Hou 2 Tokyo Research Laboratory IBM Japan Ltd. LAB-S73 623-4 Shiotsurua Yaato Kanagawa

More information

Module Contact: Dr Rudy Lapeer (CMP) Copyright of the University of East Anglia Version 1

Module Contact: Dr Rudy Lapeer (CMP) Copyright of the University of East Anglia Version 1 UNIVERSITY OF EAST ANGLIA School of Coputing Sciences Main Series UG Exaination 2016-17 GRAPHICS 1 CMP-5010B Tie allowed: 2 hours Answer THREE questions. Notes are not peritted in this exaination Do not

More information

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,

More information

Brian Noguchi CS 229 (Fall 05) Project Final Writeup A Hierarchical Application of ICA-based Feature Extraction to Image Classification Brian Noguchi

Brian Noguchi CS 229 (Fall 05) Project Final Writeup A Hierarchical Application of ICA-based Feature Extraction to Image Classification Brian Noguchi A Hierarchical Application of ICA-based Feature Etraction to Iage Classification Introduction Iage classification poses one of the greatest challenges in the achine vision and achine learning counities.

More information

The Internal Conflict of a Belief Function

The Internal Conflict of a Belief Function The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of

More information

A Periodic Dynamic Load Balancing Method

A Periodic Dynamic Load Balancing Method 2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 A Periodic Dynaic Load Balancing Method Taotao Fan* State Key Laboratory of Inforation

More information

Shape Optimization of Quad Mesh Elements

Shape Optimization of Quad Mesh Elements Shape Optiization of Quad Mesh Eleents Yufei Li 1, Wenping Wang 1, Ruotian Ling 1, and Changhe Tu 2 1 The University of Hong Kong 2 Shandong University Abstract We study the proble of optiizing the face

More information

Fair Energy-Efficient Sensing Task Allocation in Participatory Sensing with Smartphones

Fair Energy-Efficient Sensing Task Allocation in Participatory Sensing with Smartphones Advance Access publication on 24 February 2017 The British Coputer Society 2017. All rights reserved. For Perissions, please eail: journals.perissions@oup.co doi:10.1093/cojnl/bxx015 Fair Energy-Efficient

More information

3 Conference on Inforation Sciences and Systes, The Johns Hopkins University, March, 3 Sensitivity Characteristics of Cross-Correlation Distance Metric and Model Function F. Porikli Mitsubishi Electric

More information

Flucs: Artificial Lighting & Daylighting. IES Virtual Environment

Flucs: Artificial Lighting & Daylighting. IES Virtual Environment Flucs: Artificial Lighting & Daylighting IES Virtual Environent Contents 1. General Description of the FLUCS Interface... 6 1.1. Coon Controls... 6 1.2. Main Application Window... 6 1.3. Other Windows...

More information

The Horizontal Deformation Analysis of High-rise Buildings

The Horizontal Deformation Analysis of High-rise Buildings Environental Engineering 10th International Conference eissn 2029-7092 / eisbn 978-609-476-044-0 Vilnius Gediinas Technical University Lithuania, 27 28 April 2017 Article ID: enviro.2017.194 http://enviro.vgtu.lt

More information

Geometry. The Method of the Center of Mass (mass points): Solving problems using the Law of Lever (mass points). Menelaus theorem. Pappus theorem.

Geometry. The Method of the Center of Mass (mass points): Solving problems using the Law of Lever (mass points). Menelaus theorem. Pappus theorem. Noveber 13, 2016 Geoetry. The Method of the enter of Mass (ass points): Solving probles using the Law of Lever (ass points). Menelaus theore. Pappus theore. M d Theore (Law of Lever). Masses (weights)

More information

1 Extended Boolean Model

1 Extended Boolean Model 1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible

More information

Automatic Graph Drawing Algorithms

Automatic Graph Drawing Algorithms Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs

More information

Using Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses

Using Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization

More information

Predicting x86 Program Runtime for Intel Processor

Predicting x86 Program Runtime for Intel Processor Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given

More information

Region Segmentation Region Segmentation

Region Segmentation Region Segmentation /7/ egion Segentation Lecture-7 Chapter 3, Fundaentals of Coputer Vision Alper Yilaz,, Mubarak Shah, Fall UCF egion Segentation Alper Yilaz,, Mubarak Shah, Fall UCF /7/ Laer epresentation Applications

More information

Threshold Analysis of Non-Binary Spatially-Coupled LDPC Codes with Windowed Decoding

Threshold Analysis of Non-Binary Spatially-Coupled LDPC Codes with Windowed Decoding 1 Threshold Analysis of Non-Binary Spatially-Coupled LDPC Codes with Windowed Decoding Lai Wei, Toshiaki Koike-Akino, David G. M. Mitchell, Thoas E. Fuja, and Daniel J. Costello, Jr. Departent of Electrical

More information

A Novel 2D Texture Classifier For Gray Level Images

A Novel 2D Texture Classifier For Gray Level Images 2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.co A Novel 2D Texture Classifier For Gray Level Iages B.S. Mousavi 1 Young Researchers Club, Zahedan

More information

EFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B.

EFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B. EFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B. Girod1 1 Stanford University, USA 2 Qualco Inc., USA ABSTRACT We study

More information

Galois Homomorphic Fractal Approach for the Recognition of Emotion

Galois Homomorphic Fractal Approach for the Recognition of Emotion Galois Hooorphic Fractal Approach for the Recognition of Eotion T. G. Grace Elizabeth Rani 1, G. Jayalalitha 1 Research Scholar, Bharathiar University, India, Associate Professor, Departent of Matheatics,

More information

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se

More information

Experimental analysis for error compensation of laser scanner data

Experimental analysis for error compensation of laser scanner data International conference on Innovative Methods in Product Design June 15 th 17 th, 2011, Venice, Italy Experiental analysis for error copensation of laser scanner data F. De Crescenzio (a), M. Fantini

More information

Genetic-Based EM Algorithm for Learning Gaussian Mixture Models

Genetic-Based EM Algorithm for Learning Gaussian Mixture Models 1344 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 27, NO. 8, AUGUST 2005 Genetic-Based EM Algorith for Learning Gaussian Mixture Models Franz Pernkopf, Meber, IEEE, and Djael Bouchaffra,

More information

2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016)

2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016) 2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016) Method for Marking and Positioning Corrosions in the Autoobile Engine Cylinder Cavity fro the Ultrasonic Phased Array

More information

I ve Seen Enough : Incrementally Improving Visualizations to Support Rapid Decision Making

I ve Seen Enough : Incrementally Improving Visualizations to Support Rapid Decision Making I ve Seen Enough : Increentally Iproving Visualizations to Support Rapid Decision Making Sajjadur Rahan Marya Aliakbarpour 2 Ha Kyung Kong Eric Blais 3 Karrie Karahalios,4 Aditya Paraeswaran Ronitt Rubinfield

More information

Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed

Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Yonghwan Ki* & Dick K.P. Yue** Massachusetts Institute of Technology, Departent of Ocean Engineering, Cabridge,

More information

ANALYSIS AND RECOVERY OF SYSTEMATIC ERRORS IN AIRBORNE LASER SYSTEM

ANALYSIS AND RECOVERY OF SYSTEMATIC ERRORS IN AIRBORNE LASER SYSTEM ANALYSIS AND RECOVERY OF SYSTEMATIC ERRORS IN AIRBORNE LASER SYSTEM Zhihe Wang*, Rong Shu,Weiing Xu, Hongyi Pu, Bo Yao Shanghai Institute of Technical Physics, CAS, 500 Yutian Road, Shanghai 200083, P.

More information

Data & Knowledge Engineering

Data & Knowledge Engineering Data & Knowledge Engineering 7 (211) 17 187 Contents lists available at ScienceDirect Data & Knowledge Engineering journal hoepage: www.elsevier.co/locate/datak An approxiate duplicate eliination in RFID

More information

LOSSLESS COMPRESSION OF BAYER MASK IMAGES USING AN OPTIMAL VECTOR PREDICTION TECHNIQUE

LOSSLESS COMPRESSION OF BAYER MASK IMAGES USING AN OPTIMAL VECTOR PREDICTION TECHNIQUE 1th European Signal Processing Conference (EUSIPCO 2006), Florence, Italy, Septeber -8, 2006, copyright by EUASIP LOSSLESS COMPESSION OF AYE MASK IMAES USIN AN OPTIMAL VECTO PEDICTION TECHNIQUE Stefano

More information

The Australian National University, Canberra Australia

The Australian National University, Canberra Australia Iproved Precision in the Measureent of Longitudinal Global and Regional Voluetric Changes via a Novel MRI Gradient Distortion Characterization and Correction Technique Vladiir S. Fonov 1, Andrew Janke

More information

Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization

Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization 1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,

More information

Research on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm

Research on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm roceedings of the 7th International Conference on Innovation & Manageent 893 Research on a Kind of QoS-Sensitive Seantic Web Services Coposition Method Based on Genetic Algorith Cao Hongjiang, Nie Guihua,

More information

THE rounding operation is performed in almost all arithmetic

THE rounding operation is performed in almost all arithmetic This is the author's version of an article that has been published in this journal. Changes were ade to this version by the publisher prior to publication. The final version of record is available at http://dx.doi.org/.9/tvlsi.5.538

More information

Error estimation of bathymetric grid models derived from historic and contemporary datasets 1 Introduction

Error estimation of bathymetric grid models derived from historic and contemporary datasets 1 Introduction Error estiation of bathyetric grid odels derived fro historic and conteporary datasets Martin Jakobsson, Brian Calder, Larry Mayer and Andy Arstrong Center for Coastal and Ocean Mapping, University of

More information

Closing The Performance Gap between Causal Consistency and Eventual Consistency

Closing The Performance Gap between Causal Consistency and Eventual Consistency Closing The Perforance Gap between Causal Consistency and Eventual Consistency Jiaqing Du Călin Iorgulescu Aitabha Roy Willy Zwaenepoel EPFL ABSTRACT It is well known that causal consistency is ore expensive

More information