Online Calibration of Path Loss Exponent in Wireless Sensor Networks

Size: px
Start display at page:

Download "Online Calibration of Path Loss Exponent in Wireless Sensor Networks"

Transcription

1 Online Calibration of Path Loss Exponent in Wireless Sensor Networks Guoqiang Mao, Brian D.O. Anderson and Barış Fidan School of Electrical and Information Engineering, the University of Sydney. Research School of Information Sciences and Engineering, Australian National University National ICT Australia Limited[1], Sydney, Australia National ICT Australia Limited, Canberra, Australia Abstract The path loss exponent (PLE) is a parameter indicating the rate at which the received signal strength (RSS) decreases with distance, and its value depends on the specific propagation environment. Path loss exponent estimation plays an important role in distance-based wireless sensor network localization, where distance is estimated from the RSS measurements. Path loss exponent estimation is also useful for other purposes like sensor network dimensioning. Existing techniques on PLE estimation rely on both RSS measurements and distance measurements in the same environment to calibrate the PLE. However distance measurements can be difficult and expensive to obtain in some environments. In this paper we propose a technique for online calibration of the path loss exponent in wireless sensor networks without using distance measurements. The major contribution of this paper is to demonstrate that it is possible to estimate the PLE using only power measurements and the geometric constraints associated with planarity in a sensor network. This may have a significant impact on wireless sensor network localization. I. INTRODUCTION The wireless received signal strength (RSS) has been popularly modeled by a log-normal model [1], [], []: P ij [dbm] N(P ij [dbm], σ db), (1) P ij [dbm] = P (d )[dbm] α log (d ij /d ), () where P ij [dbm] is the received power at a receiving node j from a transmitting node i in db milliwatts, P ij [dbm] is the mean power in db milliwatts, σdb is the variance of the shadowing, P (d )[dbm] is the received power in db milliwatts at a reference distance d and d ij is the distance between nodes i and j. In this paper, we use the notation [dbm] to denote that power is measured in db milliwatts. Otherwise, it is measured in milliwatts. The reference power P (d )[dbm] is calculated using the free space Friis equation or obtained through field measurements at distance d []. It is important to notice that the reference distance d should always be in the far field of the transmitter antenna so that the near-field effect does not alter the reference power. In large coverage cellular systems, a 1 km reference distance is commonly used, whereas in microcellular systems, a much 1 National ICT Australia is funded by the Australian Governments Department of Communications, Information Technology and the Arts and the Australian Research Council through the Backing Australias Ability initiative and the ICT Centre of Excellence Program. smaller distance such as m or 1 m is used []. In this paper, it is assumed that d and P (d )[dbm] can be obtained from a priori calibration of the wireless device and they are known constants. In many cases, P ij [dbm] P ji [dbm] due to the asymmetric wireless signal propagation path from node i to node j and from node j to node i. However in this paper, it is assumed that P ij [dbm] = P ji [dbm] for simplicity. In the case of an asymmetric path, the average value of P ij [dbm] and P ji [dbm] is used. It is also assumed that all distances are normalized with respect to d. Therefore Eq. can be simplified as: P ij [dbm] = P (d )[dbm] αlog d ij. () The parameter α is called the path loss exponent (PLE), which indicates the rate at which the received signal strength decreases with distance. The value of α depends on the specific propagation environment. In this paper, it is assumed that α is an unknown constant, which is to be determined. For a large wireless sensor network spanning a wide area with different environmental conditions, the area can be divided into smaller regions and α can be considered as a constant in each region. Path loss exponent estimation plays an important role in distance-based wireless sensor network localization, where distance is estimated from the received signal strength measurements []. Path loss exponent estimation is also useful for other purposes like sensor network dimensioning. As the value of the path loss exponent depends on the environment in which a sensor network is deployed, existing techniques on path loss exponent estimation rely on both RSS measurements and distance measurements in the same environment to calibrate the path loss exponent [1], []. RSS measurements are readily available. However distance measurements can be difficult and expensive to obtain in some environments. Moreover, the reliance on distance measurements impedes deployment in unknown environments. In this paper we propose a technique for online calibration of the path loss exponent in wireless sensor networks using the Cayley-Menger determinant [], [], which does not rely on distance measurements. The proposed technique also does not assume knowledge of the quantity σdb in Eq. 1. The major contribution of this paper is to demonstrate that it is possible to estimate the PLE using only power measurements and the geometric constraints associated with planarity in a sensor

2 p 1 Fig. 1. P,d 1 1 P 1,d 1 P,d p p P,d 1 1 P,d P,d p A fully-connected planar quadrilateral in sensor network. network. This may have a significant impact on distance-based wireless sensor network localization. For ease of explanation, the paper focuses on path loss exponent estimation in D. However the proposed technique may also be extended to D. The rest of the paper is organized as follows. In Section II we present the fundamental principle underpinning the proposed technique as well as an introduction to the proposed algorithm. The presence of noise in the log-normal model means that considerable adjustment is required of an algorithm initially developed for the noiseless case, to correct for the presence of bias. In Section III, the proposed algorithm is validated using both simulations and real measurement data. Conclusions and suggestions to further work are given in Section IV. II. PATH LOSS EXPONENT ESTIMATION BASED ON THE CAYLEY-MENGER DETERMINANT Consider a sensor with three neighbors where the neighbors of that sensor are also neighbors of each other. Two sensors i and j are neighbors if P ij is nonzero. The sensor and its neighbors can be represented by a full-connected planar quadrilateral shown in Fig. 1. The tuple (P ij, d ij ) represents the measured power and the true distance between node i and node j respectively. P ij and d ij are related through Eq. 1 and Eq.. The path loss exponent estimation problem can be formulated as the simultaneous estimation of the true distances d 1, d 1, d 1, d, d, d and α given the power measurements P 1, P 1, P 1, P, P, P. Using the maximum likelihood estimator, the likelihood function can be obtained as: 1 i<j L(d 1, d 1, d 1, d, d, d, α) = 1 ( πσ db ) exp( (P ij[dbm] P (d )[dbm] + αlog d ij ) σdb ) As the number of power measurements is smaller than the number of parameters to be estimated, this leads to a set of simple equations. In these equations P ij and P (d ) are in decimal units, not in db units, so that P ij = Pij[dBm]/. P 1 = P (d ) d α 1 () P 1 = P (d ) d α 1 () P 1 = P (d ) d α 1 () P = P (d ) d α () P = P (d ) d α () P = P (d ) d α () Another constraint that is required to solve the above equations can be found from the geometric constraint on a fully-connected planar quadrilateral using the Cayley-Menger determinant [], []. The Cayley-Menger determinant of a quadrilateral is given by: D(p 1, p, p, p ) = d 1 d 1 d 1 1 d 1 d d 1 d 1 d d 1 d 1 d d () A classical result on the Cayley-Menger determinant is given by the following theorem: Theorem 1: (Theorem 11.1 in []) Consider an n-tuple of points p 1,..., p n in m-dimensional space with n m + 1. The rank of the Cayley-Menger matrix M(p 1,..., p n ) (defined analogously to the right side of Eq. but without the determinant operation) is at most m + 1. A direct application of the theorem leads to: D(p 1, p, p, p ) =. (11) Combining Eq. 11 and Eq. to Eq., a nonlinear equation for α can be obtained: C /α 1 C /α 1 C /α 1 1 C /α 1 C /α C /α 1 h(α) = C /α 1 C /α C /α 1 =, C /α 1 C /α C /α (1) where C ij = P ij /P (d ), 1 i < j, and the C ij are all known. An analytical solution to Eq. 1 is difficult to find. However Eq. 1 can be conveniently solved using the bracketing and bisection numerical technique [, section.1]. Unfortunately, the estimate of α obtained using this method shows a strong bias, i.e., Bˆα = E(ˆα) α. (1) Fig. shows a histogram of the estimated path loss exponent, which is obtained from simulation using, different quadrilaterals whose vertices are uniformly distributed in a square region of 1 1. Other parameters used in the simulation are: the true value of α is.; σ db =.; P (d )[dbm] =.dbm; d = 1m. These parameters are drawn from real measurement data reported in [1]. It should be noted that in the presence of noise in power measurements, Eq. 1 may have non-unique solutions even in the typical range of α

