Open access peer-reviewed chapter

# Inversion-Based Fourier Transform as a New Tool for Noise Rejection

By Mihály Dobróka, Hajnalka Szegedi and Péter Vass

Submitted: April 18th 2016Reviewed: October 14th 2016Published: February 8th 2017

DOI: 10.5772/66338

## Abstract

In this study, a new inversion method is presented for performing two-dimensional (2D) Fourier transform. The discretization of the continuous Fourier spectra is given by a series expansion with the scaled Hermite functions as square-integrable set of basis functions. The expansion coefficients are determined by solving an overdetermined inverse problem. In order to define a quick algorithm in calculating the Jacobian matrix of the problem, the special feature that the Hermite functions are eigenfunctions of the Fourier transformation is used. In the field of inverse problem theory, there are numerous procedures for noise rejection, so if the Fourier transformation is formulated as an inverse problem, these tools can be used to reduce the noise sensitivity. It was demonstrated in many case studies that the use of Cauchy-Steiner weights could increase the noise rejection capability of geophysical inversion methods. Following this idea, the two-dimensional Fourier transform is formulated as an iteratively reweighted least squares (IRLS) problem using Cauchy-Steiner weights. The new procedure is numerically tested using synthetic data.

### Keywords

• noise rejection in Fourier transformation
• series expansion–based inversion
• robust Fourier transformation
• Hermite functions
• reduction to pole

## 1. Introduction

In signal processing, the frequency spectrum of the time domain signals plays a very important role. In order to change over from the time domain to the frequency domain, the Fourier transform is applied most frequently. In the case of equidistantly sampled discrete time domain data sets, the so-called discrete Fourier transform (DFT) algorithm is used to determine the discrete frequency spectrum. In the numerically very efficient Fast Fourier Transform algorithm (FFT), the spectrum is determined by solving a complete set of inhomogeneous linear algebraic set of equations.

The measured data set always contains noise, which is linearly projected into the frequency domain during Fourier transformation, so the traditional FT algorithms are sensitive to noise, most significantly to non-Gaussian one. On the other hand, it is well-known that in the framework of inverse problem theory there are a collection of methods with excellent noise rejection capability. For this reason, it was proposed to handle the 1D Fourier Transform as an overdetermined inverse problem .

In inverse problem theory, it is known that the simple least squares (LSQ) method gives optimal solution in case of Gaussian data noises while it is very sensitive for outliers. To reduce the effect of outlying data various (robust) inversion methods have been developed. The least absolute deviation (LAD) is one of the most frequently applied robust inversion method, which can be numerically realized by linear programing or by using the so-called iteratively reweighted least squares (IRLS) procedure . In this case, the L1 norm of the deviation between the observed and predicted data is minimized. The IRLS procedure which iteratively recalculates the so-called Cauchy weights results in a very efficient robust inversion method . In applying Cauchy inversion, the scale parameter of the Cauchy weights should be a prioriknown. This problem is solved in the framework of the most frequent value (MFV) method (developed by Steiner [4, 5]), where the scale parameter is derived from the data set. The weights given by the MFV method have been extensively used in various IRLS inversion problems. A successful application in joint inversion of seismic and geoelectric data was published by Dobróka et al. . Szűcs et al.  reported a considerable improvement due to the use of Steiner’s weights in the interpretation of borehole geophysical data. The Cauchy weights improved by Steiner’s MFV method (the so-called Cauchy-Steiner weights) were successfully applied in robust tomography algorithms by Dobróka and Szegedi .

In previous papers by Szegedi and Dobróka , the 1D Fourier transformation was handled as robust inverse problem using IRLS algorithm with Cauchy-Steiner weights. It was shown that the noise sensitivity of the continuous Fourier transform (and its discrete variants DFT and FFT) was appropriately reduced by using robust inversion. Following a fruitful inversion strategy developed at the Geophysical Department of the University of Miskolc we used series expansion as a discretization tool. Series expansion–based inversion methods were successfully used in the interpretation of borehole geophysical data [10, 11] and also in processing induced polarization data . In this study, we further develop the previously published inversion-based 1D Fourier transform algorithm by extending it to 2D cases.

