ARRAY ANTENNA DIAGNOSTICS WITH THE 3D RECONSTRUCTION ALGORITHM

Size: px
Start display at page:

Download "ARRAY ANTENNA DIAGNOSTICS WITH THE 3D RECONSTRUCTION ALGORITHM"

Transcription

1 ARRAY ANTENNA DIAGNOSTICS WITH THE 3D RECONSTRUCTION ALGORITHM Cecilia Cappellin 1, Peter Meincke 1, Sergey Pinenko 2, Erik Jørgensen 1 1 TICRA, Læderstræde 34, DK-1201 Copenhagen, Denmark 2 DTU Elektro, Technical Uniersity of Denmark, Ørsteds Plads, Bilding 348, 2800 Kgs. Lyngby, Denmark ABSTRACT The 3D reconstrction algorithm is applied to a slotted waegide array measred at the DTU-ESA Spherical Near-Field Antenna Test Facility. One slot of the array is coered by condctie tape and an error is present in the array excitation. Reslts show the accracy obtainable by the 3D reconstrction algorithm. Considerations on the measrement sampling, the obtainable spatial resoltion, and the possibility of taking fll adantage of the reconstrction geometry are proided. Keywords: Array, Diagnostics, Resoltion, Spherical Wae Expansion, Inerse Method of Moments 1. Introdction Accrate and general antenna diagnostics techniqes to identify, from the radiated measred field, the electrical and mechanical errors affecting the antenna nder test are of high importance for the antenna measrements commnity. Microwae holography, based on the wellestablished relation between the antenna far-field and the isible region of the plane wae spectrm [1], has been widely sed for this prpose. The algorithm is general, simple and comptationally ery fast bt has a limit in the spatial resoltion of the compted extreme near-field, since the inisible region of the plane wae spectrm is always neglected. The techniqe presented in [2] allows the reconstrction of part of the inisible region of the plane wae spectrm, ths proiding higher resoltion in the compted extreme near-field, bt shows some limitation when dealing with large antennas and typical measrement noise. To oercome these limits, a new class of antenna diagnostics algorithm has been introdced in the last decade. These new methods are based on the discretization of integral eqations, see [3]-[9], which are deried by placing nknown eqialent electric and magnetic crrents on a srface conformal to the antenna and reqiring that the crrents radiate the measred field otside the srface and zero field inside the srface. A discrete set of eqations are obtained by sing a standard Method of Moments discretization, e.g., RWG fnctions on flat trianglar facets [5], or higher-order basis fnctions on cred srfaces [8]. The latter choice has shown to proide better accracy and lower memory reqirements [8]. Althogh more demanding in terms of memory sage and comptation time as compared to microwae holography, these new methods allow reconstrcting the field on an arbitrary 3D srface enclosing the antenna. The 3D reconstrction algorithm deeloped by TICRA in [8]-[9] is implemented in the commercial software DIATOOL. The identification of array element failre is of particlar interest for antenna diagnostics, and mainly docmented in the literatre throgh experimental reslts, see for example [13]. Diagnostics of array failre, howeer, focses often on reslts achieed by microwae holography, which is intrinsically limited in accracy. Thogh noticeable improements were recently achieed by [14], all proposed techniqes assme the knowledge of the array element factor, either from a dedicated measrement or a software simlation. To or knowledge, the enhanced capabilities of the 3D reconstrction algorithm on array diagnostics hae not been stdied in detail yet. The prpose of this work is ths to stdy the accracy achieable by the 3D reconstrction algorithm when dealing with a slotted waegide array of which measred data are aailable. Considerations on the measrement sampling, the obtainable spatial resoltion, and the possibility of taking fll adantage of the reconstrction geometry will be proided. The paper is organized as follows: Section 2 smmarizes the main featres of the 3D reconstrction algorithm implemented in DIATOOL, Section 3 describes the inestigations performed on a slotted waegide array measred at the DTU-ESA Spherical Near-Field Facility, while conclsions are drawn in Section The 3D Reconstrction Algorithm The higher-order inerse Method of Moments algorithm, [8]-[9], was introdced as an extension of preiosly aailable integral-eqation based reconstrction techniqes. The method comptes the tangential electric and magnetic fields EH, on the reconstrction srface S enclosing an antenna, based on the field measred at discrete points otside the srface.