3 Number of estimated path loss exponent falling into the region Estimated path loss exponent Fig.. Histogram of the estimated path loss exponent using Cayley-Menger determinant. The figure is obtained using, quadrilaterals whose vertices are uniformly distributed in a square region of Fig.. Relationship between the bias of ˆα, the standard deviation of noise in power measurement σ db and α. B ˆα depends to a small degree on α as well as on σdb. for some quadrilaterals. In that case, we simply discard that quadrilateral and do not use it in the calculation to avoid any ambiguity. As shown in the figure, the true value of α is. and the estimated value of α has a bias of.. The simulation shows that ˆα obtained using the aforementioned technique has a strong bias which cannot be ignored. Bias removal requires an analysis on E( ˆα). However a direct analysis of E( ˆα) is difficult because of the difficulty in obtaining an explicit analytical expression of α from Eq. 1. Therefore we resort to numerical experiments to evaluate E(ˆα). Our numerical evaluation shows that the bias of ˆα, Bˆα, has an approximate linear relationship with σ db for a fixed α. This is shown in Fig.. Fig. is obtained using, quadrilaterals whose vertices are uniformly distributed in a square of 1 1. The corresponding power measurements are obtained using Eq. 1 and Eq.. Moreover further simulations show that the relationship between Bˆα, σ db and α is almost independent of the distribution of the vertices of the quadrilaterals and is also independent of the shape of the area in which the vertices of the quadrilaterals are located. As an example, Fig. shows the relationship between Bˆα and σ db for quadrilaterals whose vertices are located in areas of a variety of different shapes and distributed in the area following different distributions. Fig. shows the relationship between Bˆα and σ db at a specific value of α =.. Based on the observation shown in Fig. and Fig. that the relationship between Bˆα and σ db is independent of the distribution of the vertices of various quadrilaterals and the shape of the area in which vertices of the quadrilaterals are located, a pattern matching technique can be used to estimate the path loss exponent which uses the power measurements only. Specifically, via a priori simulation, a data base can be established ( where each entry in the ) data base is arranged in the form α i, σdb,j, E(ˆα) α i,σdb,j. The symbol E(ˆα) αi,σdb,j is used to emphasize dependence of E(ˆα) on the path loss exponent α i and the variance of noise in power measurements σdb,j. This data base can be obtained using a large number of quadrilterals whose vertices, say, are uniformly distributed in an area. The corresponding power measurements are obtained using Eq. 1 and Eq.. The distance between adjacent σdb is the same, i.e., σ db,j+1 σ db,j = σ db. (1) The distance between adjacent α is also the same, i.e., α i+1 α i = α. (1) Given this data base, the estimation of α can be obtained using the following procedure for pattern matching: 1) Identify a set of fully connected quadrilaterals in the wireless sensor network for further computation; ) Add a random Gaussian noise with variance σdb into each power measurement. The power is measured in db milliwatts unit; ) For each individual quadrilateral, solve for ˆα using Eq. 1. An E(ˆα) r,1 corresponding to σdb can be obtained as the average value of ˆα obtained from each individual quadrilateral. Here the subscript r is used to mark the difference with the corresponding value in the database; ) Repeat steps and using different noise variance values M σdb, where M =, 1,,..., m. Here M = corresponds to the original data set without the additionally introduced noise. A series of tuples (, E(ˆα) r, ), ( σdb, E(ˆα) r,1),..., (m σdb, E(ˆα) r,m) can then be obtained; ) Search the database and find the values of i and j such that: m {i, j} = argmin (E(ˆα) r,n E(ˆα) αi,σdb,j+n ). N= (1)

4 (a).. (b) (c) (d) Fig.. Relationship between the bias of α and the standard deviation of noise in power measurement σdb. The relationship between Bα and σdb is almost independent of the distribution of the vertices of the quadrilaterals and independent of the shape of the area in which the vertices of the quadrilaterals are located. a) Generated from quadrilaterals whose vertices are uniformly distributed in a L shaped area. b) Generated from quadrilaterals whose vertices are uniformly distributed in a rectangular area of x. c) Generated from quadrilaterals whose vertices are distributed in a square area of 1x1 following a truncated Gaussian distribution with a zero mean and a standard variation of. d) Generated from quadrilaterals whose vertices are located in a ring. The inner radius of the ring is and the outer radius is. The coordinates of the vertices are generated by first selecting a number uniformly distributed in [, ] and then selecting a number uniformly distributed in [, π]. The two numbers are used as the polar coordinate of the vertex to obtain the rectangular coordinate. The parameter m has to be a large number, say, in order to obtain a reasonably accurate estimate of α, which is robust against the randomness in the data. ) Finally, an improved estimate of α approximately correcting for the bias can be obtained as: α = αi. (1) Similarly, an estimate of σdb can be obtained as: σ db = σdb,j. (1) III. S IMULATION VALIDATION In this section, we shall validate the proposed technique using both simulations and real measurements. The database is established by simulations using, quadrilaterals whose vertices are uniformly distributed in a square region of 1 1. The measured power is generated using Eq. 1 and Eq.. σdb is set to be 1 and the distance between adjacent αi is set to be.1, i.e., α =.1. Another set of, quadrilaterals whose vertices is uniformly distributed in a rectangular area of are used to establish the performance of the proposed algorithm. points are used in the search, i.e., m = in Eq. 1. The simulation is repeated by varying the value of α from to and varying the value of σdb from to, which are the typical ranges of the two parameters []. Fig. shows the error in estimating α and Fig. shows the error in estimating σ. As shown in Fig., the error in estimating α is contained in the region [.,.1]. The mean estimation error is.11 and the error variance is.11. Fig. shows that the error in estimating σdb is contained in the region [, 1]. The mean estimation error is. and the error variance is.. Fig. also shows that the error in estimating σdb is larger at smaller values of σdb. This is attributable to the larger separation between σdb,j+1 and σdb,j at smaller values of σdb,j. The impact of the estimation error depends on the specific application, density of sensor network and deployment of sensors. It is beyond the scope of this paper to evaluate the impact of the estimation error. The estimation error is attributable to the randomness in the data and can be reduced by using smaller values of σdb and α at the expense of increased computational load. For example, our simulation (not shown here due to space limitation) shows that by using m =, α =. and

