Summary. Reconstruction of data from non-uniformly spaced samples
|
|
- Dorothy Harrington
- 5 years ago
- Views:
Transcription
1 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 Suary We address the question of whether or not there always is a bandwidth benefit in non-unifor spatial sapling of geophysical data. Answering this question is, for exaple, iportant in the context of rando sapling of seisic data, as it recently has been shown that there can be such a benefit under certain assuptions on the spectral structure of the data. Assue that a fixed nuber of sensors are placed either uniforly (i.e., on a regular grid) or nonuniforly (either randoly distributed or following any suitable non-unifor sapling schee). The bandwidth supported by unifor sapling is that of the yquist wavenubers corresponding to the sapling distances on the regular grid. The bandwidth supported by the nonunifor sapling we propose here refers to the axiu bandwidth of data that could be reconstructed by a linear operator at arbitrary sapling locations within the survey area without unacceptably high reconstruction error. Without aking further assuptions on the spectral structure of the data, i.e., especially without assuing sparseness of the data spectru, we will argue that we see no such bandwidth benefit in non-unifor sapling in the exaples we have investigated. Introduction Chen and Allebach (1987) set out to find a sapling location set aong a candidate group of such sets that is optial for data reconstruction over a given class of bandliited broadband signals. If the bandwidth is given, the sapling locations are usually designed to be unifor with the sapling location distances such that the corresponding yquist wavenubers are greater than the assued bandwidth. However, in any applications it is ipossible to place sensors at regular locations. The theory of copressive sapling even requires randoly distributed sensors (Candès et al., 2004; Hennenfent and Herrann, 2008; Moldoveanu, 2010). We consider here a reverse proble; that of finding the axiu bandwidth supported by a given set of non-unifor sapling locations. We consider that a set of sapling locations supports broadband signals of a certain bandwidth if the data can be reconstructed at non-sapling points within an acceptable accuracy. Hence, it akes sense to look for the axiu bandwidth supported by the set of sapling locations. To eliinate edge effects, the area of data reconstruction could be restricted to an inner part of the set of data sapling locations. To test whether a certain bandwidth is supported by the sapling locations, we suggest proceeding as follows: firstly, copute the axiu of the iniu ean-square interpolation error for a range of reconstruction locations within the selected subarea of the point set. Secondly, if this axiu is lower than the acceptable reconstruction error, flag the bandwidth as being supported by the set of sapling locations. If this test is done in an exhaustive search over bandwidth, the bandwidth doain can be split into a region that the set of sapling locations supports and a copleentary region that it fails to support. The approach developed here is valid for any diensionality of the sapling proble, while a typical exaple would be twodiensional spatial sapling of geophysical data. All exaples we give to illustrate the approach will be spatially two-diensional for ease of visualization. Reconstruction of data fro non-uniforly spaced saples We wish to reconstruct the signal fro non-uniforly spaced sapling locations by a linear convolution-like process; the signal at non-sapling locations will be estiated by a weighted suation of existing saples in the direct neighborhood of the reconstruction location. The weights, of course, ust be selected such that the reconstruction error is inial. Optial reconstruction of one-diensional signals by a weighted suation of data sapled non-uniforly is given by Yen s 4 th theore (1956). Chen and Allebach showed an extension of Yen s approach to two-diensional sapling, which can be easily extended to any nuber of diensions. The reconstruction ethod described by Yen s 4 th theore is optial for spatially broadband signals (Özbek et al., 2010); the assued signal bandwidth is a critical paraeter. In all the work entioned above, the signal bandwidth was assued known and fixed, such that, depending on the sapling locations, a reconstruction ight be possible or not. For infinitely long one-diensional data, it is well known that the axiu bandwidth supported by the sapling locations can be estiated as the yquist wavenuber corresponding to the average sapling distances (Beutler, 1974; Jerri, 1977). Moore and Ferber (2008) added a bandwidth optiization strategy to the reconstruction of n- diensional non-uniforly sapled seisic data as a way of finding the axiu bandwidth supported by the sapling locations. In this paper, we first show that the axiu bandwidth supported by non-unifor sapling locations is not uniquely defined. In fact, the wavenuber doain can be split into a region around the zero wavenuber supported by the sapling locations, and a copleentary region that is not supported. We also show that, for broadband data, there is no significant bandwidth SEG San Antonio 2011 Annual Meeting 57
2 gain in non-unifor sapling copared to unifor sapling. Miniu ean-square error interpolation operator As stated above, we wish to reconstruct data at nonsapling locations using a weighted suation over data in the direct vicinity of the non-sapling location. The weights w ( w1, w2,, w ) T for a reconstruction operator applied to the data d ( d, d2,, d ) T, with the data represented by a function d( x ) of an M-diensional sapling location vector. The reconstruction by eans of weighted suation can be atheatically expressed as ˆ T d w d. We select here the iniu ean-square error reconstruction operator (Chen and Allebach, 1987; Moore and Ferber, 2008), that depends on the sapling locations, the interpolation location, and the assued data bandwidth (hence used as the bandwidth paraeter of the Yen-4 operator), but not specifically on the details of the data or its wavenuber spectru. The reconstruction operator can be coputed fro the atrix/vector equation 1 w( k ) S ( k ) r( k ), with k as the bandwidth paraeter, whose coponents are the axiu wavenubers in each of the M diensions of sapling. The sapling location atrix that ust be inverted to get the reconstruction operator is M sin 2 k( xi, x j, ) S( k ) si, j, with si, j. 2 k ( x x ) 1 i, j, Siilarly, the interpolation vector, r, also a product of sinc functions, depends on the differences between sapling locations and the output location for data reconstruction, and is given by M sin 2 k( xi, y ) T r( k ) ( r1,..., r), with ri. 2 k ( x y ) 1 i, The iniu ean-square error (MMSE) can now be coputed as: MMSE Exaples 1 w r. i i i 1 As a first exaple, we show here a bandwidth support spectru for a siple unifor sapling schee, consisting of 25 sapling locations on a unifor sapling grid of 12.5 by For a range of x- and y- wavenubers, we copute the axiu value of the MMSE of the corresponding reconstruction operator, the axiu being taken over the central survey area. These axia as function of the x- and y-wavenubers are displayed colorcoded in Figure 1B. The wavenubers reside in the range of zero to 0.1 1/, for both coordinate axes of the sapling schee. Only positive wavenubers, i.e. one quadrant of Figure 1: Bandwidth support spectru (B) for 25 sensors on a unifor by grid. The lower wavenubers below / are well supported, with a transition region before the non-supported wavenuber (greater than /) appear. The left side of Figure (A) shows a non-quadratic bandwidth box and how it relates to a single entry in the bandwidth support spectru. SEG San Antonio 2011 Annual Meeting 58
3 the full bandwidth support wavenuber spectru, are displayed due to the inherent syetry. The corresponding axiu MMSE values are displayed on a logarithic color-coded scale, such that deep blue colors denote very sall reconstruction errors, while red colors denote large errors. For coparison, we indicate the yquist wavenubers of the infinite regular grid (i.e., kx = ky = 0.04 /) by a blue dot. Figure 1A clearly shows that the wavenuber doain splits into two regions: one region of low wavenubers, supported by the non-unifor sapling schee, and the other region with larger wavenubers that are not supported. There is also a transition zone between these regions. The bandwidth support spectru should be interpreted as follows: assue a bandwidth of the data characterized by two wavenubers in spatial x- and y- directions, for exaple kx = / and ky = /, i.e., one assues that the data resides in the wavenuber box highlighted in green color in Figure 1A. For this bandwidth box there is one entry in the bandwidth support spectru highlighted by the blue dot indicated by the green arrow. This particular schee of 25 sensors on a by grid does not support this bandwidth box well, as it is in the transition zone fro good to poor support. The yquist wavenubers of the by unifor grid, i.e. kx = ky = /, are also on the edge of the bandwidth support area due to the fact that only 25 sensor locations are available for data reconstruction. The size of the transition zone will shrink with a larger nuber of sensors, which would allow use of a ore accurate interpolation operator. As a second exaple we show a siple non-unifor sapling schee, also consisting of 25 sapling locations derived fro the unifor sapling grid of by used above by rando variations around the unifor sapling locations. For the sae range of x- and y- wavenubers we again copute the axiu value of the MMSE of the corresponding reconstruction operator, the axiu being taken over the central reconstruction locations (inside the red rectangle in Figure 2A). These axia as a function of the x- and y- wavenuber are again displayed color-coded in Figure 2B. For coparison we indicate again the yquist wavenubers of the underlying regular grid (i.e. kx = ky = /) by a blue dot. The diagra depicted in Figure 2B clearly shows that the wavenuber doain again splits into two regions: one region with low wavenubers, clearly supported by the non-unifor sapling schee, and the other region with larger wavenubers that are not supported. There is also a transition zone between these regions. The bandwidth support region is larger than that of the unifor sapling schee used above. Higher wavenubers in one direction, ky = 0.08 for exaple, can be supported if the wavenuber of the other direction is reduced, kx = 0.01 for exaple, see yellow dot in Figure 2B, such that non-unifor Figure 2: Bandwidth support spectru (Figure 2B) for a non-unifor sapling schee (sensor locations depicted in Figure 2A), created by rando variations around the unifor grid used in the first exaple. The axiu ean square error for the linear reconstruction operators is coputed over the inner part of the survey area inside the red rectangle in Figure 2A. SEG San Antonio 2011 Annual Meeting 59
4 sapling could be regarded as being ore versatile than the unifor sapling schees. With this type of nonunifor sapling the wavenuber transition zone sees to follow a curve in which the product of the corresponding wavenubers is the product of the wavenubers of the 2 2 underlying unifor grid ( k k 0.04 ). The bandwidth corresponding to the yquist wavenubers of the underlying unifor grid however is not better supported by this non-unifor sapling schee, as it still sits on the edge of the transition zone fro good to poor bandwidth support. As a third exaple, we look at another non-unifor sapling schee for 25 sensors placed in the sae survey area as before, but this tie using Haersley points (Tien-Tsin et al., 1997), depicted in Figure 3A, to define the sensor locations. These points for a well-known lowdiscrepancy sequence and have been used, for exaple, for quasi-monte Carlo integration. The bandwidth support spectru, Figure 3B, now is ore anisotropic and soewhat larger than that of the rando sapling schee above, but fundaentally siilar, and again not showing a bandwidth benefit as copared to unifor sapling (blue dot in Figure 3B). x y Conclusions For spatially broadband signals, i.e., without assuing anything else about the signals other than bandliitation, we presented a technique to calculate the axiu bandwidths that a non-unifor sapling schee supports. We introduced the so-called bandwidth support spectru as a function that contains the axiu iniu ean square reconstruction error of the corresponding optiu linear reconstruction operator, the Yen-4 operator, as a function of those liiting wavenubers. The bandwidth support spectru splits the wavenuber plane into three distinct areas; those low-wavenubers well supported by the sapling schee and those higher wavenubers clearly not supported, with a transition zone between. We showed that non-unifor sapling schees can be ore versatile than unifor schees, as they can support wavenubers that a particular unifor schee with the sae nuber of sensor locations cannot support. However, we also showed, that under the restriction of an identical nuber of sensor locations in the survey area, the nonunifor sapling schees show no bandwidth gain beyond that of the yquist wavenubers associated with the unifor sapling schee. Figure 3: Bandwidth support spectru (Figure 3B) for a non-unifor sapling schee using Haersley points (sensor locations depicted in Figure 3A), created by rando variations around the unifor grid used in the first exaple. The axiu ean square error for the linear reconstruction operators is coputed over the inner part of the survey area inside the red rectangle in Fig. 3A. SEG San Antonio 2011 Annual Meeting 60
5 EDITED REFERECES ote: This reference list is a copy-edited version of the reference list subitted by the author. Reference lists for the 2011 SEG Technical Progra Expanded Abstracts have been copy edited so that references provided with the online etadata for each paper will achieve a high degree of linking to cited sources that appear on the Web. REFERECES Beutler, F. J., 1974, Recovery of randoly sapled signals by siple interpolators: Inforation and Control, 26, , doi: /s (74) Candès, E. J., J. Roberg, and T. Tao, 2006, Robust uncertainty principles: exact signal reconstruction fro highly incoplete frequency inforation: IEEE Transactions on Inforation Theory, 52, , doi: /tit Chen, D. S., and J. P. Allebach, 1987, Analysis of error in reconstruction of two-diensional signals fro irregularly spaced saples: IEEE Transactions on Acoustics, Speech and Signal Processing, 35, Hennenfent, G., and F. J. Herrann, 2008, Siply denoise: wavefield reconstruction via jittered undersapling: Geophysics, 75, no. 3, V19 V28, doi: / Jerri, A. J., 1977, The Shannon sapling theore its various extensions and applications: a tutorial review: Proceedings of the IEEE, 65, , doi: /proc Moldoveanu,., 2010, Rando sapling: a new strategy for arine acquisition: 80th Annual International Meeting, SEG, Expanded Abstracts, Moore, I., and R.-G. Ferber, 2008, Bandwidth optiization for copact Fourier interpolation: 70th Conference and Exhibition, EAGE, Extended Abstracts. Özbek, A., M. Vassallo, A. K. Özdeir, D. Molteni, and Y. K. Alp, 2010, Anti-alias optial interpolation with priors: 80th Annual International Meeting, SEG, Expanded Abstracts, Tien-Tsin, W., W.-S. Luk, and P.-A. Heng, 1997, Sapling with Haersley and Halton points: Journal of Graphics Tools, 2, Yen, J. L., 1956, On non unifor sapling of bandliited signals: IRE Transactions on Circuit Theory, 3, , doi: /tct SEG San Antonio 2011 Annual Meeting 61
( ) ( ) ( ) ( ), Main Menu
Anti-alias optial interpolation with priors Ali Özbek*, Schluberger; Massiiliano Vassallo, WesternGeco; A. Keal Özdeir, WesternGeco; Daniele Molteni 1, WesternGeco; Yaşar Keal Alp 2, Schluberger. Suary
More information( ) ( ) ( ) = ( ) Summary
Where is the center of a ulti-depth arine source arra? Jon-Fredrik Hopperstad*, Robert Laws, and Ed Kragh, Schluberger Cabridge Research Suar In previous work, we discussed how to design a arine source
More informationClustering. 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 informationA Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction
MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, August 23, 2004, 12:38 PM) PART III: CHAPTER ONE DIFFUSERS FOR CGH S
COPUTER GEERATED HOLOGRAS Optical Sciences 67 W.J. Dallas (onday, August 3, 004, 1:38 P) PART III: CHAPTER OE DIFFUSERS FOR CGH S Part III: Chapter One Page 1 of 8 Introduction Hologras for display purposes
More informationGenerating Mechanisms for Evolving Software Mirror Graph
Journal of Modern Physics, 2012, 3, 1050-1059 http://dx.doi.org/10.4236/jp.2012.39139 Published Online Septeber 2012 (http://www.scirp.org/journal/jp) Generating Mechaniss for Evolving Software Mirror
More informationG045 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 informationThe 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 informationELEVATION 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 informationEvaluation 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 informationDetection 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 informationImage 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 informationA Learning Framework for Nearest Neighbor Search
A Learning Fraework for Nearest Neighbor Search Lawrence Cayton Departent of Coputer Science University of California, San Diego lcayton@cs.ucsd.edu Sanjoy Dasgupta Departent of Coputer Science University
More informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More information2013 IEEE Conference on Computer Vision and Pattern Recognition. Compressed Hashing
203 IEEE Conference on Coputer Vision and Pattern Recognition Copressed Hashing Yue Lin Rong Jin Deng Cai Shuicheng Yan Xuelong Li State Key Lab of CAD&CG, College of Coputer Science, Zhejiang University,
More informationEffects 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 informationOptimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model
1746 J. Opt. Soc. A. A/ Vol. 22, No. 9/ Septeber 2005 Y. J. Xiao and Y. F. Li Optiized stereo reconstruction of free-for space curves based on a nonunifor rational B-spline odel Yi Jun Xiao Departent of
More informationA Learning Framework for Nearest Neighbor Search
A Learning Fraework for Nearest Neighbor Search Lawrence Cayton Departent of Coputer Science University of California, San Diego lcayton@cs.ucsd.edu Sanjoy Dasgupta Departent of Coputer Science University
More informationEfficient Learning of Generalized Linear and Single Index Models with Isotonic Regression
Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression Sha M. Kakade Microsoft Research and Wharton, U Penn skakade@icrosoft.co Varun Kanade SEAS, Harvard University
More informationEFFICIENT 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 informationOn 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 informationGromov-Hausdorff Distance Between Metric Graphs
Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value
More informationDistributed Multicast Tree Construction in Wireless Sensor Networks
Distributed Multicast Tree Construction in Wireless Sensor Networks Hongyu Gong, Luoyi Fu, Xinzhe Fu, Lutian Zhao 3, Kainan Wang, and Xinbing Wang Dept. of Electronic Engineering, Shanghai Jiao Tong University,
More informationI 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 informationMinimax Sensor Location to Monitor a Piecewise Linear Curve
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location to Monitor a Piecewise Linear Curve To M. Cavalier The Pennsylvania State University University Par, PA 680 Whitney A. Conner
More informationDepth 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 informationDerivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router
Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of
More informationA 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 informationStructural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl.
Structural Balance in Networks An Optiizational Approach Andrej Mrvar Faculty of Social Sciences University of Ljubljana Kardeljeva pl. 5 61109 Ljubljana March 23 1994 Contents 1 Balanced and clusterable
More informationCassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards
Unit 1 Congruence, Proof, and Constructions Doain: Congruence (CO) Essential Question: How do properties of congruence help define and prove geoetric relationships? Matheatical Practices: 1. Make sense
More information6.1 Topological relations between two simple geometric objects
Chapter 5 proposed a spatial odel to represent the spatial extent of objects in urban areas. The purpose of the odel, as was clarified in Chapter 3, is ultifunctional, i.e. it has to be capable of supplying
More informationA 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 informationGeo-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 informationQuantitative 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 informationError 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 informationGuillotine subdivisions approximate polygonal subdivisions: Part III { Faster polynomial-time approximation schemes for
Guillotine subdivisions approxiate polygonal subdivisions: Part III { Faster polynoial-tie approxiation schees for geoetric network optiization Joseph S. B. Mitchell y April 19, 1997; Last revision: May
More informationMulti Packet Reception and Network Coding
The 2010 Military Counications Conference - Unclassified Progra - etworking Protocols and Perforance Track Multi Packet Reception and etwork Coding Aran Rezaee Research Laboratory of Electronics Massachusetts
More informationUsing 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 informationOPTIMAL 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 informationDiscrete Fourier Transform
Discrete Fourier Transfor This is the first tutorial in our ongoing series on tie series spectral analysis. In this entry, we will closely exaine the discrete Fourier transfor (aa DFT) and its inverse,
More informationModal Masses Estimation in OMA by a Consecutive Mass Change Method.
Modal Masses Estiation in OMA by a Consecutive Mass Change Method. F. Pelayo University of Oviedo, Departent of Construction and Manufacturing Engineering, Gijón, Spain M. López-Aenlle University of Oviedo,
More informationCOLOR 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 informationReal 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 informationEE 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 informationIdentifying 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 informationMAC schemes - Fixed-assignment schemes
MAC schees - Fixed-assignent schees M. Veeraraghavan, April 6, 04 Mediu Access Control (MAC) schees are echaniss for sharing a single link. MAC schees are essentially ultiplexing schees. For exaple, on
More informationSet 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 informationHomework 1. An Introduction to Neural Networks
Hoework An Introduction to Neural Networks -785: Introduction to Deep Learning Spring 09 OUT: January 4, 09 DUE: February 6, 09, :59 PM Start Here Collaboration policy: You are expected to coply with the
More informationNovel 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 informationA novel configuration method of the acoustic random beamforming array for multiple wideband moving sound source localization
INTER-NOISE 6 A novel configuration ethod of the acoustic rando beaforing array for ultiple wideband oving sound source localization Zhihong LIU ; Huichao LI ;Chujie YI 3 Qingdao Technological University,
More informationPOSITION-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 informationAscending 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 informationPrivacy-preserving String-Matching With PRAM Algorithms
Privacy-preserving String-Matching With PRAM Algoriths Report in MTAT.07.022 Research Seinar in Cryptography, Fall 2014 Author: Sander Sii Supervisor: Peeter Laud Deceber 14, 2014 Abstract In this report,
More informationSmarter 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 informationA Survey on Sub-Nyquist Sampling
A Survey on Sub-Nyquist Sapling Chien-Chia Chen ABSTRACT This paper gives a survey of sub-nyquist sapling. Sub-Nyquist sapking is of great interest in the environent that sapling by Nyquist rate is infeasible
More information1 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 informationPROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS WITH A SINGLE LASER RANGE FINDER
nd International Congress of Mechanical Engineering (COBEM 3) Noveber 3-7, 3, Ribeirão Preto, SP, Brazil Copyright 3 by ABCM PROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS
More informationFeature Based Registration for Panoramic Image Generation
IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh
More informationSurvivability 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 informationGalois 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 informationAGV 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 informationInvestigation 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 informationData & 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 informationThe Boundary Between Privacy and Utility in Data Publishing
The Boundary Between Privacy and Utility in Data Publishing Vibhor Rastogi Dan Suciu Sungho Hong ABSTRACT We consider the privacy proble in data publishing: given a database instance containing sensitive
More informationLeveraging Relevance Cues for Improved Spoken Document Retrieval
Leveraging Relevance Cues for Iproved Spoken Docuent Retrieval Pei-Ning Chen 1, Kuan-Yu Chen 2 and Berlin Chen 1 National Taiwan Noral University, Taiwan 1 Institute of Inforation Science, Acadeia Sinica,
More informationTheoretical 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 informationAn Efficient Approach for Content Delivery in Overlay Networks
An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr
More informationEfficient and Strategyproof Spectrum Allocations in Multi-Channel Wireless Networks
Efficient and Strategyproof Spectru Allocations in Multi-Channel Wireless Networks Ping Xu, Xiang-Yang Li, Senior Meber, IEEE, ShaoJie Tang, and JiZhong Zhao Abstract In this paper, we study the spectru
More informationComputer 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 informationA Study of the Relationship Between Support Vector Machine and Gabriel Graph
A Study of the Relationship Between Support Vector Machine and Gabriel Graph Wan Zhang and Irwin King {wzhang, king}@cse.cuhk.edu.hk Departent of Coputer Science & Engineering The Chinese University of
More informationMinimax Sensor Location in the Plane
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location in the Plane To M. Cavalier The Pennsylvania State University University Par, PA 680 Enrique del Castillo The Pennsylvania
More informationGenetic-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 informationDesigning 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 informationFair 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 informationOblivious 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 informationResearch 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 informationJoint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points
Joint Measureent- and Traffic Descriptor-based Adission Control at Real-Tie Traffic Aggregation Points Stylianos Georgoulas, Panos Triintzios and George Pavlou Centre for Counication Systes Research, University
More informationA 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 informationApproximate String Matching with Reduced Alphabet
Approxiate String Matching with Reduced Alphabet Leena Salela 1 and Jora Tarhio 2 1 University of Helsinki, Departent of Coputer Science leena.salela@cs.helsinki.fi 2 Aalto University Deptartent of Coputer
More informationRanking Spatial Data by Quality Preferences
1 Ranking Spatial Data by Quality Preferences Man Lung Yiu, Hua Lu, Nikos Maoulis, and Michail Vaitis Abstract A spatial preference query ranks objects based on the qualities of features in their spatial
More informationQUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS
QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755
More informationCarving Differential Unit Test Cases from System Test Cases
Carving Differential Unit Test Cases fro Syste Test Cases Sebastian Elbau, Hui Nee Chin, Matthew B. Dwyer, Jonathan Dokulil Departent of Coputer Science and Engineering University of Nebraska - Lincoln
More informationDifferent 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 informationOPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS
OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS ADRIAN DEACONU Transilvania University of Brasov, Roania Abstract A linear tie
More informationEfficient 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 informationTALLINN 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 informationA Psychovisual Threshold for Generating Quantization Process in Tchebichef Moment Image Compression
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/617715 A Psychovisual Threshold for Generating Quantization Process in Tchebichef oent Iage
More informationCollaborative 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 informationThe Application of Bandwidth Optimization Technique in SLA Negotiation Process
The Application of Bandwidth Optiization Technique in SLA egotiation Process Srećko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia
More informationA Hybrid Network Architecture for File Transfers
JOURNAL OF IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO., JANUARY 9 A Hybrid Network Architecture for File Transfers Xiuduan Fang, Meber, IEEE, Malathi Veeraraghavan, Senior Meber,
More informationMiPPS: A Generative Model for Multi-Manifold Clustering
Manifold Learning and its Applications: Papers fro the AAAI Fall Syposiu (FS-9-) MiPPS: A Generative Model for Multi-Manifold Clustering Oluwasani Koyejo and Joydeep Ghosh Electrical and Coputer Engineering
More informationTHE 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 informationImplementation of fast motion estimation algorithms and comparison with full search method in H.264
IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.3, March 2008 139 Ipleentation of fast otion estiation algoriths and coparison with full search ethod in H.264 A.Ahadi, M.M.Azadfar
More informationMedical 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 informationAN APPROACH FOR THE SEMANTICALLY CORRECT INTEGRATION OF A DTM AND 2D GIS VECTOR DATA
AN APPROACH FOR THE SEMANTICALLY CORRECT INTEGRATION OF A DTM AND 2D GIS VECTOR DATA A. Koch Institute of Photograetry and GeoInforation (IPI), University of Hannover, Gerany Nienburger Straße 1, 30167
More informationA Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design
A Fast Multi-Obective Genetic Algorith for Hardware-Software Partitioning In Ebedded Syste Design 1 M.Jagadeeswari, 2 M.C.Bhuvaneswari 1 Research Scholar, P.S.G College of Technology, Coibatore, India
More informationPlanet 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 informationShortest 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 informationBrian 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 informationAutomatic 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