2 The tangential fields on the reconstrction srface S are obtained by the eqialent electric and magnetic srface crrent densities Js and Ms according to Js nˆ H, (1) Ms nˆ E (2) with ˆn being the otward normal nit ector. These eqialent crrents correspond to Loe s eqialence principle, since they prodce zero field inside S, and are fond by soling the so-called data eqation, which relates the measred data and the nknown srface crrent densities, 3. Slotted Waegide Array The 3D reconstrction was applied to a 6 by 7 slotted waegide array of dimensions 30 cm by 27 cm working at 5.25 GHz, with different row excitations and a condctie tape coering one slot, as shown in Figre 1. E meas 0 LJs K Ms, (3) where 0 is the free space impedance and L and K are integral operators defined in [8]. The a priori information that the fields radiated by the srface crrent densities mst be zero inside S is then enforced as a bondary condition eqation [6] and the correct set of eqialent srface crrent densities is finally fond. The srface of reconstrction is discretized sing crilinear patches of p to forth order. The electric and magnetic srface crrents densities on each patch are expanded in higher order Legendre basis fnctions M M 1 M M 1 X a B a B, (4) m 0 n 0 m 0 n 0 where X [ Js, Ms ], coefficients, M and a and the - and - directions, and a are nknown M are the expansion orders along B and B are the - and -directed higher-order Legendre basis fnctions defined in [8] and [10]. The crrent expansion of Eq. (4) is then inserted in the data eqation of Eq. (3) and the aboe mentioned bondary condition eqation. These copled eqations are finally soled by the iteratie soltion scheme described in [9], which allows one to achiee an accrate soltion by balancing the effects of noise with the reqirement of achieing Loe s crrents. The inerse Method of Moments algorithm in DIATOOL differs from other similar methods [4]-[6] in three important aspects. First, the geometry and nknown crrents are represented by smooth polynomial fnctions. Second, the testing of the bondary condition operator is performed on the actal srface of reconstrction. Third, a new reglarization scheme is employed, in which the data eqation and the bondary condition are treated separately. These differences reslt in improed efficiency, enhanced accracy, and better resoltion properties. Figre 1 The 6 by 7 slotted waegide array in the DTU-ESA Spherical Near-Field Antenna Test Facility. The antenna was measred at the DTU-ESA Spherical Near-Field Antenna Test Facility on a fll sphere, with sampling in t eta and p i eqal to and. respectiely, and a SNR of 70 db. The measrement coordinate system is shown in Figre 1: the origin coincides with the geometrical center of the array, the x- axis is horizontal, the y-axis is ertical and the z-axis points ot of the paper. The distance between slots is 0.67 λ, with λ being the waelength, along the ertical y- axis, and 0.85 λ along the horizontal x-axis. Since the prodct kr o, where k is the waenmber and r o the radis of the antenna minimm sphere, is eqal to 21, one finds that the Spherical Wae Expansion (SWE) of the field radiated by the antenna can be trncated to N=31, according to [12] N kr max 10,3.6 3 o kr o. (5) Once the maximm N is fond, the sampling on the measrement sphere mst at least be eqal to 180 N (6) which becomes Δθ=Δφ=. for N=31. Conseqently, the field measred at the DTU-ESA Facility has an oersampling factor of 2.9 in theta and 1.3 in phi,

3 relatie to the ale of., and proides 7280 field samples distribted oer the measrement sphere. The nmber of measred field samples sets an pper limit for the maximm nmber of nknowns that the 3D reconstrction algorithm can sole. In DIATOOL the maximm nmber of nknowns is approximately eqal to twice the nmber of measrement samples, in the present case arond The nmber of nknowns depends on the nmber of patches sed to mesh the closed srface, on which the crrents are reconstrcted. Moreoer, it depends on the accracy of the polynomial expansion sed to represent the nknown crrents. The polynomial expansion order is atomatically adapted to the electrical size of each patch, leading to the so-called normal accracy. It can, howeer, be increased by an order at a time, by sing en anced, ig or extreme accracy, if necessary. T e normal and en anced settings are in general sfficient when dealing with measred data with 70 db SNR. The maximm dimension of the patches sed in the mesh of the reconstrction is 2 λ. Thogh it is recommended to se as large patches as possible, in order to limit the memory sage and the comptation time, it was fond that the possibility of decreasing the patch dimension plays an important role in the reconstrction capabilities, as it will be discssed in the next paragraph. The reconstrction srface was a box enclosing the slotted waegide array of Figre 1, with sizes 32 cm by 28 cm by 2 cm, with the top face coinciding with the array apertre. First, the maximm dimension of the patches was set to the defalt ale of 2 λ and the en anced accracy was chosen. This gae rise to 30 patches oer the reconstrction box and 4536 nknowns. The amplitde in db of the y-component of the reconstrcted tangential electric field on the top face of the box is shown in Figre 2, together with the sed patches and the location of the coered slot. It is seen that it possible to distingish the 6 by 7 slots and that the radiation on the coered slot location looks different with respect to the rest of the apertre. The length of the patches was then redced to 0.8 λ, which almost coincided with the spacing of the slots along the horizontal axis, and gae rise to 142 patches oer the reconstrction box. By keeping t e en anced accracy the nmber of nknowns became The reslt of the reconstrction is shown in Figre 3. It is seen that the indiidal slots are better resoled when compared to Figre 2, both in the cols and rows, and that the coered slot is now clearly identified. Moreoer, it can be obsered that the slot rows 2 and 3 are strongly excited whereas rows 6 and 7 are ery weak. This is in contradiction with the expected array excitation, which postlates a symmetric excitation relatie to row 4, with row 4 being the one excited the most. This indicates that an error is present in the array feeding network. The reslt gien by the traditional microwae holography on a plane of 32 cm by 28 cm located on the array apertre is shown in Figre 4. While the pictre shows areas of high and low excitation similar to what is shown in Figre 2 and Figre 3, it is eident that the indiidal slots cannot be resoled, and that the resoltion of the 3D reconstrction is far higher than the one proided by microwae holography. Figre 3 - Amplitde of the y-component of the and enhanced accracy. Figre 2 Amplitde of the y-component of the with patch size of 2 λ and enhanced accracy. Figre 4 - Amplitde of the y-component of the tangential electric field from traditional microwae holography.