5 (a) (b) (c) (d) Fig.. Relationship between the bias of ˆα and the standard deviation of noise in power measurement σ db at a specific value of α. Subfigures a), b), c), d) are obtained under the same conditions as those in Fig.. σdb =., the maximum error in estimating α reduces to.. The mean error reduces to. and the error variance reduces to.. Another possible approach to reducing estimation error is by applying a noise reduction technique [] to data before the pattern matching. Simulations using quadrilaterals whose vertices are distributed in an area of a different shape and/or following a different distribution show similar performance. Fig. and Fig. show the simulation results using a set of, quadrilaterals whose vertices are distributed in a square region of 1 1 following a truncated two-dimensional Gaussian distribution. The mean of the Gaussian distribution is at the center of the square region and the standard deviation of the Gaussian distribution is. Both figures show similar performance as those in Fig. and Fig. except that the estimation error of α has a value of. at a couple of points in Fig.. However the estimation error of σ db is better than that in Fig.. To further evaluate the performance of the proposed technique, we apply it to real measurement data reported in [1]. The measurement data and the deployment of sensors can also be found at hero/localize/. The wireless sensor network in [1] consists of fully connected nodes, which make up 1, 1 quadrilaterals. It is both computationally intensive and unnecessary to compute ˆα for each quadrilateral. Here we randomly choose, quadri- Error in Estimating α Fig.. Error in estimating α using the pattern matching. The vertices of the quadrilaterals are uniformly distributed in a rectangular area of. laterals for computation. The reference power P (d )[dbm] is calculated using the free space Friis equation at a reference distance d = 1m and P (d )[dbm] =.dbm [1]. The path loss exponent estimated using both the power measurements and the measured distances is.. The path loss exponent estimated using the proposed technique is., which represents an error of.. The true value σ db

6 Error in Estimating σ Fig.. Error in estimating σ db using the pattern matching. The vertices of the quadrilaterals are uniformly distributed in a rectangular area of. Error in Estimating α Fig.. Error in estimating α using the pattern matching. The vertices of the quadrilaterals are distributed in a square region of 1 1 following a truncated two-dimensional Gaussian distribution. (i.e., the value obtained using real power measurements and measured distances) is. and the estimation error is 1.. The slightly larger error in estimating σ db when using real measurement data may be attributable to the density of the noise in the power measurements deviating from a Gaussian distribution. IV. CONCLUSION AND FURTHER WORK In this paper, we proposed an algorithm which can estimate the path loss exponent using only power measurements and the underlying planar geometric constraints on the sensors only. The algorithm is based on the Cayley-Menger determinant and it does not use any distance measurements. The algorithm is validated using both simulations and real measurement data. The proposed algorithm may have significant impact on distance-based wireless sensor network localization. In this paper, we observed the empirical law that the relationship between Bˆα, σ db and α is independent of the distribution of the vertices of the quadrilaterals and is also independent of.. Error in Estimating σ Fig.. Error in estimating σ db using the pattern matching. The vertices of the quadrilaterals are distributed in a square region of 1 1 following a truncated two-dimensional Gaussian distribution. the shape of the area in which the vertices of the quadrilaterals are located. It is desirable to obtain an analytical expression of the relationship between Bˆα, σ db and α. This is also the direction of our future research. Furthermore, the proposed algorithm relies on the lognormal propagation model in Eq. 1 and Eq. in the sense that the maximum likelihood estimator shown in Eq. to Eq. may have a different form when the received signal strength has a different model. Although the log-normal propagation model is a popular model for wireless network, there are environments in which the log-normal propagation model is not the best model []. In that case, a technique needs to be developed to select the best model and choose the best estimator for distance to replace Eq. to Eq. accordingly. Therefore how to develop an algorithm for environments in which the lognormal propagation model does not apply is also a future research topic. REFERENCES [1] N. Patwari, I. Hero, A.O., M. Perkins, N. Correal, and R. O Dea, Relative location estimation in wireless sensor networks, IEEE Transactions on Signal Processing, vol. 1, no., pp. 1 1,. [] T. S. Rappaport, Wireless Communications: Principles and Practice, nd ed. Prentice Hall PTR, 1. [] D. Lymberopoulos, Q. Lindsey, and A. Savvides, An empirical analysis of radio signal strength variability in ieee.1. networks using monopole antennas, Tech. Rep. ENALAB Technical Report 1,. [] G. Mao, B. Fidan, and B. D. O. Anderson, Sensor network localization, in Sensor Network and Configuration: Fundamentals, Techniques, Platforms and Experiments. Germany: Springer-Verlag,. [] G. M. Crippen and T. F. Havel, Distance Geometry and Molecular Conformation. New York: John Wiley and Sons Inc., 1. [] L. M. Blumenthal, Theory and Applications Distance Geometry. Oxford University Press, 1. [] W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Receipes in C - The Art of Scientific Computing, nd ed. Cambridge University Press,. [] S. V. Vaseghi, Advanced Digital Signal Processing and Noise Reduction, rd ed. John Wiley & Sons,...

Recent advances in Metamodel of Optimal Prognosis. Lectures. Thomas Most & Johannes Will

Recent advances in Metamodel of Optimal Prognosis. Lectures. Thomas Most & Johannes Will Lectures Recent advances in Metamodel of Optimal Prognosis Thomas Most & Johannes Will presented at the Weimar Optimization and Stochastic Days 2010 Source: www.dynardo.de/en/library Recent advances in

More information

Indirect Radio Interferometric Localization via Pairwise Distances

