Nested Arrays: A Novel Approach to Array Processing with Enhanced Degrees of Freedom

Size: px
Start display at page:

Download "Nested Arrays: A Novel Approach to Array Processing with Enhanced Degrees of Freedom"

Transcription

1 Nested Arrays: A Novel Approach to Array Processing with Enhanced Degrees of Freedom Xiangfeng Wang OSPAC May 7, 2013

2 Reference Reference Pal Piya, and P. P. Vaidyanathan. Nested arrays: a novel approach to array processing with enhanced degrees of freedom. IEEE Transactions on Signal Processing. 58.8(2010):

3 Outline Outline Motivation and Goal Co-array Perspective Nested Array: Optimization DOA Estimation Numerical Examples Conclusion

4 Motivation and Goal Motivation and Goal Antenna arrays Direction-of-arrival (DOA) estimation Uniform linear arrays (ULA) Degree of freedom (DOF) is N 1 for ULA Goal: nested arrrays obtain O(N 2 ) DOF from only O(N) physical sensors

5 Co-array Perspective Signal Model A N element possibly nonuniform linear antenna array a(θ) R N 1 be the steering vector a(θ) i = e j 2π λ d i sin θ where d i denotes the position of the i-th sensor Assume D narrowband sources from directions {θ i, i = 1, 2,, D} with powers {σi 2, i = 1, 2,, D} Received signal x[k] = A s[k] + n[k] where A = [a(θ 1 ) a(θ 2 ) a(θ D )] denotes the array manifold matrix and s[k] = [s 1 [k] s 2 [k] s D [k]] T, and n[k] denotes temporally and spatially white, and uncorrelated from the sources.

6 Co-array Perspective Difference Co-Array R xx = E [xx H] = AR ss A H + σni 2 = A σ 2 1 σ 2 2. σ 2 D AH + σni 2 [ D ] z = vec(r xx ) = vec σi 2 (a(θ i )a H (θ i )) + σn1 2 n i=1 = (A A) p + σ 2 n1 n

7 Co-array Perspective Difference Co-Array A A behave like the manifold of a array whose sensor locations are given by the distinct values in the set {x i x j, 1 i, j N} Difference Co-Array: Let us consider an array of N sensors, with x i denoting the position vector of the i-th sensor. Define the set D = {x i x j }, i, j = 1, 2,, N, where D u denotes the distinct elements of the set D. The difference co-array is defined as the array which has sensors located at positions given by the set D u.

8 Co-array Perspective Difference Co-Array Weight Function: Define an integer valued function w : D u N + such that w(d) = no. of occurences of d in D, d D u. w(0) = N, 1 w(d) N 1, d D u \{0}. w(d) = w( d), d D u,d 0 w(d) = N(N 1) Cardinality of D u gives the defrees of freedom DOF max = N(N 1) + 1

9 Co-array Perspective Difference Co-Array Summary: If we use second-order statistics, then by exploiting the degrees of freedom (DOF) of the difference co-array, there is a possibility that we can get O(N 2 ) degrees of freedom using only O(N) physical elements Examples: an N element ULA 2N 1 elements ULA

10 Nested Array Nested Array Idea: Use a possibly nonuniform array its difference co-array has significantly more degrees of freedom than the original array. Nested Array: can be generated very easily in a systematic fashion and degrees of freedom of its co-array can be exactly predict. Two Level Nested Array K Levels Nested Array

11 Nested Array Two Level Nested Array A concatenation of two ULAs Inner ULA has N 1 elements with spacing d 1 S inner = {md 1, m = 1, 2,, N 1 } Outer ULA has N 2 elements with spacing d 2 = (N 1 + 1)d 1 S outer = {n(n 1 + 1)d 1, n = 1, 2,, N 2 } Difference co-array: a ULA with 2N 2 (N 1 + 1) 1 elements S ca = {nd 1, n = M,, M, M = N 2 (N 1 + 1) 1} 2N 2 (N 1 + 1) 1 freedoms in the co-array using only N 1 + N 2 elements

12 Nested Array Two Level Nested Array N 1 = 3, d 1 = d, N 2 = 3, d 2 = 4d, M = 11

13 Nested Array Two Level Nested Array max N 1,N 2 2N 2 (N 1 + 1) 1 s.t. N 1 + N 2 = N N optimal N 1, N 2 DOF even N 1 = N 2 = 1 2 N N N 2 odd N 1 = N 1, N 2 2 = N+1 2 obtain little over half of the maximum N N

14 Nested Array K Levels Nested Array Parameters: K, N i, i = 1, 2,, K N + S 1 = {nd, n = 1, 2,, N 1 } i 1 S i = {nd (N j + 1), n = 1, 2,, N i }, i = 2,, K j=1