4 3.1) Effect of Trncated Measrement Sphere and Sampling Density It was then decided to stdy if trncating the measrement sphere and decreasing the nmber of measred samples had an effect on the reconstrcted field. To stdy the measrement trncation effect, the measred sphere was trncated to, ile keeping t e original sampling o in t eta and. in p i. This gae rise to 3280 measred samples. By zero padding the remaining part of the sphere the aailable samples became 5315 and allo ed to reconstrct t e ield it en anced accracy and 0.8 λ for the patch size. The reslt is shown in Figre 5: the reconstrcted field is less accrate than that presented in Figre 3, i.e. the slots start oerlapping, bt still better than Figre 4 since the slots can still roghly be identified. The trncated sp ere as t en redced to and respectiely, always zero padding the remaining part of the sphere. The reconstrction was performed again with 0.8 λ and it en anced accracy and it as obsered that with 60, see Figre 6, slots cold no longer be resoled and the reslt looked similar to the microwae holography pictre of Figre 4. By inspecting the measred field pattern, it was fond that or t eta elonging to - and to - t e lowest ale of the co-polar component was -35 db from the peak, while for theta belonging to - it became eqal to -30 db. Figre 6 - Amplitde of the y-component of the To stdy the measrement sampling effect, the SWE of the original measred field was sed to compte the field on a fll sp ere it sampling in t eta and p i o.. This ale corresponds to an oersampling factor of 1.6 relatie to t e minimm sampling o.. This prodced 5100 field samples on a fll sphere, which allowed one to se again t e en anced accracy and 0.8 λ of patch size. The reslt of the reconstrction is shown in Figre 7. Figre 5 - Amplitde of the y-component of the Figre 7 - Amplitde of the y-component of the, enhanced accracy, fll sphere data, and oersampling of 1.6. It is seen that all slots are identified and that the reslt almost coincides with that of Figre 3. As long as fll sphere data is aailable, with a sampling according to Eqs. (5)-(6), the sampling does not play a key role in the reconstrction. T e sp ere it. sampling as t en trncated to., giing rise to measred points and ths approximately 4800 possible nknowns. To decrease the nmber of nknowns of the reconstrction, the patch size was kept eqal to 0.8 λ while the accracy as set to normal, generating nkno ns. T e reslt is shown in Figre 8.