Indirect Radio Interferometric Localization via Pairwise Distances Indirect Radio Interferometric Localization via Pairwise Distances Neal Patwari and Alfred O. Hero III Department of Electrical Engineering & Computer Science University of Michigan, Ann Arbor, USA [npatwari,

More information

Factorization with Missing and Noisy Data

Factorization with Missing and Noisy Data Factorization with Missing and Noisy Data Carme Julià, Angel Sappa, Felipe Lumbreras, Joan Serrat, and Antonio López Computer Vision Center and Computer Science Department, Universitat Autònoma de Barcelona,

More information

Analysis of Node Failure on Coverage in Presence of Shadowing and Fading in Wireless Sensor Networks

Analysis of Node Failure on Coverage in Presence of Shadowing and Fading in Wireless Sensor Networks International Journal of pplied Engineering Research ISSN 973-4562 Volume 12, Number 16 (217 pp. 665-67 nalysis of Node Failure on Coverage in Presence of Shadowing and Fading in Wireless Sensor Networks

More information

On the Maximum Throughput of A Single Chain Wireless Multi-Hop Path

On the Maximum Throughput of A Single Chain Wireless Multi-Hop Path On the Maximum Throughput of A Single Chain Wireless Multi-Hop Path Guoqiang Mao, Lixiang Xiong, and Xiaoyuan Ta School of Electrical and Information Engineering The University of Sydney NSW 2006, Australia

More information

Particle Filtering. CS6240 Multimedia Analysis. Leow Wee Kheng. Department of Computer Science School of Computing National University of Singapore

Particle Filtering. CS6240 Multimedia Analysis. Leow Wee Kheng. Department of Computer Science School of Computing National University of Singapore Particle Filtering CS6240 Multimedia Analysis Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore (CS6240) Particle Filtering 1 / 28 Introduction Introduction

More information

Prolonging Network Lifetime via Partially Controlled Node Deployment and Adaptive Data Propagation in WSN

Prolonging Network Lifetime via Partially Controlled Node Deployment and Adaptive Data Propagation in WSN Prolonging Network Lifetime via Partially Controlled Node Deployment and Adaptive Data Propagation in WSN Fangting Sun, Mark Shayman Department of Electrical and Computer Engineering University of Maryland,

More information

On frame and orientation localization for relative sensing networks

On frame and orientation localization for relative sensing networks Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-, 2008 On frame and orientation localization for relative sensing networks Giulia Piovan Iman Shames Barış Fidan Francesco

More information

Efficient computation of source magnetic scalar potential

Efficient computation of source magnetic scalar potential Adv. Radio Sci., 4, 59 63, 2006 Author(s) 2006. This work is licensed under a Creative Commons License. Advances in Radio Science Efficient computation of source magnetic scalar potential W. Hafla, A.

More information

Note Set 4: Finite Mixture Models and the EM Algorithm

Note Set 4: Finite Mixture Models and the EM Algorithm Note Set 4: Finite Mixture Models and the EM Algorithm Padhraic Smyth, Department of Computer Science University of California, Irvine Finite Mixture Models A finite mixture model with K components, for

More information

Constrained Optimization of the Stress Function for Multidimensional Scaling

Constrained Optimization of the Stress Function for Multidimensional Scaling Constrained Optimization of the Stress Function for Multidimensional Scaling Vydunas Saltenis Institute of Mathematics and Informatics Akademijos 4, LT-08663 Vilnius, Lithuania Saltenis@ktlmiilt Abstract

More information

Learning Inverse Dynamics: a Comparison

Learning Inverse Dynamics: a Comparison Learning Inverse Dynamics: a Comparison Duy Nguyen-Tuong, Jan Peters, Matthias Seeger, Bernhard Schölkopf Max Planck Institute for Biological Cybernetics Spemannstraße 38, 72076 Tübingen - Germany Abstract.

More information

1. Estimation equations for strip transect sampling, using notation consistent with that used to

1. Estimation equations for strip transect sampling, using notation consistent with that used to Web-based Supplementary Materials for Line Transect Methods for Plant Surveys by S.T. Buckland, D.L. Borchers, A. Johnston, P.A. Henrys and T.A. Marques Web Appendix A. Introduction In this on-line appendix,

More information

Path Planning and Localization for Mobile Anchor Based Wireless Sensor Networks

Path Planning and Localization for Mobile Anchor Based Wireless Sensor Networks Path Planning and Localization for Mobile Anchor Based Wireless Sensor Networks Ecenaz Erdemir, T. Engin Tuncer Electrical and Electronics Engineering Department, METU, Ankara, Turkey {ecenaz, etuncer}@metu.edu.tr

More information

Invariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction

Invariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction Invariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction Stefan Müller, Gerhard Rigoll, Andreas Kosmala and Denis Mazurenok Department of Computer Science, Faculty of

More information

Self-Organizing Maps for cyclic and unbounded graphs

Self-Organizing Maps for cyclic and unbounded graphs Self-Organizing Maps for cyclic and unbounded graphs M. Hagenbuchner 1, A. Sperduti 2, A.C. Tsoi 3 1- University of Wollongong, Wollongong, Australia. 2- University of Padova, Padova, Italy. 3- Hong Kong

More information

Sensor Network Localization Using Least Squares Kernel Regression

Sensor Network Localization Using Least Squares Kernel Regression Sensor Network Localization Using Least Squares Kernel Regression Anthony Kuh 1, Chaopin Zhu 1, and Danilo Mandic 2 1 University of Hawaii 2 Imperial College London Abstract. This paper considers the sensor

More information

Chapter 4. The Classification of Species and Colors of Finished Wooden Parts Using RBFNs

Chapter 4. The Classification of Species and Colors of Finished Wooden Parts Using RBFNs Chapter 4. The Classification of Species and Colors of Finished Wooden Parts Using RBFNs 4.1 Introduction In Chapter 1, an introduction was given to the species and color classification problem of kitchen

More information

An ICA based Approach for Complex Color Scene Text Binarization

An ICA based Approach for Complex Color Scene Text Binarization An ICA based Approach for Complex Color Scene Text Binarization Siddharth Kherada IIIT-Hyderabad, India siddharth.kherada@research.iiit.ac.in Anoop M. Namboodiri IIIT-Hyderabad, India anoop@iiit.ac.in

More information

Digital Image Processing Laboratory: MAP Image Restoration

Digital Image Processing Laboratory: MAP Image Restoration Purdue University: Digital Image Processing Laboratories 1 Digital Image Processing Laboratory: MAP Image Restoration October, 015 1 Introduction This laboratory explores the use of maximum a posteriori

More information

MATH3016: OPTIMIZATION

MATH3016: OPTIMIZATION MATH3016: OPTIMIZATION Lecturer: Dr Huifu Xu School of Mathematics University of Southampton Highfield SO17 1BJ Southampton Email: h.xu@soton.ac.uk 1 Introduction What is optimization? Optimization is

More information

Adaptive Filtering using Steepest Descent and LMS Algorithm

Adaptive Filtering using Steepest Descent and LMS Algorithm IJSTE - International Journal of Science Technology & Engineering Volume 2 Issue 4 October 2015 ISSN (online): 2349-784X Adaptive Filtering using Steepest Descent and LMS Algorithm Akash Sawant Mukesh

More information

Distributed Detection in Sensor Networks: Connectivity Graph and Small World Networks

Distributed Detection in Sensor Networks: Connectivity Graph and Small World Networks Distributed Detection in Sensor Networks: Connectivity Graph and Small World Networks SaeedA.AldosariandJoséM.F.Moura Electrical and Computer Engineering Department Carnegie Mellon University 5000 Forbes

More information

Centre for Digital Image Measurement and Analysis, School of Engineering, City University, Northampton Square, London, ECIV OHB

Centre for Digital Image Measurement and Analysis, School of Engineering, City University, Northampton Square, London, ECIV OHB HIGH ACCURACY 3-D MEASUREMENT USING MULTIPLE CAMERA VIEWS T.A. Clarke, T.J. Ellis, & S. Robson. High accuracy measurement of industrially produced objects is becoming increasingly important. The techniques

More information

Hybrid Quasi-Monte Carlo Method for the Simulation of State Space Models

Hybrid Quasi-Monte Carlo Method for the Simulation of State Space Models The Tenth International Symposium on Operations Research and Its Applications (ISORA 211) Dunhuang, China, August 28 31, 211 Copyright 211 ORSC & APORC, pp. 83 88 Hybrid Quasi-Monte Carlo Method for the

More information

Preprocessing: Smoothing and Derivatives

Preprocessing: Smoothing and Derivatives Preprocessing: Smoothing and Derivatives Jarmo Alander University of Vaasa November 1, 2010 Contents Preprocessing Baseline correction. Autoscaling. Savitzky-Golay Smoothing Filters Savitzky-Golay Filters

More information

Effects of multi-scale velocity heterogeneities on wave-equation migration Yong Ma and Paul Sava, Center for Wave Phenomena, Colorado School of Mines

Effects of multi-scale velocity heterogeneities on wave-equation migration Yong Ma and Paul Sava, Center for Wave Phenomena, Colorado School of Mines Effects of multi-scale velocity heterogeneities on wave-equation migration Yong Ma and Paul Sava, Center for Wave Phenomena, Colorado School of Mines SUMMARY Velocity models used for wavefield-based seismic

More information

CHARACTERISTICS AND TABLES OF THE DOUBLY-TRUNCATED NORMAL DISTRIBUTION

CHARACTERISTICS AND TABLES OF THE DOUBLY-TRUNCATED NORMAL DISTRIBUTION CHAACTEISTICS AND TABES OF THE DOUBY-TUNCATED NOMA DISTIBUTION Arvid C. Johnson, Graduate School of Business and Information Systems Dominican University, 7900 W. Division St., iver Forest, I 60305 Phone:

More information

S U N G - E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T

S U N G - E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T S U N G - E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T Copyright 2018 Sung-eui Yoon, KAIST freely available on the internet http://sglab.kaist.ac.kr/~sungeui/render

More information

On the Complexity of Graph Cuboidal Dual Problems for 3-D Floorplanning of Integrated Circuit Design

On the Complexity of Graph Cuboidal Dual Problems for 3-D Floorplanning of Integrated Circuit Design On the Complexity of Graph Cuboidal Dual Problems for 3-D Floorplanning of Integrated Circuit Design Renshen Wang Chung-Kuan Cheng Department of Computer Science & Engineering University of California,

More information

Inclusion of Aleatory and Epistemic Uncertainty in Design Optimization

Inclusion of Aleatory and Epistemic Uncertainty in Design Optimization 10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA Inclusion of Aleatory and Epistemic Uncertainty in Design Optimization Sirisha Rangavajhala

More information

Two Dimensional Microwave Imaging Using a Divide and Unite Algorithm

Two Dimensional Microwave Imaging Using a Divide and Unite Algorithm Two Dimensional Microwave Imaging Using a Divide and Unite Algorithm Disha Shur 1, K. Yaswanth 2, and Uday K. Khankhoje 2 1 Indian Institute of Engineering Science and Technology, Shibpur, India 2 Indian

More information

Coordinated carrier aggregation for campus of home base stations

Coordinated carrier aggregation for campus of home base stations 2015 IEEE 2015 International Symposium on Wireless Communication Systems (ISWCS), Brussels (Belgium), Aug. 2015 DOI: 10.1109/ISWCS.2015.7454390 Coordinated carrier aggregation for campus of home base stations

More information

Multi-Hop Virtual MIMO Communication using STBC and Relay Selection

Multi-Hop Virtual MIMO Communication using STBC and Relay Selection Multi-Hop Virtual MIMO Communication using STBC and Relay Selection Athira D. Nair, Aswathy Devi T. Department of Electronics and Communication L.B.S. Institute of Technology for Women Thiruvananthapuram,

More information

WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS

WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS ARIFA SULTANA 1 & KANDARPA KUMAR SARMA 2 1,2 Department of Electronics and Communication Engineering, Gauhati

More information

Short Survey on Static Hand Gesture Recognition

Short Survey on Static Hand Gesture Recognition Short Survey on Static Hand Gesture Recognition Huu-Hung Huynh University of Science and Technology The University of Danang, Vietnam Duc-Hoang Vo University of Science and Technology The University of

More information

Robust Ring Detection In Phase Correlation Surfaces

Robust Ring Detection In Phase Correlation Surfaces Griffith Research Online https://research-repository.griffith.edu.au Robust Ring Detection In Phase Correlation Surfaces Author Gonzalez, Ruben Published 2013 Conference Title 2013 International Conference

More information

Figure (5) Kohonen Self-Organized Map

Figure (5) Kohonen Self-Organized Map 2- KOHONEN SELF-ORGANIZING MAPS (SOM) - The self-organizing neural networks assume a topological structure among the cluster units. - There are m cluster units, arranged in a one- or two-dimensional array;

More information

Machine Learning / Jan 27, 2010

Machine Learning / Jan 27, 2010 Revisiting Logistic Regression & Naïve Bayes Aarti Singh Machine Learning 10-701/15-781 Jan 27, 2010 Generative and Discriminative Classifiers Training classifiers involves learning a mapping f: X -> Y,

More information

The Curse of Dimensionality

The Curse of Dimensionality The Curse of Dimensionality ACAS 2002 p1/66 Curse of Dimensionality The basic idea of the curse of dimensionality is that high dimensional data is difficult to work with for several reasons: Adding more

More information

A New Splitting-Merging Paradigm for Distributed Localization in Wireless Sensor Networks

A New Splitting-Merging Paradigm for Distributed Localization in Wireless Sensor Networks A New Splitting-Merging Paradigm for Distributed Localization in Wireless Sensor Networks S. Alireza Motevallian, Lu Xia, Brian D.O Anderson Abstract This paper proposes a new merging (stitching) scheme

More information

A numerical grid and grid less (Mesh less) techniques for the solution of 2D Laplace equation

A numerical grid and grid less (Mesh less) techniques for the solution of 2D Laplace equation Available online at www.pelagiaresearchlibrary.com Advances in Applied Science Research, 2014, 5(1):150-155 ISSN: 0976-8610 CODEN (USA): AASRFC A numerical grid and grid less (Mesh less) techniques for

More information

Filtering Images. Contents

Filtering Images. Contents Image Processing and Data Visualization with MATLAB Filtering Images Hansrudi Noser June 8-9, 010 UZH, Multimedia and Robotics Summer School Noise Smoothing Filters Sigmoid Filters Gradient Filters Contents

More information

Multiple Constraint Satisfaction by Belief Propagation: An Example Using Sudoku

Multiple Constraint Satisfaction by Belief Propagation: An Example Using Sudoku Multiple Constraint Satisfaction by Belief Propagation: An Example Using Sudoku Todd K. Moon and Jacob H. Gunther Utah State University Abstract The popular Sudoku puzzle bears structural resemblance to

More information

Constructing Numerical Reference Modes from Sparse Time Series

Constructing Numerical Reference Modes from Sparse Time Series Constructing Numerical Reference Modes from Sparse Series Peter S. Hovmand, Ph.D. Washington University George Warren Brown School of Social Work Campus Box 1196 One Brookings Drive St. Louis, MO 63130

More information

Robust Kernel Methods in Clustering and Dimensionality Reduction Problems

Robust Kernel Methods in Clustering and Dimensionality Reduction Problems Robust Kernel Methods in Clustering and Dimensionality Reduction Problems Jian Guo, Debadyuti Roy, Jing Wang University of Michigan, Department of Statistics Introduction In this report we propose robust

More information

Geometric Considerations for Distribution of Sensors in Ad-hoc Sensor Networks

Geometric Considerations for Distribution of Sensors in Ad-hoc Sensor Networks Geometric Considerations for Distribution of Sensors in Ad-hoc Sensor Networks Ted Brown, Deniz Sarioz, Amotz Bar-Noy, Tom LaPorta, Dinesh Verma, Matthew Johnson, Hosam Rowaihy November 20, 2006 1 Introduction

More information

Approximation of 3D-Parametric Functions by Bicubic B-spline Functions

Approximation of 3D-Parametric Functions by Bicubic B-spline Functions International Journal of Mathematical Modelling & Computations Vol. 02, No. 03, 2012, 211-220 Approximation of 3D-Parametric Functions by Bicubic B-spline Functions M. Amirfakhrian a, a Department of Mathematics,

More information

INTERSECTION OF CURVES FACTS, COMPUTATIONS, APPLICATIONS IN BLOWUP*

INTERSECTION OF CURVES FACTS, COMPUTATIONS, APPLICATIONS IN BLOWUP* South Bohemia Mathematical Letters Volume 24, (2016), No. 1, 10-16. INTERSECTION OF CURVES FACTS, COMPUTATIONS, APPLICATIONS IN BLOWUP* PAVEL CHALMOVIANSKÝ abstrakt. We deal with application of intersection

More information

IMPROVING THE DATA COLLECTION RATE IN WIRELESS SENSOR NETWORKS BY USING THE MOBILE RELAYS

IMPROVING THE DATA COLLECTION RATE IN WIRELESS SENSOR NETWORKS BY USING THE MOBILE RELAYS IMPROVING THE DATA COLLECTION RATE IN WIRELESS SENSOR NETWORKS BY USING THE MOBILE RELAYS 1 K MADHURI, 2 J.KRISHNA, 3 C.SIVABALAJI II M.Tech CSE, AITS, Asst Professor CSE, AITS, Asst Professor CSE, NIST

More information

Tomographic Algorithm for Industrial Plasmas

Tomographic Algorithm for Industrial Plasmas Tomographic Algorithm for Industrial Plasmas More info about this article: http://www.ndt.net/?id=22342 1 Sudhir K. Chaudhary, 1 Kavita Rathore, 2 Sudeep Bhattacharjee, 1 Prabhat Munshi 1 Nuclear Engineering

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction A Monte Carlo method is a compuational method that uses random numbers to compute (estimate) some quantity of interest. Very often the quantity we want to compute is the mean of

More information

OPTIMAL DESIGN OF A STEPPER-DRIVEN PLANAR LINKAGE USING ENTROPY METHODS

OPTIMAL DESIGN OF A STEPPER-DRIVEN PLANAR LINKAGE USING ENTROPY METHODS Optimal Design of A Stepper-Driven Planar Linkage Using Entropy Methods OPTIMAL DESIGN OF A STEPPER-DRIVEN PLANAR LINKAGE USING ENTROPY METHODS J. C. Musto 1* 1 Mechanical Engineering Department, Milwaukee

More information

Distributive Time Division Multiplexed Localization Technique for WLANs

Distributive Time Division Multiplexed Localization Technique for WLANs Distributive Time Division Multiplexed Localization Technique for WLANs ADNAN UMAR KHAN Faculty of Technology De Montfort University, United Kingdom This thesis is submitted in partial fulfillment of the

More information

Analysis of Planar Anisotropy of Fibre Systems by Using 2D Fourier Transform

Analysis of Planar Anisotropy of Fibre Systems by Using 2D Fourier Transform Maroš Tunák, Aleš Linka Technical University in Liberec Faculty of Textile Engineering Department of Textile Materials Studentská 2, 461 17 Liberec 1, Czech Republic E-mail: maros.tunak@tul.cz ales.linka@tul.cz

More information

Robust Signal-Structure Reconstruction

Robust Signal-Structure Reconstruction Robust Signal-Structure Reconstruction V. Chetty 1, D. Hayden 2, J. Gonçalves 2, and S. Warnick 1 1 Information and Decision Algorithms Laboratories, Brigham Young University 2 Control Group, Department

More information

Multicomponent land data pre-processing for FWI: a benchmark dataset

Multicomponent land data pre-processing for FWI: a benchmark dataset Multicomponent land data pre-processing for FWI: a benchmark dataset Raul Cova, Bernie K. Law and Kris Innanen CRWES/University of Calgary Summary Successful full-waveform inversion (FWI) studies using

More information

Fitting Fragility Functions to Structural Analysis Data Using Maximum Likelihood Estimation

Fitting Fragility Functions to Structural Analysis Data Using Maximum Likelihood Estimation Fitting Fragility Functions to Structural Analysis Data Using Maximum Likelihood Estimation 1. Introduction This appendix describes a statistical procedure for fitting fragility functions to structural

More information

Model-based segmentation and recognition from range data

Model-based segmentation and recognition from range data Model-based segmentation and recognition from range data Jan Boehm Institute for Photogrammetry Universität Stuttgart Germany Keywords: range image, segmentation, object recognition, CAD ABSTRACT This

More information

A Probabilistic Approach to the Hough Transform

A Probabilistic Approach to the Hough Transform A Probabilistic Approach to the Hough Transform R S Stephens Computing Devices Eastbourne Ltd, Kings Drive, Eastbourne, East Sussex, BN21 2UE It is shown that there is a strong relationship between the

More information

HUMAN COMPUTER INTERFACE BASED ON HAND TRACKING

HUMAN COMPUTER INTERFACE BASED ON HAND TRACKING Proceedings of MUSME 2011, the International Symposium on Multibody Systems and Mechatronics Valencia, Spain, 25-28 October 2011 HUMAN COMPUTER INTERFACE BASED ON HAND TRACKING Pedro Achanccaray, Cristian

More information

Fault Tolerant Parallel Filters Based on ECC Codes

Fault Tolerant Parallel Filters Based on ECC Codes Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 11, Number 7 (2018) pp. 597-605 Research India Publications http://www.ripublication.com Fault Tolerant Parallel Filters Based on

More information

On the Parameter Estimation of the Generalized Exponential Distribution Under Progressive Type-I Interval Censoring Scheme

On the Parameter Estimation of the Generalized Exponential Distribution Under Progressive Type-I Interval Censoring Scheme arxiv:1811.06857v1 [math.st] 16 Nov 2018 On the Parameter Estimation of the Generalized Exponential Distribution Under Progressive Type-I Interval Censoring Scheme Mahdi Teimouri Email: teimouri@aut.ac.ir

More information

EXPANDING CURRENT PRACTICE IN USING DYNAMIC GEOMETRY TO TEACH ABOUT ANGLE PROPERTIES

EXPANDING CURRENT PRACTICE IN USING DYNAMIC GEOMETRY TO TEACH ABOUT ANGLE PROPERTIES EXANDING CURRENT RACTICE IN USING DYNAMIC GEOMETRY TO TEACH ABOUT ANGLE ROERTIES Kenneth Ruthven University of Cambridge Faculty of Education Introductory comments An earlier article (Ruthven, Hennessy

More information

Bagging for One-Class Learning

Bagging for One-Class Learning Bagging for One-Class Learning David Kamm December 13, 2008 1 Introduction Consider the following outlier detection problem: suppose you are given an unlabeled data set and make the assumptions that one

More information

A Novel Geometric Diagram and Its Applications in Wireless Networks

A Novel Geometric Diagram and Its Applications in Wireless Networks A Novel Geometric Diagram and Its Applications in Wireless Networks Guangbin Fan * and Jingyuan Zhang * Department of Computer and Information Science, University of Mississippi University, MS 38677, Email:

More information

VARIANCE REDUCTION TECHNIQUES IN MONTE CARLO SIMULATIONS K. Ming Leung

VARIANCE REDUCTION TECHNIQUES IN MONTE CARLO SIMULATIONS K. Ming Leung POLYTECHNIC UNIVERSITY Department of Computer and Information Science VARIANCE REDUCTION TECHNIQUES IN MONTE CARLO SIMULATIONS K. Ming Leung Abstract: Techniques for reducing the variance in Monte Carlo

More information

Influence of geometric imperfections on tapered roller bearings life and performance

Influence of geometric imperfections on tapered roller bearings life and performance Influence of geometric imperfections on tapered roller bearings life and performance Rodríguez R a, Calvo S a, Nadal I b and Santo Domingo S c a Computational Simulation Centre, Instituto Tecnológico de

More information

Distance Distributions and Boundary Effects in Finite Uniformly Random Networks

Distance Distributions and Boundary Effects in Finite Uniformly Random Networks AusCTW 2013 1/35 Distance Distributions and Boundary Effects in Finite Uniformly Random Networks Salman Durrani Senior Lecturer Applied Signal Processing (ASP) Research Group Research School of Engineering,

More information

IMAGE PROCESSING AND IMAGE REGISTRATION ON SPIRAL ARCHITECTURE WITH salib

IMAGE PROCESSING AND IMAGE REGISTRATION ON SPIRAL ARCHITECTURE WITH salib IMAGE PROCESSING AND IMAGE REGISTRATION ON SPIRAL ARCHITECTURE WITH salib Stefan Bobe 1 and Gerald Schaefer 2,* 1 University of Applied Sciences, Bielefeld, Germany. 2 School of Computing and Informatics,

More information

Color-Based Classification of Natural Rock Images Using Classifier Combinations

Color-Based Classification of Natural Rock Images Using Classifier Combinations Color-Based Classification of Natural Rock Images Using Classifier Combinations Leena Lepistö, Iivari Kunttu, and Ari Visa Tampere University of Technology, Institute of Signal Processing, P.O. Box 553,

More information

JPEG compression of monochrome 2D-barcode images using DCT coefficient distributions

JPEG compression of monochrome 2D-barcode images using DCT coefficient distributions Edith Cowan University Research Online ECU Publications Pre. JPEG compression of monochrome D-barcode images using DCT coefficient distributions Keng Teong Tan Hong Kong Baptist University Douglas Chai

More information

3D Nearest-Nodes Finite Element Method for Solid Continuum Analysis

3D Nearest-Nodes Finite Element Method for Solid Continuum Analysis Adv. Theor. Appl. Mech., Vol. 1, 2008, no. 3, 131-139 3D Nearest-Nodes Finite Element Method for Solid Continuum Analysis Yunhua Luo Department of Mechanical & Manufacturing Engineering, University of

More information

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS HEMANT D. TAGARE. Introduction. Shape is a prominent visual feature in many images. Unfortunately, the mathematical theory

More information

COMPUTATIONAL STATISTICS UNSUPERVISED LEARNING

COMPUTATIONAL STATISTICS UNSUPERVISED LEARNING COMPUTATIONAL STATISTICS UNSUPERVISED LEARNING Luca Bortolussi Department of Mathematics and Geosciences University of Trieste Office 238, third floor, H2bis luca@dmi.units.it Trieste, Winter Semester

More information

Bias-Variance Tradeos Analysis Using Uniform CR Bound. Mohammad Usman, Alfred O. Hero, Jerey A. Fessler and W. L. Rogers. University of Michigan

Bias-Variance Tradeos Analysis Using Uniform CR Bound. Mohammad Usman, Alfred O. Hero, Jerey A. Fessler and W. L. Rogers. University of Michigan Bias-Variance Tradeos Analysis Using Uniform CR Bound Mohammad Usman, Alfred O. Hero, Jerey A. Fessler and W. L. Rogers University of Michigan ABSTRACT We quantify fundamental bias-variance tradeos for

More information

Adaptive Metric Nearest Neighbor Classification

Adaptive Metric Nearest Neighbor Classification Adaptive Metric Nearest Neighbor Classification Carlotta Domeniconi Jing Peng Dimitrios Gunopulos Computer Science Department Computer Science Department Computer Science Department University of California

More information

Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude

Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude A. Migukin *, V. atkovnik and J. Astola Department of Signal Processing, Tampere University of Technology,

More information

SEMI-BLIND IMAGE RESTORATION USING A LOCAL NEURAL APPROACH

SEMI-BLIND IMAGE RESTORATION USING A LOCAL NEURAL APPROACH SEMI-BLIND IMAGE RESTORATION USING A LOCAL NEURAL APPROACH Ignazio Gallo, Elisabetta Binaghi and Mario Raspanti Universitá degli Studi dell Insubria Varese, Italy email: ignazio.gallo@uninsubria.it ABSTRACT

More information

Data Distortion for Privacy Protection in a Terrorist Analysis System

Data Distortion for Privacy Protection in a Terrorist Analysis System Data Distortion for Privacy Protection in a Terrorist Analysis System Shuting Xu, Jun Zhang, Dianwei Han, and Jie Wang Department of Computer Science, University of Kentucky, Lexington KY 40506-0046, USA

More information

An Evaluation of the Performance of RANSAC Algorithms for Stereo Camera Calibration

An Evaluation of the Performance of RANSAC Algorithms for Stereo Camera Calibration Tina Memo No. 2000-009 Presented at BMVC 2000 An Evaluation of the Performance of RANSAC Algorithms for Stereo Camera Calibration A. J. Lacey, N. Pinitkarn and N. A. Thacker Last updated 21 / 02 / 2002

More information

Head Frontal-View Identification Using Extended LLE

Head Frontal-View Identification Using Extended LLE Head Frontal-View Identification Using Extended LLE Chao Wang Center for Spoken Language Understanding, Oregon Health and Science University Abstract Automatic head frontal-view identification is challenging

More information

Element Quality Metrics for Higher-Order Bernstein Bézier Elements

Element Quality Metrics for Higher-Order Bernstein Bézier Elements Element Quality Metrics for Higher-Order Bernstein Bézier Elements Luke Engvall and John A. Evans Abstract In this note, we review the interpolation theory for curvilinear finite elements originally derived

More information

Camera Calibration Using Line Correspondences

Camera Calibration Using Line Correspondences Camera Calibration Using Line Correspondences Richard I. Hartley G.E. CRD, Schenectady, NY, 12301. Ph: (518)-387-7333 Fax: (518)-387-6845 Email : hartley@crd.ge.com Abstract In this paper, a method of

More information

Algebraic Iterative Methods for Computed Tomography

Algebraic Iterative Methods for Computed Tomography Algebraic Iterative Methods for Computed Tomography Per Christian Hansen DTU Compute Department of Applied Mathematics and Computer Science Technical University of Denmark Per Christian Hansen Algebraic

More information

CHAPTER 5 PROPAGATION DELAY

CHAPTER 5 PROPAGATION DELAY 98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,

More information

3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times 3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

More information

Fountain Codes Based on Zigzag Decodable Coding

Fountain Codes Based on Zigzag Decodable Coding Fountain Codes Based on Zigzag Decodable Coding Takayuki Nozaki Kanagawa University, JAPAN Email: nozaki@kanagawa-u.ac.jp Abstract Fountain codes based on non-binary low-density parity-check (LDPC) codes

More information

A STRUCTURAL OPTIMIZATION METHODOLOGY USING THE INDEPENDENCE AXIOM

A STRUCTURAL OPTIMIZATION METHODOLOGY USING THE INDEPENDENCE AXIOM Proceedings of ICAD Cambridge, MA June -3, ICAD A STRUCTURAL OPTIMIZATION METHODOLOGY USING THE INDEPENDENCE AXIOM Kwang Won Lee leekw3@yahoo.com Research Center Daewoo Motor Company 99 Cheongchon-Dong

More information

AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS

AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS Emre Alpman Graduate Research Assistant Aerospace Engineering Department Pennstate University University Park, PA, 6802 Abstract A new methodology

More information

Artistic Stylization of Images and Video Part III Anisotropy and Filtering Eurographics 2011

Artistic Stylization of Images and Video Part III Anisotropy and Filtering Eurographics 2011 Artistic Stylization of Images and Video Part III Anisotropy and Filtering Eurographics 2011 Hasso-Plattner-Institut, University of Potsdam, Germany Image/Video Abstraction Stylized Augmented Reality for

More information

8.B. The result of Regiomontanus on tetrahedra

8.B. The result of Regiomontanus on tetrahedra 8.B. The result of Regiomontanus on tetrahedra We have already mentioned that Plato s theory that the five regular polyhedra represent the fundamental elements of nature, and in supplement (3.D) to the

More information

CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS

CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS CHAPTER 4 CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS 4.1 Introduction Optical character recognition is one of

More information

1.2 Numerical Solutions of Flow Problems

1.2 Numerical Solutions of Flow Problems 1.2 Numerical Solutions of Flow Problems DIFFERENTIAL EQUATIONS OF MOTION FOR A SIMPLIFIED FLOW PROBLEM Continuity equation for incompressible flow: 0 Momentum (Navier-Stokes) equations for a Newtonian

More information

CLUSTER HEAD SELECTION USING RF SIGNAL STRENGTH. Scott Fazackerley, Alan Paeth, Ramon Lawrence

CLUSTER HEAD SELECTION USING RF SIGNAL STRENGTH. Scott Fazackerley, Alan Paeth, Ramon Lawrence CLUSTER HEAD SELECTION USING RF SIGNAL STRENGTH Scott Fazackerley, Alan Paeth, Ramon Lawrence University of British Columbia Okanagan scott.fazackerley@alumni.ubc.ca, alan.paeth@ubc.ca, ramon.lawrence@ubc.ca

More information

Divide and Conquer Kernel Ridge Regression

Divide and Conquer Kernel Ridge Regression Divide and Conquer Kernel Ridge Regression Yuchen Zhang John Duchi Martin Wainwright University of California, Berkeley COLT 2013 Yuchen Zhang (UC Berkeley) Divide and Conquer KRR COLT 2013 1 / 15 Problem

More information

A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings

A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings Scientific Papers, University of Latvia, 2010. Vol. 756 Computer Science and Information Technologies 207 220 P. A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings

More information

CHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL

CHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL 2.1 Topology Control in Wireless Sensor Networks Network topology control is about management of network topology to support network-wide requirement.

More information

Nonparametric regression using kernel and spline methods

Nonparametric regression using kernel and spline methods Nonparametric regression using kernel and spline methods Jean D. Opsomer F. Jay Breidt March 3, 016 1 The statistical model When applying nonparametric regression methods, the researcher is interested

More information

A New Online Clustering Approach for Data in Arbitrary Shaped Clusters

A New Online Clustering Approach for Data in Arbitrary Shaped Clusters A New Online Clustering Approach for Data in Arbitrary Shaped Clusters Richard Hyde, Plamen Angelov Data Science Group, School of Computing and Communications Lancaster University Lancaster, LA1 4WA, UK

More information