## 2. Theoretical background for 1D algorithm

The Fourier transform and its inverse allow establishing a connection between the time and frequency domain. For the one-dimensional case the Fourier transform is defined as

U(ω)=12πu(t)ejωtdt,E1

where tdenotes the time, ωis the angular frequency and jis the imaginary unit, U(ω)is the Fourier transform of a real-valued time function u(t). Thus, the Fourier transform provides the frequency domain representation of a phenomenon investigated by the measurement of some quantity in the time domain. By means of the inverse Fourier transform

u(t)=12πU(ω)ejωtdω,E2

we can return from the frequency domain to the time domain.

A next step in formulating the Fourier transform as an inverse problem is the discretization of the frequency spectrum U(ω). In order to satisfy this requirement, let us assume that U(ω)is approximated with sufficient accuracy by using a finite series expansion

U(ω)=i=1MBiΨi(ω),E3

where the parameter Biis a complex valued expansion coefficient and Ψiis a member of an accordingly chosen set of real valued basis functions.

Using the terminology of (discrete) inverse problem theory, the theoretical values of time domain data (forward problem) can be given by the inverse Fourier transform

utheor(tk)=uktheor=12πU(ω)ejωtkdω,E4

where tkis the kth sampling time. Inserting the expression given in Eq. (3) one finds that

uktheor12π(i=1MBiΨi(ω))ejωtkdω=i=1MBi12πΨi(ω)ejωtkdω.E5

Let us introduce the notation

Gk,i=12πΨi(ω)ejωtkdω,E6

where Gk,iis an element of the so called Jacobian matrix of the size N-by-M(Nis the number of time domain data and Mis the number of unknown expansion coefficients). It is important for later considerations to note, that the Jacobian can be written as the inverse Fourier transform (in t=tk) of the Ψibasis function. The theoretical values take the linear form

uktheor=i=1MBiGk,i.E7

The parameterization is always an important step in constructing an inversion algorithm. In Fourier transformation the frequency spectrum is defined over the interval (−∞,∞), so the set of basis functions should be defined in the same domain. In addition, the use of orthonormal functions for the series expansion is also proposed to the parameterization of the model. Because of these reasons we have chosen the set of scaled Hermite functions for discretization (their square-integrability ensures the existence of their Fourier transform).

If one tries to extend the concept of inversion-based Fourier transform for two-dimensional (2D) (or even multidimensional) case, a quick and simpler way of calculation can be advantageous. For this reason, consider the basic formulae of Hermite polynomials and Hermite functions.

The basic Hermite polynomials can be defined by the Rodriguez formula

hn(0)(ω)=(1)neω2(ddω)neω2,n=0,1,2,...,E8

and also can be generated by the recursive formula

hn+1(0)(ω)=2ωhn(0)(ω)2nhn1(0)(ω),E9

where h0(0)(ω)=1, h1(0)(ω)=2ω. The Hermite polynomials fulfill the orthogonality condition