5 resoled and the reslt almost coincides with that proided by microwae holography. Figre 8 - Amplitde of the y-component of the If we compare it with Figre 4 and Figre 6 we can see that the pictres are ery similar. This means that a lower oersampling, combined with a trncated sphere, affects the resoltion achieable with the 3D reconstrction, prodcing reslts almost eqialent with the traditional microwae holography. This conclsion is also confirmed by the reslts presented in [11], where the 3D reconstrction achieed the same reslts as microwae holography, when applied to a slotted waegide array with measred data trncated to a 80 sphere and an oersampling factor of Conclsions The 3D reconstrction algorithm was applied to a slotted waegide array measred at the DTU-ESA Spherical Near-Field Antenna Test Facility. One slot of the array was coered by condctie tape and an error was present in the array excitation. Both defects cold sccessflly be detected, and all slots cold be identified. It was shown that the spatial resoltion proided by the 3D reconstrction is mch higher than that proided by traditional microwae holography, where the indiidal slots cannot be resoled. This happens when measred fll sphere data are aailable and when the measred field sampling is almost a factor 3 or 1.5 higher the minimm sampling defined by spherical wae theory. It was also illstrated that when the length of the patches describing the reconstrction srface is chosen eqal to the spacing of the array elements the accracy of the reconstrcted field increases. Finally it was shown that trncated measrements data affects the accracy of the reconstrcted field. When the measred field is trncated bt oersampled by a factor 3 relatie to the minimm sampling defined by spherical wae theory, this redction in accracy is howeer limited and the obtained reslts still allow to roghly identifying the indiidal slots. Howeer, when the oersampling of the trncated measred field is decreased to arond 1.5, slots cannot be 5. REFERENCES 1 H. G. Booker, P. C. Clemmo, T e concept o anglar spectrm of plane waes and its relation to that of polar diagram and apertre distri tion, Proc. Inst. Elec. Eng., ol. 9 (1), pp , Janary [2 C. Cappellin, O. Brein jerg, A. Frandsen, Properties o t e transformation from the spherical wae expansion to the plane ae expansion, Radio Science, ol. 43, no. RS1012, doi: /2007rs003696, Febrary [3 T. K. Sarkar, A. Taag ol, Near-field to near/far-field transformation for arbitrary near-field geometry tilizing and eqialent electric crrent and MoM, IEEE Trans. Antennas Propagat., ol. 47, no. 3, pp , Mar [4] Y. Alarez, F. Las-Heras, M. R. Pino, Reconstrction o eqialent crrents distribtion oer arbitrary three-dimensional sr aces ased on integral eqation algorit ms, IEEE Trans. Antennas Propagat., ol. 55, no. 12, pp , Dec [5 J. L. A. Qijano, G. Vecc i, Improed-accracy sorce reconstrction on arbitrary 3-D sr aces, IEEE Antennas and Wireless Propagation Letters, ol. 8, pp , K. Persson and M. Gsta sson, Reconstrction of eqialent crrents sing a near-field data transformation - with radome applications, Progress in Electromagnetics Researc, ol. 54, pp , [7 T. F. Ei ert, C. H. Sc midt, Mltileel ast mltipole accelerated inerse eqialent crrent method employing Rao- Wilton-Glisson discretization of electric and magnetic srface crrents, IEEE Trans. on Antennas Propag., ol., no., pp , [8] E. Jørgensen, P. Meincke, C. Cappellin, and M. Sabbadini, Improed sorce reconstrction techniqe for antenna diagnostics, Proc. of the 32 nd ESA Antenna Workshop, ESTEC, Noordwijk, The Netherlands, [9] E. Jørgensen, P. Meincke, O. Borries, and M. Sabbadini, Processing o measred ields sing adanced inerse met od of moments algorit m, Proc. of the 33rd ESA Antenna Workshop, ESTEC, Noordwijk, The Netherlands, [10] E. Jørgensen, J. L. Volakis, P. Meincke, and O. Breinbjerg, Hig er order ierarc ical Legendre asis nctions for electromagnetic modelling, IEEE Trans. Antennas Propagat., ol. 52, no. 11, pp , No [11] E. Jørgensen, D. W. Hess, P. Meincke, O. Borries, C. Cappellin, J. Ford am, Antenna diagnostics on planar arrays sing a 3D sorce reconstrction techniqe and spherical nearfield measrements, Proc. of ECAP 2012, Prage, F. Jensen, A. Frandsen, On t e nm er o modes in sp erical ae expansions, Proc. Antenna Meas. Tec. Ass. Symposim, AMTA 2004, pp , [13] J. J. Lee, E. M. Ferren, D. P. Woollen, K. M. Lee, Nearfield probe sed as a diagnostic tool to locate defectie elements in an array antenna, IEEE Trans. Ant. Prop., ol., no., Jne D. W. Hess, S. T. McBride, Imaging o element excitations it sp erical scanning, Proc. Antenna Meas. Tech. Ass. Symposim, AMTA 2011, pp , 2011.

Design and Optimization of Multi-Faceted Reflectarrays for Satellite Applications

Design and Optimization of Multi-Faceted Reflectarrays for Satellite Applications Design and Optimization of Mlti-Faceted Reflectarrays for Satellite Applications Min Zho, Stig B. Sørensen, Peter Meincke, and Erik Jørgensen TICRA, Copenhagen, Denmark ticra@ticra.com Abstract The design

More information

PROCESSING OF MEASURED FIELDS USING ADVANCED INVERSE METHOD OF MOMENTS ALGORITHM

PROCESSING OF MEASURED FIELDS USING ADVANCED INVERSE METHOD OF MOMENTS ALGORITHM PROCESSING OF MEASURED FIELDS USING ADVANCED INVERSE METHOD OF MOMENTS ALGORITHM E. Jørgensen 1, P. Meincke 1, O. Borries 1, and M. Sabbadini 2 1 TICRA, Læderstræde 34, DK-1201 København K, Denmark, ej@ticra.com,

More information

New Modelling Capabilities in Commercial Software for High-Gain Antennas

New Modelling Capabilities in Commercial Software for High-Gain Antennas 6th European Conference on Antennas and Propagation (EUCAP) New Modelling Capabilities in Commercial Software for High-Gain Antennas Erik Jørgensen, Michael Lumholt, Peter Meincke, Min Zhou, Stig B. Sørensen,

More information

Towards applications based on measuring the orbital angular momentum of light

Towards applications based on measuring the orbital angular momentum of light CHAPTER 8 Towards applications based on measring the orbital anglar momentm of light Efficient measrement of the orbital anglar momentm (OAM) of light has been a longstanding problem in both classical

More information

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining

More information

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,

More information

A sufficient condition for spiral cone beam long object imaging via backprojection

A sufficient condition for spiral cone beam long object imaging via backprojection A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral

More information

SYNTHETIC APERTURE SIGNAL PROCESSING FOR HIGH RESOLUTION 3D IMAGE RECONSTRUCTION IN THE THZ-DOMAIN

SYNTHETIC APERTURE SIGNAL PROCESSING FOR HIGH RESOLUTION 3D IMAGE RECONSTRUCTION IN THE THZ-DOMAIN 7th Eropean Signal Processing Conference (EUSIPCO 9) Glasgow, Scotland, Agst -8, 9 SYNTHETIC APERTURE SIGNAL PROCESSING FOR HIGH RESOLUTION D IMAGE RECONSTRUCTION IN THE THZ-DOMAIN Marijke Vandewal, Roel

More information

3D SURFACE RECONSTRUCTION BASED ON COMBINED ANALYSIS OF REFLECTANCE AND POLARISATION PROPERTIES: A LOCAL APPROACH

3D SURFACE RECONSTRUCTION BASED ON COMBINED ANALYSIS OF REFLECTANCE AND POLARISATION PROPERTIES: A LOCAL APPROACH 3D SURFACE RECONSTRUCTION BASED ON COMBINED ANALYSIS OF REFLECTANCE AND POLARISATION PROPERTIES: A LOCAL APPROACH Pablo d Angelo and Christian Wöhler DaimlerChrysler Research and Technology, Machine Perception

More information

Image Restoration Image Degradation and Restoration

Image Restoration Image Degradation and Restoration Image Degradation and Restoration hxy Image Degradation Model: Spatial domain representation can be modeled by: g x y h x y f x y x y Freqency domain representation can be modeled by: G F N Prepared By:

More information

Object Pose from a Single Image

Object Pose from a Single Image Object Pose from a Single Image How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the

More information

Improving Network Connectivity Using Trusted Nodes and Edges

Improving Network Connectivity Using Trusted Nodes and Edges Improing Network Connectiity Using Trsted Nodes and Edges Waseem Abbas, Aron Laszka, Yegeniy Vorobeychik, and Xenofon Kotsokos Abstract Network connectiity is a primary attribte and a characteristic phenomenon

More information

A GENERIC MODEL OF A BASE-ISOLATED BUILDING

A GENERIC MODEL OF A BASE-ISOLATED BUILDING Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes

More information

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz

More information

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands

More information

5.0 Curve and Surface Theory

5.0 Curve and Surface Theory 5. Cre and Srface Theor 5.1 arametric Representation of Cres Consider the parametric representation of a cre as a ector t: t [t t t] 5.1 The deriatie of sch a ector ealated at t t is gien b t [ t t t ]

More information

Real-Time Robot Path Planning via a Distance-Propagating Dynamic System with Obstacle Clearance

Real-Time Robot Path Planning via a Distance-Propagating Dynamic System with Obstacle Clearance POSTPRINT OF: IEEE TRANS. SYST., MAN, CYBERN., B, 383), 28, 884 893. 1 Real-Time Robot Path Planning ia a Distance-Propagating Dynamic System with Obstacle Clearance Allan R. Willms, Simon X. Yang Member,

More information

Tu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization

Tu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)

More information

Reconstructing Generalized Staircase Polygons with Uniform Step Length

Reconstructing Generalized Staircase Polygons with Uniform Step Length Jornal of Graph Algorithms and Applications http://jgaa.info/ ol. 22, no. 3, pp. 431 459 (2018) DOI: 10.7155/jgaa.00466 Reconstrcting Generalized Staircase Polygons with Uniform Step Length Nodari Sitchinaa

More information

Optimal Sampling in Compressed Sensing

Optimal Sampling in Compressed Sensing Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In

More information

Building Facade Detection, Segmentation, and Parameter Estimation for Mobile Robot Localization and Guidance

Building Facade Detection, Segmentation, and Parameter Estimation for Mobile Robot Localization and Guidance Bilding Facade etection, Segmentation, and Parameter Estimation for Mobile Robot Localization and Gidance Jeffrey A. elmerico SUNY at Bffalo jad12@bffalo.ed Philip aid Army Research Laboratory Adelphi,

More information

The LS-STAG Method : A new Immersed Boundary / Level-Set Method for the Computation of Incompressible Viscous Flows in Complex Geometries

The LS-STAG Method : A new Immersed Boundary / Level-Set Method for the Computation of Incompressible Viscous Flows in Complex Geometries The LS-STAG Method : A new Immersed Bondary / Level-Set Method for the Comptation of Incompressible Viscos Flows in Complex Geometries Yoann Cheny & Olivier Botella Nancy Universités LEMTA - UMR 7563 (CNRS-INPL-UHP)

More information

Real-time mean-shift based tracker for thermal vision systems

Real-time mean-shift based tracker for thermal vision systems 9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University

More information

CS 4204 Computer Graphics

CS 4204 Computer Graphics CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types

More information

Computer-Aided Mechanical Design Using Configuration Spaces

Computer-Aided Mechanical Design Using Configuration Spaces Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)

More information

Primary and Derived Variables with the Same Accuracy in Interval Finite Elements

Primary and Derived Variables with the Same Accuracy in Interval Finite Elements Primary and Deried Variables with the Same Accracy in Interal inite Elements M. V. Rama Rao R. L. Mllen 2 and R. L. Mhanna 3 Vasai College of Engineering Hyderabad - 5 3 INDIA dr.mrr@gmail.com 2 Case Western

More information

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing 1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity

More information

Stereopsis Raul Queiroz Feitosa

Stereopsis Raul Queiroz Feitosa Stereopsis Ral Qeiroz Feitosa 5/24/2017 Stereopsis 1 Objetie This chapter introdces the basic techniqes for a 3 dimensional scene reconstrction based on a set of projections of indiidal points on two calibrated

More information

Seismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Columbia

Seismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Columbia Seismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Colmbia SUMMARY Approximate message passing (AMP) is a comptationally

More information

Uncertainty Determination for Dimensional Measurements with Computed Tomography

Uncertainty Determination for Dimensional Measurements with Computed Tomography Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association

More information

Faster Random Walks By Rewiring Online Social Networks On-The-Fly

Faster Random Walks By Rewiring Online Social Networks On-The-Fly 1 Faster Random Walks By Rewiring Online ocial Networks On-The-Fly Zhojie Zho 1, Nan Zhang 2, Zhigo Gong 3, Gatam Das 4 1,2 Compter cience Department, George Washington Uniersity 1 rexzho@gw.ed 2 nzhang10@gw.ed

More information

Vertex Guarding in Weak Visibility Polygons

Vertex Guarding in Weak Visibility Polygons Vertex Garding in Weak Visibility Polygons Pritam Bhattacharya, Sbir Kmar Ghosh*, Bodhayan Roy School of Technology and Compter Science Tata Institte of Fndamental Research Mmbai 400005, India arxi:1409.46212

More information

[1] Hopcroft, J., D. Joseph and S. Whitesides, Movement problems for twodimensional

[1] Hopcroft, J., D. Joseph and S. Whitesides, Movement problems for twodimensional Acknoledgement. The athors thank Bill Lenhart for interesting discssions on the recongration of rlers. References [1] Hopcroft, J., D. Joseph and S. Whitesides, Moement problems for todimensional linkages,

More information

Planarity-Preserving Clustering and Embedding for Large Planar Graphs

Planarity-Preserving Clustering and Embedding for Large Planar Graphs Planarity-Presering Clstering and Embedding for Large Planar Graphs Christian A. Dncan, Michael T. Goodrich, and Stephen G. Koboro Center for Geometric Compting The Johns Hopkins Uniersity Baltimore, MD

More information

Today. B-splines. B-splines. B-splines. Computergrafik. Curves NURBS Surfaces. Bilinear patch Bicubic Bézier patch Advanced surface modeling

Today. B-splines. B-splines. B-splines. Computergrafik. Curves NURBS Surfaces. Bilinear patch Bicubic Bézier patch Advanced surface modeling Comptergrafik Matthias Zwicker Uniersität Bern Herbst 29 Cres Srfaces Parametric srfaces Bicbic Bézier patch Adanced srface modeling Piecewise Bézier cres Each segment spans for control points Each segment

More information

Assessment of synthetic winds through spectral modeling and validation using FAST

Assessment of synthetic winds through spectral modeling and validation using FAST Jornal of Physics: Conference Series PAPER OPEN ACCESS Assessment of synthetic winds throgh spectral modeling and alidation sing FAST To cite this article: A Chogle et al 2016 J. Phys.: Conf. Ser. 753

More information

Friend of My Friend: Network Formation with Two-Hop Benefit

Friend of My Friend: Network Formation with Two-Hop Benefit Friend of My Friend: Network Formation with Two-Hop Benefit Elliot Ansheleich, Onkar Bhardwaj, and Michael Usher Rensselaer Polytechnic Institte, Troy NY, USA Abstract. How and why people form ties is

More information

Mobility Control and Its Applications in Mobile Ad Hoc Networks

Mobility Control and Its Applications in Mobile Ad Hoc Networks Mobility Control and Its Applications in Mobile Ad Hoc Netorks Jie W and Fei Dai Department of Compter Science and Engineering Florida Atlantic Uniersity Boca Raton, FL 3331 Abstract Most existing localized

More information

Resolving Linkage Anomalies in Extracted Software System Models

Resolving Linkage Anomalies in Extracted Software System Models Resolving Linkage Anomalies in Extracted Software System Models Jingwei W and Richard C. Holt School of Compter Science University of Waterloo Waterloo, Canada j25w, holt @plg.waterloo.ca Abstract Program

More information

Evaluating Influence Diagrams

Evaluating Influence Diagrams Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will

More information

Stereo Matching and 3D Visualization for Gamma-Ray Cargo Inspection

Stereo Matching and 3D Visualization for Gamma-Ray Cargo Inspection Stereo Matching and 3D Visalization for Gamma-Ray Cargo Inspection Zhigang Zh *ab, Y-Chi H bc a Department of Compter Science, The City College of New York, New York, NY 3 b Department of Compter Science,

More information

Faster Random Walks By Rewiring Online Social Networks On-The-Fly

Faster Random Walks By Rewiring Online Social Networks On-The-Fly Faster Random Walks By Rewiring Online ocial Networks On-The-Fly Zhojie Zho 1, Nan Zhang 2, Zhigo Gong 3, Gatam Das 4 1,2 Compter cience Department, George Washington Uniersity 1 rexzho@gw.ed 2 nzhang10@gw.ed

More information

Calibration based on part set-up measurement for on-machine inspection using vision

Calibration based on part set-up measurement for on-machine inspection using vision Calibration based on part set-p measrement for on-machine inspection sing ision Lorène Dbreil, Yann Qinsat, Claire Lartige To cite this ersion: Lorène Dbreil, Yann Qinsat, Claire Lartige. Calibration based

More information

Date: December 5, 1999 Dist'n: T1E1.4

Date: December 5, 1999 Dist'n: T1E1.4 12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:

More information

On shortest-path all-optical networks without wavelength conversion requirements

On shortest-path all-optical networks without wavelength conversion requirements Research Collection Working Paper On shortest-path all-optical networks withot waelength conersion reqirements Athor(s): Erlebach, Thomas; Stefanakos, Stamatis Pblication Date: 2002 Permanent Link: https://doi.org/10.3929/ethz-a-004446054

More information

Image Compression Compression Fundamentals

Image Compression Compression Fundamentals Compression Fndamentals Data compression refers to the process of redcing the amont of data reqired to represent given qantity of information. Note that data and information are not the same. Data refers

More information

Appearance Based Tracking with Background Subtraction

Appearance Based Tracking with Background Subtraction The 8th International Conference on Compter Science & Edcation (ICCSE 213) April 26-28, 213. Colombo, Sri Lanka SD1.4 Appearance Based Tracking with Backgrond Sbtraction Dileepa Joseph Jayamanne Electronic

More information

Analytical Solution of Kinematic Response of Batter Pile under P and SV Waves Earthquake

Analytical Solution of Kinematic Response of Batter Pile under P and SV Waves Earthquake 7 th SASTech 013, ran, Bandar-Abbas. 7-8 March, 013. Organized by Khaaran nstitte of igher Edcation Analytical Soltion of Kinematic Response of Batter ile nder and S Waes Earthqake M. Ghazai 1,. Raanshenas

More information

Chapter 7 TOPOLOGY CONTROL

Chapter 7 TOPOLOGY CONTROL Chapter TOPOLOGY CONTROL Oeriew Topology Control Gabriel Graph et al. XTC Interference SINR & Schedling Complexity Distribted Compting Grop Mobile Compting Winter 00 / 00 Distribted Compting Grop MOBILE

More information

PARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT

PARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies

More information

Rectangle-of-influence triangulations

Rectangle-of-influence triangulations CCCG 2016, Vancoer, British Colmbia, Ag 3 5, 2016 Rectangle-of-inflence trianglations Therese Biedl Anna Lbi Saeed Mehrabi Sander Verdonschot 1 Backgrond The concept of rectangle-of-inflence (RI) draings

More information

Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks

Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks 1 Localized Delanay Trianglation with Application in Ad Hoc Wireless Networks Xiang-Yang Li Gria Călinesc Peng-Jn Wan Y Wang Department of Compter Science, Illinois Institte of Technology, Chicago, IL

More information

Blind Compressive Sensing Framework for Collaborative Filtering

Blind Compressive Sensing Framework for Collaborative Filtering Blind Compressie Sensing ramewor for Collaboratie iltering Anpriya Gogna ECE Department III-Delhi Delhi, INDIA anpriyag@iiitd.ac.in Angshl Majmdar ECE Department III-Delhi Delhi, INDIA angshl@iiitd.ac.in

More information

Lecture 10. Diffraction. incident

Lecture 10. Diffraction. incident 1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see

More information

Layered Light Field Reconstruction for Defocus Blur

Layered Light Field Reconstruction for Defocus Blur Layered Light Field Reconstrction for Defocs Blr KARTHIK VAIDYANATHAN, JACOB MUNKBERG, PETRIK CLARBERG and MARCO SALVI Intel Corporation We present a novel algorithm for reconstrcting high qality defocs

More information

Improved Multilevel Fast Multipole Method for Higher-Order Discretizations

Improved Multilevel Fast Multipole Method for Higher-Order Discretizations Improved Multilevel Fast Multipole Method for Higher-Order Discretizations Oscar Borries 1,, Peter Meincke, Erik Jørgensen, Stig Busk Sørensen, Per Christian Hansen 1 1 Technical University of Denmark,

More information

METAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY

METAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY VOL. 10, NO 22, DECEBER, 2015 ISSN 1819-6608 ETAODEL FOR SOFTWARE SOLUTIONS IN COPUTED TOOGRAPHY Vitaliy ezhyev Faclty of Compter Systems and Software Engineering, Universiti alaysia Pahang, Gambang, alaysia

More information

A RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA

A RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA A RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA Mei Zho*, Ling-li Tang, Chan-rong Li, Zhi Peng, Jing-mei Li Academy of Opto-Electronics, Chinese Academy of Sciences, No.9, Dengzhang

More information

Topic Continuity for Web Document Categorization and Ranking

Topic Continuity for Web Document Categorization and Ranking Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:

More information

Hardware-Accelerated Free-Form Deformation

Hardware-Accelerated Free-Form Deformation Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric

More information

KINEMATICS OF FLUID MOTION

KINEMATICS OF FLUID MOTION KINEMATICS OF FLUID MOTION The Velocity Field The representation of properties of flid parameters as fnction of the spatial coordinates is termed a field representation of the flo. One of the most important

More information

AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING

AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING Mingsheng LIAO, Li ZHANG, Zxn ZHANG, Jiangqing ZHANG Whan Technical University of Srveying and Mapping, Natinal Lab. for Information Eng. in

More information

Blended Deformable Models

Blended Deformable Models Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University

More information

Multiple Source Shortest Paths in a Genus g Graph

Multiple Source Shortest Paths in a Genus g Graph Mltiple Sorce Shortest Paths in a Gens g Graph Sergio Cabello Erin W. Chambers Abstract We gie an O(g n log n) algorithm to represent the shortest path tree from all the ertices on a single specified face

More information

Chapter 5. Plane Graphs and the DCEL

Chapter 5. Plane Graphs and the DCEL Chapter 5 Plane Graphs and the DCEL So far we hae been talking abot geometric strctres sch as trianglations of polygons and arrangements of line segments withot paying mch attention to how to represent

More information

SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization

SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Mltidimensional Prediction and Error- Controlled Qantization Dingwen Tao (University of California, Riverside) Sheng

More information

DYNAMIC ROAD STRUCTURE ESTIMATION

DYNAMIC ROAD STRUCTURE ESTIMATION Blletin of the Transilania Uniersity of Braşo Vol. 8 (57) No. - 15 Series I: Engineering Sciences DYNAMIC ROAD STRUCTURE ESTIMATION S.M. GRIGORESCU 1 G. MĂCEŞANU 1 Abstract: The paper presents a roa strctre

More information

Networks An introduction to microcomputer networking concepts

Networks An introduction to microcomputer networking concepts Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES

More information

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the ICC 27 proceedings. The Impact of Avatar Mobility on Distribted Server Assignment

More information

Fast Ray Tetrahedron Intersection using Plücker Coordinates

Fast Ray Tetrahedron Intersection using Plücker Coordinates Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,

More information

A Layered Approach to Stereo Reconstruction

A Layered Approach to Stereo Reconstruction Appeared in the 1998 Conference on Compter Vision and Pattern Recognition, Santa Barbara, CA, Jne 1998. A Layered Approach to Stereo Reconstrction Simon Baker Richard Szeliski and P. Anandan Department

More information

EFFICIENT SOLUTION OF SYSTEMS OF ORIENTATION CONSTRAINTS

EFFICIENT SOLUTION OF SYSTEMS OF ORIENTATION CONSTRAINTS EFFICIENT SOLUTION OF SSTEMS OF OIENTATION CONSTAINTS Joseh L. Ganley Cadence Design Systems, Inc. ganley@cadence.com ABSTACT One sbtask in constraint-drien lacement is enforcing a set of orientation constraints

More information

OCIS codes: ( ) Microscopy; ( ) Partial coherence in imaging; ( ) Image reconstruction techniques

OCIS codes: ( ) Microscopy; ( ) Partial coherence in imaging; ( ) Image reconstruction techniques Sparsity based sb-wavelength imaging with partially incoherent light via qadratic compressed sensing Yoav Shechtman 1, Yonina C. Eldar, Alexander Szameit 1 and Mordechai Segev 1 1 Physics Department and

More information

Digital Image Processing Chapter 5: Image Restoration

Digital Image Processing Chapter 5: Image Restoration Digital Image Processing Chapter 5: Image Restoration Concept of Image Restoration Image restoration is to restore a degraded image back to the original image while image enhancement is to maniplate the

More information

The extra single-cycle adders

The extra single-cycle adders lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since

More information

Adaptive Influence Maximization in Microblog under the Competitive Independent Cascade Model

Adaptive Influence Maximization in Microblog under the Competitive Independent Cascade Model International Jornal of Knowledge Engineering, Vol. 1, No. 2, September 215 Adaptie Inflence Maximization in Microblog nder the Competitie Independent Cascade Model Zheng Ding, Kai Ni, and Zhiqiang He

More information

Pushing squares around

Pushing squares around Pshing sqares arond Adrian Dmitresc János Pach Ý Abstract We stdy dynamic self-reconfigration of modlar metamorphic systems. We garantee the feasibility of motion planning in a rectanglar model consisting

More information

A Frequency-optimized Discontinuous Formulation for Wave Propagation Problems

A Frequency-optimized Discontinuous Formulation for Wave Propagation Problems th Flid Dynamics Conference and Ehibit 8 Jne - Jly, Chicago, Illinois AIAA -55 A Freqency-optimized Discontinos Formlation for Wave Propagation Problems Yi Li and Z. J. Wang Department of Aerospace Engineering

More information

Towards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions

Towards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions Towards Understanding Bilevel Mlti-objective Optimization with Deterministic Lower Level Decisions Ankr Sinha Ankr.Sinha@aalto.fi Department of Information and Service Economy, Aalto University School

More information

Complete Information Pursuit Evasion in Polygonal Environments

Complete Information Pursuit Evasion in Polygonal Environments Complete Information Prsit Easion in Polygonal Enironments Kyle Klein and Sbhash Sri Department of Compter Science Uniersity of California Santa Barbara, CA 9306 Abstract Sppose an npredictable eader is

More information

Maximum Weight Independent Sets in an Infinite Plane

Maximum Weight Independent Sets in an Infinite Plane Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking

More information

Digital Image Processing Chapter 5: Image Restoration

Digital Image Processing Chapter 5: Image Restoration Digital Image Processing Chapter 5: Image Restoration Concept of Image Restoration Image restoration is to restore a degraded image back to the original image while image enhancement is to maniplate the

More information

COMPOSITION OF STABLE SET POLYHEDRA

COMPOSITION OF STABLE SET POLYHEDRA COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining

More information

Fault Tolerance in Hypercubes

Fault Tolerance in Hypercubes Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different

More information

Mobility Control and Its Applications in Mobile Ad Hoc Networks

Mobility Control and Its Applications in Mobile Ad Hoc Networks Mobility Control and Its Applications in Mobile Ad Hoc Netorks Jie W and Fei Dai, Florida Atlantic Uniersity Abstract Most eisting localized protocols in mobile ad hoc netorks, sch as data commnication

More information

Fast Obstacle Detection using Flow/Depth Constraint

Fast Obstacle Detection using Flow/Depth Constraint Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl

More information

On Plane Constrained Bounded-Degree Spanners

On Plane Constrained Bounded-Degree Spanners On Plane Constrained Bonded-Degree Spanners Prosenjit Bose 1, Rolf Fagerberg 2, André an Renssen 1, Sander Verdonschot 1 1 School of Compter Science, Carleton Uniersity, Ottaa, Canada. Email: jit@scs.carleton.ca,

More information

f x y z ds f P S (,, ) lim ( ) ds f P S S S.

f x y z ds f P S (,, ) lim ( ) ds f P S S S. 4.7 rface Integral We diide srface into patches patch, mltiply by the area with area, and form the sm n n i j f P ( ). We ealate f at a point P, in each Then we take the limit as the patch size approaches

More information

Direct Trimming of NURBS Surfaces on the GPU

Direct Trimming of NURBS Surfaces on the GPU Direct Trimming of NURBS Srfaces on the GPU Andre Schollmeyer Bernd Fro hlich Bahas-Uniersita t Weimar Abstract This paper presents a highly efficient direct trimming techniqe for NURBS srfaces, which

More information

EFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES. Curtis D. Mobley and Lydia Sundman Sequoia Scientific, Inc. th

EFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES. Curtis D. Mobley and Lydia Sundman Sequoia Scientific, Inc. th EFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES Crtis D. Mobley and Lydia Sndman Seqoia Scientific, Inc. th 15317 NE 90 Street Redmond, WA 98052 USA mobley@seqoiasci.com phone: 425-867-2464

More information

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition

More information

CS 557 Lecture IX. Drexel University Dept. of Computer Science

CS 557 Lecture IX. Drexel University Dept. of Computer Science CS 7 Lectre IX Dreel Uniersity Dept. of Compter Science Fall 00 Shortest Paths Finding the Shortest Paths in a graph arises in many different application: Transportation Problems: Finding the cheapest

More information

Spatial domain: Enhancement in the case of a single image

Spatial domain: Enhancement in the case of a single image Unit-6 Spatial domain: Enhancement in the case of a single image Spatial masks Man image enhancement techniqes are based on spatial operations performed on local neighborhoods of inpt piels. The image

More information

Visibility-Graph-based Shortest-Path Geographic Routing in Sensor Networks

Visibility-Graph-based Shortest-Path Geographic Routing in Sensor Networks Athor manscript, pblished in "INFOCOM 2009 (2009)" Visibility-Graph-based Shortest-Path Geographic Roting in Sensor Networks Gang Tan Marin Bertier Anne-Marie Kermarrec INRIA/IRISA, Rennes, France. Email:

More information

A Distributed Algorithm for Deadlock Detection and Resolution

A Distributed Algorithm for Deadlock Detection and Resolution A Distribted Algorithm for Deadlock Detection and Resoltion Don P. Mitchell Michael J. Merritt AT&T Bell Laboratories ABSTRACT This aer resents two distribted algorithms for detecting and resoling deadlocks.

More information

Available online: 25 Oct To link to this article:

Available online: 25 Oct To link to this article: This article was downloaded by: [Whan Uniersity] On: 5 Febrary 202, At: 9:06 Pblisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Nmber: 072954 Registered office: Mortimer

More information

Chapter 4: Network Layer

Chapter 4: Network Layer Chapter 4: Introdction (forarding and roting) Reie of qeeing theor Roting algorithms Link state, Distance Vector Roter design and operation IP: Internet Protocol IP4 (datagram format, addressing, ICMP,

More information

Constrained Routing Between Non-Visible Vertices

Constrained Routing Between Non-Visible Vertices Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,

More information

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Fixed-Parameter Algorithms for Cluster Vertex Deletion Fixed-Parameter Algorithms for Clster Vertex Deletion Falk Hüffner Christian Komsieicz Hannes Moser Rolf Niedermeier Institt für Informatik, Friedrich-Schiller-Uniersität Jena, Ernst-Abbe-Platz 2, D-07743

More information

Investigation of turbulence measurements with a continuous wave, conically scanning LiDAR Abstract 1. Introduction

Investigation of turbulence measurements with a continuous wave, conically scanning LiDAR Abstract 1. Introduction Investigation of trblence measrements with a continos wave, conically scanning LiDAR Rozenn Wagner 1, Torben Mikkelsen 1, Michael Cortney Risø DTU, PO Box 49,DK4000 Roskilde, Denmark rozn@risoe.dt.dk Abstract

More information