15 Nested Array K Levels Nested Array Degrees of freedom in the corresponding difference co-array DOF K = 2 {[N 2 (N 1 + 1) 1] + [(N 3 1)(N 1 + N 2 + 1) +(N 1 + 1)] + + [(N K 1)(N 1 + N 2 + N N K 1 + 1) + (N 1 + N N K 2 + 1)} + 1 K DOF K = 2 K i=1 j=i+1 N i N j + N K 1 + 1

16 Nested Array K Levels Nested Array max max K N + N 1,,N K N + subject to DOF K K N i = N i=1 Theorem 1. Given a number N of sensors, the optimal number of nesting levels K and the number of sensors per nesting level are given by K = N 1, { 1, i = 1, 2,, K 1, N i = 0, i = K.

17 Nested Array K Levels Nested Array ( K ) 2 1 DOF K = 2 N i 2 = N 2 i=1 K i=1 K Ni 2 + 2N K 1 i=1 N 2 i + N K 1 1 j K 1 break N j into the sum of two smaller integers N j1 and N j2, i.e., N j = N j1 + N j2 (K + 1) levels of nested with {N 1, N 2,, N j 1, N j1, N j2, N j+1,, N K } sensors DOF K+1 = N 2 Ni 2 + Nj1 2 + Nj N K 1 i j,i=1

18 Nested Array K Levels Nested Array DOF = DOF K+1 DOF K = N 2 j N 2 j1 N2 j2 = 2N j1n j2 0 breaking up always increases the degrees of freedom similar analysis for j = K DOF = DOF K+1 DOF K = 2N K1 (N K2 1) 0 The corresponding difference array is a nonuniform linear array with degrees of freedom given by DOF opt = N(N 1) + 1 which is same as the upper bound. Structure of the Optimally Nested Array: the optimum nested array has sensors located at the positions given by the set S opt = {d, 2d, 4d, 8d,, 2 N 1 d} The optimally nested array is one with exponential spacing

19 Application Spatial Smoothing Based DOA Estimation Spatial smoothing works only for a ULA and we shall focus on the two-level nested array or any array whose difference co-array is a filled ULA. 2-level nested array, N 2 sensors in each level A A R N2 D with (N 2 2)/2 + N distinct rows

20 Application Spatial Smoothing Based DOA Estimation Theorem 2 : The matrix R ss as defined as where R ss = ˆR 2 1 ˆR = (A 11 ΛA H N N 11 + σni 2 ) 2 has the same form as the covariance matrix of the signal received by alonger ULA consisting of N 2 /4 + N/2 sensors and hence by applying MUSIC on R ss, uptp N 2 /4 + N/2 1 sources can be identified.

21 Numerical Examples Environment 6 sensor array (N = 6) 8 narrowband sources (D = 8) directions of arrival { 60, 45, 30, 0, 15, 30, 45, 60 } noise is assumed to be spatially and temporally white 2 level nested array with 3 sensors in each level N 2 /4 + N/2 1 = 11 SS-method: proposed spatial smoothing based technique QS-method: KR product based MUSIC in [1] which requires quasi stationarity

22 Numerical Examples MUSIC Spectrum with different numbers of snapshots

23 Numerical Examples MUSIC Spectrum with different numbers of snapshots

24 Numerical Examples Optimally Nested Array vs 2 Level Nested Array

25 Numerical Examples Optimally Nested Array vs 2 Level Nested Array

26 Conclusion Conclusion A novel nested array structure is proposed which can realize significantly more degrees of freedom Optimum nested array structure was found through solving a combinatorial optimization problem An alternative spatial smoothing based approach to underdetermined DOA estimation Future research?

27 Conclusion References W.K. Ma, T.H. Hsieh, and C.Y. Chi. DOA estimation of quasi-stationary signals via Khatri-Rao subspace. ICASSP, April 2009:

CO-PRIME ARRAY PROCESSING WITH SUM AND DIFFERENCE CO-ARRAY

CO-PRIME ARRAY PROCESSING WITH SUM AND DIFFERENCE CO-ARRAY CO-PRIME ARRAY PROCESSING WITH SUM AND DIFFERENCE CO-ARRAY Xiaomeng Wang 1, Xin Wang 1, Xuehong Lin 1,2 1 Department of Electrical and Computer Engineering, Stony Brook University, USA 2 School of Information

More information

High Order Super Nested Arrays

High Order Super Nested Arrays High Order Super Nested Arrays Chun-Lin Liu 1 and P. P. Vaidyanathan 2 Dept. of Electrical Engineering, MC 136-93 California Institute of Technology, Pasadena, CA 91125, USA cl.liu@caltech.edu 1, ppvnath@systems.caltech.edu

More information

Super Nested Arrays: Linear Sparse Arrays. with Reduced Mutual Coupling Part I: Fundamentals

Super Nested Arrays: Linear Sparse Arrays. with Reduced Mutual Coupling Part I: Fundamentals Super Nested Arrays: Linear Sparse Arrays 1 with Reduced Mutual Coupling Part I: Fundamentals Chun-Lin Liu, Student Member, IEEE, and P. P. Vaidyanathan, Fellow, IEEE Abstract In array processing, mutual

More information

Thinned Coprime Arrays for DOA Estimation

Thinned Coprime Arrays for DOA Estimation Thinned Coprime Arrays for DOA Estimation Ahsan Raza, Wei Liu and Qing Shen Communications Research Group Department of Electronic and Electrical Engineering, University of Sheffield Sheffield, S1 3JD,

More information

SUPER NESTED ARRAYS: SPARSE ARRAYS WITH LESS MUTUAL COUPLING THAN NESTED ARRAYS

SUPER NESTED ARRAYS: SPARSE ARRAYS WITH LESS MUTUAL COUPLING THAN NESTED ARRAYS SUPER NESTED ARRAYS: SPARSE ARRAYS WITH LESS MUTUAL COUPLING THAN NESTED ARRAYS Chun-Lin Liu 1 and P. P. Vaidyanathan 2 Dept. of Electrical Engineering, 136-93 California Institute of Technology, Pasadena,

More information

Unconstrained Beamforming : A Versatile Approach.

Unconstrained Beamforming : A Versatile Approach. Unconstrained Beamforming : A Versatile Approach. Monika Agrawal Centre for Applied Research in Electronics, IIT Delhi October 11, 2005 Abstract Adaptive beamforming is minimizing the output power in constrained

More information

Optimization of array geometry for direction-of-arrival estimation using a priori information

Optimization of array geometry for direction-of-arrival estimation using a priori information Adv. Radio Sci., 8, 87 94, 200 doi:0.594/ars-8-87-200 Author(s) 200. CC Attribution 3.0 License. Advances in Radio Science Optimization of array geometry for direction-of-arrival estimation using a priori

More information

Super Nested Arrays: Linear Sparse Arrays. with Reduced Mutual Coupling Part II: High-Order Extensions

Super Nested Arrays: Linear Sparse Arrays. with Reduced Mutual Coupling Part II: High-Order Extensions Super Nested Arrays: Linear Sparse Arrays with Reduced Mutual Coupling Part II: High-Order Extensions Chun-Lin Liu, Student Member, IEEE, and P. P. Vaidyanathan, Fellow, IEEE Abstract In array processing,

More information

Fast Direction-of-Arrival Estimation in Coprime Arrays

Fast Direction-of-Arrival Estimation in Coprime Arrays Fast Direction-of-Arrival Estimation in Coprime Arrays William Baxter, Elias Aboutanios School of Electrical and Telecommunications Engineering University of New South Wales, Australia Email: w.baxter@unsw.edu.au,

More information

Passive Differential Matched-field Depth Estimation of Moving Acoustic Sources

Passive Differential Matched-field Depth Estimation of Moving Acoustic Sources Lincoln Laboratory ASAP-2001 Workshop Passive Differential Matched-field Depth Estimation of Moving Acoustic Sources Shawn Kraut and Jeffrey Krolik Duke University Department of Electrical and Computer

More information

Generating (n,2) De Bruijn Sequences with Some Balance and Uniformity Properties. Abstract

Generating (n,2) De Bruijn Sequences with Some Balance and Uniformity Properties. Abstract Generating (n,) De Bruijn Sequences with Some Balance and Uniformity Properties Yi-Chih Hsieh, Han-Suk Sohn, and Dennis L. Bricker Department of Industrial Management, National Huwei Institute of Technology,

More information

Efficient Iterative Semi-supervised Classification on Manifold

Efficient Iterative Semi-supervised Classification on Manifold . Efficient Iterative Semi-supervised Classification on Manifold... M. Farajtabar, H. R. Rabiee, A. Shaban, A. Soltani-Farani Sharif University of Technology, Tehran, Iran. Presented by Pooria Joulani

More information

Lec 08 Feature Aggregation II: Fisher Vector, Super Vector and AKULA

Lec 08 Feature Aggregation II: Fisher Vector, Super Vector and AKULA Image Analysis & Retrieval CS/EE 5590 Special Topics (Class Ids: 44873, 44874) Fall 2016, M/W 4-5:15pm@Bloch 0012 Lec 08 Feature Aggregation II: Fisher Vector, Super Vector and AKULA Zhu Li Dept of CSEE,

More information

Optimum Array Processing

Optimum Array Processing Optimum Array Processing Part IV of Detection, Estimation, and Modulation Theory Harry L. Van Trees WILEY- INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION Preface xix 1 Introduction 1 1.1 Array Processing

More information

SS4 - Spatial array processing

SS4 - Spatial array processing Doctoral Program on Electrical Engineering and Communications Sérgio M. Jesus (sjesus@ualg.pt) Universidade do Algarve, PT-8005-139 Faro, Portugal www.siplab.fct.ualg.pt 24 February 2010 thanks to Paulo

More information

Digital Signal Processing. Soma Biswas

Digital Signal Processing. Soma Biswas Digital Signal Processing Soma Biswas 2017 Partial credit for slides: Dr. Manojit Pramanik Outline What is FFT? Types of FFT covered in this lecture Decimation in Time (DIT) Decimation in Frequency (DIF)

More information

Extending coprime sensor arrays to achieve the peak side lobe height of a full uniform linear array

Extending coprime sensor arrays to achieve the peak side lobe height of a full uniform linear array Adhikari et al. EURASIP Journal on Advances in Signal Processing 214, 214:148 http://asp.eurasipjournals.com/content/214/1/148 RESEARCH Open Access Extending coprime sensor arrays to achieve the peak side

More information

ANGULAR INFORMATION RESOLUTION FROM CO-PRIME ARRAYS IN RADAR

ANGULAR INFORMATION RESOLUTION FROM CO-PRIME ARRAYS IN RADAR ANGULAR INFORMATION RESOLUTION FROM CO-PRIME ARRAYS IN RADAR Radmila Pribić Sensors Advanced Developments, Thales Nederl Delft, The Netherls ABSTRACT Angular resolution can be improved by using co-prime

More information

Design and Implementation of Small Microphone Arrays

Design and Implementation of Small Microphone Arrays Design and Implementation of Small Microphone Arrays for Acoustic and Speech Signal Processing Jingdong Chen and Jacob Benesty Northwestern Polytechnical University 127 Youyi West Road, Xi an, China jingdongchen@ieee.org

More information

Newton Polygons of L-Functions

Newton Polygons of L-Functions Newton Polygons of L-Functions Phong Le Department of Mathematics University of California, Irvine June 2009/Ph.D. Defense Phong Le Newton Polygons of L-Functions 1/33 Laurent Polynomials Let q = p a where

More information

PERFORMANCE OF ROOT-MUSIC ALGORITHM USING REAL-WORLD ARRAYS

PERFORMANCE OF ROOT-MUSIC ALGORITHM USING REAL-WORLD ARRAYS PERFORMANCE OF ROOT-MUSIC ALGORITHM USING REAL-WORLD ARRAYS Fabio Belloni, Andreas Richter, and Visa Koivunen Signal Processing Laboratory, SMARAD CoE, Helsinki University of Technology (HUT) Otakaari

More information

DOA ESTIMATION WITH SUB-ARRAY DIVIDED TECH- NIQUE AND INTERPORLATED ESPRIT ALGORITHM ON A CYLINDRICAL CONFORMAL ARRAY ANTENNA

DOA ESTIMATION WITH SUB-ARRAY DIVIDED TECH- NIQUE AND INTERPORLATED ESPRIT ALGORITHM ON A CYLINDRICAL CONFORMAL ARRAY ANTENNA Progress In Electromagnetics Research, PIER 103, 201 216, 2010 DOA ESTIMATION WITH SUB-ARRAY DIVIDED TECH- NIQUE AND INTERPORLATED ESPRIT ALGORITHM ON A CYLINDRICAL CONFORMAL ARRAY ANTENNA P. Yang, F.

More information

CSCI 104 Runtime Complexity. Mark Redekopp David Kempe Sandra Batista

CSCI 104 Runtime Complexity. Mark Redekopp David Kempe Sandra Batista 1 CSCI 104 Runtime Complexity Mark Redekopp David Kempe Sandra Batista 2 Motivation You are given a large data set with n = 500,000 genetic markers for 5000 patients and you want to examine that data for

More information

Degrees of Freedom in Cached Interference Networks with Limited Backhaul

Degrees of Freedom in Cached Interference Networks with Limited Backhaul Degrees of Freedom in Cached Interference Networks with Limited Backhaul Vincent LAU, Department of ECE, Hong Kong University of Science and Technology (A) Motivation Interference Channels 3 No side information

More information

Gap-Filling of Solar Wind Data by Singular Spectrum Analysis

Gap-Filling of Solar Wind Data by Singular Spectrum Analysis Gap-Filling of Solar Wind Data by Singular Spectrum Analysis Dmitri Kondrashov University of California, Los Angeles Yuri Shprits University of California, Los Angeles Motivation 1. Observational data

More information

New Approaches for EEG Source Localization and Dipole Moment Estimation. Shun Chi Wu, Yuchen Yao, A. Lee Swindlehurst University of California Irvine

New Approaches for EEG Source Localization and Dipole Moment Estimation. Shun Chi Wu, Yuchen Yao, A. Lee Swindlehurst University of California Irvine New Approaches for EEG Source Localization and Dipole Moment Estimation Shun Chi Wu, Yuchen Yao, A. Lee Swindlehurst University of California Irvine Outline Motivation why EEG? Mathematical Model equivalent

More information

Topic 4: Vectors Markscheme 4.6 Intersection of Lines and Planes Paper 2

Topic 4: Vectors Markscheme 4.6 Intersection of Lines and Planes Paper 2 Topic : Vectors Markscheme. Intersection of Lines and Planes Paper. Using an elimination method, x y + z x y z x y x + y 8 y Therefore x, y, z Using matrices, x y z x y z 5 (using a graphic display calculator)

More information

Overview: motion-compensated coding

Overview: motion-compensated coding Overview: motion-compensated coding Motion-compensated prediction Motion-compensated hybrid coding Motion estimation by block-matching Motion estimation with sub-pixel accuracy Power spectral density of

More information

International Journal of Foundations of Computer Science c World Scientic Publishing Company DFT TECHNIQUES FOR SIZE ESTIMATION OF DATABASE JOIN OPERA

International Journal of Foundations of Computer Science c World Scientic Publishing Company DFT TECHNIQUES FOR SIZE ESTIMATION OF DATABASE JOIN OPERA International Journal of Foundations of Computer Science c World Scientic Publishing Company DFT TECHNIQUES FOR SIZE ESTIMATION OF DATABASE JOIN OPERATIONS KAM_IL SARAC, OMER E GEC_IO GLU, AMR EL ABBADI

More information

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistical Methods -

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistical Methods - Physics 736 Experimental Methods in Nuclear-, Particle-, and Astrophysics - Statistical Methods - Karsten Heeger heeger@wisc.edu Course Schedule and Reading course website http://neutrino.physics.wisc.edu/teaching/phys736/

More information

Sparse Linear Nested Array for Active Sensing

Sparse Linear Nested Array for Active Sensing Sparse Linear Nested Array for Active Sensing Robin Rajamäki and Visa Koivunen School of Electrical Engineering Aalto University, 0250 Espoo, Finland Email: robin.rajamaki@aalto.fi, visa.koivunen@aalto.fi

More information

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles Mesh Simplification Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies for efficient

More information

Informationslogistik Unit 4: The Relational Algebra

Informationslogistik Unit 4: The Relational Algebra Informationslogistik Unit 4: The Relational Algebra 26. III. 2012 Outline 1 SQL 2 Summary What happened so far? 3 The Relational Algebra Summary 4 The Relational Calculus Outline 1 SQL 2 Summary What happened

More information

Sector Beamforming with Uniform Circular Array Antennas Using Phase Mode Transformation

Sector Beamforming with Uniform Circular Array Antennas Using Phase Mode Transformation Sector Beamforming with Uniform Circular Array Antennas Using Phase Mode Transformation Mohsen Askari School of Electrical and Computer Engineering Shiraz University, Iran Email: maskari@shirazuacir Mahmood

More information

Chapter 4: Control structures. Repetition

Chapter 4: Control structures. Repetition Chapter 4: Control structures Repetition Loop Statements After reading and studying this Section, student should be able to Implement repetition control in a program using while statements. Implement repetition

More information

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #16 Loops: Matrix Using Nested for Loop

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #16 Loops: Matrix Using Nested for Loop Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #16 Loops: Matrix Using Nested for Loop In this section, we will use the, for loop to code of the matrix problem.

More information

Definition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.

Definition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class. Resolvable BIBDs Definition Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class. A partition of B into parallel classes (there must be r of them) is

More information

2. Optimization problems 6

2. Optimization problems 6 6 2.1 Examples... 7... 8 2.3 Convex sets and functions... 9 2.4 Convex optimization problems... 10 2.1 Examples 7-1 An (NP-) optimization problem P 0 is defined as follows Each instance I P 0 has a feasibility

More information

Copyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch.

Copyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch. Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible

More information

Assignment 2. Unsupervised & Probabilistic Learning. Maneesh Sahani Due: Monday Nov 5, 2018

Assignment 2. Unsupervised & Probabilistic Learning. Maneesh Sahani Due: Monday Nov 5, 2018 Assignment 2 Unsupervised & Probabilistic Learning Maneesh Sahani Due: Monday Nov 5, 2018 Note: Assignments are due at 11:00 AM (the start of lecture) on the date above. he usual College late assignments

More information

an interpolating polynomial P (x) for f(x) Issues: how to find, represent, compute P (x); errors?

an interpolating polynomial P (x) for f(x) Issues: how to find, represent, compute P (x); errors? INTERPOLATION Background Polynomial Approximation Problem: given f(x) C[a, b], find P n (x) = a 0 + a 1 x + a 2 x 2 + + a n x n with P n (x) close to f(x) for x [a, b]. Motivations: f(x) might be difficult

More information

Action TU1208 Civil Engineering Applications of Ground Penetrating Radar. SPOT-GPR: a freeware tool for target detection and localization in GPR data

Action TU1208 Civil Engineering Applications of Ground Penetrating Radar. SPOT-GPR: a freeware tool for target detection and localization in GPR data Action TU1208 Civil Engineering Applications of Ground Penetrating Radar Final Conference Warsaw, Poland 25-27 September 2017 SPOT-GPR: a freeware tool for target detection and localization in GPR data

More information

SET DEFINITION 1 elements members

SET DEFINITION 1 elements members SETS SET DEFINITION 1 Unordered collection of objects, called elements or members of the set. Said to contain its elements. We write a A to denote that a is an element of the set A. The notation a A denotes

More information

LOW-DENSITY PARITY-CHECK (LDPC) codes [1] can

LOW-DENSITY PARITY-CHECK (LDPC) codes [1] can 208 IEEE TRANSACTIONS ON MAGNETICS, VOL 42, NO 2, FEBRUARY 2006 Structured LDPC Codes for High-Density Recording: Large Girth and Low Error Floor J Lu and J M F Moura Department of Electrical and Computer

More information

Online Facility Location

Online Facility Location Online Facility Location Adam Meyerson Abstract We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these

More information

Angle-Polarization Estimation for Coherent Sources with Linear Tripole Sensor Arrays

Angle-Polarization Estimation for Coherent Sources with Linear Tripole Sensor Arrays sensors Article Angle-Polarization Estimation for Coherent Sources with Linear Tripole Sensor Arrays Kun Wang 1, Jin He 2,, Ting Shu 2 and Zhong Liu 1 1 Department of Electronic Engineering, Nanjing University

More information

Learning a Manifold as an Atlas Supplementary Material

Learning a Manifold as an Atlas Supplementary Material Learning a Manifold as an Atlas Supplementary Material Nikolaos Pitelis Chris Russell School of EECS, Queen Mary, University of London [nikolaos.pitelis,chrisr,lourdes]@eecs.qmul.ac.uk Lourdes Agapito

More information

Chapter 4: Control structures

Chapter 4: Control structures Chapter 4: Control structures Repetition Loop Statements After reading and studying this Section, student should be able to Implement repetition control in a program using while statements. Implement repetition

More information

Modeling and Estimation of FPN Components in CMOS Image Sensors

Modeling and Estimation of FPN Components in CMOS Image Sensors Modeling and Estimation of FPN Components in CMOS Image Sensors Abbas El Gamal a, Boyd Fowler a,haomin b,xinqiaoliu a a Information Systems Laboratory, Stanford University Stanford, CA 945 USA b Fudan

More information

Research Article Cross Beam STAP for Nonstationary Clutter Suppression in Airborne Radar

Research Article Cross Beam STAP for Nonstationary Clutter Suppression in Airborne Radar Antennas and Propagation Volume 213, Article ID 27631, 5 pages http://dx.doi.org/1.1155/213/27631 Research Article Cross Beam STAP for Nonstationary Clutter Suppression in Airborne Radar Yongliang Wang,

More information

Interference. Electric fields from two different sources at a single location add together. The same is true for magnetic fields at a single location.

Interference. Electric fields from two different sources at a single location add together. The same is true for magnetic fields at a single location. Interference Electric fields from two different sources at a single location add together. The same is true for magnetic fields at a single location. Thus, interacting electromagnetic waves also add together.

More information

Extremal Graph Theory: Turán s Theorem

Extremal Graph Theory: Turán s Theorem Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini

More information

08 An Introduction to Dense Continuous Robotic Mapping

08 An Introduction to Dense Continuous Robotic Mapping NAVARCH/EECS 568, ROB 530 - Winter 2018 08 An Introduction to Dense Continuous Robotic Mapping Maani Ghaffari March 14, 2018 Previously: Occupancy Grid Maps Pose SLAM graph and its associated dense occupancy

More information

Programming, numerics and optimization

Programming, numerics and optimization Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June

More information

A Non-Iterative Approach to Frequency Estimation of a Complex Exponential in Noise by Interpolation of Fourier Coefficients

A Non-Iterative Approach to Frequency Estimation of a Complex Exponential in Noise by Interpolation of Fourier Coefficients A on-iterative Approach to Frequency Estimation of a Complex Exponential in oise by Interpolation of Fourier Coefficients Shahab Faiz Minhas* School of Electrical and Electronics Engineering University

More information

3.2 Recursions One-term recursion, searching for a first occurrence, two-term recursion. 2 sin.

3.2 Recursions One-term recursion, searching for a first occurrence, two-term recursion. 2 sin. Chapter 3 Sequences 3.1 Summation Nested loops, while-loops with compound termination criteria 3.2 Recursions One-term recursion, searching for a first occurrence, two-term recursion. In Chapter 2 we played

More information

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F

More information

Lecture 27, April 24, Reading: See class website. Nonparametric regression and kernel smoothing. Structured sparse additive models (GroupSpAM)

Lecture 27, April 24, Reading: See class website. Nonparametric regression and kernel smoothing. Structured sparse additive models (GroupSpAM) School of Computer Science Probabilistic Graphical Models Structured Sparse Additive Models Junming Yin and Eric Xing Lecture 7, April 4, 013 Reading: See class website 1 Outline Nonparametric regression

More information

Star Forests, Dominating Sets and Ramsey-type Problems

Star Forests, Dominating Sets and Ramsey-type Problems Star Forests, Dominating Sets and Ramsey-type Problems Sheila Ferneyhough a, Ruth Haas b,denis Hanson c,1 and Gary MacGillivray a,1 a Department of Mathematics and Statistics, University of Victoria, P.O.

More information

Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference

Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference Minh Dao 1, Xiang Xiang 1, Bulent Ayhan 2, Chiman Kwan 2, Trac D. Tran 1 Johns Hopkins Univeristy, 3400

More information

Exam Issued: May 29, 2017, 13:00 Hand in: May 29, 2017, 16:00

Exam Issued: May 29, 2017, 13:00 Hand in: May 29, 2017, 16:00 P. Hadjidoukas, C. Papadimitriou ETH Zentrum, CTL E 13 CH-8092 Zürich High Performance Computing for Science and Engineering II Exam Issued: May 29, 2017, 13:00 Hand in: May 29, 2017, 16:00 Spring semester

More information

Sparse Reconstruction / Compressive Sensing

Sparse Reconstruction / Compressive Sensing Sparse Reconstruction / Compressive Sensing Namrata Vaswani Department of Electrical and Computer Engineering Iowa State University Namrata Vaswani Sparse Reconstruction / Compressive Sensing 1/ 20 The

More information

Notes for Lecture 21. From One-Time Signatures to Fully Secure Signatures

Notes for Lecture 21. From One-Time Signatures to Fully Secure Signatures U.C. Berkeley CS276: Cryptography Handout N21 Luca Trevisan April 7, 2009 Notes for Lecture 21 Scribed by Anand Bhaskar, posted May 1, 2009 Summary Today we show how to construct an inefficient (but efficiently

More information

Clustering and Visualisation of Data

Clustering and Visualisation of Data Clustering and Visualisation of Data Hiroshi Shimodaira January-March 28 Cluster analysis aims to partition a data set into meaningful or useful groups, based on distances between data points. In some

More information

Geometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data

Geometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Copyright 2010 Gotsman, Pauly Page 1 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies

More information

Integer Programming Theory

Integer Programming Theory Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x

More information

Analysis of Different Reference Plane Setups for the Calibration of a Mobile Laser Scanning System

Analysis of Different Reference Plane Setups for the Calibration of a Mobile Laser Scanning System Analysis of Different Reference Plane Setups for the Calibration of a Mobile Laser Scanning System 18. Internationaler Ingenieurvermessungskurs Graz, Austria, 25-29 th April 2017 Erik Heinz, Christian

More information

Dynamic Programming. An Enumeration Approach. Matrix Chain-Products. Matrix Chain-Products (not in book)

Dynamic Programming. An Enumeration Approach. Matrix Chain-Products. Matrix Chain-Products (not in book) Matrix Chain-Products (not in book) is a general algorithm design paradigm. Rather than give the general structure, let us first give a motivating example: Matrix Chain-Products Review: Matrix Multiplication.

More information

Introduction to Analysis of Algorithms

Introduction to Analysis of Algorithms Introduction to Analysis of Algorithms Analysis of Algorithms To determine how efficient an algorithm is we compute the amount of time that the algorithm needs to solve a problem. Given two algorithms

More information

Institute for Advanced Computer Studies. Department of Computer Science. Direction of Arrival and The Rank-Revealing. E. C. Boman y. M. F.

Institute for Advanced Computer Studies. Department of Computer Science. Direction of Arrival and The Rank-Revealing. E. C. Boman y. M. F. University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{91{166 TR{2813 Direction of Arrival and The Rank-Revealing URV Decomposition E. C. Boman y

More information

Mining Data Streams. Outline [Garofalakis, Gehrke & Rastogi 2002] Introduction. Summarization Methods. Clustering Data Streams

Mining Data Streams. Outline [Garofalakis, Gehrke & Rastogi 2002] Introduction. Summarization Methods. Clustering Data Streams Mining Data Streams Outline [Garofalakis, Gehrke & Rastogi 2002] Introduction Summarization Methods Clustering Data Streams Data Stream Classification Temporal Models CMPT 843, SFU, Martin Ester, 1-06

More information

Three Dimensional Geometry. Linear Programming

Three Dimensional Geometry. Linear Programming Three Dimensional Geometry Linear Programming A plane is determined uniquely if any one of the following is known: The normal to the plane and its distance from the origin is given, i.e. equation of a

More information

The main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals)

The main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals) Motivation The main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals) monochrome f(x,y) or color r(x,y), g(x,y), b(x,y) These functions are represented

More information

CHAPTER 6 ODD MEAN AND EVEN MEAN LABELING OF GRAPHS

CHAPTER 6 ODD MEAN AND EVEN MEAN LABELING OF GRAPHS 92 CHAPTER 6 ODD MEAN AND EVEN MEAN LABELING OF GRAPHS In this chapter we introduce even and odd mean labeling,prime labeling,strongly Multiplicative labeling and Strongly * labeling and related results

More information

Part I. Hierarchical clustering. Hierarchical Clustering. Hierarchical clustering. Produces a set of nested clusters organized as a

Part I. Hierarchical clustering. Hierarchical Clustering. Hierarchical clustering. Produces a set of nested clusters organized as a Week 9 Based in part on slides from textbook, slides of Susan Holmes Part I December 2, 2012 Hierarchical Clustering 1 / 1 Produces a set of nested clusters organized as a Hierarchical hierarchical clustering

More information

Spatial Outlier Detection

Spatial Outlier Detection Spatial Outlier Detection Chang-Tien Lu Department of Computer Science Northern Virginia Center Virginia Tech Joint work with Dechang Chen, Yufeng Kou, Jiang Zhao 1 Spatial Outlier A spatial data point

More information

Outlier Pursuit: Robust PCA and Collaborative Filtering

Outlier Pursuit: Robust PCA and Collaborative Filtering Outlier Pursuit: Robust PCA and Collaborative Filtering Huan Xu Dept. of Mechanical Engineering & Dept. of Mathematics National University of Singapore Joint w/ Constantine Caramanis, Yudong Chen, Sujay

More information

Heterogeneity Increases Multicast Capacity in Clustered Network

Heterogeneity Increases Multicast Capacity in Clustered Network Heterogeneity Increases Multicast Capacity in Clustered Network Qiuyu Peng Xinbing Wang Huan Tang Department of Electronic Engineering Shanghai Jiao Tong University April 15, 2010 Infocom 2011 1 / 32 Outline

More information

Algebraic Graph Theory- Adjacency Matrix and Spectrum

Algebraic Graph Theory- Adjacency Matrix and Spectrum Algebraic Graph Theory- Adjacency Matrix and Spectrum Michael Levet December 24, 2013 Introduction This tutorial will introduce the adjacency matrix, as well as spectral graph theory. For those familiar

More information

Comparison of TSP Algorithms

Comparison of TSP Algorithms Comparison of TSP Algorithms Project for Models in Facilities Planning and Materials Handling December 1998 Participants: Byung-In Kim Jae-Ik Shim Min Zhang Executive Summary Our purpose in this term project

More information

Geometrical Feature Extraction Using 2D Range Scanner

Geometrical Feature Extraction Using 2D Range Scanner Geometrical Feature Extraction Using 2D Range Scanner Sen Zhang Lihua Xie Martin Adams Fan Tang BLK S2, School of Electrical and Electronic Engineering Nanyang Technological University, Singapore 639798

More information

Manifolds Pt. 1. PHYS Southern Illinois University. August 24, 2016

Manifolds Pt. 1. PHYS Southern Illinois University. August 24, 2016 Manifolds Pt. 1 PHYS 500 - Southern Illinois University August 24, 2016 PHYS 500 - Southern Illinois University Manifolds Pt. 1 August 24, 2016 1 / 20 Motivating Example: Pendulum Example Consider a pendulum

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for

More information

CELLULAR automata (CA) are mathematical models for

CELLULAR automata (CA) are mathematical models for 1 Cellular Learning Automata with Multiple Learning Automata in Each Cell and its Applications Hamid Beigy and M R Meybodi Abstract The cellular learning automata, which is a combination of cellular automata

More information

Lecture 8: Jointly distributed random variables

Lecture 8: Jointly distributed random variables Lecture : Jointly distributed random variables Random Vectors and Joint Probability Distributions Definition: Random Vector. An n-dimensional random vector, denoted as Z = (Z, Z,, Z n ), is a function

More information

Intrinsic Dimensionality Estimation for Data Sets

Intrinsic Dimensionality Estimation for Data Sets Intrinsic Dimensionality Estimation for Data Sets Yoon-Mo Jung, Jason Lee, Anna V. Little, Mauro Maggioni Department of Mathematics, Duke University Lorenzo Rosasco Center for Biological and Computational

More information

Super-resolution on Text Image Sequences

Super-resolution on Text Image Sequences November 4, 2004 Outline Outline Geometric Distortion Optical/Motion Blurring Down-Sampling Total Variation Basic Idea Outline Geometric Distortion Optical/Motion Blurring Down-Sampling No optical/image

More information

Low-Complexity Adaptive Set-Membership Reduced-rank LCMV Beamforming

Low-Complexity Adaptive Set-Membership Reduced-rank LCMV Beamforming Low-Complexity Adaptive Set-Membership Reduced-rank LCMV Beamforming Lei Wang, Rodrigo C. de Lamare Communications Research Group, Department of Electronics University of York, York YO1 DD, UK lw1@ohm.york.ac.uk

More information

Administrivia. CS 133: Databases. Cost-based Query Sub-System. Goals for Today. Midterm on Thursday 10/18. Assignments

Administrivia. CS 133: Databases. Cost-based Query Sub-System. Goals for Today. Midterm on Thursday 10/18. Assignments Administrivia Midterm on Thursday 10/18 CS 133: Databases Fall 2018 Lec 12 10/16 Prof. Beth Trushkowsky Assignments Lab 3 starts after fall break No problem set out this week Goals for Today Cost-based

More information

Portability and Scalability of Sparse Tensor Decompositions on CPU/MIC/GPU Architectures

Portability and Scalability of Sparse Tensor Decompositions on CPU/MIC/GPU Architectures Photos placed in horizontal position with even amount of white space between photos and header Portability and Scalability of Sparse Tensor Decompositions on CPU/MIC/GPU Architectures Christopher Forster,

More information

Motivation. The main goal of Computer Graphics is to generate 2D images. 2D images are continuous 2D functions (or signals)

Motivation. The main goal of Computer Graphics is to generate 2D images. 2D images are continuous 2D functions (or signals) Motivation The main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals) monochrome f(x,y) or color r(x,y), g(x,y), b(x,y) These functions are represented

More information

Development of a Test Field for the Calibration and Evaluation of Kinematic Multi Sensor Systems

Development of a Test Field for the Calibration and Evaluation of Kinematic Multi Sensor Systems Development of a Test Field for the Calibration and Evaluation of Kinematic Multi Sensor Systems DGK-Doktorandenseminar Graz, Austria, 26 th April 2017 Erik Heinz Institute of Geodesy and Geoinformation

More information

The Probabilistic Method

The Probabilistic Method The Probabilistic Method Po-Shen Loh June 2010 1 Warm-up 1. (Russia 1996/4 In the Duma there are 1600 delegates, who have formed 16000 committees of 80 persons each. Prove that one can find two committees

More information

Mengjiao Zhao, Wei-Ping Zhu

Mengjiao Zhao, Wei-Ping Zhu ADAPTIVE WAVELET PACKET THRESHOLDING WITH ITERATIVE KALMAN FILTER FOR SPEECH ENHANCEMENT Mengjiao Zhao, Wei-Ping Zhu Department of Electrical and Computer Engineering Concordia University, Montreal, Quebec,

More information

Sampling Approaches to Metrology in Semiconductor Manufacturing

Sampling Approaches to Metrology in Semiconductor Manufacturing Sampling Approaches to Metrology in Semiconductor Manufacturing Tyrone Vincent 1 and Broc Stirton 2, Kameshwar Poolla 3 1 Colorado School of Mines, Golden CO 2 GLOBALFOUNDRIES, Austin TX 3 University of

More information

Status of PSF Reconstruction at Lick

Status of PSF Reconstruction at Lick Status of PSF Reconstruction at Lick Mike Fitzgerald Workshop on AO PSF Reconstruction May 10-12, 2004 Quick Outline Recap Lick AO system's features Reconstruction approach Implementation issues Calibration

More information

An Introduction to Graph Theory

An Introduction to Graph Theory An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and

More information

MAT137 Calculus! Lecture 31

MAT137 Calculus! Lecture 31 MAT137 Calculus! Lecture 31 Today: Next: Integration Methods: Integration Methods: Trig. Functions (v. 9.10-9.12) Rational Functions Trig. Substitution (v. 9.13-9.15) (v. 9.16-9.17) Integration by Parts

More information

Results on the min-sum vertex cover problem

Results on the min-sum vertex cover problem Results on the min-sum vertex cover problem Ralucca Gera, 1 Craig Rasmussen, Pantelimon Stănică 1 Naval Postgraduate School Monterey, CA 9393, USA {rgera, ras, pstanica}@npsedu and Steve Horton United

More information

AN acoustic array consists of a number of elements,

AN acoustic array consists of a number of elements, APPLICATION NOTE 1 Acoustic camera and beampattern Jørgen Grythe, Norsonic AS, Oslo, Norway Abstract The wavenumber-frequency response of an array describes the response to an arbitrary plane wave both

More information