eω2hn(0)(ω)hm(0)(ω)dω=2nn!πδnm,δnm={0,nm1,n=m,E10

where δnmdenotes the Kronecker symbol. Based on this formula, the basic Hermite functions can be defined as

Hn(0)(ω)=eω22hn(0)(ω)πn!2n,n=0,1,2,.E11

Afterward the function Hn(0)(ω)is not only a complete orthogonal but an orthonormal system

Hn(0)(ω)Hm(0)(ω)dω=δnm,δnm={0,nm1,n=m.E12

There is an important special feature of Hermite functions, namely that they are the eigenfunctions of the Fourier transform 

F{Hn(0)(t)}=(j)nHn(0)(ω),E13

and for the inverse Fourier transform, respectively

F-1{Hn(0)(ω)}=(j)nHn(0)(t).E14

As it was given in reference , the Hermite functions have to be modified by scaling because in geophysical applications the frequency covers wide ranges. The Rodriguez formula for modified Hermite polynomials takes the form

hn(ω,α)=(1)neαω2(ddω)neαω2,E15

and can be also generated by the recursive formula

hn+1(ω,α)=2ωαhn(ω,α)2nαhn1(ω,α),E16

where αis the scale factor and h0(ω,α)=1, h1(ω,α)=2αω. The normalizing equation is

eαω2hn(0)(ω,α)hm(0)(ω,α)dω=πα(2α)nn!δnm,δnm={0,nm1,n=m.E17

Thus, the scaled Hermite functions can be defined as

Hn(ω,α)=eαω22hn(ω,α)παn!(2α)n.E18

In this case the normalizing equation is

Hn(ω,α)Hm(ω,α)dω=δnm,δnm={0,nm1,n=m.E19

Introducing the notation ω'=αωthe hn(ω,α)modified Hermite polynomials can be traced back to the hn(0)base polynomials. Substituting ω'into Eq. (15) we obtain

hn(ω,α)=(α)n(1)neω'2(ddω')neω'2=(α)nhn(0)(ω')=(α)nhn(0)(αω).E20

Similarly, the modified Hermite function can also be traced back to the basic case (Hn(0)). According to Eq. (18), we get the following formula

Hn(ω,α)=eω'22(α)nhn(ω')π1αn!2nαn=α4eω'22hn(ω')πn!2n=α4Hn(0)(ω')=α4Hn(0)(αω).E21

Expanding the spectrum by means of the modified Hermite functions, in accordance with Eq. (6) the Jacobian matrix can be written as the inverse Fourier transform of the Hn(ω,α)basis functions

Gkn=12πHn(ω,α)ejωtdω.E22

Using Eq. (21) one finds

Gkn=12πα4Hn(0)(ω')ejωtdω,E23

or taking the notations ωt=ω't', ω'=αωand t'=tαinto account we have

Gkn=1α412πHn(0)(ω')ejω't'dω'=1α4F-1{Hn(0)(ω')}.E24

Using the properties of the base Hermite functions from Eq. (14) Eq. (24) can be rewritten in the following form

Gkn=1α4(j)nHn(0)(t')=1α4(j)nHn(0)(tα).E25

This is a very important result in further developing the inversion-based Fourier transform method because the Jacobian matrix can be produced quickly, as the procedure do not require integration. This is especially important in case of 2D (or higher dimensional) Fourier transform.

In accordance with Eq. (7) the theoretical data can be obtained as a linear expression of the expansion coefficients using the easily calculated elements of the Jacobian matrix. The general element of the deviation vector can be given in the following form

ek=ukmeasureduktheor.E26

In the framework of inverse problem theory, various methods are given for the minimization of appropriately chosen norm of the deviation vector resulting in an estimation of the expansion coefficients (Biestimated). After this, the real and imaginary part of the estimated spectrum can be calculated at any frequency as

Uestimated(ω)=i=1MBiestimatedHi(ω,α).E27

## 3. Theoretical background for 2D algorithm

For the two-dimensional case the Fourier transform is defined as

U(ωx,ωy)=12πu(x,y)ej(ωxx+ωyy)dxdy,E28

where x,ydenotes the spatial coordinates, ωx,ωyare the (angular) spatial frequencies and jis the imaginary unit. The frequency spectrum U(ωx,ωy)is the Fourier transform of a real valued function u(x,y)and it is generally a complex valued continuous function. In two dimensions the forward problem giving the theoretical values of the space domain data can be defined by the two-dimensional inverse Fourier transform

u(x,y)=12πU(ωx,ωy)ej(ωxx+ωyy)dωxdωy,E29

where U(ωx,ωy)denotes the 2D spatial frequency spectrum, which will be discretized using the scaled Hermite functions defined above

U(ωx,ωy)=n=1Nm=1MBn,mHn(ωx,α)Hm(ωy,β),E30

where

Hn(ωx,α)=eαωx22hn(ωx,α)παn!(2α)n,hn(ωx,α)=(1)neαωx2(ddωx)neαωx2,E31
Hm(ωy,β)=eβωy22hm(ωy,β)πβm!(2β)m,hm(ωy,β)=(1)meβωy2(ddωy)meβωy2.E32

Using Eq. (29) the data calculated at the point (xk,yl)

u(xk,yl)=12πn=1Nm=1MBn,mHn(ωx,α)Hm(ωy,β)ej(ωxxk+ωyyl)dωxdωy,E33

where k=(1,2,,K), l=(1,2,,L)denote the sequence numbers of the measurement points along the xand ydirections, respectively. By introducing the Jacobian matrix, we can write

u(xk,yl)=n=1Nm=1MBn,mGk,ln,m,E34

where

Gk,ln,m=12πHn(ωx,α)Hm(ωy,β)ej(ωxxk+ωyyl)dωxdωy=12πHn(ωx,α)ejωxxkdωx12πHm(ωy,β)ejωyyldωy.E35

Similar to Eq. (21)

Hn(ωx,α)=α4Hn(0)(αωx),Hm(ωy,β)=β4Hm(0)(βωy),E36

and the Jacobian takes the form

Gk,ln,m=αβ42πHn(0)(αωx)ejωxxkdωx12πHm(0)(βωy)ejωyyldωy.E37

Using the notations

ωxxk=ωxxk,ωx=αωx,xk=xkα,ωyyl=ωyyl,ωy=βωy,yl=ylβ,E38

we can write

Gk,ln,m=1αβ42πHn(0)(ωx)ejωxxkdωx12πHm(0)(ωy)ejωyyldωy=1αβ4F-1{Hn(0)(ωx)}F-1{Hm(0)(ωy)}E39

and applying the well-known Eq. (14), the Jacobian matrix can be written in its final form (without integration)

Gk,ln,m=(j)n+mαβ4Hn(0)(xk)Hm(0)(yl).E40

The programming of the algorithm is quite simple after using the transformation of the indices i=n+(m1)N, s=k+(l1)K. With these notations, the total number of the unknown expansion coefficient is I=N+(M1)N=NMand that of the measured data is S=K+(L1)K=KL. The theoretical data can be calculated as

ustheor=i=1IBiGs,i,E41

and the general element of the deviation vector can be given in the following form

es=usmeasuredi=1IBiGs,iE42

with (i=1,,I,s=1,,S). After this, the inverse problem can be formulated in a straightforward manner.

## 4. Inversion algorithms

If the measured data set contains Gaussian noise, the minimization of the L2 norm of the deviation vector is applied. This is the case of the least squares method when

E2=k=1Nek2E43

is minimized resulting in the well-known set of the normal equations

GTGB=GTumeasured.E44

By solving these normal equations, we can give an estimate for the complex expansion coefficients, and both the real and imaginary parts of the LSQ estimated Fourier transform (LSQ-FT) can be calculated at any frequency by using

Uestimated(ω)=i=1MBiestimated  Ψi(ω).E45

As is well-known, the least squares method gives optimal results only when the data-noise follows Gaussian distribution. This distribution seldom occurs in practice so other norms of the deviation vector are introduced. In order to define a robust inversion algorithm, the minimization of the weighted norm

Ew=k=1Nwkek2.E46

with the so-called Cauchy weights

wk=σ2σ2+ek2.E47

is suggested (here σ2is an accordingly chosen positive number). Using this norm for the solution of inverse problems provides reliable results even if the input data sets contain outliers .

There is a problem with inversion procedures involving Cauchy weights, namely the scale parameter should be a priorigiven. This difficulty can easily be solved by using Steiner weights . In the framework of Steiner’s most frequent value method, the scale parameter σ2is derived from data residuals in an internal iteration loop. In the (j+ 1)th step of this procedure Steiner’s scale factor εj+12(called dihesion) can be calculated from εj2as

εj+12=3k=1Nek2(εj2+ek2)2s=1N(1εj2+es2)2,E48

where the ε0starting value in the 0th step is given as

ε032(emaxemin).E49

The stop criterion can be defined on an experimental basis (for example, a fixed number of iterations). After this the Cauchy weights are modified by using the (Steiner’s) scale parameter (Cauchy-Steiner weights)

wk=ε2ε2+ek2.E50

In the case of Cauchy-Steiner weights the misfit function given in Eq. (46) is nonquadratic (because ekcontains the unknown expansion coefficients) and so the inverse problem is nonlinear which can be solved again by applying the method of the iteratively reweighted least squares . In the framework of this algorithm a 0th order solution B(0)is derived by using the (nonweighted) LSQ method and the weights are calculated as

wk(0)=ε2ε2+(ek(0))2.E51

with ek(0)=ukmeasureduk(0), where uk(0)=i=1MBi(0)Gkiand the expansion coefficients are given by the LSQ method. In the first iteration the misfit function

Ew(1)=k=1Nwk(0)ek(1)2E52

is minimized resulting in the linear set of normal equations

GTW(0)GB(1)=GTW(0)umeasuredE53

of the (linear) weighted least squares method where the W(0)weighting matrix (independent of B(1)) is of the diagonal form Wkk(0)=wk(0). Solving Eq. (53) one finds

B(1)=(GTW(0)G)1GTW(0)umeasuredE54
uk(1)=i=1MBi(1)Gki,ek(1)=ukmeasureduk(1),wk(1)=ε2ε2+(ek(1))2.E55

The minimization of the new misfit function

Ew(2)=k=1Nwk(1)ek(2)2E56

gives B(2)which serves again for the calculation of wk(2). This procedure is repeated giving the typical jth iteration step

GTW(j1)GB(j)=GTW(j1)umeasuredE57

with the W(j1)weighting matrix

Wkk(j1)=wk(j1).E58

(Here we note that each step of these iterations contain an internal loop for the determination of the Steiner’s scale parameter.) This iteration is repeated until a proper stop criterion is met.

## 5. Numerical investigations

In order to test our inversion-based Fourier transform we generated a 2D data set in a rectangular test area of the size [−1,1] units in both xand ydirections (Figure 1). In the homogeneous background (with the theoretical model value u= 0), there is a rectangular anomaly (with u= 1.0) in the center of size [−0.2, 0.2] units in both directions. The sampling intervals were dx = dy =0.04 units so the number of data is N =51*51. The 2D Fourier spectrum of the (noise-free) discrete data set was calculated by means of 2D DFT algorithm, Figure 2 shows its absolute value (amplitude spectrum).

To test the outlier sensitivity of the Fourier transformation algorithms, the noisy data set I was generated, in which random noise of Cauchy distribution (with 0 location and 0.02 scale parameters) were added to the noise-free data set shown in Figure 1. Data set I containing outliers is shown in Figure 3 and its DFT (amplitude) spectrum is shown in Figure 4. It can be seen that compared to Figure 2 the DFT spectrum is highly distorted proving a sufficient noise sensitivity to the traditional DFT.

For quantitative characterization of the results we introduce the RMS distance between two data sets (for example noisy and noiseless) as

d=1Ni=1Nxj=1Ny[unoiseless(xi,yj)unoisy(xi,yj)] 2E59

in the space domain (N,Nx,Nyare relevant numbers of data point in the 2D test area) and the model distance

D=[1Mi=1Mxj=1My(Re [Unoisy(ωxi,ωyi)]Re [Unoiseless(ωxi,ωyi)] )2++1Mi=1Mxj=1My(Im [Unoisy(ωxi,ωyi)]Im [Unoiseless(ωxi,ωyi)] )2]12E60

in the spatial frequency domain (M,Mx,Myare relevant numbers of data points). The distance between the noisy and noiseless data sets is d =0.0984. Using Eq. (60) we find the model distance between the DFT spectra of the noisy (contaminated with Cauchy noise) and the noiseless data sets: D =0.0713.

If we apply our inversion based (IRLS-FT) method for the same noisy data set we get an estimated spectrum shown in Figure 5. Compared to the DFT spectrum (Figure 4) this figure represents sufficient improvement characterized by the model distance between the noiseless and the noisy (given by IRLS-FT) spectra: D= 0.00128. Figure 5.The 2D amplitude spectrum of the noisy data set calculated by IRLS-FT.

It is well known that DFT and inverse DFT sequentially retrieve the noisy input data set exactly. In our inversion-based robust Fourier transform method we solve an overdetermined set of equations. In this case, it is important to see the space domain data set given by the inverse Fourier transform of the IRLS-FT spectrum. This is the so-called calculated data introduced previously in defining the IRLS-FT algorithm

ustheor=i=1IBiGs,i.E61

The result is shown in Figure 6. Compared to the noisy data set, the new inversion-based Fourier transform method has appreciable noise rejection capability. This is characterized by the data distance between the noiseless data set and the space domain data calculated by the IRLS-FT method: d= 0.0140. It can be seen, that compared to the common DFT our inversion-based 2D Fourier transformation method has around 6–7 times lower noise sensitivity both in space domain and frequency domain.

## 6. Application

The Fourier transformation is widely used in solving scientific or technical problems. Here we present a geophysical application in the field of processing geomagnetic data set. It is well known that the magnetic field has generally dipolar nature. It means that a magnetic body (i.e., wall fragments buried with soil in an archeo-geophysical measurement) usually produces doubled anomaly (positive and negative) in the magnetic map depending on the geographical position of the measurement area. The only exceptions are the northern and the southern magnetic poles of the Earth and the magnetic equator. In order to simplify the interpretation of magnetic maps an elegant way was developed: the reduction to pole. This is a transformation resulting a magnetic data set that one would measure above the same magnetic body on the north (or southern) pole.

In order to apply our robust 2D IRLS-FT method a synthetic data set was generated. The measurement area was defined on the surface between (-100, 100) m in both of xand ydirection. An anomaly of magnetization 100 nT (with D= 2.5° declination and I= 63° inclination) was assumed between the z-coordinates (20, 10) m. A rectangular measurement system was assumed with 5 m spacing in both directions (resulting in 1681 “measurement” data). The surface magnetic data calculated by means of the method of Kunaratnam  are shown in Figure 7. As it was mentioned, the interpretation of magnetic measurements is often supported by reducing the data to I= 90° pole. This can be done in the spatial frequency domain by applying the formula

R(u,v)=T(u,v)S(u,v),E62

where T(u,v)is the 2D Fourier transform of the magnetic data set, S(u,v)is the frequency domain operator of the pole reduction. The reduced data set in space domain can be found by inverse Fourier transformation of the R(u,v)data set. This is shown in Figure 8 using noise-free magnetic data and the traditional DFT in 2D Fourier transformation.

In order to simulate noisy data set the magnetic data were contaminated with random noise following Cauchy distribution. The noisy data set and the result of pole reduction (using again the traditional DFT) is shown in Figures 9 and 10. It can be seen, that the pole reduction is highly distorted, which is caused by the low noise reduction capability of the 2D DFT algorithm proved in the previous chapter.

In contrary, the result of reduction to pole with the use of our new inversion-based 2D Fourier transformation algorithm is presented in Figure 11. In this case, we used Hermite function with 900 unknown expansion coefficients (considering the number of data, the inverse problem is sufficiently overdetermined). Figure 11 demonstrates high noise reduction capacity (compared to Figure 10, where the traditional 2D DFT was used for Fourier transformation). It can be seen that the pole-reduced data set is close to that shown in Figure 8 (noise-free data), and the limits of magnetization data are [0,250] in both cases. The result proves the successful applicability of our inversion-based 2D IRLS-FT algorithm.

## 7. Discussion

We presented a new algorithm for the 2D Fourier transform. Our purpose was to increase the noise rejection capacity of the Fourier transform. To do this, we applied the tools of inverse problem theory. In order to discretize the continuous function of the complex spectrum, series expansion was used. It was shown, that the Jacobian matrix of the inverse problem can be written as the inverse FT of the basis functions used in the discretization. Because of this reason Hermite functions were chosen as they are eigenfunctions of the Fourier transformation. This selection gave the possibility of very quick computation of the Jacobian even in 2D problems.

The unknown parameters (series expansion coefficients) are determined by solving an overdetermined inverse problem. For having a robust 2D FT method Cauchy-Steiner weights were applied in a robust iteratively reweighted least squares algorithm. In order to characterize the accuracy and the noise rejection capacity of the new Fourier Transform method we made numerical test using synthetic data sets containing random noise of Cauchy distribution and the characteristic distance between spectra calculated by means of noisy data as well as noise-free ones was calculated. It was shown that compared to the traditional DFT the characteristic distances were reduced by a factor of 6–7 so the noise reduction capability of the new inversion-based Fourier transform method (for abbreviation we used IRLS-FT) was clearly demonstrated.

Fourier transformation is widely used in science and techniques, so the new robust 2D Fourier transform method seems to be applicable on various fields of data processing dealing with noisy data sets, especially those containing outliers. As an example, we presented its application in reduction to pole, which is a frequently used operation in the interpretation of geomagnetic data sets. By our experience, the new method shows sufficient noise rejection capability compared to the traditional reduction to pole algorithm using the well-known DFT.

## 8. Conclusions

It was shown that considering the 2D Fourier transformation as an overdetermined inverse problem could result in a procedure with increased noise rejection capability. In order to find a robust method the iteratively reweighted least squares procedure using Cauchy-Steiner weights is proposed. In the framework of the new inversion-based FT method series expansion is used for discretization of the complex Fourier spectrum. The procedure is relatively quick, due to the appropriate choice of the set of basis function: the Hermite functions are involved, as they are eigenfunctions of the Fourier transformation.

## Acknowledgments

The research was supported by the National Research Development and Innovation Office (project no. K109441) and by the GINOP-2.3.2-15-2016-00010 "Development of enhanced engineering methods with the aim at utilization of subterranean energy resources" project in the framework of the Széchenyi 2020 Plan, funded by the European Union, co-financed by the European Structural and Investment Funds.

chapter PDF
Citations in RIS format
Citations in bibtex format

## More

© 2017 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution 3.0 License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## How to cite and reference

### Cite this chapter Copy to clipboard

Mihály Dobróka, Hajnalka Szegedi and Péter Vass (February 8th 2017). Inversion-Based Fourier Transform as a New Tool for Noise Rejection, Fourier Transforms - High-tech Application and Current Trends, Goran S. Nikolic, Milorad D. Cakic and Dragan J. Cvetkovic, IntechOpen, DOI: 10.5772/66338. Available from:

### chapter statistics

2Crossref citations

### Related Content

Next chapter

#### Single Bin Sliding Discrete Fourier Transform

By Carlos Martin Orallo and Ignacio Carugati

First chapter

#### Fourier Transform Infrared Imaging Spectroscopy in Biomedicine – Important Things to Consider When Planning a New Experiment

By Rieppo J., Rieppo L., Saarakkala S. and Jurvelin J.S.

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.