COMPUTATION OF FOURIER TRANSFORMS FOR NOISY B FOR NOISY BANDLIMITED SIGNALS
|
|
- Silvester Shepherd
- 6 years ago
- Views:
Transcription
1 COMPUTATION OF FOURIER TRANSFORMS FOR NOISY BANDLIMITED SIGNALS October 22, 2011
2 I. Introduction Definition of Fourier transform: F [f ](ω) := ˆf (ω) := + f (t)e iωt dt, ω R (1)
3 I. Introduction Definition of Fourier transform: F [f ](ω) := ˆf (ω) := + f (t)e iωt dt, ω R (1) Definition of band-limited function: A function f L 2 (R) is said to be Ω-band-limited if ˆf (ω) = 0, ω / [ Ω, Ω]. Here ˆf (ω) is the Fourier transform of f.
4 The inversion formula: f (t) = 1 Ω ˆf (ω)e iωt dω, a.e. t R (2) 2π Ω
5 The inversion formula: f (t) = 1 Ω ˆf (ω)e iωt dω, a.e. t R (2) 2π Ω The problem: We will consider the problem of computing ˆf (ω) from f (t) by solving the integral equation: 1 Ω ˆf (ω)e iωt dω = f (t). (3) 2π Ω
6 Sampling Theorem For band-limited signals, we have the following sampling theorem [3]. Shannon Sampling Theorem. The Ω-band-limited signal f (t) can be exactly reconstructed from its samples f (nh), and f (t) = where H := π/ω. n= sin Ω(t nh) f (nh) (4) Ω(t nh)
7 Fourier Serious Calculating the Fourier transform of f (t) by the formula (4), we have the formula which is same as the Fourier series [4] p.3 ˆf (ω) = H n= f (nh)e inhω P[ Ω, Ω] (5) where P[ Ω, Ω] is the characteristic function of [ Ω, Ω].
8 The problem in practice In many practical problems, the samples {f (nh)} are noisy: f (nh) = f T (nh)+η(nh) (6) where {η(nh)} is the noise η(nh) δ (7) and f T L 2 is the exact band-limited signal.
9 A brief review of some previous results in this problem 1. In [7] and [8], some spectral estimators are given. However the ill-posedness is not discussed (Definition of ill-posed is in the next slide).
10 A brief review of some previous results in this problem 1. In [7] and [8], some spectral estimators are given. However the ill-posedness is not discussed (Definition of ill-posed is in the next slide). 2. To overcome the ill-posedness, regularization techniques are used for the problem of computing ˆf in [9] and [10]. Those regularization techniques need the process of calculus of variations.
11 II. The Ill-posedness of the Problem Definition: Assume A : D U is linear. The problem Az = u of determining the solution z in the space D from the initial data u in the space U is well-posed on the pair of metric spaces (D, U) in the sense of Hadamard if we have: 1. Existence: A is onto. 2. Uniqueness: A is Stability: A 1 is continuous.
12 II. The Ill-posedness of the Problem Definition: Assume A : D U is linear. The problem Az = u of determining the solution z in the space D from the initial data u in the space U is well-posed on the pair of metric spaces (D, U) in the sense of Hadamard if we have: 1. Existence: A is onto. 2. Uniqueness: A is Stability: A 1 is continuous. Remark: Problems that violate any of the three conditions are ill-posed.
13 The Definition of the Operator A The operator A on last page is defined by the following formula: Aˆf := {..., f ( nh),...f ( H), f (0), f (H),...f (nh),...}. (8) We discuss the ill-posedness of the problem on the pair of spaces of (L 2, l ) where L 2 = {F : F L 2 [ Ω, Ω]} and F (ω) L 2 = Ω Ω F (ω) 2 dω. l is the space {a(n) : n Z} of bounded sequences and a l = sup a(n). n Z
14 The problem is ill-posed on the pair of spaces (L 2, l ). 1. Existence: The existence condition is not satisfied. We can choose the sampling {f (nh)} to be the samples of a signal whose frequency distribution is not in [ Ω, Ω]. This is equivalent to the fact A(L 2 ) l where A(L 2 ) is the range of A.
15 The problem is ill-posed on the pair of spaces (L 2, l ). 1. Existence: The existence condition is not satisfied. We can choose the sampling {f (nh)} to be the samples of a signal whose frequency distribution is not in [ Ω, Ω]. This is equivalent to the fact A(L 2 ) l where A(L 2 ) is the range of A. 2. Uniqueness: The uniqueness condition is satisfied, since f (nh) 0 implies f (t) 0. So A is injective.
16 The problem is ill-posed on the pair of spaces (L 2, l ). 1. Existence: The existence condition is not satisfied. We can choose the sampling {f (nh)} to be the samples of a signal whose frequency distribution is not in [ Ω, Ω]. This is equivalent to the fact A(L 2 ) l where A(L 2 ) is the range of A. 2. Uniqueness: The uniqueness condition is satisfied, since f (nh) 0 implies f (t) 0. So A is injective. 3. Stability: The stability condition is not satisfied. In other words, A 1 is not continuous from A(L 2 ) to L 2. Proof of Instability By Parseval equality, ˆη 2 = 2πH n= η(nh) 2, it is easy to see the stability condition is not satisfied. So, this is a highly ill-posed problem.
17 III. Regularization method Definition of regularizing operator: Assume Az e = u e ( e for exact). An operator R(, α) : U D, depending on a parameter α, is called a regularizing operator for the equation Az = u in a neighborhood of u e if there exists a function α = α(δ) of δ such that if lim δ 0 u δ u e = 0 and z α = R(u δ, α(δ)) then lim z α z e = 0. δ 0 The approximate solution z α = R(u, α) to the exact solution z e obtained by the method of regularization is called a regularized solution.
18 Regularized Fourier Transform Since this is a highly ill-posed problem [1], the formula (1) is not reliable in practice. In [2], a regularized Fourier transform is presented: F α [f ] = where α > 0 is the regularization parameter. f (t)e iωt dt 1 + 2πα + 2παt 2, ( )
19 Regularized Fourier Transform Since this is a highly ill-posed problem [1], the formula (1) is not reliable in practice. In [2], a regularized Fourier transform is presented: F α [f ] = where α > 0 is the regularization parameter. f (t)e iωt dt 1 + 2πα + 2παt 2, ( ) Remark: This formula needs the information of f (t), t (, ). We are considering computation of ˆf from f (nh).
20 The Regularized Fourier Series Based on the regularized Fourier transform (3) and the Fourier series (5), we construct the regularized Fourier Series: ˆf α (ω) = H n= where f (nh) is given in (6). f (nh) 1 + 2πα + 2πα(nH) 2 einhω P[ Ω, Ω] (9)
21 Lemma 1. η(nh) 1 + 2πα + 2πα(nH) 2 n= 2 = O(δ 2 ) + O(δ 2 / α) where η and δ are given in (6) and (7) in section I.
22 The Convergence Property I Theorem 1. If we choose α = α(δ) such that α(δ) 0 and δ 2 / α(δ) 0 as δ 0, then ˆf α (ω) ˆf T (ω) in L 2 [ Ω, Ω] as δ 0.
23 The Convergence Property I Theorem 1. If we choose α = α(δ) such that α(δ) 0 and δ 2 / α(δ) 0 as δ 0, then ˆf α (ω) ˆf T (ω) in L 2 [ Ω, Ω] as δ 0. Remark: According this theorem, α should be chosen by the error of the sampling. We can choose α = kδ µ where k > 0 and 0 < µ < 4. Then ˆf α (ω) ˆf T (ω) in [ Ω, Ω] as δ 0.
24 The Convergence Property II Theorem 2. If the noise in (6) is white noise such that E[η(nH)] = 0 and Var[η(nH)] = σ 2, then the bias ˆf T (ω) E[ˆf α (ω)] 0 in L 2 [ Ω, Ω] as α 0 and Var[ˆf α (ω)] = O(σ 2 ) + O(σ 2 / α).
25 IV. Experimental Results In practical computation, we first filter the noise out of the band [ Ω, Ω] by the convolution f (t) = f δ (t) sin(ωt) πt where f δ (t) is the signal with noise w(t): f δ (t) = f T (t) + w(t).
26 The Algorithm We choose a large integer N and use the next formula in computation: ˆf α (ω) = H N n= N f (nh) 1 + 2πα + 2πα(nH) 2 einhω P[ Ω, Ω] (10) where f (nh) is the sampling data after filtering the noise out of the band [ Ω, Ω]. The regularization parameter α can be chosen according to the noise level in Theorem 1.
27 Example 1. Suppose Then f T (t) = 1 cos t πt 2. ˆf T (ω) = (1 t )P[ Ω, Ω] where Ω = 1. We add the white noise that is uniformly distributed in [ 0.025, 0.025] and choose N = 500 after the filtering process. The result with the Fourier series and the result with the regularized Fourier series with α = are in figure 1. The vertical axes are the values of the Fourier series and regularized Fourier series respectively. The result of the regularized Fourier series with α = and α = are in figure 2.
28 Discussion on the result From the numerical results in Figure 1 and Figure 2, we can see that bias is smaller if α is reduced from to This means that ˆf T (ω) E[ˆf (ω)] is close to zero which is the result of Theorem 2. However if α is too small such as the case α = in Figure 2, the error of the regularized Fourier series is large. This is due to the second term O(σ/ α) in the estimation of Var[ˆf (ω)] in Theorem 2.
29 The Tikhonov regularization method I In example 2, we will compare the regularized Fourier series with the Tikhonov regularization method used in [1], [9] and [10]. We introduce the Tikhonov regularization method next. First we write equation (2) by the finite difference method Aˆf = f where and A = ( ) 1 2π eiω j t k h, h = Ω/M (2N+1) (2M+1) ˆf = (ˆf M,..., ˆf 0,..., ˆf M ) f = (f N,..., f 0,..., f N ).
30 The Tikhonov regularization method II Define the smoothing functional M α [ˆf, f ] = Aˆf f 2 + α ˆf 2. Here the norms of ˆf and f are defined by ˆf 2 = M j= M ˆf j 2, f 2 = N k= N f k 2. We can find the approximate Fourier transform by minimizing M α [ˆf, f ]. And the minimizer is the solution of the Euler equation ( A T A + αi ) ˆf = A T f.
31 Example 2. The signals are the same as the signals in Example 1. We choose M=400. The results of the regularized Fourier series and the Tikhonov regularized solution with α = are in Figure 3, 4 and 5 for the cases H = π, H = π/10 and H = π/50. We can see that if H is smaller the Tikhonov regularized solution is more accurate, but it is not as good as the regularized Fourier series.
32 References I A. N. Tikhonov and V. Y. Arsenin, Solution of Ill-Posed Problems. Winston/Wiley, W. Chen, An Efficient Method for An Ill-posed Problem Band-limited Extrapolation by Regularization. IEEE Trans. on Signal Processing, vol 54, pp , C. E. Shannon, A mathematical theory of communication. The Bell System Technical Journal, vol. 27, July J. R. Higgins, Sampling Theory in Fourier and Signal Analysis Foundations. Oxford University Press Inc., New York, 1996.
33 References II R. Bhatia, Fourier Series. The Mathematical Association of American, A. Steiner, Plancherel s Theorem and the Shannon Series Derived Simultaneously. The American Mathematical Monthly, vol. 87, no. 3, Mar. 1980, pp A. R. Nematollahi, Spectral Estimation of Stationary Time Series: Recent Developments. J. Statist. Res. Iran 2, 2005, pp
34 References III S. V. Narasimhan and M. Harish, Spectral estimation based on discrete cosine transform and modified group delay. Signal Processing 86, 2004, pp H. Kim, B. Yang and B. Lee, Iterative Fourier transform algorithm with regularization for the optimal design of diffractive optical elements. J. Opt. Soc. Am. A Vol. 21, No. 12, pp , I. V. Lyuboshenko and A. M. Akhmetshin, Regularization Of The Problem Of Image Restoration From Its Noisy Fourier Transform Phase. International Conference on Image Processing, Volume 1, 1996 pp
Some Aspects of Band-limited Extrapolations
October 3, 2009 I. Introduction Definition of Fourier transform: F [f ](ω) := ˆf (ω) := + f (t)e iωt dt, ω R (1) I. Introduction Definition of Fourier transform: F [f ](ω) := ˆf (ω) := + f (t)e iωt dt,
More informationTHE computation of Fourier transforms (see Definition
IAENG International Journal of Applied Mathematis, 48:, IJAM_48 6 The Computation of Fourier Transform via Gauss-Regularized Fourier Series Qingyue Zhang Abstrat In this paper, we onstrut a new regularized
More informationAN EFFICIENT METHOD FOR AN ILL-POSED PROBLEM BAND-LIMITED EXTRAPOLATION BY REGULARIZATION
AN EFFICIENT METHOD FOR AN ILL-POSED PROBLEM BAND-LIMITED EXTRAPOLATION BY REGULARIZATION by WEIDONG CHEN B.S., Jiangsu College of Education, Nanjing, China, 1986 M.S., Hebei Institute of Technology, Tianjin,
More information2 The Fourier Transform
2 The Fourier Transform The Fourier transform decomposes a signal defined on an infinite time interval into a λ-frequency component, where λ can be any real(or even complex) number. 2.1 Informal Development
More informationFrom Fourier to Wavelets in 60 Slides
From Fourier to Wavelets in 60 Slides Bernhard G. Bodmann Math Department, UH September 20, 2008 B. G. Bodmann (UH Math) From Fourier to Wavelets in 60 Slides September 20, 2008 1 / 62 Outline 1 From Fourier
More information5. THE CLASSES OF FOURIER TRANSFORMS
5. THE CLASSES OF FOURIER TRANSFORMS There are four classes of Fourier transform, which are represented in the following table. So far, we have concentrated on the discrete Fourier transform. Table 1.
More informationIterative Methods for Ill-Posed Problems
Iterative Methods for Ill-Posed Problems Based on joint work with: Serena Morigi Fiorella Sgallari Andriy Shyshkov Salt Lake City, May, 2007 Outline: Inverse and ill-posed problems Tikhonov regularization
More informationLecture 4: Fourier Transforms.
1 Definition. Lecture 4: Fourier Transforms. We now come to Fourier transforms, which we give in the form of a definition. First we define the spaces L 1 () and L 2 (). Definition 1.1 The space L 1 ()
More informationNonlinear error dynamics for cycled data assimilation methods
Nonlinear error dynamics for cycled data assimilation methods A J F Moodey 1, A S Lawless 1,2, P J van Leeuwen 2, R W E Potthast 1,3 1 Department of Mathematics and Statistics, University of Reading, UK.
More informationFourier series. Complex Fourier series. Positive and negative frequencies. Fourier series demonstration. Notes. Notes. Notes.
Fourier series Fourier series of a periodic function f (t) with period T and corresponding angular frequency ω /T : f (t) a 0 + (a n cos(nωt) + b n sin(nωt)), n1 Fourier series is a linear sum of cosine
More informationFourier Series. Fourier Transform
Math Methods I Lia Vas Fourier Series. Fourier ransform Fourier Series. Recall that a function differentiable any number of times at x = a can be represented as a power series n= a n (x a) n where the
More informationEmpirical Risk Minimization as Parameter Choice Rule for General Linear Regularization Methods
Empirical Risk Minimization as Parameter Choice Rule for General Linear Regularization Methods Frank Werner 1 Statistical Inverse Problems in Biophysics Group Max Planck Institute for Biophysical Chemistry,
More informationRegularization and Inverse Problems
Regularization and Inverse Problems Caroline Sieger Host Institution: Universität Bremen Home Institution: Clemson University August 5, 2009 Caroline Sieger (Bremen and Clemson) Regularization and Inverse
More informatione iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that
Phys 53 Fourier Transforms In this handout, I will go through the derivations of some of the results I gave in class (Lecture 4, /). I won t reintroduce the concepts though, so if you haven t seen the
More informationbe the set of complex valued 2π-periodic functions f on R such that
. Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on
More informatione iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that
Phys 531 Fourier Transforms In this handout, I will go through the derivations of some of the results I gave in class (Lecture 14, 1/11). I won t reintroduce the concepts though, so you ll want to refer
More informationRegularization Theory
Regularization Theory Solving the inverse problem of Super resolution with CNN Aditya Ganeshan Under the guidance of Dr. Ankik Kumar Giri December 13, 2016 Table of Content 1 Introduction Material coverage
More informationAdjoint Fuzzy Partition and Generalized Sampling Theorem
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 1-2016 Adjoint Fuzzy Partition and Generalized Sampling Theorem Irina Perfilieva University
More informationInverse problems in statistics
Inverse problems in statistics Laurent Cavalier (Université Aix-Marseille 1, France) YES, Eurandom, 10 October 2011 p. 1/32 Part II 2) Adaptation and oracle inequalities YES, Eurandom, 10 October 2011
More informationLinear Filters. L[e iωt ] = 2π ĥ(ω)eiωt. Proof: Let L[e iωt ] = ẽ ω (t). Because L is time-invariant, we have that. L[e iω(t a) ] = ẽ ω (t a).
Linear Filters 1. Convolutions and filters. A filter is a black box that takes an input signal, processes it, and then returns an output signal that in some way modifies the input. For example, if the
More informationConvergence Rates in Regularization for Nonlinear Ill-Posed Equations Involving m-accretive Mappings in Banach Spaces
Applied Mathematical Sciences, Vol. 6, 212, no. 63, 319-3117 Convergence Rates in Regularization for Nonlinear Ill-Posed Equations Involving m-accretive Mappings in Banach Spaces Nguyen Buong Vietnamese
More informationLecture 2: Tikhonov-Regularization
Lecture 2: Tikhonov-Regularization Bastian von Harrach harrach@math.uni-stuttgart.de Chair of Optimization and Inverse Problems, University of Stuttgart, Germany Advanced Instructional School on Theoretical
More informationReproducing Kernel Hilbert Spaces
Reproducing Kernel Hilbert Spaces Lorenzo Rosasco 9.520 Class 03 February 9, 2011 About this class Goal To introduce a particularly useful family of hypothesis spaces called Reproducing Kernel Hilbert
More informationIll-Posedness of Backward Heat Conduction Problem 1
Ill-Posedness of Backward Heat Conduction Problem 1 M.THAMBAN NAIR Department of Mathematics, IIT Madras Chennai-600 036, INDIA, E-Mail mtnair@iitm.ac.in 1. Ill-Posedness of Inverse Problems Problems that
More informationTime-Dependent Statistical Mechanics A1. The Fourier transform
Time-Dependent Statistical Mechanics A1. The Fourier transform c Hans C. Andersen November 5, 2009 1 Definition of the Fourier transform and its inverse. Suppose F (t) is some function of time. Then its
More informationLecture 6 January 21, 2016
MATH 6/CME 37: Applied Fourier Analysis and Winter 06 Elements of Modern Signal Processing Lecture 6 January, 06 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long, Edited by E. Bates Outline Agenda: Fourier
More informationOptimal control as a regularization method for. an ill-posed problem.
Optimal control as a regularization method for ill-posed problems Stefan Kindermann, Carmeliza Navasca Department of Mathematics University of California Los Angeles, CA 995-1555 USA {kinder,navasca}@math.ucla.edu
More informationRapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization
Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization Shuyang Ling Department of Mathematics, UC Davis Oct.18th, 2016 Shuyang Ling (UC Davis) 16w5136, Oaxaca, Mexico Oct.18th, 2016
More informationLecture 34. Fourier Transforms
Lecture 34 Fourier Transforms In this section, we introduce the Fourier transform, a method of analyzing the frequency content of functions that are no longer τ-periodic, but which are defined over the
More informationComputer Vision & Digital Image Processing
Computer Vision & Digital Image Processing Image Restoration and Reconstruction I Dr. D. J. Jackson Lecture 11-1 Image restoration Restoration is an objective process that attempts to recover an image
More informationa k cos kω 0 t + b k sin kω 0 t (1) k=1
MOAC worksheet Fourier series, Fourier transform, & Sampling Working through the following exercises you will glean a quick overview/review of a few essential ideas that you will need in the moac course.
More informationErkut Erdem. Hacettepe University February 24 th, Linear Diffusion 1. 2 Appendix - The Calculus of Variations 5.
LINEAR DIFFUSION Erkut Erdem Hacettepe University February 24 th, 2012 CONTENTS 1 Linear Diffusion 1 2 Appendix - The Calculus of Variations 5 References 6 1 LINEAR DIFFUSION The linear diffusion (heat)
More informationExamination paper for TMA4130 Matematikk 4N: SOLUTION
Department of Mathematical Sciences Examination paper for TMA4 Matematikk 4N: SOLUTION Academic contact during examination: Morten Nome Phone: 9 84 97 8 Examination date: December 7 Examination time (from
More informationTwo-parameter regularization method for determining the heat source
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 8 (017), pp. 3937-3950 Research India Publications http://www.ripublication.com Two-parameter regularization method for
More informationX. Chen More on Sampling
X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,
More informationNumerical differentiation by means of Legendre polynomials in the presence of square summable noise
www.oeaw.ac.at Numerical differentiation by means of Legendre polynomials in the presence of square summable noise S. Lu, V. Naumova, S. Pereverzyev RICAM-Report 2012-15 www.ricam.oeaw.ac.at Numerical
More informationTwo-channel sampling in wavelet subspaces
DOI: 10.1515/auom-2015-0009 An. Şt. Univ. Ovidius Constanţa Vol. 23(1),2015, 115 125 Two-channel sampling in wavelet subspaces J.M. Kim and K.H. Kwon Abstract We develop two-channel sampling theory in
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.34: Discrete-Time Signal Processing OpenCourseWare 006 ecture 8 Periodogram Reading: Sections 0.6 and 0.7
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Representation of Signals in Terms of Frequency Components Consider the CT signal defined by N xt () = Acos( ω t+ θ ), t k = 1 k k k The frequencies `present
More informationPreconditioning. Noisy, Ill-Conditioned Linear Systems
Preconditioning Noisy, Ill-Conditioned Linear Systems James G. Nagy Emory University Atlanta, GA Outline 1. The Basic Problem 2. Regularization / Iterative Methods 3. Preconditioning 4. Example: Image
More informationDetermination of a source term and boundary heat flux in an inverse heat equation
ISSN 1746-7659, England, UK Journal of Information and Computing Science Vol. 8, No., 013, pp. 3-114 Determination of a source term and boundary heat flux in an inverse heat equation A.M. Shahrezaee 1
More informationEAS 305 Random Processes Viewgraph 1 of 10. Random Processes
EAS 305 Random Processes Viewgraph 1 of 10 Definitions: Random Processes A random process is a family of random variables indexed by a parameter t T, where T is called the index set λ i Experiment outcome
More informationELEN 4810 Midterm Exam
ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise
More informationHölder regularity estimation by Hart Smith and Curvelet transforms
Hölder regularity estimation by Hart Smith and Curvelet transforms Jouni Sampo Lappeenranta University Of Technology Department of Mathematics and Physics Finland 18th September 2007 This research is done
More informationFourier Series. (Com S 477/577 Notes) Yan-Bin Jia. Nov 29, 2016
Fourier Series (Com S 477/577 otes) Yan-Bin Jia ov 9, 016 1 Introduction Many functions in nature are periodic, that is, f(x+τ) = f(x), for some fixed τ, which is called the period of f. Though function
More informationCS-9645 Introduction to Computer Vision Techniques Winter 2018
Table of Contents Spectral Analysis...1 Special Functions... 1 Properties of Dirac-delta Functions...1 Derivatives of the Dirac-delta Function... 2 General Dirac-delta Functions...2 Harmonic Analysis...
More informationPreconditioning. Noisy, Ill-Conditioned Linear Systems
Preconditioning Noisy, Ill-Conditioned Linear Systems James G. Nagy Emory University Atlanta, GA Outline 1. The Basic Problem 2. Regularization / Iterative Methods 3. Preconditioning 4. Example: Image
More informationBasic relations valid for the Bernstein space B 2 σ and their extensions to functions from larger spaces in terms of their distances from B 2 σ
Basic relations valid for the Bernstein space B 2 σ and their extensions to functions from larger spaces in terms of their distances from B 2 σ Part 3: Distance functional approach of Part 2 applied to
More informationEstimation of transmission eigenvalues and the index of refraction from Cauchy data
Estimation of transmission eigenvalues and the index of refraction from Cauchy data Jiguang Sun Abstract Recently the transmission eigenvalue problem has come to play an important role and received a lot
More information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
More informationWhittaker-Kotel nikov-shannon approximation of sub-gaussian random processes
Whittaker-Kotel nikov-shannon approximation of sub-gaussian random processes Andriy Olenko Department of Mathematics and Statistics, La Trobe University, Melbourne, Australia The presentation is based
More informationA Smooth Operator, Operated Correctly
Clark Department of Mathematics Bard College at Simon s Rock March 6, 2014 Abstract By looking at familiar smooth functions in new ways, we can make sense of matrix-valued infinite series and operator-valued
More informationLecture 9 February 2, 2016
MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture 9 February 2, 26 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long, Edited by E. Bates Outline Agenda:
More informationSolutions to Problems in Chapter 4
Solutions to Problems in Chapter 4 Problems with Solutions Problem 4. Fourier Series of the Output Voltage of an Ideal Full-Wave Diode Bridge Rectifier he nonlinear circuit in Figure 4. is a full-wave
More informationMATH 205C: STATIONARY PHASE LEMMA
MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)
More informationPeriodic functions: simple harmonic oscillator
Periodic functions: simple harmonic oscillator Recall the simple harmonic oscillator (e.g. mass-spring system) d 2 y dt 2 + ω2 0y = 0 Solution can be written in various ways: y(t) = Ae iω 0t y(t) = A cos
More informationOutline of Fourier Series: Math 201B
Outline of Fourier Series: Math 201B February 24, 2011 1 Functions and convolutions 1.1 Periodic functions Periodic functions. Let = R/(2πZ) denote the circle, or onedimensional torus. A function f : C
More informationMath Fall Linear Filters
Math 658-6 Fall 212 Linear Filters 1. Convolutions and filters. A filter is a black box that takes an input signal, processes it, and then returns an output signal that in some way modifies the input.
More informationA sufficient condition for the existence of the Fourier transform of f : R C is. f(t) dt <. f(t) = 0 otherwise. dt =
Fourier transform Definition.. Let f : R C. F [ft)] = ˆf : R C defined by The Fourier transform of f is the function F [ft)]ω) = ˆfω) := ft)e iωt dt. The inverse Fourier transform of f is the function
More informationPhD Course: Introduction to Inverse Problem. Salvatore Frandina Siena, August 19, 2012
PhD Course: to Inverse Problem salvatore.frandina@gmail.com theory Department of Information Engineering, Siena, Italy Siena, August 19, 2012 1 / 68 An overview of the - - - theory 2 / 68 Direct and Inverse
More informationWavelets and multiresolution representations. Time meets frequency
Wavelets and multiresolution representations Time meets frequency Time-Frequency resolution Depends on the time-frequency spread of the wavelet atoms Assuming that ψ is centred in t=0 Signal domain + t
More informationDetection and Estimation Theory
ESE 54 Detection and Estimation heory Joseph A. O Sullivan Samuel C. Sachs Professor Electronic Systems and Signals Research Laboratory Electrical and Systems Engineering Washington University Urbauer
More informationHeisenberg's inequality for Fourier transform
Heisenberg's inequality for Fourier transform Riccardo Pascuzzo Abstract In this paper, we prove the Heisenberg's inequality using the Fourier transform. Then we show that the equality holds for the Gaussian
More informationCalculating Accurate Waveforms for LIGO and LISA Data Analysis
Calculating Accurate Waveforms for LIGO and LISA Data Analysis Lee Lindblom Theoretical Astrophysics, Caltech HEPL-KIPAC Seminar, Stanford 17 November 2009 Results from the Caltech/Cornell Numerical Relativity
More information2 A Model, Harmonic Map, Problem
ELLIPTIC SYSTEMS JOHN E. HUTCHINSON Department of Mathematics School of Mathematical Sciences, A.N.U. 1 Introduction Elliptic equations model the behaviour of scalar quantities u, such as temperature or
More information13. Power Spectrum. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if.
For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if jt X ( ) = xte ( ) dt, (3-) then X ( ) represents its energy spectrum. his follows from Parseval
More informationLINEAR RESPONSE THEORY
MIT Department of Chemistry 5.74, Spring 5: Introductory Quantum Mechanics II Instructor: Professor Andrei Tokmakoff p. 8 LINEAR RESPONSE THEORY We have statistically described the time-dependent behavior
More informationUnbiased Risk Estimation as Parameter Choice Rule for Filter-based Regularization Methods
Unbiased Risk Estimation as Parameter Choice Rule for Filter-based Regularization Methods Frank Werner 1 Statistical Inverse Problems in Biophysics Group Max Planck Institute for Biophysical Chemistry,
More informationPartial Differential Equations
Part II Partial Differential Equations Year 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2015 Paper 4, Section II 29E Partial Differential Equations 72 (a) Show that the Cauchy problem for u(x,
More informationInverse scattering problem from an impedance obstacle
Inverse Inverse scattering problem from an impedance obstacle Department of Mathematics, NCKU 5 th Workshop on Boundary Element Methods, Integral Equations and Related Topics in Taiwan NSYSU, October 4,
More informationLecture 1 January 5, 2016
MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture January 5, 26 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long; Edited by E. Candes & E. Bates Outline
More informationarxiv: v2 [math.oc] 10 Aug 2012 Nikolai Dokuchaev
On causal band-limited mean suare approximation arxiv:1111.6701v2 [math.oc] 10 Aug 2012 Nikolai Dokuchaev Department of Mathematics & Statistics, Curtin University, GPO Box U1987, Perth, 6845 Western Australia
More informationChap 4. Sampling of Continuous-Time Signals
Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion
More informationSignal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5
Signal and systems p. 1/5 Signal and systems Linear Systems Luigi Palopoli palopoli@dit.unitn.it Wrap-Up Signal and systems p. 2/5 Signal and systems p. 3/5 Fourier Series We have see that is a signal
More informationFourier Analysis of Stationary and Non-Stationary Time Series
Fourier Analysis of Stationary and Non-Stationary Time Series September 6, 2012 A time series is a stochastic process indexed at discrete points in time i.e X t for t = 0, 1, 2, 3,... The mean is defined
More informationINHOMOGENEOUS LINEAR SYSTEMS OF DIFFERENTIAL EQUATIONS
INHOMOGENEOUS LINEAR SYSTEMS OF DIFFERENTIAL EQUATIONS Definitions and a general fact If A is an n n matrix and f(t) is some given vector function, then the system of differential equations () x (t) Ax(t)
More informationH Optimal Nonparametric Density Estimation from Quantized Samples
H Optimal Nonparametric Density Estimation from Quantized Samples M. Nagahara 1, K. I. Sato 2, and Y. Yamamoto 1 1 Graduate School of Informatics, Kyoto University, 2 Graduate School of Economics, Kyoto
More informationOutline. Math Partial Differential Equations. Fourier Transforms for PDEs. Joseph M. Mahaffy,
Outline Math 53 - Partial Differential Equations s for PDEs Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
More informationPhase recovery with PhaseCut and the wavelet transform case
Phase recovery with PhaseCut and the wavelet transform case Irène Waldspurger Joint work with Alexandre d Aspremont and Stéphane Mallat Introduction 2 / 35 Goal : Solve the non-linear inverse problem Reconstruct
More informationTIME ENCODING AND PERFECT RECOVERY OF BANDLIMITED SIGNALS
TIME ENCODING AND PERFECT RECOVERY OF BANDLIMITED SIGNALS Aurel A. Lazar Department of Electrical Engineering Columbia University, New York, NY 27 aurel@ee.columbia.edu László T. Tóth Department of Telecommunications
More informationThe Spectral Density Estimation of Stationary Time Series with Missing Data
The Spectral Density Estimation of Stationary Time Series with Missing Data Jian Huang and Finbarr O Sullivan Department of Statistics University College Cork Ireland Abstract The spectral estimation of
More informationSignals and Spectra - Review
Signals and Spectra - Review SIGNALS DETERMINISTIC No uncertainty w.r.t. the value of a signal at any time Modeled by mathematical epressions RANDOM some degree of uncertainty before the signal occurs
More informationLINEAR SYSTEMS. J. Elder PSYC 6256 Principles of Neural Coding
LINEAR SYSTEMS Linear Systems 2 Neural coding and cognitive neuroscience in general concerns input-output relationships. Inputs Light intensity Pre-synaptic action potentials Number of items in display
More informationStochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno
Stochastic Processes M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno 1 Outline Stochastic (random) processes. Autocorrelation. Crosscorrelation. Spectral density function.
More informationConditional stability versus ill-posedness for operator equations with monotone operators in Hilbert space
Conditional stability versus ill-posedness for operator equations with monotone operators in Hilbert space Radu Ioan Boț and Bernd Hofmann September 16, 2016 Abstract In the literature on singular perturbation
More informationFourier transforms. R. C. Daileda. Partial Differential Equations April 17, Trinity University
The Fourier Transform R. C. Trinity University Partial Differential Equations April 17, 214 The Fourier series representation For periodic functions Recall: If f is a 2p-periodic (piecewise smooth) function,
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Fourier Series Representation of Periodic Signals Let x(t) be a CT periodic signal with period T, i.e., xt ( + T) = xt ( ), t R Example: the rectangular
More informationInverse problems Total Variation Regularization Mark van Kraaij Casa seminar 23 May 2007 Technische Universiteit Eindh ove n University of Technology
Inverse problems Total Variation Regularization Mark van Kraaij Casa seminar 23 May 27 Introduction Fredholm first kind integral equation of convolution type in one space dimension: g(x) = 1 k(x x )f(x
More informationMorozov s discrepancy principle for Tikhonov-type functionals with non-linear operators
Morozov s discrepancy principle for Tikhonov-type functionals with non-linear operators Stephan W Anzengruber 1 and Ronny Ramlau 1,2 1 Johann Radon Institute for Computational and Applied Mathematics,
More information8: Correlation. E1.10 Fourier Series and Transforms ( ) Fourier Transform - Correlation: 8 1 / 11. 8: Correlation
E. Fourier Series and Transforms (25-5585) - Correlation: 8 / The cross-correlation between two signals u(t) and v(t) is w(t) = u(t) v(t) u (τ)v(τ +t)dτ = u (τ t)v(τ)dτ [sub: τ τ t] The complex conjugate,
More informationFAST RECOVERY ALGORITHMS FOR TIME ENCODED BANDLIMITED SIGNALS. Ernő K. Simonyi
FAST RECOVERY ALGORITHS FOR TIE ENCODED BANDLIITED SIGNALS Aurel A Lazar Dept of Electrical Engineering Columbia University, New York, NY 27, USA e-mail: aurel@eecolumbiaedu Ernő K Simonyi National Council
More informationConvergence rates in l 1 -regularization when the basis is not smooth enough
Convergence rates in l 1 -regularization when the basis is not smooth enough Jens Flemming, Markus Hegland November 29, 2013 Abstract Sparsity promoting regularization is an important technique for signal
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationFourier Series & The Fourier Transform
Fourier Series & The Fourier Transform What is the Fourier Transform? Anharmonic Waves Fourier Cosine Series for even functions Fourier Sine Series for odd functions The continuous limit: the Fourier transform
More informationc 2011 International Press Vol. 18, No. 1, pp , March DENNIS TREDE
METHODS AND APPLICATIONS OF ANALYSIS. c 2011 International Press Vol. 18, No. 1, pp. 105 110, March 2011 007 EXACT SUPPORT RECOVERY FOR LINEAR INVERSE PROBLEMS WITH SPARSITY CONSTRAINTS DENNIS TREDE Abstract.
More informationThe Wiener algebra and Wiener s lemma
he Wiener algebra and Wiener s lemma Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of oronto January 17, 2015 1 Introduction Let = R/Z. For f L 1 () we define f L 1 () = 1 For
More information1 Mathematical Preliminaries
Mathematical Preliminaries We shall go through in this first chapter all of the mathematics needed for reading the rest of this book. The reader is expected to have taken a one year course in differential
More informationVolterra Integral Equations of the First Kind with Jump Discontinuous Kernels
Volterra Integral Equations of the First Kind with Jump Discontinuous Kernels Denis Sidorov Energy Systems Institute, Russian Academy of Sciences e-mail: contact.dns@gmail.com INV Follow-up Meeting Isaac
More information5th-order differentiation
ARBITRARY-ORDER REAL-TIME EXACT ROBUST DIFFERENTIATION A. Levant Applied Mathematics Dept., Tel-Aviv University, Israel E-mail: levant@post.tau.ac.il Homepage: http://www.tau.ac.il/~levant/ 5th-order differentiation
More informationBernstein s inequality and Nikolsky s inequality for R d
Bernstein s inequality and Nikolsky s inequality for d Jordan Bell jordan.bell@gmail.com Department of athematics University of Toronto February 6 25 Complex Borel measures and the Fourier transform Let
More information