WorldWideScience

Sample records for fourier rebinning algorithm

  1. Fourier rebinning algorithm for inverse geometry CT.

    Science.gov (United States)

    Mazin, Samuel R; Pele, Norbert J

    2008-11-01

    Inverse geometry computed tomography (IGCT) is a new type of volumetric CT geometry that employs a large array of x-ray sources opposite a smaller detector array. Volumetric coverage and high isotropic resolution produce very large data sets and therefore require a computationally efficient three-dimensional reconstruction algorithm. The purpose of this work was to adapt and evaluate a fast algorithm based on Defrise's Fourier rebinning (FORE), originally developed for positron emission tomography. The results were compared with the average of FDK reconstructions from each source row. The FORE algorithm is an order of magnitude faster than the FDK-type method for the case of 11 source rows. In the center of the field-of-view both algorithms exhibited the same resolution and noise performance. FORE exhibited some resolution loss (and less noise) in the periphery of the field-of-view. FORE appears to be a fast and reasonably accurate reconstruction method for IGCT.

  2. Exact and approximate Fourier rebinning algorithms for the solution of the data truncation problem in 3-D PET.

    Science.gov (United States)

    Bouallègue, Fayçal Ben; Crouzet, Jean-François; Comtat, Claude; Fourcade, Marjolaine; Mohammadi, Bijan; Mariano-Goulart, Denis

    2007-07-01

    This paper presents an extended 3-D exact rebinning formula in the Fourier space that leads to an iterative reprojection algorithm (iterative FOREPROJ), which enables the estimation of unmeasured oblique projection data on the basis of the whole set of measured data. In first approximation, this analytical formula also leads to an extended Fourier rebinning equation that is the basis for an approximate reprojection algorithm (extended FORE). These algorithms were evaluated on numerically simulated 3-D positron emission tomography (PET) data for the solution of the truncation problem, i.e., the estimation of the missing portions in the oblique projection data, before the application of algorithms that require complete projection data such as some rebinning methods (FOREX) or 3-D reconstruction algorithms (3DRP or direct Fourier methods). By taking advantage of all the 3-D data statistics, the iterative FOREPROJ reprojection provides a reliable alternative to the classical FOREPROJ method, which only exploits the low-statistics nonoblique data. It significantly improves the quality of the external reconstructed slices without loss of spatial resolution. As for the approximate extended FORE algorithm, it clearly exhibits limitations due to axial interpolations, but will require clinical studies with more realistic measured data in order to decide on its pertinence.

  3. Fourier rebinning and consistency equations for time-of-flight PET planograms.

    Science.gov (United States)

    Li, Yusheng; Defrise, Michel; Matej, Samuel; Metzler, Scott D

    2016-01-01

    Due to the unique geometry, dual-panel PET scanners have many advantages in dedicated breast imaging and on-board imaging applications since the compact scanners can be combined with other imaging and treatment modalities. The major challenges of dual-panel PET imaging are the limited-angle problem and data truncation, which can cause artifacts due to incomplete data sampling. The time-of-flight (TOF) information can be a promising solution to reduce these artifacts. The TOF planogram is the native data format for dual-panel TOF PET scanners, and the non-TOF planogram is the 3D extension of linogram. The TOF planograms is five-dimensional while the objects are three-dimensional, and there are two degrees of redundancy. In this paper, we derive consistency equations and Fourier-based rebinning algorithms to provide a complete understanding of the rich structure of the fully 3D TOF planograms. We first derive two consistency equations and John's equation for 3D TOF planograms. By taking the Fourier transforms, we obtain two Fourier consistency equations and the Fourier-John equation, which are the duals of the consistency equations and John's equation, respectively. We then solve the Fourier consistency equations and Fourier-John equation using the method of characteristics. The two degrees of entangled redundancy of the 3D TOF data can be explicitly elicited and exploited by the solutions along the characteristic curves. As the special cases of the general solutions, we obtain Fourier rebinning and consistency equations (FORCEs), and thus we obtain a complete scheme to convert among different types of PET planograms: 3D TOF, 3D non-TOF, 2D TOF and 2D non-TOF planograms. The FORCEs can be used as Fourier-based rebinning algorithms for TOF-PET data reduction, inverse rebinnings for designing fast projectors, or consistency conditions for estimating missing data. As a byproduct, we show the two consistency equations are necessary and sufficient for 3D TOF planograms

  4. Fourier rebinning and consistency equations for time-of-flight PET planograms

    International Nuclear Information System (INIS)

    Li, Yusheng; Matej, Samuel; Metzler, Scott D; Defrise, Michel

    2016-01-01

    Due to the unique geometry, dual-panel PET scanners have many advantages in dedicated breast imaging and on-board imaging applications since the compact scanners can be combined with other imaging and treatment modalities. The major challenges of dual-panel PET imaging are the limited-angle problem and data truncation, which can cause artifacts due to incomplete data sampling. The time-of-flight (TOF) information can be a promising solution to reduce these artifacts. The TOF planogram is the native data format for dual-panel TOF PET scanners, and the non-TOF planogram is the 3D extension of linogram. The TOF planograms is five-dimensional while the objects are three-dimensional, and there are two degrees of redundancy. In this paper, we derive consistency equations and Fourier-based rebinning algorithms to provide a complete understanding of the rich structure of the fully 3D TOF planograms. We first derive two consistency equations and John’s equation for 3D TOF planograms. By taking the Fourier transforms, we obtain two Fourier consistency equations (FCEs) and the Fourier–John equation (FJE), which are the duals of the consistency equations and John’s equation, respectively. We then solve the FCEs and FJE using the method of characteristics. The two degrees of entangled redundancy of the 3D TOF data can be explicitly elicited and exploited by the solutions along the characteristic curves. As the special cases of the general solutions, we obtain Fourier rebinning and consistency equations (FORCEs), and thus we obtain a complete scheme to convert among different types of PET planograms: 3D TOF, 3D non-TOF, 2D TOF and 2D non-TOF planograms. The FORCEs can be used as Fourier-based rebinning algorithms for TOF-PET data reduction, inverse rebinnings for designing fast projectors, or consistency conditions for estimating missing data. As a byproduct, we show the two consistency equations are necessary and sufficient for 3D TOF planograms. Finally, we give

  5. Advancements to the planogram frequency–distance rebinning algorithm

    International Nuclear Information System (INIS)

    Champley, Kyle M; Kinahan, Paul E; Raylman, Raymond R

    2010-01-01

    In this paper we consider the task of image reconstruction in positron emission tomography (PET) with the planogram frequency–distance rebinning (PFDR) algorithm. The PFDR algorithm is a rebinning algorithm for PET systems with panel detectors. The algorithm is derived in the planogram coordinate system which is a native data format for PET systems with panel detectors. A rebinning algorithm averages over the redundant four-dimensional set of PET data to produce a three-dimensional set of data. Images can be reconstructed from this rebinned three-dimensional set of data. This process enables one to reconstruct PET images more quickly than reconstructing directly from the four-dimensional PET data. The PFDR algorithm is an approximate rebinning algorithm. We show that implementing the PFDR algorithm followed by the (ramp) filtered backprojection (FBP) algorithm in linogram coordinates from multiple views reconstructs a filtered version of our image. We develop an explicit formula for this filter which can be used to achieve exact reconstruction by means of a modified FBP algorithm applied to the stack of rebinned linograms and can also be used to quantify the errors introduced by the PFDR algorithm. This filter is similar to the filter in the planogram filtered backprojection algorithm derived by Brasse et al. The planogram filtered backprojection and exact reconstruction with the PFDR algorithm require complete projections which can be completed with a reprojection algorithm. The PFDR algorithm is similar to the rebinning algorithm developed by Kao et al. By expressing the PFDR algorithm in detector coordinates, we provide a comparative analysis between the two algorithms. Numerical experiments using both simulated data and measured data from a positron emission mammography/tomography (PEM/PET) system are performed. Images are reconstructed by PFDR+FBP (PFDR followed by 2D FBP reconstruction), PFDRX (PFDR followed by the modified FBP algorithm for exact

  6. A fast rebinning algorithm for 3D positron emission tomography using John's equation

    Science.gov (United States)

    Defrise, Michel; Liu, Xuan

    1999-08-01

    Volume imaging in positron emission tomography (PET) requires the inversion of the three-dimensional (3D) x-ray transform. The usual solution to this problem is based on 3D filtered-backprojection (FBP), but is slow. Alternative methods have been proposed which factor the 3D data into independent 2D data sets corresponding to the 2D Radon transforms of a stack of parallel slices. Each slice is then reconstructed using 2D FBP. These so-called rebinning methods are numerically efficient but are approximate. In this paper a new exact rebinning method is derived by exploiting the fact that the 3D x-ray transform of a function is the solution to the second-order partial differential equation first studied by John. The method is proposed for two sampling schemes, one corresponding to a pair of infinite plane detectors and another one corresponding to a cylindrical multi-ring PET scanner. The new FORE-J algorithm has been implemented for this latter geometry and was compared with the approximate Fourier rebinning algorithm FORE and with another exact rebinning algorithm, FOREX. Results with simulated data demonstrate a significant improvement in accuracy compared to FORE, while the reconstruction time is doubled. Compared to FOREX, the FORE-J algorithm is slightly less accurate but more than three times faster.

  7. Two-sheet surface rebinning algorithm for real time cone beam tomography

    Energy Technology Data Exchange (ETDEWEB)

    Betcke, Marta M. [University College London (United Kingdom). Dept. of Computer Science; Lionheart, William R.B. [Manchester Univ. (United Kingdom). School of Mathematics

    2011-07-01

    The Rapiscan RTT80 is an example of a fast cone beam CT scanner in which the X-ray sources are fixed on a circle while the detector rows are offset axially on one side of the sources. Reconstruction for this offset truncation presents a new challenge and we propose a method using rebinning to an optimal two-sheet surface. (orig.)

  8. Exact rebinning methods for three-dimensional PET.

    Science.gov (United States)

    Liu, X; Defrise, M; Michel, C; Sibomana, M; Comtat, C; Kinahan, P; Townsend, D

    1999-08-01

    The high computational cost of data processing in volume PET imaging is still hindering the routine application of this successful technique, especially in the case of dynamic studies. This paper describes two new algorithms based on an exact rebinning equation, which can be applied to accelerate the processing of three-dimensional (3-D) PET data. The first algorithm, FOREPROJ, is a fast-forward projection algorithm that allows calculation of the 3-D attenuation correction factors (ACF's) directly from a two-dimensional (2-D) transmission scan, without first reconstructing the attenuation map and then performing a 3-D forward projection. The use of FOREPROJ speeds up the estimation of the 3-D ACF's by more than a factor five. The second algorithm, FOREX, is a rebinning algorithm that is also more than five times faster, compared to the standard reprojection algorithm (3DRP) and does not suffer from the image distortions generated by the even faster approximate Fourier rebinning (FORE) method at large axial apertures. However, FOREX is probably not required by most existing scanners, as the axial apertures are not large enough to show improvements over FORE with clinical data. Both algorithms have been implemented and applied to data simulated for a scanner with a large axial aperture (30 degrees), and also to data acquired with the ECAT HR and the ECAT HR+ scanners. Results demonstrate the excellent accuracy achieved by these algorithms and the important speedup when the sinogram sizes are powers of two.

  9. Discrete Fourier analysis of multigrid algorithms

    NARCIS (Netherlands)

    van der Vegt, Jacobus J.W.; Rhebergen, Sander

    2011-01-01

    The main topic of this report is a detailed discussion of the discrete Fourier multilevel analysis of multigrid algorithms. First, a brief overview of multigrid methods is given for discretizations of both linear and nonlinear partial differential equations. Special attention is given to the

  10. Fast algorithm of adaptive Fourier series

    Science.gov (United States)

    Gao, You; Ku, Min; Qian, Tao

    2018-05-01

    Adaptive Fourier decomposition (AFD, precisely 1-D AFD or Core-AFD) was originated for the goal of positive frequency representations of signals. It achieved the goal and at the same time offered fast decompositions of signals. There then arose several types of AFDs. AFD merged with the greedy algorithm idea, and in particular, motivated the so-called pre-orthogonal greedy algorithm (Pre-OGA) that was proven to be the most efficient greedy algorithm. The cost of the advantages of the AFD type decompositions is, however, the high computational complexity due to the involvement of maximal selections of the dictionary parameters. The present paper offers one formulation of the 1-D AFD algorithm by building the FFT algorithm into it. Accordingly, the algorithm complexity is reduced, from the original $\\mathcal{O}(M N^2)$ to $\\mathcal{O}(M N\\log_2 N)$, where $N$ denotes the number of the discretization points on the unit circle and $M$ denotes the number of points in $[0,1)$. This greatly enhances the applicability of AFD. Experiments are carried out to show the high efficiency of the proposed algorithm.

  11. Testing a Fourier Accelerated Hybrid Monte Carlo Algorithm

    OpenAIRE

    Catterall, S.; Karamov, S.

    2001-01-01

    We describe a Fourier Accelerated Hybrid Monte Carlo algorithm suitable for dynamical fermion simulations of non-gauge models. We test the algorithm in supersymmetric quantum mechanics viewed as a one-dimensional Euclidean lattice field theory. We find dramatic reductions in the autocorrelation time of the algorithm in comparison to standard HMC.

  12. The linogram algorithm and direct fourier method with linograms

    International Nuclear Information System (INIS)

    Edholm, P.R.

    1990-01-01

    This text is an attempt to describe the linogram algorithm based on a somewhat simplified mathematical description of the algorithm which is also more similar to the actual digital implementation. Another algorithm with linograms, which may be called a direct fourier method is also presented. (K.A.E.)

  13. Influence of rebinning on the reconstructed resolution of fan-beam SPECT

    International Nuclear Information System (INIS)

    Koole, M.; D'Asseler, Y.; Staelens, S.; Vandenberghe, S.; Eede, I. van den; Walle, R. van de; Lemahieu, I.

    2002-01-01

    Aim: Fan-beam projection data can be rebinned to a parallel-beam geometry. This rebinning operation allows these data to be reconstructed with algorithms for parallel-beam projection data. The advantage of such an operation is that a dedicated projection/backprojection step for fan-beam geometry doesn't need to be developed. In clinical practice bilinear interpolation is often used for this rebinning operation. The aim of this study is to investigate the influence of the rebinning operation on the resolution properties of the reconstructed SPECT-image. Materials and methods: We have simulated the resolution properties of a fan-beam collimator, used in clinical routine, by means of a dedicated projector operation which models the distance dependent sensitivity and resolution of the collimator. With this projector, we generated noise-free sinograms for a point source located at various distances from the center of rotation. The number of angles of these sinograms varied from 60 to 180, corresponding to a step angle of 6 to 2 degrees. These generated fan-beam projection data were reconstructed directly with a filtered backprojection algorithm for fan-beam projection data, which consists of weighting and filtering the projection data with a ramp filter and of a weighted backprojection. Next, the generated fan-beam projection data were rebinned by means of bilinear interpolation and reconstructed with standard filtered backprojection for parallel-beam data. A two-dimensional Gaussian was fitted to the two point sources, one reconstructed with FBP for fan-beam and one reconstructed with FBP for parallel-beam after rebinning, yielding an estimate for the reconstructed Full Width at Half Maximum (FWHM) in the radial and tangential direction, for different locations in the field of view. Results: Results show little difference in resolution degradation in the radial direction between direct reconstruction and reconstruction after rebinning. However, significant loss in

  14. An algorithm for the basis of the finite Fourier transform

    Science.gov (United States)

    Santhanam, Thalanayar S.

    1995-01-01

    The Finite Fourier Transformation matrix (F.F.T.) plays a central role in the formulation of quantum mechanics in a finite dimensional space studied by the author over the past couple of decades. An outstanding problem which still remains open is to find a complete basis for F.F.T. In this paper we suggest a simple algorithm to find the eigenvectors of F.T.T.

  15. Limitations on continuous variable quantum algorithms with Fourier transforms

    International Nuclear Information System (INIS)

    Adcock, Mark R A; Hoeyer, Peter; Sanders, Barry C

    2009-01-01

    We study quantum algorithms implemented within a single harmonic oscillator, or equivalently within a single mode of the electromagnetic field. Logical states correspond to functions of the canonical position, and the Fourier transform to canonical momentum serves as the analogue of the Hadamard transform for this implementation. This continuous variable version of quantum information processing has widespread appeal because of advanced quantum optics technology that can create, manipulate and read Gaussian states of light. We show that, contrary to a previous claim, this implementation of quantum information processing has limitations due to a position-momentum trade-off of the Fourier transform, analogous to the famous time-bandwidth theorem of signal processing.

  16. A unified Fourier theory for time-of-flight PET data.

    Science.gov (United States)

    Li, Yusheng; Matej, Samuel; Metzler, Scott D

    2016-01-21

    Fully 3D time-of-flight (TOF) PET scanners offer the potential of previously unachievable image quality in clinical PET imaging. TOF measurements add another degree of redundancy for cylindrical PET scanners and make photon-limited TOF-PET imaging more robust than non-TOF PET imaging. The data space for 3D TOF-PET data is five-dimensional with two degrees of redundancy. Previously, consistency equations were used to characterize the redundancy of TOF-PET data. In this paper, we first derive two Fourier consistency equations and Fourier-John equation for 3D TOF PET based on the generalized projection-slice theorem; the three partial differential equations (PDEs) are the dual of the sinogram consistency equations and John's equation. We then solve the three PDEs using the method of characteristics. The two degrees of entangled redundancy of the TOF-PET data can be explicitly elicited and exploited by the solutions of the PDEs along the characteristic curves, which gives a complete understanding of the rich structure of the 3D x-ray transform with TOF measurement. Fourier rebinning equations and other mapping equations among different types of PET data are special cases of the general solutions. We also obtain new Fourier rebinning and consistency equations (FORCEs) from other special cases of the general solutions, and thus we obtain a complete scheme to convert among different types of PET data: 3D TOF, 3D non-TOF, 2D TOF and 2D non-TOF data. The new FORCEs can be used as new Fourier-based rebinning algorithms for TOF-PET data reduction, inverse rebinnings for designing fast projectors, or consistency conditions for estimating missing data. Further, we give a geometric interpretation of the general solutions--the two families of characteristic curves can be obtained by respectively changing the azimuthal and co-polar angles of the biorthogonal coordinates in Fourier space. We conclude the unified Fourier theory by showing that the Fourier consistency equations are

  17. Tilted cone-beam reconstruction with row-wise fan-to-parallel rebinning

    International Nuclear Information System (INIS)

    Hsieh Jiang; Tang Xiangyang

    2006-01-01

    Reconstruction algorithms for cone-beam CT have been the focus of many studies. Several exact and approximate reconstruction algorithms were proposed for step-and-shoot and helical scanning trajectories to combat cone-beam related artefacts. In this paper, we present a new closed-form cone-beam reconstruction formula for tilted gantry data acquisition. Although several algorithms were proposed in the past to combat errors induced by the gantry tilt, none of the algorithms addresses the scenario in which the cone-beam geometry is first rebinned to a set of parallel beams prior to the filtered backprojection. We show that the image quality advantages of the rebinned parallel-beam reconstruction are significant, which makes the development of such an algorithm necessary. Because of the rebinning process, the reconstruction algorithm becomes more complex and the amount of iso-centre adjustment depends not only on the projection and tilt angles, but also on the reconstructed pixel location. In this paper, we first demonstrate the advantages of the row-wise fan-to-parallel rebinning and derive a closed-form solution for the reconstruction algorithm for the step-and-shoot and constant-pitch helical scans. The proposed algorithm requires the 'warping' of the reconstruction matrix on a view-by-view basis prior to the backprojection step. We further extend the algorithm to the variable-pitch helical scans in which the patient table travels at non-constant speeds. The algorithm was tested extensively on both the 16- and 64-slice CT scanners. The efficacy of the algorithm is clearly demonstrated by multiple experiments

  18. The discrete Fourier transform theory, algorithms and applications

    CERN Document Server

    Sundaraajan, D

    2001-01-01

    This authoritative book provides comprehensive coverage of practical Fourier analysis. It develops the concepts right from the basics and gradually guides the reader to the advanced topics. It presents the latest and practically efficient DFT algorithms, as well as the computation of discrete cosine and Walsh-Hadamard transforms. The large number of visual aids such as figures, flow graphs and flow charts makes the mathematical topic easy to understand. In addition, the numerous examples and the set of C-language programs (a supplement to the book) help greatly in understanding the theory and

  19. A unified Fourier theory for time-of-flight PET data

    International Nuclear Information System (INIS)

    Li, Yusheng; Matej, Samuel; Metzler, Scott D

    2016-01-01

    Fully 3D time-of-flight (TOF) PET scanners offer the potential of previously unachievable image quality in clinical PET imaging. TOF measurements add another degree of redundancy for cylindrical PET scanners and make photon-limited TOF-PET imaging more robust than non-TOF PET imaging. The data space for 3D TOF-PET data is five-dimensional with two degrees of redundancy. Previously, consistency equations were used to characterize the redundancy of TOF-PET data. In this paper, we first derive two Fourier consistency equations and Fourier–John equation for 3D TOF PET based on the generalized projection-slice theorem; the three partial differential equations (PDEs) are the dual of the sinogram consistency equations and John’s equation. We then solve the three PDEs using the method of characteristics. The two degrees of entangled redundancy of the TOF-PET data can be explicitly elicited and exploited by the solutions of the PDEs along the characteristic curves, which gives a complete understanding of the rich structure of the 3D x-ray transform with TOF measurement. Fourier rebinning equations and other mapping equations among different types of PET data are special cases of the general solutions. We also obtain new Fourier rebinning and consistency equations (FORCEs) from other special cases of the general solutions, and thus we obtain a complete scheme to convert among different types of PET data: 3D TOF, 3D non-TOF, 2D TOF and 2D non-TOF data. The new FORCEs can be used as new Fourier-based rebinning algorithms for TOF-PET data reduction, inverse rebinnings for designing fast projectors, or consistency conditions for estimating missing data. Further, we give a geometric interpretation of the general solutions—the two families of characteristic curves can be obtained by respectively changing the azimuthal and co-polar angles of the biorthogonal coordinates in Fourier space. We conclude the unified Fourier theory by showing that the Fourier consistency equations

  20. On the Cooley-Turkey Fast Fourier algorithm for arbitrary factors ...

    African Journals Online (AJOL)

    Atonuje and Okonta in [1] developed the Cooley-Turkey Fast Fourier transform algorithm and its application to the Fourier transform of discretely sampled data points N, expressed in terms of a power y of 2. In this paper, we extend the formalism of [1] Cookey-Turkey Fast Fourier transform algorithm. The method is developed ...

  1. Fourier domain preconditioned conjugate gradient algorithm for atmospheric tomography.

    Science.gov (United States)

    Yang, Qiang; Vogel, Curtis R; Ellerbroek, Brent L

    2006-07-20

    By 'atmospheric tomography' we mean the estimation of a layered atmospheric turbulence profile from measurements of the pupil-plane phase (or phase gradients) corresponding to several different guide star directions. We introduce what we believe to be a new Fourier domain preconditioned conjugate gradient (FD-PCG) algorithm for atmospheric tomography, and we compare its performance against an existing multigrid preconditioned conjugate gradient (MG-PCG) approach. Numerical results indicate that on conventional serial computers, FD-PCG is as accurate and robust as MG-PCG, but it is from one to two orders of magnitude faster for atmospheric tomography on 30 m class telescopes. Simulations are carried out for both natural guide stars and for a combination of finite-altitude laser guide stars and natural guide stars to resolve tip-tilt uncertainty.

  2. A new BP Fourier algorithm and its application in English teaching evaluation

    Science.gov (United States)

    Pei, Xuehui; Pei, Guixin

    2017-08-01

    BP neural network algorithm has wide adaptability and accuracy when used in complicated system evaluation, but its calculation defects such as slow convergence have limited its practical application. The paper tries to speed up the calculation convergence of BP neural network algorithm with Fourier basis functions and presents a new BP Fourier algorithm for complicated system evaluation. First, shortages and working principle of BP algorithm are analyzed for subsequent targeted improvement; Second, the presented BP Fourier algorithm adopts Fourier basis functions to simplify calculation structure, designs new calculation transfer function between input and output layers, and conducts theoretical analysis to prove the efficiency of the presented algorithm; Finally, the presented algorithm is used in evaluating university English teaching and the application results shows that the presented BP Fourier algorithm has better performance in calculation efficiency and evaluation accuracy and can be used in evaluating complicated system practically.

  3. Implementation of Period-Finding Algorithm by Means of Simulating Quantum Fourier Transform

    Directory of Open Access Journals (Sweden)

    Zohreh Moghareh Abed

    2010-01-01

    Full Text Available In this paper, we introduce quantum fourier transform as a key ingredient for many useful algorithms. These algorithms make a solution for problems which is considered to be intractable problems on a classical computer. Quantum Fourier transform is propounded as a key for quantum phase estimation algorithm. In this paper our aim is the implementation of period-finding algorithm.Quantum computer solves this problem, exponentially faster than classical one. Quantum phase estimation algorithm is the key for the period-finding problem .Therefore, by means of simulating quantum Fourier transform, we are able to implement the period-finding algorithm. In this paper, the simulation of quantum Fourier transform is carried out by Matlab software.

  4. High-speed fan-beam reconstruction using direct two-dimensional Fourier transform method

    International Nuclear Information System (INIS)

    Niki, Noboru; Mizutani, Toshio; Takahashi, Yoshizo; Inouye, Tamon.

    1984-01-01

    Since the first development of X-ray computer tomography (CT), various efforts have been made to obtain high quality of high-speed image. However, the development of high resolution CT and the ultra-high speed CT to be applied to hearts is still desired. The X-ray beam scanning method was already changed from the parallel beam system to the fan-beam system in order to greatly shorten the scanning time. Also, the filtered back projection (DFBP) method has been employed to directly processing fan-beam projection data as reconstruction method. Although the two-dimensional Fourier transform (TFT) method significantly faster than FBP method was proposed, it has not been sufficiently examined for fan-beam projection data. Thus, the ITFT method was investigated, which first executes rebinning algorithm to convert the fan-beam projection data to the parallel beam projection data, thereafter, uses two-dimensional Fourier transform. By this method, although high speed is expected, the reconstructed images might be degraded due to the adoption of rebinning algorithm. Therefore, the effect of the interpolation error of rebinning algorithm on the reconstructed images has been analyzed theoretically, and finally, the result of the employment of spline interpolation which allows the acquisition of high quality images with less errors has been shown by the numerical and visual evaluation based on simulation and actual data. Computation time was reduced to 1/15 for the image matrix of 512 and to 1/30 for doubled matrix. (Wakatsuki, Y.)

  5. Missing texture reconstruction method based on error reduction algorithm using Fourier transform magnitude estimation scheme.

    Science.gov (United States)

    Ogawa, Takahiro; Haseyama, Miki

    2013-03-01

    A missing texture reconstruction method based on an error reduction (ER) algorithm, including a novel estimation scheme of Fourier transform magnitudes is presented in this brief. In our method, Fourier transform magnitude is estimated for a target patch including missing areas, and the missing intensities are estimated by retrieving its phase based on the ER algorithm. Specifically, by monitoring errors converged in the ER algorithm, known patches whose Fourier transform magnitudes are similar to that of the target patch are selected from the target image. In the second approach, the Fourier transform magnitude of the target patch is estimated from those of the selected known patches and their corresponding errors. Consequently, by using the ER algorithm, we can estimate both the Fourier transform magnitudes and phases to reconstruct the missing areas.

  6. A Fourier reconstruction algorithm with constant attenuation compensation using 1800 acquisition data for SPECT

    International Nuclear Information System (INIS)

    Tang Qiulin; Zeng, Gengsheng L; Gullberg, Grant T

    2007-01-01

    In this paper, we develop an approximate analytical reconstruction algorithm that compensates for uniform attenuation in 2D parallel-beam SPECT with a 180 0 acquisition. This new algorithm is in the form of a direct Fourier reconstruction. The complex variable central slice theorem is used to derive this algorithm. The image is reconstructed with the following steps: first, the attenuated projection data acquired over 180 deg. are extended to 360 deg. and the value for the uniform attenuator is changed to a negative value. The Fourier transform (FT) of the image in polar coordinates is obtained from the Fourier transform of an analytic function interpolated from an extension of the projection data according to the complex central slice theorem. Finally, the image is obtained by performing a 2D inverse Fourier transform. Computer simulations and comparison studies with a 360 deg. full-scan algorithm are provided

  7. Periodic transonic flow simulation using fourier-based algorithm

    International Nuclear Information System (INIS)

    Mohaghegh, Mohammad Reza; Malekjafarian, Majid

    2014-01-01

    The present research simulates time-periodic unsteady transonic flow around pitching airfoils via the solution of unsteady Euler and Navier-Stokes equations, using time spectral method (TSM) and compares it with the traditional methods like BDF and explicit structured adaptive grid method. The TSM uses a Fourier representation in time and hence solves for the periodic state directly without resolving transients (which consume most of the resources in a time-accurate scheme). Mathematical tools used here are discrete Fourier transformations. The TSM has been validated with 2D external aerodynamics test cases. These test cases are NACA 64A010 (CT6) and NACA 0012 (CT1 and CT5) pitching airfoils. Because of turbulent nature of flow, Baldwin-Lomax turbulence model has been used in viscous flow analysis with large oscillation amplitude (CT5 type). The results presented by the TSM are compared with experimental data and the two other methods. By enforcing periodicity and using Fourier representation in time that has a spectral accuracy, tremendous reduction of computational cost has been obtained compared to the conventional time-accurate methods. Results verify the small number of time intervals per pitching cycle (just four time intervals) required to capture the flow physics with small oscillation amplitude (CT6) and large oscillation amplitude (CT5) as compared to the other two methods.

  8. Specification of the Fast Fourier Transform algorithm as a term rewriting system

    NARCIS (Netherlands)

    Rodenburg, P.H.; Hoekzema, D.J.

    1987-01-01

    We specify an algorithm for multiplying polynomials with complex coefficients incorporating, the Fast Fourier Transform algorithm of Cooley and Tukey [CT]. The specification formalism we use is a variant of the formalism ASF described in. [BHK]. The difference with ASF is essentially a matter of

  9. Fast fourier algorithms in spectral computation and analysis of vibrating machines

    International Nuclear Information System (INIS)

    Farooq, U.; Hafeez, T.; Khan, M.Z.; Amir, M.

    2001-01-01

    In this work we have discussed Fourier and its history series, relationships among various Fourier mappings, Fourier coefficients, transforms, inverse transforms, integrals, analyses, discrete and fast algorithms for data processing and analysis of vibrating systems. The evaluation of magnitude of the source signal at transmission time, related coefficient matrix, intensity, and magnitude at the receiving end (stations). Matrix computation of Fourier transform has been explained, and applications are presented. The fast Fourier transforms, new computational scheme. have been tested with an example. The work also includes digital programs for obtaining the frequency contents of time function. It has been explained that how the fast Fourier algorithms (FFT) has decreased computational work by several order of magnitudes and split the spectrum of a signal into two (even and odd modes) at every successive step. That fast quantitative processing for discrete Fourier transforms' computations as well as signal splitting and combination provides an efficient. and reliable tool for spectral analyses. Fourier series decompose the given variable into a sum of oscillatory functions each having a specific frequency. These frequencies, with their corresponding amplitude and phase angles, constitute the frequency contents of the original time functions. These fast processing achievements, signals decomposition and combination may be carried out by the principle of superposition and convolution for, even, signals of different frequencies. Considerable information about a machine or a structure can be derived from variable speed and frequency tests. (author)

  10. Single-slice rebinning method for helical cone-beam CT

    International Nuclear Information System (INIS)

    Noo, F.; Defrise, M.; Clackdoyle, R.

    1999-01-01

    In this paper, we present reconstruction results from helical cone-beam CT data, obtained using a simple and fast algorithm, which we call the CB-SSRB algorithm. This algorithm combines the single-slice rebinning method of PET imaging with the weighting schemes of spiral CT algorithms. The reconstruction is approximate but can be performed using 2D multislice fan-beam filtered backprojection. The quality of the results is surprisingly good, and far exceeds what one might expect, even when the pitch of the helix is large. In particular, with this algorithm comparable quality is obtained using helical cone-beam data with a normalized pitch of 10 to that obtained using standard spiral CT reconstruction with a normalized pitch of 2. (author)

  11. Study on the algorithm of computational ghost imaging based on discrete fourier transform measurement matrix

    Science.gov (United States)

    Zhang, Leihong; Liang, Dong; Li, Bei; Kang, Yi; Pan, Zilan; Zhang, Dawei; Gao, Xiumin; Ma, Xiuhua

    2016-07-01

    On the basis of analyzing the cosine light field with determined analytic expression and the pseudo-inverse method, the object is illuminated by a presetting light field with a determined discrete Fourier transform measurement matrix, and the object image is reconstructed by the pseudo-inverse method. The analytic expression of the algorithm of computational ghost imaging based on discrete Fourier transform measurement matrix is deduced theoretically, and compared with the algorithm of compressive computational ghost imaging based on random measurement matrix. The reconstruction process and the reconstruction error are analyzed. On this basis, the simulation is done to verify the theoretical analysis. When the sampling measurement number is similar to the number of object pixel, the rank of discrete Fourier transform matrix is the same as the one of the random measurement matrix, the PSNR of the reconstruction image of FGI algorithm and PGI algorithm are similar, the reconstruction error of the traditional CGI algorithm is lower than that of reconstruction image based on FGI algorithm and PGI algorithm. As the decreasing of the number of sampling measurement, the PSNR of reconstruction image based on FGI algorithm decreases slowly, and the PSNR of reconstruction image based on PGI algorithm and CGI algorithm decreases sharply. The reconstruction time of FGI algorithm is lower than that of other algorithms and is not affected by the number of sampling measurement. The FGI algorithm can effectively filter out the random white noise through a low-pass filter and realize the reconstruction denoising which has a higher denoising capability than that of the CGI algorithm. The FGI algorithm can improve the reconstruction accuracy and the reconstruction speed of computational ghost imaging.

  12. A Fourier analysis for a fast simulation algorithm. [for switching converters

    Science.gov (United States)

    King, Roger J.

    1988-01-01

    This paper presents a derivation of compact expressions for the Fourier series analysis of the steady-state solution of a typical switching converter. The modeling procedure for the simulation and the steady-state solution is described, and some desirable traits for its matrix exponential subroutine are discussed. The Fourier analysis algorithm was tested on a phase-controlled parallel-loaded resonant converter, providing an experimental confirmation.

  13. A Space Object Detection Algorithm using Fourier Domain Likelihood Ratio Test

    Science.gov (United States)

    Becker, D.; Cain, S.

    Space object detection is of great importance in the highly dependent yet competitive and congested space domain. Detection algorithms employed play a crucial role in fulfilling the detection component in the situational awareness mission to detect, track, characterize and catalog unknown space objects. Many current space detection algorithms use a matched filter or a spatial correlator to make a detection decision at a single pixel point of a spatial image based on the assumption that the data follows a Gaussian distribution. This paper explores the potential for detection performance advantages when operating in the Fourier domain of long exposure images of small and/or dim space objects from ground based telescopes. A binary hypothesis test is developed based on the joint probability distribution function of the image under the hypothesis that an object is present and under the hypothesis that the image only contains background noise. The detection algorithm tests each pixel point of the Fourier transformed images to make the determination if an object is present based on the criteria threshold found in the likelihood ratio test. Using simulated data, the performance of the Fourier domain detection algorithm is compared to the current algorithm used in space situational awareness applications to evaluate its value.

  14. Local structure information by EXAFS analysis using two algorithms for Fourier transform calculation

    International Nuclear Information System (INIS)

    Aldea, N; Pintea, S; Rednic, V; Matei, F; Hu Tiandou; Xie Yaning

    2009-01-01

    The present work is a comparison study between different algorithms of Fourier transform for obtaining very accurate local structure results using Extended X-ray Absorption Fine Structure technique. In this paper we focus on the local structural characteristics of supported nickel catalysts and Fe 3 O 4 core-shell nanocomposites. The radial distribution function could be efficiently calculated by the fast Fourier transform when the coordination shells are well separated while the Filon quadrature gave remarkable results for close-shell coordination.

  15. Bladed wheels damage detection through Non-Harmonic Fourier Analysis improved algorithm

    Science.gov (United States)

    Neri, P.

    2017-05-01

    Recent papers introduced the Non-Harmonic Fourier Analysis for bladed wheels damage detection. This technique showed its potential in estimating the frequency of sinusoidal signals even when the acquisition time is short with respect to the vibration period, provided that some hypothesis are fulfilled. Anyway, previously proposed algorithms showed severe limitations in cracks detection at their early stage. The present paper proposes an improved algorithm which allows to detect a blade vibration frequency shift due to a crack whose size is really small compared to the blade width. Such a technique could be implemented for condition-based maintenance, allowing to use non-contact methods for vibration measurements. A stator-fixed laser sensor could monitor all the blades as they pass in front of the spot, giving precious information about the wheel health. This configuration determines an acquisition time for each blade which become shorter as the machine rotational speed increases. In this situation, traditional Discrete Fourier Transform analysis results in poor frequency resolution, being not suitable for small frequency shift detection. Non-Harmonic Fourier Analysis instead showed high reliability in vibration frequency estimation even with data samples collected in a short time range. A description of the improved algorithm is provided in the paper, along with a comparison with the previous one. Finally, a validation of the method is presented, based on finite element simulations results.

  16. An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm

    Science.gov (United States)

    Zhang, B.; Sang, Jun; Alam, Mohammad S.

    2013-03-01

    An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm was proposed. Firstly, the original secret image was encrypted into two phase-only masks M1 and M2 via cascaded iterative Fourier transform (CIFT) algorithm. Then, the public-key encryption algorithm RSA was adopted to encrypt M2 into M2' . Finally, a host image was enlarged by extending one pixel into 2×2 pixels and each element in M1 and M2' was multiplied with a superimposition coefficient and added to or subtracted from two different elements in the 2×2 pixels of the enlarged host image. To recover the secret image from the stego-image, the two masks were extracted from the stego-image without the original host image. By applying public-key encryption algorithm, the key distribution was facilitated, and also compared with the image hiding method based on optical interference, the proposed method may reach higher robustness by employing the characteristics of the CIFT algorithm. Computer simulations show that this method has good robustness against image processing.

  17. Generalizing, optimizing, and inventing numerical algorithms for the fractional Fourier, Fresnel, and linear canonical transforms

    Science.gov (United States)

    Hennelly, Bryan M.; Sheridan, John T.

    2005-05-01

    By use of matrix-based techniques it is shown how the space-bandwidth product (SBP) of a signal, as indicated by the location of the signal energy in the Wigner distribution function, can be tracked through any quadratic-phase optical system whose operation is described by the linear canonical transform. Then, applying the regular uniform sampling criteria imposed by the SBP and linking the criteria explicitly to a decomposition of the optical matrix of the system, it is shown how numerical algorithms (employing interpolation and decimation), which exhibit both invertibility and additivity, can be implemented. Algorithms appearing in the literature for a variety of transforms (Fresnel, fractional Fourier) are shown to be special cases of our general approach. The method is shown to allow the existing algorithms to be optimized and is also shown to permit the invention of many new algorithms.

  18. Fourier transform resampling: Theory and application

    International Nuclear Information System (INIS)

    Hawkins, W.G.

    1996-01-01

    One of the most challenging problems in medical imaging is the development of reconstruction algorithms for nonstandard geometries. This work focuses on the application of Fourier analysis to the problem of resampling or rebinning. Conventional resampling methods utilizing some form of interpolation almost always result in a loss of resolution in the tomographic image. Fourier Transform Resampling (FTRS) offers potential improvement because the Modulation Transfer Function (MTF) of the process behaves like an ideal low pass filter. The MTF, however, is nonstationary if the coordinate transformation is nonlinear. FTRS may be viewed as a generalization of the linear coordinate transformations of standard Fourier analysis. Simulated MTF's were obtained by projecting point sources at different transverse positions in the flat fan beam detector geometry. These MTF's were compared to the closed form expression for FIRS. Excellent agreement was obtained for frequencies at or below the estimated cutoff frequency. The resulting FTRS algorithm is applied to simulations with symmetric fan beam geometry, an elliptical orbit and uniform attenuation, with a normalized root mean square error (NRME) of 0.036. Also, a Tc-99m point source study (1 cm dia., placed in air 10 cm from the COR) for a circular fan beam acquisition was reconstructed with a hybrid resampling method. The FWHM of the hybrid resampling method was 11.28 mm and compares favorably with a direct reconstruction (FWHM: 11.03 mm)

  19. Quantum Color Image Encryption Algorithm Based on A Hyper-Chaotic System and Quantum Fourier Transform

    Science.gov (United States)

    Tan, Ru-Chao; Lei, Tong; Zhao, Qing-Min; Gong, Li-Hua; Zhou, Zhi-Hong

    2016-12-01

    To improve the slow processing speed of the classical image encryption algorithms and enhance the security of the private color images, a new quantum color image encryption algorithm based on a hyper-chaotic system is proposed, in which the sequences generated by the Chen's hyper-chaotic system are scrambled and diffused with three components of the original color image. Sequentially, the quantum Fourier transform is exploited to fulfill the encryption. Numerical simulations show that the presented quantum color image encryption algorithm possesses large key space to resist illegal attacks, sensitive dependence on initial keys, uniform distribution of gray values for the encrypted image and weak correlation between two adjacent pixels in the cipher-image.

  20. Fully 3D PET image reconstruction using a fourier preconditioned conjugate-gradient algorithm

    International Nuclear Information System (INIS)

    Fessler, J.A.; Ficaro, E.P.

    1996-01-01

    Since the data sizes in fully 3D PET imaging are very large, iterative image reconstruction algorithms must converge in very few iterations to be useful. One can improve the convergence rate of the conjugate-gradient (CG) algorithm by incorporating preconditioning operators that approximate the inverse of the Hessian of the objective function. If the 3D cylindrical PET geometry were not truncated at the ends, then the Hessian of the penalized least-squares objective function would be approximately shift-invariant, i.e. G'G would be nearly block-circulant, where G is the system matrix. We propose a Fourier preconditioner based on this shift-invariant approximation to the Hessian. Results show that this preconditioner significantly accelerates the convergence of the CG algorithm with only a small increase in computation

  1. A conservative Fourier pseudospectral algorithm for a coupled nonlinear Schrödinger system

    International Nuclear Information System (INIS)

    Cai Jia-Xiang; Wang Yu-Shun

    2013-01-01

    We derive a new method for a coupled nonlinear Schrödinger system by using the square of first-order Fourier spectral differentiation matrix D 1 instead of traditional second-order Fourier spectral differentiation matrix D 2 to approximate the second derivative. We prove the proposed method preserves the charge and energy conservation laws exactly. In numerical tests, we display the accuracy of numerical solution and the role of the nonlinear coupling parameter in cases of soliton collisions. Numerical experiments also exhibit the excellent performance of the method in preserving the charge and energy conservation laws. These numerical results verify that the proposed method is both a charge-preserving and an energy-preserving algorithm

  2. Fourier analysis algorithm for the posterior corneal keratometric data: clinical usefulness in keratoconus.

    Science.gov (United States)

    Sideroudi, Haris; Labiris, Georgios; Georgantzoglou, Kimon; Ntonti, Panagiota; Siganos, Charalambos; Kozobolis, Vassilios

    2017-07-01

    To develop an algorithm for the Fourier analysis of posterior corneal videokeratographic data and to evaluate the derived parameters in the diagnosis of Subclinical Keratoconus (SKC) and Keratoconus (KC). This was a cross-sectional, observational study that took place in the Eye Institute of Thrace, Democritus University, Greece. Eighty eyes formed the KC group, 55 eyes formed the SKC group while 50 normal eyes populated the control group. A self-developed algorithm in visual basic for Microsoft Excel performed a Fourier series harmonic analysis for the posterior corneal sagittal curvature data. The algorithm decomposed the obtained curvatures into a spherical component, regular astigmatism, asymmetry and higher order irregularities for averaged central 4 mm and for each individual ring separately (1, 2, 3 and 4 mm). The obtained values were evaluated for their diagnostic capacity using receiver operating curves (ROC). Logistic regression was attempted for the identification of a combined diagnostic model. Significant differences were detected in regular astigmatism, asymmetry and higher order irregularities among groups. For the SKC group, the parameters with high diagnostic ability (AUC > 90%) were the higher order irregularities, the asymmetry and the regular astigmatism, mainly in the corneal periphery. Higher predictive accuracy was identified using diagnostic models that combined the asymmetry, regular astigmatism and higher order irregularities in averaged 3and 4 mm area (AUC: 98.4%, Sensitivity: 91.7% and Specificity:100%). Fourier decomposition of posterior Keratometric data provides parameters with high accuracy in differentiating SKC from normal corneas and should be included in the prompt diagnosis of KC. © 2017 The Authors Ophthalmic & Physiological Optics © 2017 The College of Optometrists.

  3. Iterative algorithm of discrete Fourier transform for processing randomly sampled NMR data sets

    International Nuclear Information System (INIS)

    Stanek, Jan; Kozminski, Wiktor

    2010-01-01

    Spectra obtained by application of multidimensional Fourier Transformation (MFT) to sparsely sampled nD NMR signals are usually corrupted due to missing data. In the present paper this phenomenon is investigated on simulations and experiments. An effective iterative algorithm for artifact suppression for sparse on-grid NMR data sets is discussed in detail. It includes automated peak recognition based on statistical methods. The results enable one to study NMR spectra of high dynamic range of peak intensities preserving benefits of random sampling, namely the superior resolution in indirectly measured dimensions. Experimental examples include 3D 15 N- and 13 C-edited NOESY-HSQC spectra of human ubiquitin.

  4. Fast volume reconstruction in positron emission tomography: Implementation of four algorithms on a high-performance scalable parallel platform

    International Nuclear Information System (INIS)

    Egger, M.L.; Scheurer, A.H.; Joseph, C.

    1996-01-01

    The issue of long reconstruction times in PET has been addressed from several points of view, resulting in an affordable dedicated system capable of handling routine 3D reconstruction in a few minutes per frame: on the hardware side using fast processors and a parallel architecture, and on the software side, using efficient implementations of computationally less intensive algorithms. Execution times obtained for the PRT-1 data set on a parallel system of five hybrid nodes, each combining an Alpha processor for computation and a transputer for communication, are the following (256 sinograms of 96 views by 128 radial samples): Ramp algorithm 56 s, Favor 81 s and reprojection algorithm of Kinahan and Rogers 187 s. The implementation of fast rebinning algorithms has shown our hardware platform to become communications-limited; they execute faster on a conventional single-processor Alpha workstation: single-slice rebinning 7 s, Fourier rebinning 22 s, 2D filtered backprojection 5 s. The scalability of the system has been demonstrated, and a saturation effect at network sizes above ten nodes has become visible; new T9000-based products lifting most of the constraints on network topology and link throughput are expected to result in improved parallel efficiency and scalability properties

  5. Efficient Fourier-based algorithms for time-periodic unsteady problems

    Science.gov (United States)

    Gopinath, Arathi Kamath

    2007-12-01

    This dissertation work proposes two algorithms for the simulation of time-periodic unsteady problems via the solution of Unsteady Reynolds-Averaged Navier-Stokes (URANS) equations. These algorithms use a Fourier representation in time and hence solve for the periodic state directly without resolving transients (which consume most of the resources in a time-accurate scheme). In contrast to conventional Fourier-based techniques which solve the governing equations in frequency space, the new algorithms perform all the calculations in the time domain, and hence require minimal modifications to an existing solver. The complete space-time solution is obtained by iterating in a fifth pseudo-time dimension. Various time-periodic problems such as helicopter rotors, wind turbines, turbomachinery and flapping-wings can be simulated using the Time Spectral method. The algorithm is first validated using pitching airfoil/wing test cases. The method is further extended to turbomachinery problems, and computational results verified by comparison with a time-accurate calculation. The technique can be very memory intensive for large problems, since the solution is computed (and hence stored) simultaneously at all time levels. Often, the blade counts of a turbomachine are rescaled such that a periodic fraction of the annulus can be solved. This approximation enables the solution to be obtained at a fraction of the cost of a full-scale time-accurate solution. For a viscous computation over a three-dimensional single-stage rescaled compressor, an order of magnitude savings is achieved. The second algorithm, the reduced-order Harmonic Balance method is applicable only to turbomachinery flows, and offers even larger computational savings than the Time Spectral method. It simulates the true geometry of the turbomachine using only one blade passage per blade row as the computational domain. In each blade row of the turbomachine, only the dominant frequencies are resolved, namely

  6. Multiple Sclerosis Identification Based on Fractional Fourier Entropy and a Modified Jaya Algorithm

    Directory of Open Access Journals (Sweden)

    Shui-Hua Wang

    2018-04-01

    Full Text Available Aim: Currently, identifying multiple sclerosis (MS by human experts may come across the problem of “normal-appearing white matter”, which causes a low sensitivity. Methods: In this study, we presented a computer vision based approached to identify MS in an automatic way. This proposed method first extracted the fractional Fourier entropy map from a specified brain image. Afterwards, it sent the features to a multilayer perceptron trained by a proposed improved parameter-free Jaya algorithm. We used cost-sensitivity learning to handle the imbalanced data problem. Results: The 10 × 10-fold cross validation showed our method yielded a sensitivity of 97.40 ± 0.60%, a specificity of 97.39 ± 0.65%, and an accuracy of 97.39 ± 0.59%. Conclusions: We validated by experiments that the proposed improved Jaya performs better than plain Jaya algorithm and other latest bioinspired algorithms in terms of classification performance and training speed. In addition, our method is superior to four state-of-the-art MS identification approaches.

  7. Algorithm, applications and evaluation for protein comparison by Ramanujan Fourier transform.

    Science.gov (United States)

    Zhao, Jian; Wang, Jiasong; Hua, Wei; Ouyang, Pingkai

    2015-12-01

    The amino acid sequence of a protein determines its chemical properties, chain conformation and biological functions. Protein sequence comparison is of great importance to identify similarities of protein structures and infer their functions. Many properties of a protein correspond to the low-frequency signals within the sequence. Low frequency modes in protein sequences are linked to the secondary structures, membrane protein types, and sub-cellular localizations of the proteins. In this paper, we present Ramanujan Fourier transform (RFT) with a fast algorithm to analyze the low-frequency signals of protein sequences. The RFT method is applied to similarity analysis of protein sequences with the Resonant Recognition Model (RRM). The results show that the proposed fast RFT method on protein comparison is more efficient than commonly used discrete Fourier transform (DFT). RFT can detect common frequencies as significant feature for specific protein families, and the RFT spectrum heat-map of protein sequences demonstrates the information conservation in the sequence comparison. The proposed method offers a new tool for pattern recognition, feature extraction and structural analysis on protein sequences. Copyright © 2015 Elsevier Ltd. All rights reserved.

  8. Fourier phase retrieval with a single mask by Douglas-Rachford algorithms.

    Science.gov (United States)

    Chen, Pengwen; Fannjiang, Albert

    2018-05-01

    The Fourier-domain Douglas-Rachford (FDR) algorithm is analyzed for phase retrieval with a single random mask. Since the uniqueness of phase retrieval solution requires more than a single oversampled coded diffraction pattern, the extra information is imposed in either of the following forms: 1) the sector condition on the object; 2) another oversampled diffraction pattern, coded or uncoded. For both settings, the uniqueness of projected fixed point is proved and for setting 2) the local, geometric convergence is derived with a rate given by a spectral gap condition. Numerical experiments demonstrate global, power-law convergence of FDR from arbitrary initialization for both settings as well as for 3 or more coded diffraction patterns without oversampling. In practice, the geometric convergence can be recovered from the power-law regime by a simple projection trick, resulting in highly accurate reconstruction from generic initialization.

  9. Fractional Fourier domain optical image hiding using phase retrieval algorithm based on iterative nonlinear double random phase encoding.

    Science.gov (United States)

    Wang, Xiaogang; Chen, Wen; Chen, Xudong

    2014-09-22

    We present a novel image hiding method based on phase retrieval algorithm under the framework of nonlinear double random phase encoding in fractional Fourier domain. Two phase-only masks (POMs) are efficiently determined by using the phase retrieval algorithm, in which two cascaded phase-truncated fractional Fourier transforms (FrFTs) are involved. No undesired information disclosure, post-processing of the POMs or digital inverse computation appears in our proposed method. In order to achieve the reduction in key transmission, a modified image hiding method based on the modified phase retrieval algorithm and logistic map is further proposed in this paper, in which the fractional orders and the parameters with respect to the logistic map are regarded as encryption keys. Numerical results have demonstrated the feasibility and effectiveness of the proposed algorithms.

  10. Adaptive step-size algorithm for Fourier beam-propagation method with absorbing boundary layer of auto-determined width.

    Science.gov (United States)

    Learn, R; Feigenbaum, E

    2016-06-01

    Two algorithms that enhance the utility of the absorbing boundary layer are presented, mainly in the framework of the Fourier beam-propagation method. One is an automated boundary layer width selector that chooses a near-optimal boundary size based on the initial beam shape. The second algorithm adjusts the propagation step sizes based on the beam shape at the beginning of each step in order to reduce aliasing artifacts.

  11. Deconvolution, differentiation and Fourier transformation algorithms for noise-containing data based on splines and global approximation

    NARCIS (Netherlands)

    Wormeester, Herbert; Sasse, A.G.B.M.; van Silfhout, Arend

    1988-01-01

    One of the main problems in the analysis of measured spectra is how to reduce the influence of noise in data processing. We show a deconvolution, a differentiation and a Fourier Transform algorithm that can be run on a small computer (64 K RAM) and suffer less from noise than commonly used routines.

  12. Advanced single-slice rebinning for tilted spiral cone-beam CT

    International Nuclear Information System (INIS)

    Kachelriess, Marc; Fuchs, Theo; Schaller, Stefan; Kalender, Willi A.

    2001-01-01

    Future medical CT scanners and today's micro CT scanners demand cone-beam reconstruction algorithms that are capable of reconstructing data acquired from a tilted spiral trajectory where the vector of rotation is not necessarily parallel to the vector of table increment. For the medical CT scanner this case of nonparallel object motion is met for nonzero gantry tilt: the table moves into a direction that is not perpendicular to the plane of rotation. Since this is not a special application of medical CT but rather a daily routine in head exams, there is a strong need for corresponding reconstruction algorithms. In contrast to medical CT, where the special case of nonperpendicular motion is used on purpose, micro CT scanners cannot avoid aberrations of the rotational axis and the table increment vector due to alignment problems. Especially for those micro CT scanners that have the lifting stage mounted on the rotation table (in contrast to setups where the lifting stage holds the rotation table), this kind of misalignment is equivalent to a gantry tilt. We therefore generalize the advanced single-slice rebinning algorithm (ASSR), which is considered a very promising approach for medical cone-beam reconstruction due to its high image quality and its high reconstruction speed [Med. Phys. 27, 754-772 (2000)], to the case of tilted gantries. We evaluate this extended ASSR approach (which we will denote as ASSR + , for convenience) in comparison to the original ASSR algorithm using simulated phantom data for reconstruction. For the case of nonparallel object motion ASSR + shows significant improvements over ASSR, however, its computational complexity is slightly increased due to the broken symmetry of the spiral trajectory

  13. A Fast Algorithm of Generalized Radon-Fourier Transform for Weak Maneuvering Target Detection

    Directory of Open Access Journals (Sweden)

    Weijie Xia

    2016-01-01

    Full Text Available The generalized Radon-Fourier transform (GRFT has been proposed to detect radar weak maneuvering targets by realizing coherent integration via jointly searching in motion parameter space. Two main drawbacks of GRFT are the heavy computational burden and the blind speed side lobes (BSSL which will cause serious false alarms. The BSSL learning-based particle swarm optimization (BPSO has been proposed before to reduce the computational burden of GRFT and solve the BSSL problem simultaneously. However, the BPSO suffers from an apparent loss in detection performance compared with GRFT. In this paper, a fast implementation algorithm of GRFT using the BSSL learning-based modified wind-driven optimization (BMWDO is proposed. In the BMWDO, the BSSL learning procedure is also used to deal with the BSSL phenomenon. Besides, the MWDO adjusts the coefficients in WDO with Levy distribution and uniform distribution, and it outperforms PSO in a noisy environment. Compared with BPSO, the proposed method can achieve better detection performance with a similar computational cost. Several numerical experiments are also provided to demonstrate the effectiveness of the proposed method.

  14. Research on fast Fourier transforms algorithm of huge remote sensing image technology with GPU and partitioning technology.

    Science.gov (United States)

    Yang, Xue; Li, Xue-You; Li, Jia-Guo; Ma, Jun; Zhang, Li; Yang, Jan; Du, Quan-Ye

    2014-02-01

    Fast Fourier transforms (FFT) is a basic approach to remote sensing image processing. With the improvement of capacity of remote sensing image capture with the features of hyperspectrum, high spatial resolution and high temporal resolution, how to use FFT technology to efficiently process huge remote sensing image becomes the critical step and research hot spot of current image processing technology. FFT algorithm, one of the basic algorithms of image processing, can be used for stripe noise removal, image compression, image registration, etc. in processing remote sensing image. CUFFT function library is the FFT algorithm library based on CPU and FFTW. FFTW is a FFT algorithm developed based on CPU in PC platform, and is currently the fastest CPU based FFT algorithm function library. However there is a common problem that once the available memory or memory is less than the capacity of image, there will be out of memory or memory overflow when using the above two methods to realize image FFT arithmetic. To address this problem, a CPU and partitioning technology based Huge Remote Fast Fourier Transform (HRFFT) algorithm is proposed in this paper. By improving the FFT algorithm in CUFFT function library, the problem of out of memory and memory overflow is solved. Moreover, this method is proved rational by experiment combined with the CCD image of HJ-1A satellite. When applied to practical image processing, it improves effect of the image processing, speeds up the processing, which saves the time of computation and achieves sound result.

  15. A New Adaptive Self-Tuning Fourier Coefficients Algorithm for Periodic Torque Ripple Minimization in Permanent Magnet Synchronous Motors (PMSM

    Directory of Open Access Journals (Sweden)

    Gilberto Herrera-Ruíz

    2013-03-01

    Full Text Available A New Adaptive Self-Tuning Fourier Coefficients Algorithm for Periodic Torque Ripple Minimization in Permanent Magnet Synchronous Motors (PMSM Torque ripple occurs in Permanent Magnet Synchronous Motors (PMSMs due to the non-sinusoidal flux density distribution around the air-gap and variable magnetic reluctance of the air-gap due to the stator slots distribution. These torque ripples change periodically with rotor position and are apparent as speed variations, which degrade the PMSM drive performance, particularly at low speeds, because of low inertial filtering. In this paper, a new self-tuning algorithm is developed for determining the Fourier Series Controller coefficients with the aim of reducing the torque ripple in a PMSM, thus allowing for a smoother operation. This algorithm adjusts the controller parameters based on the component’s harmonic distortion in time domain of the compensation signal. Experimental evaluation is performed on a DSP-controlled PMSM evaluation platform. Test results obtained validate the effectiveness of the proposed self-tuning algorithm, with the Fourier series expansion scheme, in reducing the torque ripple.

  16. A new adaptive self-tuning Fourier coefficients algorithm for periodic torque ripple minimization in permanent magnet synchronous motors (PMSM).

    Science.gov (United States)

    Gómez-Espinosa, Alfonso; Hernández-Guzmán, Víctor M; Bandala-Sánchez, Manuel; Jiménez-Hernández, Hugo; Rivas-Araiza, Edgar A; Rodríguez-Reséndiz, Juvenal; Herrera-Ruíz, Gilberto

    2013-03-19

    A New Adaptive Self-Tuning Fourier Coefficients Algorithm for Periodic Torque Ripple Minimization in Permanent Magnet Synchronous Motors (PMSM) Torque ripple occurs in Permanent Magnet Synchronous Motors (PMSMs) due to the non-sinusoidal flux density distribution around the air-gap and variable magnetic reluctance of the air-gap due to the stator slots distribution. These torque ripples change periodically with rotor position and are apparent as speed variations, which degrade the PMSM drive performance, particularly at low speeds, because of low inertial filtering. In this paper, a new self-tuning algorithm is developed for determining the Fourier Series Controller coefficients with the aim of reducing the torque ripple in a PMSM, thus allowing for a smoother operation. This algorithm adjusts the controller parameters based on the component's harmonic distortion in time domain of the compensation signal. Experimental evaluation is performed on a DSP-controlled PMSM evaluation platform. Test results obtained validate the effectiveness of the proposed self-tuning algorithm, with the Fourier series expansion scheme, in reducing the torque ripple.

  17. Algorithm for three dimension reconstruction of magnetic resonance tomographs and X-ray images based on Fast Fourier Transform

    International Nuclear Information System (INIS)

    Bueno, Josiane M.; Traina, Agma Juci M.; Cruvinel, Paulo E.

    1995-01-01

    This work presents an algorithm for three-dimensional digital image reconstruction. Such algorithms based on the combination of both a Fast Fourier Transform method with Hamming Window and the use of a tri-linear interpolation function. The algorithm allows not only the generation of three-dimensional spatial spin distribution maps for Magnetic Resonance Tomography data but also X and Y-rays linear attenuation coefficient maps for CT scanners. Results demonstrates the usefulness of the algorithm in three-dimensional image reconstruction by doing first two-dimensional reconstruction and rather after interpolation. The algorithm was developed in C++ language, and there are two available versions: one under the DOS environment, and the other under the UNIX/Sun environment. (author)

  18. Fast optimal wavefront reconstruction for multi-conjugate adaptive optics using the Fourier domain preconditioned conjugate gradient algorithm.

    Science.gov (United States)

    Vogel, Curtis R; Yang, Qiang

    2006-08-21

    We present two different implementations of the Fourier domain preconditioned conjugate gradient algorithm (FD-PCG) to efficiently solve the large structured linear systems that arise in optimal volume turbulence estimation, or tomography, for multi-conjugate adaptive optics (MCAO). We describe how to deal with several critical technical issues, including the cone coordinate transformation problem and sensor subaperture grid spacing. We also extend the FD-PCG approach to handle the deformable mirror fitting problem for MCAO.

  19. Baseline correction combined partial least squares algorithm and its application in on-line Fourier transform infrared quantitative analysis.

    Science.gov (United States)

    Peng, Jiangtao; Peng, Silong; Xie, Qiong; Wei, Jiping

    2011-04-01

    In order to eliminate the lower order polynomial interferences, a new quantitative calibration algorithm "Baseline Correction Combined Partial Least Squares (BCC-PLS)", which combines baseline correction and conventional PLS, is proposed. By embedding baseline correction constraints into PLS weights selection, the proposed calibration algorithm overcomes the uncertainty in baseline correction and can meet the requirement of on-line attenuated total reflectance Fourier transform infrared (ATR-FTIR) quantitative analysis. The effectiveness of the algorithm is evaluated by the analysis of glucose and marzipan ATR-FTIR spectra. BCC-PLS algorithm shows improved prediction performance over PLS. The root mean square error of cross-validation (RMSECV) on marzipan spectra for the prediction of the moisture is found to be 0.53%, w/w (range 7-19%). The sugar content is predicted with a RMSECV of 2.04%, w/w (range 33-68%). Copyright © 2011 Elsevier B.V. All rights reserved.

  20. A novel least-square Fourier algorithm for decomposition of discrete, non-equidistant acquisition data

    CERN Document Server

    Bouthéon, M; Potier, J P

    1977-01-01

    A novel procedure for evaluating directly the Fourier series coefficients of a function described by unequally spaced but symmetrically disposed interval discrete points is given and an example illustrated. The procedure's simplicity enables it to be used for harmonic analyses of non-equidistant interval data without using the intermediate curve-fitting techniques. (2 refs).

  1. A quantum search algorithm of two entangled registers to realize quantum discrete Fourier transform of signal processing

    International Nuclear Information System (INIS)

    Pang Chaoyang; Hu Benqiong

    2008-01-01

    The discrete Fourier transform (DFT) is the base of modern signal processing. 1-dimensional fast Fourier transform (ID FFT) and 2D FFT have time complexity O (N log N) and O (N 2 log N) respectively. Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm. DFT has two properties. One property is that DFT is energy conservation transform. The other property is that many DFT coefficients are close to zero. The basic idea of this paper is that the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy. One-dimensional quantum DFT (ID QDFT) and two-dimensional quantum DFT (2D QDFT) are presented in this paper. The quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, ID and 2D QDFT have time complexity O(√N) and O (N) respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible. (general)

  2. Efficient algorithm for baseline wander and powerline noise removal from ECG signals based on discrete Fourier series.

    Science.gov (United States)

    Bahaz, Mohamed; Benzid, Redha

    2018-03-01

    Electrocardiogram (ECG) signals are often contaminated with artefacts and noises which can lead to incorrect diagnosis when they are visually inspected by cardiologists. In this paper, the well-known discrete Fourier series (DFS) is re-explored and an efficient DFS-based method is proposed to reduce contribution of both baseline wander (BW) and powerline interference (PLI) noises in ECG records. In the first step, the determination of the exact number of low frequency harmonics contributing in BW is achieved. Next, the baseline drift is estimated by the sum of all associated Fourier sinusoids components. Then, the baseline shift is discarded efficiently by a subtraction of its approximated version from the original biased ECG signal. Concerning the PLI, the subtraction of the contributing harmonics calculated in the same manner reduces efficiently such type of noise. In addition of visual quality results, the proposed algorithm shows superior performance in terms of higher signal-to-noise ratio and smaller mean square error when faced to the DCT-based algorithm.

  3. A time-dependent semiclassical wavepacket method using a fast Fourier transform (FFT) algorithm

    International Nuclear Information System (INIS)

    Gauss, J.; Heller, E.J.

    1991-01-01

    A new semiclassical propagator based on a local expansion of the potential up to second order around the moving center of the wavepackt is proposed. Formulas for the propagator are derived and the implementation using grid and fast Fourier transform (FFT) methods is discussed. The semiclassical propagator can be improved up to the exact quantum mechanical limit by including anharmonic corrections using a split operator approach. Preliminary applications to the CH 3 I photodissociation problem show the applicability and accuracy of the proposed method. (orig.)D

  4. Reducing acquisition times in multidimensional NMR with a time-optimized Fourier encoding algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Zhiyong [Department of Chemical Physics, Weizmann Institute of Science, Rehovot 76100 (Israel); Department of Electronic Science, Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance, Xiamen University, Xiamen, Fujian 361005 (China); Smith, Pieter E. S.; Frydman, Lucio, E-mail: lucio.frydman@weizmann.ac.il [Department of Chemical Physics, Weizmann Institute of Science, Rehovot 76100 (Israel)

    2014-11-21

    Speeding up the acquisition of multidimensional nuclear magnetic resonance (NMR) spectra is an important topic in contemporary NMR, with central roles in high-throughput investigations and analyses of marginally stable samples. A variety of fast NMR techniques have been developed, including methods based on non-uniform sampling and Hadamard encoding, that overcome the long sampling times inherent to schemes based on fast-Fourier-transform (FFT) methods. Here, we explore the potential of an alternative fast acquisition method that leverages a priori knowledge, to tailor polychromatic pulses and customized time delays for an efficient Fourier encoding of the indirect domain of an NMR experiment. By porting the encoding of the indirect-domain to the excitation process, this strategy avoids potential artifacts associated with non-uniform sampling schemes and uses a minimum number of scans equal to the number of resonances present in the indirect dimension. An added convenience is afforded by the fact that a usual 2D FFT can be used to process the generated data. Acquisitions of 2D heteronuclear correlation NMR spectra on quinine and on the anti-inflammatory drug isobutyl propionic phenolic acid illustrate the new method's performance. This method can be readily automated to deal with complex samples such as those occurring in metabolomics, in in-cell as well as in in vivo NMR applications, where speed and temporal stability are often primary concerns.

  5. Reducing acquisition times in multidimensional NMR with a time-optimized Fourier encoding algorithm

    International Nuclear Information System (INIS)

    Zhang, Zhiyong; Smith, Pieter E. S.; Frydman, Lucio

    2014-01-01

    Speeding up the acquisition of multidimensional nuclear magnetic resonance (NMR) spectra is an important topic in contemporary NMR, with central roles in high-throughput investigations and analyses of marginally stable samples. A variety of fast NMR techniques have been developed, including methods based on non-uniform sampling and Hadamard encoding, that overcome the long sampling times inherent to schemes based on fast-Fourier-transform (FFT) methods. Here, we explore the potential of an alternative fast acquisition method that leverages a priori knowledge, to tailor polychromatic pulses and customized time delays for an efficient Fourier encoding of the indirect domain of an NMR experiment. By porting the encoding of the indirect-domain to the excitation process, this strategy avoids potential artifacts associated with non-uniform sampling schemes and uses a minimum number of scans equal to the number of resonances present in the indirect dimension. An added convenience is afforded by the fact that a usual 2D FFT can be used to process the generated data. Acquisitions of 2D heteronuclear correlation NMR spectra on quinine and on the anti-inflammatory drug isobutyl propionic phenolic acid illustrate the new method's performance. This method can be readily automated to deal with complex samples such as those occurring in metabolomics, in in-cell as well as in in vivo NMR applications, where speed and temporal stability are often primary concerns

  6. Fourier transform and particle swarm optimization based modified LQR algorithm for mitigation of vibrations using magnetorheological dampers

    Science.gov (United States)

    Kumar, Gaurav; Kumar, Ashok

    2017-11-01

    Structural control has gained significant attention in recent times. The standalone issue of power requirement during an earthquake has already been solved up to a large extent by designing semi-active control systems using conventional linear quadratic control theory, and many other intelligent control algorithms such as fuzzy controllers, artificial neural networks, etc. In conventional linear-quadratic regulator (LQR) theory, it is customary to note that the values of the design parameters are decided at the time of designing the controller and cannot be subsequently altered. During an earthquake event, the response of the structure may increase or decrease, depending the quasi-resonance occurring between the structure and the earthquake. In this case, it is essential to modify the value of the design parameters of the conventional LQR controller to obtain optimum control force to mitigate the vibrations due to the earthquake. A few studies have been done to sort out this issue but in all these studies it was necessary to maintain a database of the earthquake. To solve this problem and to find the optimized design parameters of the LQR controller in real time, a fast Fourier transform and particle swarm optimization based modified linear quadratic regulator method is presented here. This method comprises four different algorithms: particle swarm optimization (PSO), the fast Fourier transform (FFT), clipped control algorithm and the LQR. The FFT helps to obtain the dominant frequency for every time window. PSO finds the optimum gain matrix through the real-time update of the weighting matrix R, thereby, dispensing with the experimentation. The clipped control law is employed to match the magnetorheological (MR) damper force with the desired force given by the controller. The modified Bouc-Wen phenomenological model is taken to recognize the nonlinearities in the MR damper. The assessment of the advised method is done by simulation of a three-story structure

  7. A cone-beam tomography system with a reduced size planar detector: A backprojection-filtration reconstruction algorithm as well as numerical and practical experiments

    International Nuclear Information System (INIS)

    Li Liang; Chen Zhiqiang; Zhang Li; Xing Yuxiang; Kang Kejun

    2007-01-01

    In a traditional cone-beam computed tomography (CT) system, the cost of product and computation is very high. In this paper, we develop a transversely truncated cone-beam X-ray CT system with a reduced-size detector positioned off-center, in which X-ray beams only cover half of the object. The existing filtered backprojection (FBP) or backprojection-filtration (BPF) algorithms are not directly applicable in this new system. Hence, we develop a BPF-type direct backprojection algorithm. Different from the traditional rebinning methods, our algorithm directly backprojects the pretreated projection data without rebinning. This makes the algorithm compact and computationally more efficient. Because of avoiding interpolation errors of rebinning process, higher spatial resolution is obtained. Finally, some numerical simulations and practical experiments are done to validate the proposed algorithm and compare with rebinning algorithm

  8. Radiation dose reduction in medical x-ray CT via Fourier-based iterative reconstruction.

    Science.gov (United States)

    Fahimian, Benjamin P; Zhao, Yunzhe; Huang, Zhifeng; Fung, Russell; Mao, Yu; Zhu, Chun; Khatonabadi, Maryam; DeMarco, John J; Osher, Stanley J; McNitt-Gray, Michael F; Miao, Jianwei

    2013-03-01

    A Fourier-based iterative reconstruction technique, termed Equally Sloped Tomography (EST), is developed in conjunction with advanced mathematical regularization to investigate radiation dose reduction in x-ray CT. The method is experimentally implemented on fan-beam CT and evaluated as a function of imaging dose on a series of image quality phantoms and anonymous pediatric patient data sets. Numerical simulation experiments are also performed to explore the extension of EST to helical cone-beam geometry. EST is a Fourier based iterative algorithm, which iterates back and forth between real and Fourier space utilizing the algebraically exact pseudopolar fast Fourier transform (PPFFT). In each iteration, physical constraints and mathematical regularization are applied in real space, while the measured data are enforced in Fourier space. The algorithm is automatically terminated when a proposed termination criterion is met. Experimentally, fan-beam projections were acquired by the Siemens z-flying focal spot technology, and subsequently interleaved and rebinned to a pseudopolar grid. Image quality phantoms were scanned at systematically varied mAs settings, reconstructed by EST and conventional reconstruction methods such as filtered back projection (FBP), and quantified using metrics including resolution, signal-to-noise ratios (SNRs), and contrast-to-noise ratios (CNRs). Pediatric data sets were reconstructed at their original acquisition settings and additionally simulated to lower dose settings for comparison and evaluation of the potential for radiation dose reduction. Numerical experiments were conducted to quantify EST and other iterative methods in terms of image quality and computation time. The extension of EST to helical cone-beam CT was implemented by using the advanced single-slice rebinning (ASSR) method. Based on the phantom and pediatric patient fan-beam CT data, it is demonstrated that EST reconstructions with the lowest scanner flux setting of 39 m

  9. Radiation dose reduction in medical x-ray CT via Fourier-based iterative reconstruction

    International Nuclear Information System (INIS)

    Fahimian, Benjamin P.; Zhao Yunzhe; Huang Zhifeng; Fung, Russell; Zhu Chun; Miao Jianwei; Mao Yu; Khatonabadi, Maryam; DeMarco, John J.; McNitt-Gray, Michael F.; Osher, Stanley J.

    2013-01-01

    Purpose: A Fourier-based iterative reconstruction technique, termed Equally Sloped Tomography (EST), is developed in conjunction with advanced mathematical regularization to investigate radiation dose reduction in x-ray CT. The method is experimentally implemented on fan-beam CT and evaluated as a function of imaging dose on a series of image quality phantoms and anonymous pediatric patient data sets. Numerical simulation experiments are also performed to explore the extension of EST to helical cone-beam geometry. Methods: EST is a Fourier based iterative algorithm, which iterates back and forth between real and Fourier space utilizing the algebraically exact pseudopolar fast Fourier transform (PPFFT). In each iteration, physical constraints and mathematical regularization are applied in real space, while the measured data are enforced in Fourier space. The algorithm is automatically terminated when a proposed termination criterion is met. Experimentally, fan-beam projections were acquired by the Siemens z-flying focal spot technology, and subsequently interleaved and rebinned to a pseudopolar grid. Image quality phantoms were scanned at systematically varied mAs settings, reconstructed by EST and conventional reconstruction methods such as filtered back projection (FBP), and quantified using metrics including resolution, signal-to-noise ratios (SNRs), and contrast-to-noise ratios (CNRs). Pediatric data sets were reconstructed at their original acquisition settings and additionally simulated to lower dose settings for comparison and evaluation of the potential for radiation dose reduction. Numerical experiments were conducted to quantify EST and other iterative methods in terms of image quality and computation time. The extension of EST to helical cone-beam CT was implemented by using the advanced single-slice rebinning (ASSR) method. Results: Based on the phantom and pediatric patient fan-beam CT data, it is demonstrated that EST reconstructions with the lowest

  10. Favorable noise uniformity properties of Fourier-based interpolation and reconstruction approaches in single-slice helical computed tomography

    International Nuclear Information System (INIS)

    La Riviere, Patrick J.; Pan Xiaochuan

    2002-01-01

    Volumes reconstructed by standard methods from single-slice helical computed tomography (CT) data have been shown to have noise levels that are highly nonuniform relative to those in conventional CT. These noise nonuniformities can affect low-contrast object detectability and have also been identified as the cause of the zebra artifacts that plague maximum intensity projection (MIP) images of such volumes. While these spatially variant noise levels have their root in the peculiarities of the helical scan geometry, there is also a strong dependence on the interpolation and reconstruction algorithms employed. In this paper, we seek to develop image reconstruction strategies that eliminate or reduce, at its source, the nonuniformity of noise levels in helical CT relative to that in conventional CT. We pursue two approaches, independently and in concert. We argue, and verify, that Fourier-based longitudinal interpolation approaches lead to more uniform noise ratios than do the standard 360LI and 180LI approaches. We also demonstrate that a Fourier-based fan-to-parallel rebinning algorithm, used as an alternative to fanbeam filtered backprojection for slice reconstruction, also leads to more uniform noise ratios, even when making use of the 180LI and 360LI interpolation approaches

  11. Multi-sheet surface rebinning methods for reconstruction from asymmetrically truncated cone beam projections: I. Approximation and optimality

    International Nuclear Information System (INIS)

    Betcke, Marta M; Lionheart, William R B

    2013-01-01

    The mechanical motion of the gantry in conventional cone beam CT scanners restricts the speed of data acquisition in applications with near real time requirements. A possible resolution of this problem is to replace the moving source detector assembly with static parts that are electronically activated. An example of such a system is the Rapiscan Systems RTT80 real time tomography scanner, with a static ring of sources and axially offset static cylinder of detectors. A consequence of such a design is asymmetrical axial truncation of the cone beam projections resulting, in the sense of integral geometry, in severely incomplete data. In particular we collect data only in a fraction of the Tam–Danielsson window, hence the standard cone beam reconstruction techniques do not apply. In this work we propose a family of multi-sheet surface rebinning methods for reconstruction from such truncated projections. The proposed methods combine analytical and numerical ideas utilizing linearity of the ray transform to reconstruct data on multi-sheet surfaces, from which the volumetric image is obtained through deconvolution. In this first paper in the series, we discuss the rebinning to multi-sheet surfaces. In particular we concentrate on the underlying transforms on multi-sheet surfaces and their approximation with data collected by offset multi-source scanning geometries like the RTT. The optimal multi-sheet surface and the corresponding rebinning function are found as a solution of a variational problem. In the case of the quadratic objective, the variational problem for the optimal rebinning pair can be solved by a globally convergent iteration. Examples of optimal rebinning pairs are computed for different trajectories. We formulate the axial deconvolution problem for the recovery of the volumetric image from the reconstructions on multi-sheet surfaces. Efficient and stable solution of the deconvolution problem is the subject of the second paper in this series (Betcke and

  12. Fourier transform NMR

    International Nuclear Information System (INIS)

    Hallenga, K.

    1991-01-01

    This paper discusses the concept of Fourier transformation one of the many precious legacies of the French mathematician Jean Baptiste Joseph Fourier, essential for understanding the link between continuous-wave (CW) and Fourier transform (FT) NMR. Although in modern FT NMR the methods used to obtain a frequency spectrum from the time-domain signal may vary greatly, from the efficient Cooley-Tukey algorithm to very elaborate iterative least-square methods based other maximum entropy method or on linear prediction, the principles for Fourier transformation are unchanged and give invaluable insight into the interconnection of many pairs of physical entities called Fourier pairs

  13. Approximating the Analytic Fourier Transform with the Discrete Fourier Transform

    OpenAIRE

    Axelrod, Jeremy

    2015-01-01

    The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more rapidly than via a direct matrix multiplication. Advantages and limitations of using this method to approximate the Fourier transform are discussed, and prototypical MATLAB codes implementing the method are presented.

  14. Fast reconstruction of 3D time-of-flight PET data by axial rebinning and transverse mashing

    International Nuclear Information System (INIS)

    Vandenberghe, Stefaan; Daube-Witherspoon, Margaret E; Lewitt, Robert M; Karp, Joel S

    2006-01-01

    Faster scintillators like LaBr 3 and LSO have sparked renewed interest in PET scanners with time-of-flight (TOF) information. The TOF information adds another dimension to the data set compared to conventional three-dimensional (3D) PET with the size of the projection data being multiplied by the number of TOF bins. Here we show by simulations and analytical reconstruction that angular sampling for two-dimensional (2D) TOF PET can be reduced significantly compared to what is required for conventional 2D PET. Fully 3D TOF PET data, however, have a wide range of oblique and transverse angles. To make use of the smaller necessary angular sampling we reduce the 3D data to a set of 2D histoprojections. This is done by rebinning the 3D data to 2D data and by mashing these 2D data into a limited number of angles. Both methods are based on the most likely point given by the TOF measurement. It is shown that the axial resolution loss associated with rebinning reduces with improved timing resolution and becomes less than 1 mm for a TOF resolution below 300 ps. The amount of angular mashing that can be applied without tangential resolution loss increases with improved TOF resolution. Even quite coarse angular mashing (18 angles out of 324 measured angles for 424 ps) does not significantly reduce image quality in terms of the contrast or noise. The advantages of the proposed methods are threefold. Data storage is reduced to a limited number of 2D histoprojections with TOF information. Compared to listmode format we have the advantage of a predetermined storage space and faster reconstruction. The method does not require the normalization of projections prior to rebinning and can be applied directly to measured listmode data

  15. Application of point-to-point matching algorithms for background correction in on-line liquid chromatography-Fourier transform infrared spectrometry (LC-FTIR).

    Science.gov (United States)

    Kuligowski, J; Quintás, G; Garrigues, S; de la Guardia, M

    2010-03-15

    A new background correction method for the on-line coupling of gradient liquid chromatography and Fourier transform infrared spectrometry has been developed. It is based on the use of a point-to-point matching algorithm that compares the absorption spectra of the sample data set with those of a previously recorded reference data set in order to select an appropriate reference spectrum. The spectral range used for the point-to-point comparison is selected with minimal user-interaction, thus facilitating considerably the application of the whole method. The background correction method has been successfully tested on a chromatographic separation of four nitrophenols running acetonitrile (0.08%, v/v TFA):water (0.08%, v/v TFA) gradients with compositions ranging from 35 to 85% (v/v) acetonitrile, giving accurate results for both, baseline resolved and overlapped peaks. Copyright (c) 2009 Elsevier B.V. All rights reserved.

  16. Asymmetric double-image encryption method by using iterative phase retrieval algorithm in fractional Fourier transform domain

    Science.gov (United States)

    Sui, Liansheng; Lu, Haiwei; Ning, Xiaojuan; Wang, Yinghui

    2014-02-01

    A double-image encryption scheme is proposed based on an asymmetric technique, in which the encryption and decryption processes are different and the encryption keys are not identical to the decryption ones. First, a phase-only function (POF) of each plain image is retrieved by using an iterative process and then encoded into an interim matrix. Two interim matrices are directly modulated into a complex image by using the convolution operation in the fractional Fourier transform (FrFT) domain. Second, the complex image is encrypted into the gray scale ciphertext with stationary white-noise distribution by using the FrFT. In the encryption process, three random phase functions are used as encryption keys to retrieve the POFs of plain images. Simultaneously, two decryption keys are generated in the encryption process, which make the optical implementation of the decryption process convenient and efficient. The proposed encryption scheme has high robustness to various attacks, such as brute-force attack, known plaintext attack, cipher-only attack, and specific attack. Numerical simulations demonstrate the validity and security of the proposed method.

  17. Fourier series

    CERN Document Server

    Tolstov, Georgi P

    1962-01-01

    Richard A. Silverman's series of translations of outstanding Russian textbooks and monographs is well-known to people in the fields of mathematics, physics, and engineering. The present book is another excellent text from this series, a valuable addition to the English-language literature on Fourier series.This edition is organized into nine well-defined chapters: Trigonometric Fourier Series, Orthogonal Systems, Convergence of Trigonometric Fourier Series, Trigonometric Series with Decreasing Coefficients, Operations on Fourier Series, Summation of Trigonometric Fourier Series, Double Fourie

  18. Converting optical scanning holograms of real objects to binary Fourier holograms using an iterative direct binary search algorithm.

    Science.gov (United States)

    Leportier, Thibault; Park, Min Chul; Kim, You Seok; Kim, Taegeun

    2015-02-09

    In this paper, we present a three-dimensional holographic imaging system. The proposed approach records a complex hologram of a real object using optical scanning holography, converts the complex form to binary data, and then reconstructs the recorded hologram using a spatial light modulator (SLM). The conversion from the recorded hologram to a binary hologram is achieved using a direct binary search algorithm. We present experimental results that verify the efficacy of our approach. To the best of our knowledge, this is the first time that a hologram of a real object has been reconstructed using a binary SLM.

  19. Beyond Fourier

    Science.gov (United States)

    Hoch, Jeffrey C.

    2017-10-01

    Non-Fourier methods of spectrum analysis are gaining traction in NMR spectroscopy, driven by their utility for processing nonuniformly sampled data. These methods afford new opportunities for optimizing experiment time, resolution, and sensitivity of multidimensional NMR experiments, but they also pose significant challenges not encountered with the discrete Fourier transform. A brief history of non-Fourier methods in NMR serves to place different approaches in context. Non-Fourier methods reflect broader trends in the growing importance of computation in NMR, and offer insights for future software development.

  20. Beyond Fourier.

    Science.gov (United States)

    Hoch, Jeffrey C

    2017-10-01

    Non-Fourier methods of spectrum analysis are gaining traction in NMR spectroscopy, driven by their utility for processing nonuniformly sampled data. These methods afford new opportunities for optimizing experiment time, resolution, and sensitivity of multidimensional NMR experiments, but they also pose significant challenges not encountered with the discrete Fourier transform. A brief history of non-Fourier methods in NMR serves to place different approaches in context. Non-Fourier methods reflect broader trends in the growing importance of computation in NMR, and offer insights for future software development. Copyright © 2017 Elsevier Inc. All rights reserved.

  1. Fourier Transform Infrared Spectroscopy (FT-IR) and Simple Algorithm Analysis for Rapid and Non-Destructive Assessment of Developmental Cotton Fibers.

    Science.gov (United States)

    Liu, Yongliang; Kim, Hee-Jin

    2017-06-22

    With cotton fiber growth or maturation, cellulose content in cotton fibers markedly increases. Traditional chemical methods have been developed to determine cellulose content, but it is time-consuming and labor-intensive, mostly owing to the slow hydrolysis process of fiber cellulose components. As one approach, the attenuated total reflection Fourier transform infrared (ATR FT-IR) spectroscopy technique has also been utilized to monitor cotton cellulose formation, by implementing various spectral interpretation strategies of both multivariate principal component analysis (PCA) and 1-, 2- or 3-band/-variable intensity or intensity ratios. The main objective of this study was to compare the correlations between cellulose content determined by chemical analysis and ATR FT-IR spectral indices acquired by the reported procedures, among developmental Texas Marker-1 (TM-1) and immature fiber ( im ) mutant cotton fibers. It was observed that the R value, CI IR , and the integrated intensity of the 895 cm -1 band exhibited strong and linear relationships with cellulose content. The results have demonstrated the suitability and utility of ATR FT-IR spectroscopy, combined with a simple algorithm analysis, in assessing cotton fiber cellulose content, maturity, and crystallinity in a manner which is rapid, routine, and non-destructive.

  2. Algorithm for three dimension reconstruction of magnetic resonance tomographs and X-ray images based on Fast Fourier Transform; Algoritmo para reconstrucao tridimensional de imagens de tomografos de ressonancia magnetica e de raio-X baseado no uso de Transformada Rapida de Fourier

    Energy Technology Data Exchange (ETDEWEB)

    Bueno, Josiane M.; Traina, Agma Juci M. [Sao Paulo Univ., Sao Carlos, SP (Brazil). Inst. de Ciencias Matematicas; Cruvinel, Paulo E. [EMBRAPA, Sao Carlos, SP (Brazil). CNPDIA

    1995-12-31

    This work presents an algorithm for three-dimensional digital image reconstruction. Such algorithms based on the combination of both a Fast Fourier Transform method with Hamming Window and the use of a tri-linear interpolation function. The algorithm allows not only the generation of three-dimensional spatial spin distribution maps for Magnetic Resonance Tomography data but also X and Y-rays linear attenuation coefficient maps for CT scanners. Results demonstrates the usefulness of the algorithm in three-dimensional image reconstruction by doing first two-dimensional reconstruction and rather after interpolation. The algorithm was developed in C++ language, and there are two available versions: one under the DOS environment, and the other under the UNIX/Sun environment. (author) 10 refs., 5 figs.

  3. Algorithms

    Indian Academy of Sciences (India)

    polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used to describe an algorithm for execution on a computer. An algorithm expressed using a programming.

  4. Fourier Series

    Indian Academy of Sciences (India)

    polynomials are dense in the class of continuous functions! The body of literature dealing with Fourier series has reached epic proportions over the last two centuries. We have only given the readers an outline of the topic in this article. For the full length episode we refer the reader to the monumental treatise of. A Zygmund.

  5. Fourier Series

    Indian Academy of Sciences (India)

    The theory of Fourier series deals with periodic functions. By a periodic ..... including Dirichlet, Riemann and Cantor occupied themselves with the problem of ... to converge only on a set which is negligible in a certain sense (Le. of measure ...

  6. Algorithms

    Indian Academy of Sciences (India)

    to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted algorithm design paradigms. In this article, we illustrate algorithm design techniques such as balancing, greedy strategy, dynamic programming strategy, and backtracking or traversal of ...

  7. App. 1. Fourier series and Fourier transform

    International Nuclear Information System (INIS)

    Anon.

    1977-01-01

    Definitions, formulas and practical properties in quantum mechanics are presented: Fourier series (development of periodic function, Bessel-Parseval equality); Fourier transform (Parseval-Plancherel formula, Fourier transform in three-dimensional space) [fr

  8. High resolution reconstruction of PET images using the iterative OSEM algorithm

    International Nuclear Information System (INIS)

    Doll, J.; Bublitz, O.; Werling, A.; Haberkorn, U.; Semmler, W.; Adam, L.E.; Pennsylvania Univ., Philadelphia, PA; Brix, G.

    2004-01-01

    Aim: Improvement of the spatial resolution in positron emission tomography (PET) by incorporation of the image-forming characteristics of the scanner into the process of iterative image reconstruction. Methods: All measurements were performed at the whole-body PET system ECAT EXACT HR + in 3D mode. The acquired 3D sinograms were sorted into 2D sinograms by means of the Fourier rebinning (FORE) algorithm, which allows the usage of 2D algorithms for image reconstruction. The scanner characteristics were described by a spatially variant line-spread function (LSF), which was determined from activated copper-64 line sources. This information was used to model the physical degradation processes in PET measurements during the course of 2D image reconstruction with the iterative OSEM algorithm. To assess the performance of the high-resolution OSEM algorithm, phantom measurements performed at a cylinder phantom, the hotspot Jaszczack phantom, and the 3D Hoffmann brain phantom as well as different patient examinations were analyzed. Results: Scanner characteristics could be described by a Gaussian-shaped LSF with a full-width at half-maximum increasing from 4.8 mm at the center to 5.5 mm at a radial distance of 10.5 cm. Incorporation of the LSF into the iteration formula resulted in a markedly improved resolution of 3.0 and 3.5 mm, respectively. The evaluation of phantom and patient studies showed that the high-resolution OSEM algorithm not only lead to a better contrast resolution in the reconstructed activity distributions but also to an improved accuracy in the quantification of activity concentrations in small structures without leading to an amplification of image noise or even the occurrence of image artifacts. Conclusion: The spatial and contrast resolution of PET scans can markedly be improved by the presented image restauration algorithm, which is of special interest for the examination of both patients with brain disorders and small animals. (orig.)

  9. COMPARISON OF AN INNOVATIVE NONLINEAR ALGORITHM TO CLASSICAL LEAST SQUARES FOR ANALYZING OPEN-PATH FOURIER TRANSFORM INFRARED SPECTRA COLLECTED AT A CONCENTRATED SWINE PRODUCTION FACILITY

    Science.gov (United States)

    Open-path Fourier transform infrared (OP/FTIR) spectrometry was used to measure the concentrations of ammonia, methane, and other atmospheric gases at an integrated swine production facility. The concentration-pathlength products of the target gases at this site often exceeded th...

  10. The fractional Fourier transform and applications

    Science.gov (United States)

    Bailey, David H.; Swarztrauber, Paul N.

    1991-01-01

    This paper describes the 'fractional Fourier transform', which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e exp -2(pi)i/n, the fractional Fourier transform is based on fractional roots of unity e exp -2(pi)i(alpha), where alpha is arbitrary. The fractional Fourier transform and the corresponding fast algorithm are useful for such applications as computing DFTs of sequences with prime lengths, computing DFTs of sparse sequences, analyzing sequences with noninteger periodicities, performing high-resolution trigonometric interpolation, detecting lines in noisy images, and detecting signals with linearly drifting frequencies. In many cases, the resulting algorithms are faster by arbitrarily large factors than conventional techniques.

  11. Algorithms

    Indian Academy of Sciences (India)

    ticians but also forms the foundation of computer science. Two ... with methods of developing algorithms for solving a variety of problems but ... applications of computers in science and engineer- ... numerical calculus are as important. We will ...

  12. Algorithms

    Indian Academy of Sciences (India)

    algorithm design technique called 'divide-and-conquer'. One of ... Turtle graphics, September. 1996. 5. ... whole list named 'PO' is a pointer to the first element of the list; ..... Program for computing matrices X and Y and placing the result in C *).

  13. Algorithms

    Indian Academy of Sciences (India)

    algorithm that it is implicitly understood that we know how to generate the next natural ..... Explicit comparisons are made in line (1) where maximum and minimum is ... It can be shown that the function T(n) = 3/2n -2 is the solution to the above ...

  14. Algorithms

    Indian Academy of Sciences (India)

    will become clear in the next article when we discuss a simple logo like programming language. ... Rod B may be used as an auxiliary store. The problem is to find an algorithm which performs this task. ... No disks are moved from A to Busing C as auxiliary rod. • move _disk (A, C);. (No + l)th disk is moved from A to C directly ...

  15. Computing exact Fourier series coefficients of IC rectilinear polygons from low-resolution fast Fourier coefficients

    Science.gov (United States)

    Scheibler, Robin; Hurley, Paul

    2012-03-01

    We present a novel, accurate and fast algorithm to obtain Fourier series coefficients from an IC layer whose description consists of rectilinear polygons on a plane, and how to implement it using off-the-shelf hardware components. Based on properties of Fourier calculus, we derive a relationship between the Discrete Fourier Transforms of the sampled mask transmission function and its continuous Fourier series coefficients. The relationship leads to a straightforward algorithm for computing the continuous Fourier series coefficients where one samples the mask transmission function, compute its discrete Fourier transform and applies a frequency-dependent multiplicative factor. The algorithm is guaranteed to yield the exact continuous Fourier series coefficients for any sampling representing the mask function exactly. Computationally, this leads to significant saving by allowing to choose the maximal such pixel size and reducing the fast Fourier transform size by as much, without compromising accuracy. In addition, the continuous Fourier series is free from aliasing and follows closely the physical model of Fourier optics. We show that in some cases this can make a significant difference, especially in modern very low pitch technology nodes.

  16. Group-invariant finite Fourier transforms

    International Nuclear Information System (INIS)

    Shenefelt, M.H.

    1988-01-01

    The computation of the finite Fourier transform of functions is one of the most used computations in crystallography. Since the Fourier transform involved in 3-dimensional, the size of the computation becomes very large even for relatively few sample points along each edge. In this thesis, there is a family of algorithms that reduce the computation of Fourier transform of functions respecting the symmetries. Some properties of these algorithms are: (1) The algorithms make full use of the group of symmetries of a crystal. (2) The algorithms can be factored and combined according to the prime factorization of the number of points in the sample space. (3) The algorithms are organized into a family using the group structure of the crystallographic groups to make iterative procedures possible

  17. Fourier-muunnoksesta

    OpenAIRE

    NIEMELÄ, EERO

    2008-01-01

    Tutkielman aiheena on Fourier-muunnoksen esittely. Tarkoituksena on erityisesti johdatella lukija Fourier-sarjan ja -muunnoksen käsitteisiin. Fourier-muunnosten teoria kuuluu yleisempään Fourier-analyysin aihepiiriin. Fourier-analyysin keskiössä on tulos, jonka mukaan tietyt ehdot täyttävää funktiota voidaan approksimoida mielivaltaisen tarkasti niin sanotun Fourier-sarjan avulla. Osoitamme, että 2\\pi-jaksollisen funktion Lebesgue-neliöintegroituvuus takaa suppenevan Fourier-sarjakehitelm...

  18. An optical Fourier transform coprocessor with direct phase determination.

    Science.gov (United States)

    Macfaden, Alexander J; Gordon, George S D; Wilkinson, Timothy D

    2017-10-20

    The Fourier transform is a ubiquitous mathematical operation which arises naturally in optics. We propose and demonstrate a practical method to optically evaluate a complex-to-complex discrete Fourier transform. By implementing the Fourier transform optically we can overcome the limiting O(nlogn) complexity of fast Fourier transform algorithms. Efficiently extracting the phase from the well-known optical Fourier transform is challenging. By appropriately decomposing the input and exploiting symmetries of the Fourier transform we are able to determine the phase directly from straightforward intensity measurements, creating an optical Fourier transform with O(n) apparent complexity. Performing larger optical Fourier transforms requires higher resolution spatial light modulators, but the execution time remains unchanged. This method could unlock the potential of the optical Fourier transform to permit 2D complex-to-complex discrete Fourier transforms with a performance that is currently untenable, with applications across information processing and computational physics.

  19. Total mass difference statistics algorithm: a new approach to identification of high-mass building blocks in electrospray ionization Fourier transform ion cyclotron mass spectrometry data of natural organic matter.

    Science.gov (United States)

    Kunenkov, Erast V; Kononikhin, Alexey S; Perminova, Irina V; Hertkorn, Norbert; Gaspar, Andras; Schmitt-Kopplin, Philippe; Popov, Igor A; Garmash, Andrew V; Nikolaev, Evgeniy N

    2009-12-15

    The ultrahigh-resolution Fourier transform ion cyclotron resonance (FTICR) mass spectrum of natural organic matter (NOM) contains several thousand peaks with dozens of molecules matching the same nominal mass. Such a complexity poses a significant challenge for automatic data interpretation, in which the most difficult task is molecular formula assignment, especially in the case of heavy and/or multielement ions. In this study, a new universal algorithm for automatic treatment of FTICR mass spectra of NOM and humic substances based on total mass difference statistics (TMDS) has been developed and implemented. The algorithm enables a blind search for unknown building blocks (instead of a priori known ones) by revealing repetitive patterns present in spectra. In this respect, it differs from all previously developed approaches. This algorithm was implemented in designing FIRAN-software for fully automated analysis of mass data with high peak density. The specific feature of FIRAN is its ability to assign formulas to heavy and/or multielement molecules using "virtual elements" approach. To verify the approach, it was used for processing mass spectra of sodium polystyrene sulfonate (PSS, M(w) = 2200 Da) and polymethacrylate (PMA, M(w) = 3290 Da) which produce heavy multielement and multiply-charged ions. Application of TMDS identified unambiguously monomers present in the polymers consistent with their structure: C(8)H(7)SO(3)Na for PSS and C(4)H(6)O(2) for PMA. It also allowed unambiguous formula assignment to all multiply-charged peaks including the heaviest peak in PMA spectrum at mass 4025.6625 with charge state 6- (mass bias -0.33 ppm). Application of the TMDS-algorithm to processing data on the Suwannee River FA has proven its unique capacities in analysis of spectra with high peak density: it has not only identified the known small building blocks in the structure of FA such as CH(2), H(2), C(2)H(2)O, O but the heavier unit at 154.027 amu. The latter was

  20. Three dimensional image reconstruction in the Fourier domain

    International Nuclear Information System (INIS)

    Stearns, C.W.; Chesler, D.A.; Brownell, G.L.

    1987-01-01

    Filtered backprojection reconstruction algorithms are based upon the relationship between the Fourier transform of the imaged object and the Fourier transforms of its projections. A new reconstruction algorithm has been developed which performs the image assembly operation in Fourier space, rather than in image space by backprojection. This represents a significant decrease in the number of operations required to assemble the image. The new Fourier domain algorithm has resolution comparable to the filtered backprojection algorithm, and, after correction by a pointwise multiplication, demonstrates proper recovery throughout image space. Although originally intended for three-dimensional imaging applications, the Fourier domain algorithm can also be developed for two-dimensional imaging applications such as planar positron imaging systems

  1. Principles of Fourier analysis

    CERN Document Server

    Howell, Kenneth B

    2001-01-01

    Fourier analysis is one of the most useful and widely employed sets of tools for the engineer, the scientist, and the applied mathematician. As such, students and practitioners in these disciplines need a practical and mathematically solid introduction to its principles. They need straightforward verifications of its results and formulas, and they need clear indications of the limitations of those results and formulas.Principles of Fourier Analysis furnishes all this and more. It provides a comprehensive overview of the mathematical theory of Fourier analysis, including the development of Fourier series, "classical" Fourier transforms, generalized Fourier transforms and analysis, and the discrete theory. Much of the author''s development is strikingly different from typical presentations. His approach to defining the classical Fourier transform results in a much cleaner, more coherent theory that leads naturally to a starting point for the generalized theory. He also introduces a new generalized theory based ...

  2. A reconstruction algorithms for helical cone-beam SPECT

    International Nuclear Information System (INIS)

    Weng, Y.; Zeng, G.L.; Gullberg, G.T.

    1993-01-01

    Cone-beam SPECT provides improved sensitivity for imaging small organs like the brain and heart. However, current cone-beam tomography with the focal point traversing a planar orbit does not acquire sufficient data to give an accurate reconstruction. In this paper, the authors employ a data-acquisition method which obtains complete data for cone-beam SPECT by simultaneously rotating the gamma camera and translating the patient bed, so that cone-beam projections can be obtained with the focal point traversing a helix surrounding the patient. An implementation of Grangeat's algorithm for helical cone-beam projections is developed. The algorithm requires a rebinning step to convert cone-beam data to parallel-beam data which are then reconstructed using the 3D Radon inversion. A fast new rebinning scheme is developed which uses all of the detected data to reconstruct the image and properly normalizes any multiply scanned data. This algorithm is shown to produce less artifacts than the commonly used Feldkamp algorithm when applied to either a circular planar orbit or a helical orbit acquisition. The algorithm can easily be extended to any arbitrary orbit

  3. Fractional finite Fourier transform.

    Science.gov (United States)

    Khare, Kedar; George, Nicholas

    2004-07-01

    We show that a fractional version of the finite Fourier transform may be defined by using prolate spheroidal wave functions of order zero. The transform is linear and additive in its index and asymptotically goes over to Namias's definition of the fractional Fourier transform. As a special case of this definition, it is shown that the finite Fourier transform may be inverted by using information over a finite range of frequencies in Fourier space, the inversion being sensitive to noise. Numerical illustrations for both forward (fractional) and inverse finite transforms are provided.

  4. Fourier Series Optimization Opportunity

    Science.gov (United States)

    Winkel, Brian

    2008-01-01

    This note discusses the introduction of Fourier series as an immediate application of optimization of a function of more than one variable. Specifically, it is shown how the study of Fourier series can be motivated to enrich a multivariable calculus class. This is done through discovery learning and use of technology wherein students build the…

  5. Jean Baptiste Joseph Fourier

    Science.gov (United States)

    Sterken, C.

    2003-03-01

    This paper gives a short account of some key elements in the life of Jean Baptiste Joseph Fourier (1768-1830), specifically his relation to Napoleon Bonaparte. The mathematical approach to Fourier series and the original scepticism by French mathematicians are briefly illustrated.

  6. Generalized Fourier transforms classes

    DEFF Research Database (Denmark)

    Berntsen, Svend; Møller, Steen

    2002-01-01

    The Fourier class of integral transforms with kernels $B(\\omega r)$ has by definition inverse transforms with kernel $B(-\\omega r)$. The space of such transforms is explicitly constructed. A slightly more general class of generalized Fourier transforms are introduced. From the general theory...

  7. Development of regularized expectation maximization algorithms for fan-beam SPECT data

    International Nuclear Information System (INIS)

    Kim, Soo Mee; Lee, Jae Sung; Lee, Dong Soo; Lee, Soo Jin; Kim, Kyeong Min

    2005-01-01

    SPECT using a fan-beam collimator improves spatial resolution and sensitivity. For the reconstruction from fan-beam projections, it is necessary to implement direct fan-beam reconstruction methods without transforming the data into the parallel geometry. In this study, various fan-beam reconstruction algorithms were implemented and their performances were compared. The projector for fan-beam SPECT was implemented using a ray-tracing method. The direct reconstruction algorithms implemented for fan-beam projection data were FBP (filtered backprojection), EM (expectation maximization), OS-EM (ordered subsets EM) and MAP-EM OSL (maximum a posteriori EM using the one-step late method) with membrane and thin-plate models as priors. For comparison, the fan-beam projection data were also rebinned into the parallel data using various interpolation methods, such as the nearest neighbor, bilinear and bicubic interpolations, and reconstructed using the conventional EM algorithm for parallel data. Noiseless and noisy projection data from the digital Hoffman brain and Shepp/Logan phantoms were reconstructed using the above algorithms. The reconstructed images were compared in terms of a percent error metric. For the fan-beam data with Poisson noise, the MAP-EM OSL algorithm with the thin-plate prior showed the best result in both percent error and stability. Bilinear interpolation was the most effective method for rebinning from the fan-beam to parallel geometry when the accuracy and computation load were considered. Direct fan-beam EM reconstructions were more accurate than the standard EM reconstructions obtained from rebinned parallel data. Direct fan-beam reconstruction algorithms were implemented, which provided significantly improved reconstructions

  8. Fourier analysis an introduction

    CERN Document Server

    Stein, Elias M

    2003-01-01

    This first volume, a three-part introduction to the subject, is intended for students with a beginning knowledge of mathematical analysis who are motivated to discover the ideas that shape Fourier analysis. It begins with the simple conviction that Fourier arrived at in the early nineteenth century when studying problems in the physical sciences--that an arbitrary function can be written as an infinite sum of the most basic trigonometric functions.The first part implements this idea in terms of notions of convergence and summability of Fourier series, while highlighting applications such as th

  9. A Short Biography of Joseph Fourier and Historical Development of Fourier Series and Fourier Transforms

    Science.gov (United States)

    Debnath, Lokenath

    2012-01-01

    This article deals with a brief biographical sketch of Joseph Fourier, his first celebrated work on analytical theory of heat, his first great discovery of Fourier series and Fourier transforms. Included is a historical development of Fourier series and Fourier transforms with their properties, importance and applications. Special emphasis is made…

  10. KAM Tori Construction Algorithms

    Science.gov (United States)

    Wiesel, W.

    In this paper we evaluate and compare two algorithms for the calculation of KAM tori in Hamiltonian systems. The direct fitting of a torus Fourier series to a numerically integrated trajectory is the first method, while an accelerated finite Fourier transform is the second method. The finite Fourier transform, with Hanning window functions, is by far superior in both computational loading and numerical accuracy. Some thoughts on applications of KAM tori are offered.

  11. Fourier phasing with phase-uncertain mask

    International Nuclear Information System (INIS)

    Fannjiang, Albert; Liao, Wenjing

    2013-01-01

    Fourier phasing is the problem of retrieving Fourier phase information from Fourier intensity data. The standard Fourier phase retrieval (without a mask) is known to have many solutions which cause the standard phasing algorithms to stagnate and produce wrong or inaccurate solutions. In this paper Fourier phase retrieval is carried out with the introduction of a randomly fabricated mask in measurement and reconstruction. Highly probable uniqueness of solution, up to a global phase, was previously proved with exact knowledge of the mask. Here the uniqueness result is extended to the case where only rough information about the mask’s phases is assumed. The exponential probability bound for uniqueness is given in terms of the uncertainty-to-diversity ratio of the unknown mask. New phasing algorithms alternating between the object update and the mask update are systematically tested and demonstrated to have the capability of recovering both the object and the mask (within the object support) simultaneously, consistent with the uniqueness result. Phasing with a phase-uncertain mask is shown to be robust with respect to the correlation in the mask as well as the Gaussian and Poisson noises. (paper)

  12. Digital Fourier analysis fundamentals

    CERN Document Server

    Kido, Ken'iti

    2015-01-01

    This textbook is a thorough, accessible introduction to digital Fourier analysis for undergraduate students in the sciences. Beginning with the principles of sine/cosine decomposition, the reader walks through the principles of discrete Fourier analysis before reaching the cornerstone of signal processing: the Fast Fourier Transform. Saturated with clear, coherent illustrations, "Digital Fourier Analysis - Fundamentals" includes practice problems and thorough Appendices for the advanced reader. As a special feature, the book includes interactive applets (available online) that mirror the illustrations.  These user-friendly applets animate concepts interactively, allowing the user to experiment with the underlying mathematics. For example, a real sine signal can be treated as a sum of clockwise and counter-clockwise rotating vectors. The applet illustration included with the book animates the rotating vectors and the resulting sine signal. By changing parameters such as amplitude and frequency, the reader ca...

  13. Fourier Transform Mass Spectrometry

    Science.gov (United States)

    Scigelova, Michaela; Hornshaw, Martin; Giannakopulos, Anastassios; Makarov, Alexander

    2011-01-01

    This article provides an introduction to Fourier transform-based mass spectrometry. The key performance characteristics of Fourier transform-based mass spectrometry, mass accuracy and resolution, are presented in the view of how they impact the interpretation of measurements in proteomic applications. The theory and principles of operation of two types of mass analyzer, Fourier transform ion cyclotron resonance and Orbitrap, are described. Major benefits as well as limitations of Fourier transform-based mass spectrometry technology are discussed in the context of practical sample analysis, and illustrated with examples included as figures in this text and in the accompanying slide set. Comparisons highlighting the performance differences between the two mass analyzers are made where deemed useful in assisting the user with choosing the most appropriate technology for an application. Recent developments of these high-performing mass spectrometers are mentioned to provide a future outlook. PMID:21742802

  14. Generalized Fourier transforms classes

    DEFF Research Database (Denmark)

    Berntsen, Svend; Møller, Steen

    2002-01-01

    The Fourier class of integral transforms with kernels $B(\\omega r)$ has by definition inverse transforms with kernel $B(-\\omega r)$. The space of such transforms is explicitly constructed. A slightly more general class of generalized Fourier transforms are introduced. From the general theory foll...... follows that integral transform with kernels which are products of a Bessel and a Hankel function or which is of a certain general hypergeometric type have inverse transforms of the same structure....

  15. Generalized fiber Fourier optics.

    Science.gov (United States)

    Cincotti, Gabriella

    2011-06-15

    A twofold generalization of the optical schemes that perform the discrete Fourier transform (DFT) is given: new passive planar architectures are presented where the 2 × 2 3 dB couplers are replaced by M × M hybrids, reducing the number of required connections and phase shifters. Furthermore, the planar implementation of the discrete fractional Fourier transform (DFrFT) is also described, with a waveguide grating router (WGR) configuration and a properly modified slab coupler.

  16. Fourier-transforming with quantum annealers

    Directory of Open Access Journals (Sweden)

    Itay eHen

    2014-07-01

    Full Text Available We introduce a set of quantum adiabatic evolutions that we argue may be used as `building blocks', or subroutines, in the onstruction of an adiabatic algorithm that executes Quantum Fourier Transform (QFT with the same complexity and resources as its gate-model counterpart. One implication of the above construction is the theoretical feasibility of implementing Shor's algorithm for integer factorization in an optimal manner, and any other algorithm that makes use of QFT, on quantum annealing devices. We discuss the possible advantages, as well as the limitations, of the proposed approach as well as its relation to traditional adiabatic quantum computation.

  17. A discrete Fourier transform for virtual memory machines

    Science.gov (United States)

    Galant, David C.

    1992-01-01

    An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of the details of the theory leads to a computationally efficient fast Fourier transform for the use on computers with virtual memory. Such an algorithm is of great use on modern desktop machines. A FORTRAN coded version of the algorithm is given for the case when the sequence of numbers to be transformed is a power of two.

  18. Fourier transformation for engineering and natural science

    International Nuclear Information System (INIS)

    Klingen, B.

    2001-01-01

    The following topics are covered: functions, Dirac delta function, Fourier operators, Fourier integrals, Fourier transformation and periodic functions, discrete Fourier transformations and discrete filters, applications. (WL)

  19. On Fourier re-expansions

    OpenAIRE

    Liflyand, E.

    2012-01-01

    We study an extension to Fourier transforms of the old problem on absolute convergence of the re-expansion in the sine (cosine) Fourier series of an absolutely convergent cosine (sine) Fourier series. The results are obtained by revealing certain relations between the Fourier transforms and their Hilbert transforms.

  20. Fourier plane imaging microscopy

    Energy Technology Data Exchange (ETDEWEB)

    Dominguez, Daniel, E-mail: daniel.dominguez@ttu.edu; Peralta, Luis Grave de [Department of Physics, Texas Tech University, Lubbock, Texas 79409 (United States); Nano Tech Center, Texas Tech University, Lubbock, Texas 79409 (United States); Alharbi, Nouf; Alhusain, Mdhaoui [Department of Physics, Texas Tech University, Lubbock, Texas 79409 (United States); Bernussi, Ayrton A. [Nano Tech Center, Texas Tech University, Lubbock, Texas 79409 (United States); Department of Electrical and Computer Engineering, Texas Tech University, Lubbock, Texas 79409 (United States)

    2014-09-14

    We show how the image of an unresolved photonic crystal can be reconstructed using a single Fourier plane (FP) image obtained with a second camera that was added to a traditional compound microscope. We discuss how Fourier plane imaging microscopy is an application of a remarkable property of the obtained FP images: they contain more information about the photonic crystals than the images recorded by the camera commonly placed at the real plane of the microscope. We argue that the experimental results support the hypothesis that surface waves, contributing to enhanced resolution abilities, were optically excited in the studied photonic crystals.

  1. Reducing aberration effect of Fourier transform lens by modifying Fourier spectrum of diffractive optical element in beam shaping optical system.

    Science.gov (United States)

    Zhang, Fang; Zhu, Jing; Song, Qiang; Yue, Weirui; Liu, Jingdan; Wang, Jian; Situ, Guohai; Huang, Huijie

    2015-10-20

    In general, Fourier transform lenses are considered as ideal in the design algorithms of diffractive optical elements (DOEs). However, the inherent aberrations of a real Fourier transform lens disturb the far field pattern. The difference between the generated pattern and the expected design will impact the system performance. Therefore, a method for modifying the Fourier spectrum of DOEs without introducing other optical elements to reduce the aberration effect of the Fourier transform lens is proposed. By applying this method, beam shaping performance is improved markedly for the optical system with a real Fourier transform lens. The experiments carried out with a commercial Fourier transform lens give evidence for this method. The method is capable of reducing the system complexity as well as improving its performance.

  2. Fourier Transform Mass Spectrometry.

    Science.gov (United States)

    Gross, Michael L.; Rempel, Don L.

    1984-01-01

    Discusses the nature of Fourier transform mass spectrometry and its unique combination of high mass resolution, high upper mass limit, and multichannel advantage. Examines its operation, capabilities and limitations, applications (ion storage, ion manipulation, ion chemistry), and future applications and developments. (JN)

  3. Quantum Fourier Transform Over Galois Rings

    OpenAIRE

    Zhang, Yong

    2009-01-01

    Galois rings are regarded as "building blocks" of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum algorithms and quantum error correction codes over Galois rings, we study the quantum Fourier transform (QFT) over Galois rings and prove it can be efficiently preformed on a quantum computer. The properties of the QFT over Galois rings lead to the quantum algorit...

  4. Fourier beamformation of multistatic synthetic aperture ultrasound imaging

    DEFF Research Database (Denmark)

    Moghimirad, Elahe; Villagómez Hoyos, Carlos Armando; Mahloojifar, Ali

    2015-01-01

    A new Fourier beamformation (FB) algorithm is presented for multistatic synthetic aperture ultrasound imaging. It can reduce the number of computations by a factor of 20 compared to conventional Delay-and-Sum (DAS) beamformers. The concept is based on the wavenumber algorithm from radar and sonar...

  5. Synthetic aperture ultrasound Fourier beamformation using virtual sources

    DEFF Research Database (Denmark)

    Moghimirad, Elahe; Villagómez Hoyos, Carlos Armando; Mahloojifar, Ali

    2016-01-01

    An efficient Fourier beamformation algorithm is presented for multistatic synthetic aperture ultrasound imaging using virtual sources (FBV). The concept is based on the frequency domain wavenumber algorithm from radar and sonar and is extended to a multi-element transmit/receive configuration using...

  6. Classical Fourier analysis

    CERN Document Server

    Grafakos, Loukas

    2014-01-01

    The main goal of this text is to present the theoretical foundation of the field of Fourier analysis on Euclidean spaces. It covers classical topics such as interpolation, Fourier series, the Fourier transform, maximal functions, singular integrals, and Littlewood–Paley theory. The primary readership is intended to be graduate students in mathematics with the prerequisite including satisfactory completion of courses in real and complex variables. The coverage of topics and exposition style are designed to leave no gaps in understanding and stimulate further study. This third edition includes new Sections 3.5, 4.4, 4.5 as well as a new chapter on “Weighted Inequalities,” which has been moved from GTM 250, 2nd Edition. Appendices I and B.9 are also new to this edition.  Countless corrections and improvements have been made to the material from the second edition. Additions and improvements include: more examples and applications, new and more relevant hints for the existing exercises, new exercises, and...

  7. Fourier techniques and applications

    CERN Document Server

    1985-01-01

    The first systematic methods of Fourier analysis date from the early eighteenth century with the work of Joseph Fourier on the problem of the flow of heat. (A brief history is contained in the first paper.) Given the initial tempera­ ture at all points of a region, the problem was to determine the changes in the temperature distribution over time. Understanding and predicting these changes was important in such areas as the handling of metals and the determination of geological and atmospheric temperatures. Briefly, Fourier noticed that the solution of the heat diffusion problem was simple if the initial temperature dis­ tribution was sinusoidal. He then asserted that any distri­ bution can be decomposed into a sum of sinusoids, these being the harmonics of the original function. This meant that the general solution could now be obtained by summing the solu­ tions of the component sinusoidal problems. This remarkable ability of the series of sinusoids to describe all "reasonable" functions, the sine qua n...

  8. Generalized Fourier slice theorem for cone-beam image reconstruction.

    Science.gov (United States)

    Zhao, Shuang-Ren; Jiang, Dazong; Yang, Kevin; Yang, Kang

    2015-01-01

    The cone-beam reconstruction theory has been proposed by Kirillov in 1961, Tuy in 1983, Feldkamp in 1984, Smith in 1985, Pierre Grangeat in 1990. The Fourier slice theorem is proposed by Bracewell 1956, which leads to the Fourier image reconstruction method for parallel-beam geometry. The Fourier slice theorem is extended to fan-beam geometry by Zhao in 1993 and 1995. By combining the above mentioned cone-beam image reconstruction theory and the above mentioned Fourier slice theory of fan-beam geometry, the Fourier slice theorem in cone-beam geometry is proposed by Zhao 1995 in short conference publication. This article offers the details of the derivation and implementation of this Fourier slice theorem for cone-beam geometry. Especially the problem of the reconstruction from Fourier domain has been overcome, which is that the value of in the origin of Fourier space is 0/0. The 0/0 type of limit is proper handled. As examples, the implementation results for the single circle and two perpendicular circle source orbits are shown. In the cone-beam reconstruction if a interpolation process is considered, the number of the calculations for the generalized Fourier slice theorem algorithm is O(N^4), which is close to the filtered back-projection method, here N is the image size of 1-dimension. However the interpolation process can be avoid, in that case the number of the calculations is O(N5).

  9. Fourier transforms principles and applications

    CERN Document Server

    Hansen, Eric W

    2014-01-01

    Fourier Transforms: Principles and Applications explains transform methods and their applications to electrical systems from circuits, antennas, and signal processors-ably guiding readers from vector space concepts through the Discrete Fourier Transform (DFT), Fourier series, and Fourier transform to other related transform methods.  Featuring chapter end summaries of key results, over two hundred examples and four hundred homework problems, and a Solutions Manual this book is perfect for graduate students in signal processing and communications as well as practicing engineers.

  10. On the Fourier integral theorem

    NARCIS (Netherlands)

    Koekoek, J.

    1987-01-01

    Introduction. In traditional proofs of convergence of Fourier series and of the Fourier integraI theorem basic tools are the theory of Dirichlet integraIs and the Riemann-Lebesgue lemma. Recently CHERNOFF [I) and REoIlEFFER (2) gave new proofs of convergenceof Fourier series which make no use of the

  11. The morphing of geographical features by Fourier transformation.

    Science.gov (United States)

    Li, Jingzhong; Liu, Pengcheng; Yu, Wenhao; Cheng, Xiaoqiang

    2018-01-01

    This paper presents a morphing model of vector geographical data based on Fourier transformation. This model involves three main steps. They are conversion from vector data to Fourier series, generation of intermediate function by combination of the two Fourier series concerning a large scale and a small scale, and reverse conversion from combination function to vector data. By mirror processing, the model can also be used for morphing of linear features. Experimental results show that this method is sensitive to scale variations and it can be used for vector map features' continuous scale transformation. The efficiency of this model is linearly related to the point number of shape boundary and the interceptive value n of Fourier expansion. The effect of morphing by Fourier transformation is plausible and the efficiency of the algorithm is acceptable.

  12. Exact fan-beam image reconstruction algorithm for truncated projection data acquired from an asymmetric half-size detector

    International Nuclear Information System (INIS)

    Leng Shuai; Zhuang Tingliang; Nett, Brian E; Chen Guanghong

    2005-01-01

    In this paper, we present a new algorithm designed for a specific data truncation problem in fan-beam CT. We consider a scanning configuration in which the fan-beam projection data are acquired from an asymmetrically positioned half-sized detector. Namely, the asymmetric detector only covers one half of the scanning field of view. Thus, the acquired fan-beam projection data are truncated at every view angle. If an explicit data rebinning process is not invoked, this data acquisition configuration will reek havoc on many known fan-beam image reconstruction schemes including the standard filtered backprojection (FBP) algorithm and the super-short-scan FBP reconstruction algorithms. However, we demonstrate that a recently developed fan-beam image reconstruction algorithm which reconstructs an image via filtering a backprojection image of differentiated projection data (FBPD) survives the above fan-beam data truncation problem. Namely, we may exactly reconstruct the whole image object using the truncated data acquired in a full scan mode (2π angular range). We may also exactly reconstruct a small region of interest (ROI) using the truncated projection data acquired in a short-scan mode (less than 2π angular range). The most important characteristic of the proposed reconstruction scheme is that an explicit data rebinning process is not introduced. Numerical simulations were conducted to validate the new reconstruction algorithm

  13. From Fourier Transforms to Singular Eigenfunctions for Multigroup Transport

    International Nuclear Information System (INIS)

    Ganapol, B.D.

    2001-01-01

    A new Fourier transform approach to the solution of the multigroup transport equation with anisotropic scattering and isotropic source is presented. Through routine analytical continuation, the inversion contour is shifted from the real line to produce contributions from the poles and cuts in the complex plane. The integrand along the branch cut is then recast in terms of matrix continuum singular eigenfunctions, demonstrating equivalence of Fourier transform inversion and the singular eigenfunction expansion. The significance of this paper is that it represents the initial step in revealing the intimate connection between the Fourier transform and singular eigenfunction approaches as well as serves as a basis for a numerical algorithm

  14. Image reconstruction from pairs of Fourier-transform magnitude

    International Nuclear Information System (INIS)

    Hunt, B.R.; Overman, T.L.; Gough, P.

    1998-01-01

    The retrieval of phase information from only the magnitude of the Fourier transform of a signal remains an important problem for many applications. We present an algorithm for phase retrieval when there exist two related sets of Fourier-transform magnitude data. The data are assumed to come from a single object observed in two different polarizations through a distorting medium, so the phase component of the Fourier transform of the object is corrupted. Phase retrieval is accomplished by minimization of a suitable criterion function, which can take three different forms. copyright 1998 Optical Society of America

  15. Fourier transforms in spectroscopy

    CERN Document Server

    Kauppinen, Jyrki

    2000-01-01

    This modern approach to the subject is clearly and logically structured, and gives readers an understanding of the essence of Fourier transforms and their applications. All important aspects are included with respect to their use with optical spectroscopic data. Based on popular lectures, the authors provide the mathematical fundamentals and numerical applications which are essential in practical use. The main part of the book is dedicated to applications of FT in signal processing and spectroscopy, with IR and NIR, NMR and mass spectrometry dealt with both from a theoretical and practical poi

  16. Fourier Domain Sensing

    Science.gov (United States)

    Feldkhun, Daniel (Inventor); Wagner, Kelvin H. (Inventor)

    2013-01-01

    Methods and systems are disclosed of sensing an object. A first radiation is spatially modulated to generate a structured second radiation. The object is illuminated with the structured second radiation such that the object produces a third radiation in response. Apart from any spatially dependent delay, a time variation of the third radiation is spatially independent. With a single-element detector, a portion of the third radiation is detected from locations on the object simultaneously. At least one characteristic of a sinusoidal spatial Fourier-transform component of the object is estimated from a time-varying signal from the detected portion of the third radiation.

  17. Fourier diffraction theorem for diffusion-based thermal tomography

    International Nuclear Information System (INIS)

    Baddour, Natalie

    2006-01-01

    There has been much recent interest in thermal imaging as a method of non-destructive testing and for non-invasive medical imaging. The basic idea of applying heat or cold to an area and observing the resulting temperature change with an infrared camera has led to the development of rapid and relatively inexpensive inspection systems. However, the main drawback to date has been that such an approach provides mainly qualitative results. In order to advance the quantitative results that are possible via thermal imaging, there is interest in applying techniques and algorithms from conventional tomography. Many tomography algorithms are based on the Fourier diffraction theorem, which is inapplicable to thermal imaging without suitable modification to account for the attenuative nature of thermal waves. In this paper, the Fourier diffraction theorem for thermal tomography is derived and discussed. The intent is for this thermal-diffusion based Fourier diffraction theorem to form the basis of tomographic reconstruction algorithms for quantitative thermal imaging

  18. Fast Fourier transform telescope

    International Nuclear Information System (INIS)

    Tegmark, Max; Zaldarriaga, Matias

    2009-01-01

    We propose an all-digital telescope for 21 cm tomography, which combines key advantages of both single dishes and interferometers. The electric field is digitized by antennas on a rectangular grid, after which a series of fast Fourier transforms recovers simultaneous multifrequency images of up to half the sky. Thanks to Moore's law, the bandwidth up to which this is feasible has now reached about 1 GHz, and will likely continue doubling every couple of years. The main advantages over a single dish telescope are cost and orders of magnitude larger field-of-view, translating into dramatically better sensitivity for large-area surveys. The key advantages over traditional interferometers are cost (the correlator computational cost for an N-element array scales as Nlog 2 N rather than N 2 ) and a compact synthesized beam. We argue that 21 cm tomography could be an ideal first application of a very large fast Fourier transform telescope, which would provide both massive sensitivity improvements per dollar and mitigate the off-beam point source foreground problem with its clean beam. Another potentially interesting application is cosmic microwave background polarization.

  19. Fourier Transform Spectrometer System

    Science.gov (United States)

    Campbell, Joel F. (Inventor)

    2014-01-01

    A Fourier transform spectrometer (FTS) data acquisition system includes an FTS spectrometer that receives a spectral signal and a laser signal. The system further includes a wideband detector, which is in communication with the FTS spectrometer and receives the spectral signal and laser signal from the FTS spectrometer. The wideband detector produces a composite signal comprising the laser signal and the spectral signal. The system further comprises a converter in communication with the wideband detector to receive and digitize the composite signal. The system further includes a signal processing unit that receives the composite signal from the converter. The signal processing unit further filters the laser signal and the spectral signal from the composite signal and demodulates the laser signal, to produce velocity corrected spectral data.

  20. Rainbow Fourier Transform

    Science.gov (United States)

    Alexandrov, Mikhail D.; Cairns, Brian; Mishchenko, Michael I.

    2012-01-01

    We present a novel technique for remote sensing of cloud droplet size distributions. Polarized reflectances in the scattering angle range between 135deg and 165deg exhibit a sharply defined rainbow structure, the shape of which is determined mostly by single scattering properties of cloud particles, and therefore, can be modeled using the Mie theory. Fitting the observed rainbow with such a model (computed for a parameterized family of particle size distributions) has been used for cloud droplet size retrievals. We discovered that the relationship between the rainbow structures and the corresponding particle size distributions is deeper than it had been commonly understood. In fact, the Mie theory-derived polarized reflectance as a function of reduced scattering angle (in the rainbow angular range) and the (monodisperse) particle radius appears to be a proxy to a kernel of an integral transform (similar to the sine Fourier transform on the positive semi-axis). This approach, called the rainbow Fourier transform (RFT), allows us to accurately retrieve the shape of the droplet size distribution by the application of the corresponding inverse transform to the observed polarized rainbow. While the basis functions of the proxy-transform are not exactly orthogonal in the finite angular range, this procedure needs to be complemented by a simple regression technique, which removes the retrieval artifacts. This non-parametric approach does not require any a priori knowledge of the droplet size distribution functional shape and is computationally fast (no look-up tables, no fitting, computations are the same as for the forward modeling).

  1. TMS320C25 Digital Signal Processor For 2-Dimensional Fast Fourier Transform Computation

    International Nuclear Information System (INIS)

    Ardisasmita, M. Syamsa

    1996-01-01

    The Fourier transform is one of the most important mathematical tool in signal processing and analysis, which converts information from the time/spatial domain into the frequency domain. Even with implementation of the Fast Fourier Transform algorithms in imaging data, the discrete Fourier transform execution consume a lot of time. Digital signal processors are designed specifically to perform computation intensive digital signal processing algorithms. By taking advantage of the advanced architecture. parallel processing, and dedicated digital signal processing (DSP) instruction sets. This device can execute million of DSP operations per second. The device architecture, characteristics and feature suitable for fast Fourier transform application and speed-up are discussed

  2. Quadrature formulas for Fourier coefficients

    KAUST Repository

    Bojanov, Borislav

    2009-09-01

    We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node formula for the Fourier-Tchebycheff coefficients given by Micchelli and Sharma and construct new Gaussian formulas for the Fourier coefficients of a function, based on the values of the function and its derivatives. © 2009 Elsevier B.V. All rights reserved.

  3. Complex nonlinear Fourier transform and its inverse

    International Nuclear Information System (INIS)

    Saksida, Pavle

    2015-01-01

    We study the nonlinear Fourier transform associated to the integrable systems of AKNS-ZS type. Two versions of this transform appear in connection with the AKNS-ZS systems. These two versions can be considered as two real forms of a single complex transform F c . We construct an explicit algorithm for the calculation of the inverse transform (F c ) -1 (h) for an arbitrary argument h. The result is given in the form of a convergent series of functions in the domain space and the terms of this series can be computed explicitly by means of finitely many integrations. (paper)

  4. Fourier-Hermite communications; where Fourier meets Hermite

    NARCIS (Netherlands)

    Korevaar, C.W.; Kokkeler, Andre B.J.; de Boer, Pieter-Tjerk; Smit, Gerardus Johannes Maria

    A new signal set, based on the Fourier and Hermite signal bases, is introduced. It combines properties of the Fourier basis signals with the perfect time-frequency localization of the Hermite functions. The signal set is characterized by both a high spectral efficiency and good time-frequency

  5. Fourier-Accelerated Nodal Solvers (FANS) for homogenization problems

    Science.gov (United States)

    Leuschner, Matthias; Fritzen, Felix

    2017-11-01

    Fourier-based homogenization schemes are useful to analyze heterogeneous microstructures represented by 2D or 3D image data. These iterative schemes involve discrete periodic convolutions with global ansatz functions (mostly fundamental solutions). The convolutions are efficiently computed using the fast Fourier transform. FANS operates on nodal variables on regular grids and converges to finite element solutions. Compared to established Fourier-based methods, the number of convolutions is reduced by FANS. Additionally, fast iterations are possible by assembling the stiffness matrix. Due to the related memory requirement, the method is best suited for medium-sized problems. A comparative study involving established Fourier-based homogenization schemes is conducted for a thermal benchmark problem with a closed-form solution. Detailed technical and algorithmic descriptions are given for all methods considered in the comparison. Furthermore, many numerical examples focusing on convergence properties for both thermal and mechanical problems, including also plasticity, are presented.

  6. Fourier transform wavefront control with adaptive prediction of the atmosphere.

    Science.gov (United States)

    Poyneer, Lisa A; Macintosh, Bruce A; Véran, Jean-Pierre

    2007-09-01

    Predictive Fourier control is a temporal power spectral density-based adaptive method for adaptive optics that predicts the atmosphere under the assumption of frozen flow. The predictive controller is based on Kalman filtering and a Fourier decomposition of atmospheric turbulence using the Fourier transform reconstructor. It provides a stable way to compensate for arbitrary numbers of atmospheric layers. For each Fourier mode, efficient and accurate algorithms estimate the necessary atmospheric parameters from closed-loop telemetry and determine the predictive filter, adjusting as conditions change. This prediction improves atmospheric rejection, leading to significant improvements in system performance. For a 48x48 actuator system operating at 2 kHz, five-layer prediction for all modes is achievable in under 2x10(9) floating-point operations/s.

  7. On fractional Fourier transform moments

    NARCIS (Netherlands)

    Alieva, T.; Bastiaans, M.J.

    2000-01-01

    Based on the relation between the ambiguity function represented in a quasi-polar coordinate system and the fractional power spectra, the fractional Fourier transform moments are introduced. Important equalities for the global second-order fractional Fourier transform moments are derived and their

  8. Modern Fourier analysis

    CERN Document Server

    Grafakos, Loukas

    2014-01-01

    This text is addressed to graduate students in mathematics and to interested researchers who wish to acquire an in depth understanding of Euclidean Harmonic analysis. The text covers modern topics and techniques in function spaces, atomic decompositions, singular integrals of nonconvolution type, and the boundedness and convergence of Fourier series and integrals. The exposition and style are designed to stimulate further study and promote research. Historical information and references are included at the end of each chapter. This third edition includes a new chapter entitled "Multilinear Harmonic Analysis" which focuses on topics related to multilinear operators and their applications. Sections 1.1 and 1.2 are also new in this edition. Numerous corrections have been made to the text from the previous editions and several improvements have been incorporated, such as the adoption of clear and elegant statements. A few more exercises have been added with relevant hints when necessary. Reviews fr...

  9. A three-dimensional reconstruction algorithm for an inverse-geometry volumetric CT system

    International Nuclear Information System (INIS)

    Schmidt, Taly Gilat; Fahrig, Rebecca; Pelc, Norbert J.

    2005-01-01

    An inverse-geometry volumetric computed tomography (IGCT) system has been proposed capable of rapidly acquiring sufficient data to reconstruct a thick volume in one circular scan. The system uses a large-area scanned source opposite a smaller detector. The source and detector have the same extent in the axial, or slice, direction, thus providing sufficient volumetric sampling and avoiding cone-beam artifacts. This paper describes a reconstruction algorithm for the IGCT system. The algorithm first rebins the acquired data into two-dimensional (2D) parallel-ray projections at multiple tilt and azimuthal angles, followed by a 3D filtered backprojection. The rebinning step is performed by gridding the data onto a Cartesian grid in a 4D projection space. We present a new method for correcting the gridding error caused by the finite and asymmetric sampling in the neighborhood of each output grid point in the projection space. The reconstruction algorithm was implemented and tested on simulated IGCT data. Results show that the gridding correction reduces the gridding errors to below one Hounsfield unit. With this correction, the reconstruction algorithm does not introduce significant artifacts or blurring when compared to images reconstructed from simulated 2D parallel-ray projections. We also present an investigation of the noise behavior of the method which verifies that the proposed reconstruction algorithm utilizes cross-plane rays as efficiently as in-plane rays and can provide noise comparable to an in-plane parallel-ray geometry for the same number of photons. Simulations of a resolution test pattern and the modulation transfer function demonstrate that the IGCT system, using the proposed algorithm, is capable of 0.4 mm isotropic resolution. The successful implementation of the reconstruction algorithm is an important step in establishing feasibility of the IGCT system

  10. The Convergence Acceleration of Two-Dimensional Fourier Interpolation

    Directory of Open Access Journals (Sweden)

    Anry Nersessian

    2008-07-01

    Full Text Available Hereby, the convergence acceleration of two-dimensional trigonometric interpolation for a smooth functions on a uniform mesh is considered. Together with theoretical estimates some numerical results are presented and discussed that reveal the potential of this method for application in image processing. Experiments show that suggested algorithm allows acceleration of conventional Fourier interpolation even for sparse meshes that can lead to an efficient image compression/decompression algorithms and also to applications in image zooming procedures.

  11. Fourier-Based Fast Multipole Method for the Helmholtz Equation

    KAUST Repository

    Cecka, Cris

    2013-01-01

    The fast multipole method (FMM) has had great success in reducing the computational complexity of solving the boundary integral form of the Helmholtz equation. We present a formulation of the Helmholtz FMM that uses Fourier basis functions rather than spherical harmonics. By modifying the transfer function in the precomputation stage of the FMM, time-critical stages of the algorithm are accelerated by causing the interpolation operators to become straightforward applications of fast Fourier transforms, retaining the diagonality of the transfer function, and providing a simplified error analysis. Using Fourier analysis, constructive algorithms are derived to a priori determine an integration quadrature for a given error tolerance. Sharp error bounds are derived and verified numerically. Various optimizations are considered to reduce the number of quadrature points and reduce the cost of computing the transfer function. © 2013 Society for Industrial and Applied Mathematics.

  12. Closed form fourier-based transmit beamforming for MIMO radar

    KAUST Repository

    Lipor, John J.; Ahmed, Sajid; Alouini, Mohamed-Slim

    2014-01-01

    -pattern, current research uses iterative algorithms, first to synthesize the waveform covariance matrix, R, then to design the actual waveforms to realize R. In contrast to this, we present a closed form method to design R that exploits discrete Fourier transform

  13. A cone-beam reconstruction algorithm using shift-variant filtering and cone-beam backprojection

    International Nuclear Information System (INIS)

    Defrise, M.; Clack, R.

    1994-01-01

    An exact inversion formula written in the form of shift-variant filtered-backprojection (FBP) is given for reconstruction from cone-beam data taken from any orbit satisfying Tuy's sufficiency conditions. The method is based on a result of Grangeat, involving the derivative of the three-dimensional (3-D) Radon transform, but unlike Grangeat's algorithm, no 3D rebinning step is required. Data redundancy, which occurs when several cone-beam projections supply the same values in the Radon domain, is handled using an elegant weighting function and without discarding data. The algorithm is expressed in a convenient cone-beam detector reference frame, and a specific example for the case of a dual orthogonal circular orbit is presented. When the method is applied to a single circular orbit, it is shown to be equivalent to the well-known algorithm of Feldkamp et al

  14. Fourier phase in Fourier-domain optical coherence tomography

    Science.gov (United States)

    Uttam, Shikhar; Liu, Yang

    2015-01-01

    Phase of an electromagnetic wave propagating through a sample-of-interest is well understood in the context of quantitative phase imaging in transmission-mode microscopy. In the past decade, Fourier-domain optical coherence tomography has been used to extend quantitative phase imaging to the reflection-mode. Unlike transmission-mode electromagnetic phase, however, the origin and characteristics of reflection-mode Fourier phase are poorly understood, especially in samples with a slowly varying refractive index. In this paper, the general theory of Fourier phase from first principles is presented, and it is shown that Fourier phase is a joint estimate of subresolution offset and mean spatial frequency of the coherence-gated sample refractive index. It is also shown that both spectral-domain phase microscopy and depth-resolved spatial-domain low-coherence quantitative phase microscopy are special cases of this general theory. Analytical expressions are provided for both, and simulations are presented to explain and support the theoretical results. These results are further used to show how Fourier phase allows the estimation of an axial mean spatial frequency profile of the sample, along with depth-resolved characterization of localized optical density change and sample heterogeneity. Finally, a Fourier phase-based explanation of Doppler optical coherence tomography is also provided. PMID:26831383

  15. Fourier phase in Fourier-domain optical coherence tomography.

    Science.gov (United States)

    Uttam, Shikhar; Liu, Yang

    2015-12-01

    Phase of an electromagnetic wave propagating through a sample-of-interest is well understood in the context of quantitative phase imaging in transmission-mode microscopy. In the past decade, Fourier-domain optical coherence tomography has been used to extend quantitative phase imaging to the reflection-mode. Unlike transmission-mode electromagnetic phase, however, the origin and characteristics of reflection-mode Fourier phase are poorly understood, especially in samples with a slowly varying refractive index. In this paper, the general theory of Fourier phase from first principles is presented, and it is shown that Fourier phase is a joint estimate of subresolution offset and mean spatial frequency of the coherence-gated sample refractive index. It is also shown that both spectral-domain phase microscopy and depth-resolved spatial-domain low-coherence quantitative phase microscopy are special cases of this general theory. Analytical expressions are provided for both, and simulations are presented to explain and support the theoretical results. These results are further used to show how Fourier phase allows the estimation of an axial mean spatial frequency profile of the sample, along with depth-resolved characterization of localized optical density change and sample heterogeneity. Finally, a Fourier phase-based explanation of Doppler optical coherence tomography is also provided.

  16. Novel Polynomial Basis with Fast Fourier Transform and Its Application to Reed-Solomon Erasure Codes

    KAUST Repository

    Lin, Sian-Jheng; Al-Naffouri, Tareq Y.; Han, Yunghsiang S.; Chung, Wei-Ho

    2016-01-01

    In this paper, we present a fast Fourier transform (FFT) algorithm over extension binary fields, where the polynomial is represented in a non-standard basis. The proposed Fourier-like transform requires O(h lg(h)) field operations, where h

  17. Vector Radix 2 × 2 Sliding Fast Fourier Transform

    Directory of Open Access Journals (Sweden)

    Keun-Yung Byun

    2016-01-01

    Full Text Available The two-dimensional (2D discrete Fourier transform (DFT in the sliding window scenario has been successfully used for numerous applications requiring consecutive spectrum analysis of input signals. However, the results of conventional sliding DFT algorithms are potentially unstable because of the accumulated numerical errors caused by recursive strategy. In this letter, a stable 2D sliding fast Fourier transform (FFT algorithm based on the vector radix (VR 2 × 2 FFT is presented. In the VR-2 × 2 FFT algorithm, each 2D DFT bin is hierarchically decomposed into four sub-DFT bins until the size of the sub-DFT bins is reduced to 2 × 2; the output DFT bins are calculated using the linear combination of the sub-DFT bins. Because the sub-DFT bins for the overlapped input signals between the previous and current window are the same, the proposed algorithm reduces the computational complexity of the VR-2 × 2 FFT algorithm by reusing previously calculated sub-DFT bins in the sliding window scenario. Moreover, because the resultant DFT bins are identical to those of the VR-2 × 2 FFT algorithm, numerical errors do not arise; therefore, unconditional stability is guaranteed. Theoretical analysis shows that the proposed algorithm has the lowest computational requirements among the existing stable sliding DFT algorithms.

  18. Improved method of generating bit reversed numbers for calculating fast fourier transform

    Digital Repository Service at National Institute of Oceanography (India)

    Suresh, T.

    Fast Fourier Transform (FFT) is an important tool required for signal processing in defence applications. This paper reports an improved method for generating bit reversed numbers needed in calculating FFT using radix-2. The refined algorithm takes...

  19. An integral conservative gridding--algorithm using Hermitian curve interpolation.

    Science.gov (United States)

    Volken, Werner; Frei, Daniel; Manser, Peter; Mini, Roberto; Born, Ernst J; Fix, Michael K

    2008-11-07

    The problem of re-sampling spatially distributed data organized into regular or irregular grids to finer or coarser resolution is a common task in data processing. This procedure is known as 'gridding' or 're-binning'. Depending on the quantity the data represents, the gridding-algorithm has to meet different requirements. For example, histogrammed physical quantities such as mass or energy have to be re-binned in order to conserve the overall integral. Moreover, if the quantity is positive definite, negative sampling values should be avoided. The gridding process requires a re-distribution of the original data set to a user-requested grid according to a distribution function. The distribution function can be determined on the basis of the given data by interpolation methods. In general, accurate interpolation with respect to multiple boundary conditions of heavily fluctuating data requires polynomial interpolation functions of second or even higher order. However, this may result in unrealistic deviations (overshoots or undershoots) of the interpolation function from the data. Accordingly, the re-sampled data may overestimate or underestimate the given data by a significant amount. The gridding-algorithm presented in this work was developed in order to overcome these problems. Instead of a straightforward interpolation of the given data using high-order polynomials, a parametrized Hermitian interpolation curve was used to approximate the integrated data set. A single parameter is determined by which the user can control the behavior of the interpolation function, i.e. the amount of overshoot and undershoot. Furthermore, it is shown how the algorithm can be extended to multidimensional grids. The algorithm was compared to commonly used gridding-algorithms using linear and cubic interpolation functions. It is shown that such interpolation functions may overestimate or underestimate the source data by about 10-20%, while the new algorithm can be tuned to

  20. An integral conservative gridding-algorithm using Hermitian curve interpolation

    International Nuclear Information System (INIS)

    Volken, Werner; Frei, Daniel; Manser, Peter; Mini, Roberto; Born, Ernst J; Fix, Michael K

    2008-01-01

    The problem of re-sampling spatially distributed data organized into regular or irregular grids to finer or coarser resolution is a common task in data processing. This procedure is known as 'gridding' or 're-binning'. Depending on the quantity the data represents, the gridding-algorithm has to meet different requirements. For example, histogrammed physical quantities such as mass or energy have to be re-binned in order to conserve the overall integral. Moreover, if the quantity is positive definite, negative sampling values should be avoided. The gridding process requires a re-distribution of the original data set to a user-requested grid according to a distribution function. The distribution function can be determined on the basis of the given data by interpolation methods. In general, accurate interpolation with respect to multiple boundary conditions of heavily fluctuating data requires polynomial interpolation functions of second or even higher order. However, this may result in unrealistic deviations (overshoots or undershoots) of the interpolation function from the data. Accordingly, the re-sampled data may overestimate or underestimate the given data by a significant amount. The gridding-algorithm presented in this work was developed in order to overcome these problems. Instead of a straightforward interpolation of the given data using high-order polynomials, a parametrized Hermitian interpolation curve was used to approximate the integrated data set. A single parameter is determined by which the user can control the behavior of the interpolation function, i.e. the amount of overshoot and undershoot. Furthermore, it is shown how the algorithm can be extended to multidimensional grids. The algorithm was compared to commonly used gridding-algorithms using linear and cubic interpolation functions. It is shown that such interpolation functions may overestimate or underestimate the source data by about 10-20%, while the new algorithm can be tuned to

  1. Fourier analysis and stochastic processes

    CERN Document Server

    Brémaud, Pierre

    2014-01-01

    This work is unique as it provides a uniform treatment of the Fourier theories of functions (Fourier transforms and series, z-transforms), finite measures (characteristic functions, convergence in distribution), and stochastic processes (including arma series and point processes). It emphasises the links between these three themes. The chapter on the Fourier theory of point processes and signals structured by point processes is a novel addition to the literature on Fourier analysis of stochastic processes. It also connects the theory with recent lines of research such as biological spike signals and ultrawide-band communications. Although the treatment is mathematically rigorous, the convivial style makes the book accessible to a large audience. In particular, it will be interesting to anyone working in electrical engineering and communications, biology (point process signals) and econometrics (arma models). A careful review of the prerequisites (integration and probability theory in the appendix, Hilbert spa...

  2. Quadrature formulas for Fourier coefficients

    KAUST Repository

    Bojanov, Borislav; Petrova, Guergana

    2009-01-01

    We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node

  3. Symplectic geometry and Fourier analysis

    CERN Document Server

    Wallach, Nolan R

    2018-01-01

    Suitable for graduate students in mathematics, this monograph covers differential and symplectic geometry, homogeneous symplectic manifolds, Fourier analysis, metaplectic representation, quantization, Kirillov theory. Includes Appendix on Quantum Mechanics by Robert Hermann. 1977 edition.

  4. Fourier transform nuclear magnetic resonance

    International Nuclear Information System (INIS)

    Geick, R.

    1981-01-01

    This review starts with the basic principles of resonance phenomena in physical systems. Especially, the connection is shown between the properties of these systems and Fourier transforms. Next, we discuss the principles of nuclear magnetic resonance. Starting from the general properties of physical systems showing resonance phenomena and from the special properties of nuclear spin systems, the main part of this paper reviews pulse and Fourier methods in nuclear magnetic resonance. Among pulse methods, an introduction will be given to spin echoes, and, apart from the principle of Fourier transform nuclear magnetic resonance, an introduction to the technical problems of this method, e.g. resolution in the frequency domain, aliasing, phase and intensity errors, stationary state of the spin systems for repetitive measurements, proton decoupling, and application of Fourier methods to systems in a nonequilibrium state. The last section is devoted to special applications of Fourier methods and recent developments, e.g. measurement of relaxation times, solvent peak suppression, 'rapid scan'-method, methods for suppressing the effects of dipolar coupling in solids, two-dimensional Fourier transform nuclear magnetic resonance, and spin mapping or zeugmatography. (author)

  5. Advantage of Fast Fourier Interpolation for laser modeling

    International Nuclear Information System (INIS)

    Epatko, I.V.; Serov, R.V.

    2006-01-01

    The abilities of a new algorithm: the 2-dimensional Fast Fourier Interpolation (FFI) with magnification factor (zoom) 2 n whose purpose is to improve the spatial resolution when necessary, are analyzed in details. FFI procedure is useful when diaphragm/aperture size is less than half of the current simulation scale. The computation noise due to FFI procedure is less than 10 -6 . The additional time for FFI is approximately equal to one Fast Fourier Transform execution time. For some applications using FFI procedure, the execution time decreases by a 10 4 factor compared with other laser simulation codes. (authors)

  6. Spectrums Transform Operators in Bases of Fourier and Walsh Functions

    Directory of Open Access Journals (Sweden)

    V. V. Syuzev

    2017-01-01

    Full Text Available The problems of synthesis of the efficient algorithms for digital processing of discrete signals require transforming the signal spectra from one basis system into other. The rational solution to this problem is to construct the Fourier kernel, which is a spectrum of some basis functions, according to the system of functions of the other basis. However, Fourier kernel properties are not equally studied and described for all basis systems of practical importance. The article sets a task and presents an original way to solve the problem of mutual transformation of trigonometric Fourier spectrum into Walsh spectrum of different basis systems.The relevance of this theoretical and applied problem is stipulated, on the one hand, by the prevalence of trigonometric Fourier basis for harmonic representation of digital signals, and, on the other hand, by the fact that Walsh basis systems allow us to have efficient algorithms to simulate signals. The problem solution is achieved through building the Fourier kernel of a special structure that allows us to establish independent groups of Fourier and Walsh spectrum coefficients for further reducing the computational complexity of the transform algorithms.The article analyzes the properties of the system of trigonometric Fourier functions and shows its completeness. Considers the Walsh function basis systems in three versions, namely those of Hadamard, Paley, and Hartmut giving different ordering and analytical descriptions of the functions that make up the basis. Proves a completeness of these systems.Sequentially, for each of the three Walsh systems the analytical curves for the Fourier kernel components are obtained, and Fourier kernel themselves are built with binary rational number of samples of basis functions. The kernels are presented in matrix form and, as an example, recorded for a particular value of the discrete interval of N, equal to 8. The analysis spectral coefficients of the Fourier kernel

  7. Pipeline Analyzer using the Fractional Fourier Transform for Engine Control and Satellites Data

    Directory of Open Access Journals (Sweden)

    Darian M. Onchiș

    2011-09-01

    Full Text Available The aim of this paper is to present an algorithm for computing the fractional Fourier transform integrated into the pipeline of processing multi-variate and distributed data recorded by the engine control unit (ECU of a car and its satellites. The role of this transform is vital in establishing a time-variant filter and therefore it must be computed in a fast way. But for large scale time series, the application of the discrete fractional Fourier transform involves the computations of a large number of Hermite polynomials of increasingly order. The parallel algorithm presented will optimally compute the discrete Fourier-type transform for any given angle.

  8. Resolution optimization with irregularly sampled Fourier data

    International Nuclear Information System (INIS)

    Ferrara, Matthew; Parker, Jason T; Cheney, Margaret

    2013-01-01

    Image acquisition systems such as synthetic aperture radar (SAR) and magnetic resonance imaging often measure irregularly spaced Fourier samples of the desired image. In this paper we show the relationship between sample locations, their associated backprojection weights, and image resolution as characterized by the resulting point spread function (PSF). Two new methods for computing data weights, based on different optimization criteria, are proposed. The first method, which solves a maximal-eigenvector problem, optimizes a PSF-derived resolution metric which is shown to be equivalent to the volume of the Cramer–Rao (positional) error ellipsoid in the uniform-weight case. The second approach utilizes as its performance metric the Frobenius error between the PSF operator and the ideal delta function, and is an extension of a previously reported algorithm. Our proposed extension appropriately regularizes the weight estimates in the presence of noisy data and eliminates the superfluous issue of image discretization in the choice of data weights. The Frobenius-error approach results in a Tikhonov-regularized inverse problem whose Tikhonov weights are dependent on the locations of the Fourier data as well as the noise variance. The two new methods are compared against several state-of-the-art weighting strategies for synthetic multistatic point-scatterer data, as well as an ‘interrupted SAR’ dataset representative of in-band interference commonly encountered in very high frequency radar applications. (paper)

  9. Novel Polynomial Basis with Fast Fourier Transform and Its Application to Reed-Solomon Erasure Codes

    KAUST Repository

    Lin, Sian-Jheng

    2016-09-13

    In this paper, we present a fast Fourier transform (FFT) algorithm over extension binary fields, where the polynomial is represented in a non-standard basis. The proposed Fourier-like transform requires O(h lg(h)) field operations, where h is the number of evaluation points. Based on the proposed Fourier-like algorithm, we then develop the encoding/ decoding algorithms for (n = 2m; k) Reed-Solomon erasure codes. The proposed encoding/erasure decoding algorithm requires O(n lg(n)), in both additive and multiplicative complexities. As the complexity leading factor is small, the proposed algorithms are advantageous in practical applications. Finally, the approaches to convert the basis between the monomial basis and the new basis are proposed.

  10. General Correlation Theorem for Trinion Fourier Transform

    OpenAIRE

    Bahri, Mawardi

    2017-01-01

    - The trinion Fourier transform is an extension of the Fourier transform in the trinion numbers setting. In this work we derive the correlation theorem for the trinion Fourier transform by using the relation between trinion convolution and correlation definitions in the trinion Fourier transform domains.

  11. Fourier Series, the DFT and Shape Modelling

    DEFF Research Database (Denmark)

    Skoglund, Karl

    2004-01-01

    This report provides an introduction to Fourier series, the discrete Fourier transform, complex geometry and Fourier descriptors for shape analysis. The content is aimed at undergraduate and graduate students who wish to learn about Fourier analysis in general, as well as its application to shape...

  12. Fourier series, Fourier transform and their applications to mathematical physics

    CERN Document Server

    Serov, Valery

    2017-01-01

    This text serves as an introduction to the modern theory of analysis and differential equations with applications in mathematical physics and engineering sciences.  Having outgrown from a series of half-semester courses given at University of Oulu, this book consists of four self-contained parts. The first part, Fourier Series and the Discrete Fourier Transform, is devoted to the classical one-dimensional trigonometric Fourier series with some applications to PDEs and signal processing.  The second part, Fourier Transform and Distributions, is concerned with distribution theory of L. Schwartz and its applications to the Schrödinger and magnetic Schrödinger operations.  The third part, Operator Theory and Integral Equations, is devoted mostly to the self-adjoint but unbounded operators in Hilbert spaces and their applications to integral equations in such spaces. The fourth and final part, Introduction to Partial Differential Equations, serves as an introduction to modern methods for classical theory o...

  13. Fourier series and orthogonal polynomials

    CERN Document Server

    Jackson, Dunham

    2004-01-01

    This text for undergraduate and graduate students illustrates the fundamental simplicity of the properties of orthogonal functions and their developments in related series. Starting with a definition and explanation of the elements of Fourier series, the text follows with examinations of Legendre polynomials and Bessel functions. Boundary value problems consider Fourier series in conjunction with Laplace's equation in an infinite strip and in a rectangle, with a vibrating string, in three dimensions, in a sphere, and in other circumstances. An overview of Pearson frequency functions is followe

  14. Iterative wave-front reconstruction in the Fourier domain.

    Science.gov (United States)

    Bond, Charlotte Z; Correia, Carlos M; Sauvage, Jean-François; Neichel, Benoit; Fusco, Thierry

    2017-05-15

    The use of Fourier methods in wave-front reconstruction can significantly reduce the computation time for large telescopes with a high number of degrees of freedom. However, Fourier algorithms for discrete data require a rectangular data set which conform to specific boundary requirements, whereas wave-front sensor data is typically defined over a circular domain (the telescope pupil). Here we present an iterative Gerchberg routine modified for the purposes of discrete wave-front reconstruction which adapts the measurement data (wave-front sensor slopes) for Fourier analysis, fulfilling the requirements of the fast Fourier transform (FFT) and providing accurate reconstruction. The routine is used in the adaptation step only and can be coupled to any other Wiener-like or least-squares method. We compare simulations using this method with previous Fourier methods and show an increase in performance in terms of Strehl ratio and a reduction in noise propagation for a 40×40 SPHERE-like adaptive optics system. For closed loop operation with minimal iterations the Gerchberg method provides an improvement in Strehl, from 95.4% to 96.9% in K-band. This corresponds to ~ 40 nm improvement in rms, and avoids the high spatial frequency errors present in other methods, providing an increase in contrast towards the edge of the correctable band.

  15. Fourier transform based scalable image quality measure.

    Science.gov (United States)

    Narwaria, Manish; Lin, Weisi; McLoughlin, Ian; Emmanuel, Sabu; Chia, Liang-Tien

    2012-08-01

    We present a new image quality assessment (IQA) algorithm based on the phase and magnitude of the 2D (twodimensional) Discrete Fourier Transform (DFT). The basic idea is to compare the phase and magnitude of the reference and distorted images to compute the quality score. However, it is well known that the Human Visual Systems (HVSs) sensitivity to different frequency components is not the same. We accommodate this fact via a simple yet effective strategy of nonuniform binning of the frequency components. This process also leads to reduced space representation of the image thereby enabling the reduced-reference (RR) prospects of the proposed scheme. We employ linear regression to integrate the effects of the changes in phase and magnitude. In this way, the required weights are determined via proper training and hence more convincing and effective. Lastly, using the fact that phase usually conveys more information than magnitude, we use only the phase for RR quality assessment. This provides the crucial advantage of further reduction in the required amount of reference image information. The proposed method is therefore further scalable for RR scenarios. We report extensive experimental results using a total of 9 publicly available databases: 7 image (with a total of 3832 distorted images with diverse distortions) and 2 video databases (totally 228 distorted videos). These show that the proposed method is overall better than several of the existing fullreference (FR) algorithms and two RR algorithms. Additionally, there is a graceful degradation in prediction performance as the amount of reference image information is reduced thereby confirming its scalability prospects. To enable comparisons and future study, a Matlab implementation of the proposed algorithm is available at http://www.ntu.edu.sg/home/wslin/reduced_phase.rar.

  16. FOURIER SERIES MODELS THROUGH TRANSFORMATION

    African Journals Online (AJOL)

    DEPT

    monthly temperature data (1996 – 2005) collected from the National Root ... KEY WORDS: Fourier series, square transformation, multiplicative model, ... fluctuations or movements are often periodic(Ekpeyong,2005). .... significant trend or not, if the trend is not significant, the grand mean may be used as an estimate of trend.

  17. 3-D Bidirectional Propagation Algorithm Based on Fourier Series

    Czech Academy of Sciences Publication Activity Database

    Čtyroký, Jiří

    2012-01-01

    Roč. 30, č. 23 (2012), s. 3699-30708 ISSN 0733-8724 R&D Projects: GA ČR(CZ) GAP205/10/0046; GA MŠk OC09061 Institutional support: RVO:67985882 Keywords : optics * gratings Subject RIV: JA - Electronics ; Optoelectronics, Electrical Engineering Impact factor: 2.555, year: 2012

  18. Data-parallel tomographic reconstruction : A comparison of filtered backprojection and direct Fourier reconstruction

    NARCIS (Netherlands)

    Roerdink, J.B.T.M.; Westenberg, M.A

    1998-01-01

    We consider the parallelization of two standard 2D reconstruction algorithms, filtered backprojection and direct Fourier reconstruction, using the data-parallel programming style. The algorithms are implemented on a Connection Machine CM-5 with 16 processors and a peak performance of 2 Gflop/s.

  19. Fourier-based reconstruction via alternating direction total variation minimization in linear scan CT

    International Nuclear Information System (INIS)

    Cai, Ailong; Wang, Linyuan; Yan, Bin; Zhang, Hanming; Li, Lei; Xi, Xiaoqi; Li, Jianxin

    2015-01-01

    In this study, we consider a novel form of computed tomography (CT), that is, linear scan CT (LCT), which applies a straight line trajectory. Furthermore, an iterative algorithm is proposed for pseudo-polar Fourier reconstruction through total variation minimization (PPF-TVM). Considering that the sampled Fourier data are distributed in pseudo-polar coordinates, the reconstruction model minimizes the TV of the image subject to the constraint that the estimated 2D Fourier data for the image are consistent with the 1D Fourier transform of the projection data. PPF-TVM employs the alternating direction method (ADM) to develop a robust and efficient iteration scheme, which ensures stable convergence provided that appropriate parameter values are given. In the ADM scheme, PPF-TVM applies the pseudo-polar fast Fourier transform and its adjoint to iterate back and forth between the image and frequency domains. Thus, there is no interpolation in the Fourier domain, which makes the algorithm both fast and accurate. PPF-TVM is particularly useful for limited angle reconstruction in LCT and it appears to be robust against artifacts. The PPF-TVM algorithm was tested with the FORBILD head phantom and real data in comparisons with state-of-the-art algorithms. Simulation studies and real data verification suggest that PPF-TVM can reconstruct higher accuracy images with lower time consumption

  20. From Fourier analysis to wavelets

    CERN Document Server

    Gomes, Jonas

    2015-01-01

    This text introduces the basic concepts of function spaces and operators, both from the continuous and discrete viewpoints.  Fourier and Window Fourier Transforms are introduced and used as a guide to arrive at the concept of Wavelet transform.  The fundamental aspects of multiresolution representation, and its importance to function discretization and to the construction of wavelets is also discussed. Emphasis is given on ideas and intuition, avoiding the heavy computations which are usually involved in the study of wavelets.  Readers should have a basic knowledge of linear algebra, calculus, and some familiarity with complex analysis.  Basic knowledge of signal and image processing is desirable. This text originated from a set of notes in Portuguese that the authors wrote for a wavelet course on the Brazilian Mathematical Colloquium in 1997 at IMPA, Rio de Janeiro.

  1. Compact Microwave Fourier Spectrum Analyzer

    Science.gov (United States)

    Savchenkov, Anatoliy; Matsko, Andrey; Strekalov, Dmitry

    2009-01-01

    A compact photonic microwave Fourier spectrum analyzer [a Fourier-transform microwave spectrometer, (FTMWS)] with no moving parts has been proposed for use in remote sensing of weak, natural microwave emissions from the surfaces and atmospheres of planets to enable remote analysis and determination of chemical composition and abundances of critical molecular constituents in space. The instrument is based on a Bessel beam (light modes with non-zero angular momenta) fiber-optic elements. It features low power consumption, low mass, and high resolution, without a need for any cryogenics, beyond what is achievable by the current state-of-the-art in space instruments. The instrument can also be used in a wide-band scatterometer mode in active radar systems.

  2. Uncertainty Principles and Fourier Analysis

    Indian Academy of Sciences (India)

    analysis on the part of the reader. Those who are not fa- miliar with Fourier analysis are encouraged to look up Box. 1 along with [3]. (A) Heisenberg's inequality: Let us measure concentration in terms of standard deviation i.e. for a square integrable func-. 00 tion defined on 1R and normalized so that J If(x)12d,x = 1,. -00. 00.

  3. Reproducibility of F18-FDG PET radiomic features for different cervical tumor segmentation methods, gray-level discretization, and reconstruction algorithms.

    Science.gov (United States)

    Altazi, Baderaldeen A; Zhang, Geoffrey G; Fernandez, Daniel C; Montejo, Michael E; Hunt, Dylan; Werner, Joan; Biagioli, Matthew C; Moros, Eduardo G

    2017-11-01

    Site-specific investigations of the role of radiomics in cancer diagnosis and therapy are emerging. We evaluated the reproducibility of radiomic features extracted from 18 Flourine-fluorodeoxyglucose ( 18 F-FDG) PET images for three parameters: manual versus computer-aided segmentation methods, gray-level discretization, and PET image reconstruction algorithms. Our cohort consisted of pretreatment PET/CT scans from 88 cervical cancer patients. Two board-certified radiation oncologists manually segmented the metabolic tumor volume (MTV 1 and MTV 2 ) for each patient. For comparison, we used a graphical-based method to generate semiautomated segmented volumes (GBSV). To address any perturbations in radiomic feature values, we down-sampled the tumor volumes into three gray-levels: 32, 64, and 128 from the original gray-level of 256. Finally, we analyzed the effect on radiomic features on PET images of eight patients due to four PET 3D-reconstruction algorithms: maximum likelihood-ordered subset expectation maximization (OSEM) iterative reconstruction (IR) method, fourier rebinning-ML-OSEM (FOREIR), FORE-filtered back projection (FOREFBP), and 3D-Reprojection (3DRP) analytical method. We extracted 79 features from all segmentation method, gray-levels of down-sampled volumes, and PET reconstruction algorithms. The features were extracted using gray-level co-occurrence matrices (GLCM), gray-level size zone matrices (GLSZM), gray-level run-length matrices (GLRLM), neighborhood gray-tone difference matrices (NGTDM), shape-based features (SF), and intensity histogram features (IHF). We computed the Dice coefficient between each MTV and GBSV to measure segmentation accuracy. Coefficient values close to one indicate high agreement, and values close to zero indicate low agreement. We evaluated the effect on radiomic features by calculating the mean percentage differences (d¯) between feature values measured from each pair of parameter elements (i.e. segmentation methods: MTV

  4. An introduction to Fourier series and integrals

    CERN Document Server

    Seeley, Robert T

    2006-01-01

    This compact guide emphasizes the relationship between physics and mathematics, introducing Fourier series in the way that Fourier himself used them: as solutions of the heat equation in a disk. 1966 edition.

  5. Mapping agroecological zones and time lag in vegetation growth by means of Fourier analysis of time series of NDVI images

    Science.gov (United States)

    Menenti, M.; Azzali, S.; Verhoef, W.; Van Swol, R.

    1993-01-01

    Examples are presented of applications of a fast Fourier transform algorithm to analyze time series of images of Normalized Difference Vegetation Index values. The results obtained for a case study on Zambia indicated that differences in vegetation development among map units of an existing agroclimatic map were not significant, while reliable differences were observed among the map units obtained using the Fourier analysis.

  6. Properties of the distributional finite Fourier transform

    OpenAIRE

    Carmichael, Richard D.

    2016-01-01

    The analytic functions in tubes which obtain the distributional finite Fourier transform as boundary value are shown to have a strong boundedness property and to be recoverable as a Fourier-Laplace transform, a distributional finite Fourier transform, and as a Cauchy integral of a distribution associated with the boundary value.

  7. Fourier techniques in X-ray timing

    NARCIS (Netherlands)

    van der Klis, M.

    1988-01-01

    Basic principles of Fourier techniques often used in X-ray time series analysis are reviewed. The relation between the discrete Fourier transform and the continuous Fourier transform is discussed to introduce the concepts of windowing and aliasing. The relation is derived between the power spectrum

  8. Precise and fast spatial-frequency analysis using the iterative local Fourier transform.

    Science.gov (United States)

    Lee, Sukmock; Choi, Heejoo; Kim, Dae Wook

    2016-09-19

    The use of the discrete Fourier transform has decreased since the introduction of the fast Fourier transform (fFT), which is a numerically efficient computing process. This paper presents the iterative local Fourier transform (ilFT), a set of new processing algorithms that iteratively apply the discrete Fourier transform within a local and optimal frequency domain. The new technique achieves 210 times higher frequency resolution than the fFT within a comparable computation time. The method's superb computing efficiency, high resolution, spectrum zoom-in capability, and overall performance are evaluated and compared to other advanced high-resolution Fourier transform techniques, such as the fFT combined with several fitting methods. The effectiveness of the ilFT is demonstrated through the data analysis of a set of Talbot self-images (1280 × 1024 pixels) obtained with an experimental setup using grating in a diverging beam produced by a coherent point source.

  9. Fourier descriptor classification of differential eddy current probe impedance plane trajectories

    International Nuclear Information System (INIS)

    Lord, W.; Satish, S.R.

    1984-01-01

    This chapter describes the use of a parametric model for representing the two-dimensional eddy current impedance plane trajectory. The main advantage of this approach is the ability to reconstruct the trajectory from the model coefficients. Fourier descriptors are used to facilitate defect classification. The Fourier descriptors are obtained by expanding the complex contour function in a Fourier series. Functions of Fourier coefficients which are invariant under transformation of the trajectory are derived and incorporated into a feature vector. Defect classification is obtained by using the K-Means algorithm to cluster the feature vectors. It is demonstrated that the Fourier descriptor approach represents a powerful tool which have several advantages over nonparametric approaches including its insensitivity to drift in the eddy current instrument as well as variations in the probe speed

  10. On the accurate fast evaluation of finite Fourier integrals using cubic splines

    International Nuclear Information System (INIS)

    Morishima, N.

    1993-01-01

    Finite Fourier integrals based on a cubic-splines fit to equidistant data are shown to be evaluated fast and accurately. Good performance, especially on computational speed, is achieved by the optimization of the spline fit and the internal use of the fast Fourier transform (FFT) algorithm for complex data. The present procedure provides high accuracy with much shorter CPU time than a trapezoidal FFT. (author)

  11. New algorithms for parallel MRI

    International Nuclear Information System (INIS)

    Anzengruber, S; Ramlau, R; Bauer, F; Leitao, A

    2008-01-01

    Magnetic Resonance Imaging with parallel data acquisition requires algorithms for reconstructing the patient's image from a small number of measured lines of the Fourier domain (k-space). In contrast to well-known algorithms like SENSE and GRAPPA and its flavors we consider the problem as a non-linear inverse problem. However, in order to avoid cost intensive derivatives we will use Landweber-Kaczmarz iteration and in order to improve the overall results some additional sparsity constraints.

  12. Fourier acceleration in lattice gauge theories. I. Landau gauge fixing

    International Nuclear Information System (INIS)

    Davies, C.T.H.; Batrouni, G.G.; Katz, G.R.; Kronfeld, A.S.; Lepage, G.P.; Wilson, K.G.; Rossi, P.; Svetitsky, B.

    1988-01-01

    Fourier acceleration is a useful technique which can be applied to many different numerical algorithms in order to alleviate the problem of critical slowing down. Here we describe its application to an optimization problem in the simulation of lattice gauge theories, that of gauge fixing a configuration of link fields to the Landau gauge (partial/sub μ/A/sup μ/ = 0). We find that a steepest-descents method of gauge fixing link fields at β = 5.8 on an 8 4 lattice can be made 5 times faster using Fourier acceleration. This factor will grow as the volume of the lattice is increased. We also discuss other gauges that are useful to lattice-gauge-theory simulations, among them one that is a combination of the axial and Landau gauges. This seems to be the optimal gauge to impose for the Fourier acceleration of two other important algorithms, the inversion of the fermion matrix and the updating of gauge field configurations

  13. Improved Fourier-transform profilometry

    International Nuclear Information System (INIS)

    Mao Xianfu; Chen Wenjing; Su Xianyu

    2007-01-01

    An improved optical geometry of the projected-fringe profilometry technique, in which the exit pupil of the projecting lens and the entrance pupil of the imaging lens are neither at the same height above the reference plane nor coplanar, is discussed and used in Fourier-transform profilometry. Furthermore, an improved fringe-pattern description and phase-height mapping formula based on the improved geometrical generalization is deduced. Employing the new optical geometry, it is easier for us to obtain the full-field fringe by moving either the projector or the imaging device. Therefore the new method offers a flexible way to obtain reliable height distribution of a measured object

  14. Fourier-transform optical microsystems

    Science.gov (United States)

    Collins, S. D.; Smith, R. L.; Gonzalez, C.; Stewart, K. P.; Hagopian, J. G.; Sirota, J. M.

    1999-01-01

    The design, fabrication, and initial characterization of a miniature single-pass Fourier-transform spectrometer (FTS) that has an optical bench that measures 1 cm x 5 cm x 10 cm is presented. The FTS is predicated on the classic Michelson interferometer design with a moving mirror. Precision translation of the mirror is accomplished by microfabrication of dovetailed bearing surfaces along single-crystal planes in silicon. Although it is miniaturized, the FTS maintains a relatively high spectral resolution, 0.1 cm-1, with adequate optical throughput.

  15. Fourier analysis and its applications

    CERN Document Server

    Folland, Gerald B

    2009-01-01

    This book presents the theory and applications of Fourier series and integrals, eigenfunction expansions, and related topics, on a level suitable for advanced undergraduates. It includes material on Bessel functions, orthogonal polynomials, and Laplace transforms, and it concludes with chapters on generalized functions and Green's functions for ordinary and partial differential equations. The book deals almost exclusively with aspects of these subjects that are useful in physics and engineering, and includes a wide variety of applications. On the theoretical side, it uses ideas from modern ana

  16. Fourier Transform Methods. Chapter 4

    Science.gov (United States)

    Kaplan, Simon G.; Quijada, Manuel A.

    2015-01-01

    This chapter describes the use of Fourier transform spectrometers (FTS) for accurate spectrophotometry over a wide spectral range. After a brief exposition of the basic concepts of FTS operation, we discuss instrument designs and their advantages and disadvantages relative to dispersive spectrometers. We then examine how common sources of error in spectrophotometry manifest themselves when using an FTS and ways to reduce the magnitude of these errors. Examples are given of applications to both basic and derived spectrophotometric quantities. Finally, we give recommendations for choosing the right instrument for a specific application, and how to ensure the accuracy of the measurement results..

  17. Fourier Spectroscopy: A Bayesian Way

    Directory of Open Access Journals (Sweden)

    Stefan Schmuck

    2017-01-01

    Full Text Available The concepts of standard analysis techniques applied in the field of Fourier spectroscopy treat fundamental aspects insufficiently. For example, the spectra to be inferred are influenced by the noise contribution to the interferometric data, by nonprobed spatial domains which are linked to Fourier coefficients above a certain order, by the spectral limits which are in general not given by the Nyquist assumptions, and by additional parameters of the problem at hand like the zero-path difference. To consider these fundamentals, a probabilistic approach based on Bayes’ theorem is introduced which exploits multivariate normal distributions. For the example application, we model the spectra by the Gaussian process of a Brownian bridge stated by a prior covariance. The spectra themselves are represented by a number of parameters which map linearly to the data domain. The posterior for these linear parameters is analytically obtained, and the marginalisation over these parameters is trivial. This allows the straightforward investigation of the posterior for the involved nonlinear parameters, like the zero-path difference location and the spectral limits, and hyperparameters, like the scaling of the Gaussian process. With respect to the linear problem, this can be interpreted as an implementation of Ockham’s razor principle.

  18. Pointwise convergence of Fourier series

    CERN Document Server

    Arias de Reyna, Juan

    2002-01-01

    This book contains a detailed exposition of Carleson-Hunt theorem following the proof of Carleson: to this day this is the only one giving better bounds. It points out the motivation of every step in the proof. Thus the Carleson-Hunt theorem becomes accessible to any analyst.The book also contains the first detailed exposition of the fine results of Hunt, Sjölin, Soria, etc on the convergence of Fourier Series. Its final chapters present original material. With both Fefferman's proof and the recent one of Lacey and Thiele in print, it becomes more important than ever to understand and compare these two related proofs with that of Carleson and Hunt. These alternative proofs do not yield all the results of the Carleson-Hunt proof. The intention of this monograph is to make Carleson's proof accessible to a wider audience, and to explain its consequences for the pointwise convergence of Fourier series for functions in spaces near $äcal Lü^1$, filling a well-known gap in the literature.

  19. Discrete Fourier Transform Analysis in a Complex Vector Space

    Science.gov (United States)

    Dean, Bruce H.

    2009-01-01

    Alternative computational strategies for the Discrete Fourier Transform (DFT) have been developed using analysis of geometric manifolds. This approach provides a general framework for performing DFT calculations, and suggests a more efficient implementation of the DFT for applications using iterative transform methods, particularly phase retrieval. The DFT can thus be implemented using fewer operations when compared to the usual DFT counterpart. The software decreases the run time of the DFT in certain applications such as phase retrieval that iteratively call the DFT function. The algorithm exploits a special computational approach based on analysis of the DFT as a transformation in a complex vector space. As such, this approach has the potential to realize a DFT computation that approaches N operations versus Nlog(N) operations for the equivalent Fast Fourier Transform (FFT) calculation.

  20. Fourier acceleration of iterative processes in disordered systems

    International Nuclear Information System (INIS)

    Batrouni, G.G.; Hansen, A.

    1988-01-01

    Technical details are given on how to use Fourier acceleration with iterative processes such as relaxation and conjugate gradient methods. These methods are often used to solve large linear systems of equations, but become hopelessly slow very rapidly as the size of the set of equations to be solved increases. Fourier acceleration is a method designed to alleviate these problems and result in a very fast algorithm. The method is explained for the Jacobi relaxation and conjugate gradient methods and is applied to two models: the random resistor network and the random central-force network. In the first model, acceleration works very well; in the second, little is gained. We discuss reasons for this. We also include a discussion of stopping criteria

  1. High resolution integral holography using Fourier ptychographic approach.

    Science.gov (United States)

    Li, Zhaohui; Zhang, Jianqi; Wang, Xiaorui; Liu, Delian

    2014-12-29

    An innovative approach is proposed for calculating high resolution computer generated integral holograms by using the Fourier Ptychographic (FP) algorithm. The approach initializes a high resolution complex hologram with a random guess, and then stitches together low resolution multi-view images, synthesized from the elemental images captured by integral imaging (II), to recover the high resolution hologram through an iterative retrieval with FP constrains. This paper begins with an analysis of the principle of hologram synthesis from multi-projections, followed by an accurate determination of the constrains required in the Fourier ptychographic integral-holography (FPIH). Next, the procedure of the approach is described in detail. Finally, optical reconstructions are performed and the results are demonstrated. Theoretical analysis and experiments show that our proposed approach can reconstruct 3D scenes with high resolution.

  2. Eliminating the zero spectrum in Fourier transform profilometry using empirical mode decomposition.

    Science.gov (United States)

    Li, Sikun; Su, Xianyu; Chen, Wenjing; Xiang, Liqun

    2009-05-01

    Empirical mode decomposition is introduced into Fourier transform profilometry to extract the zero spectrum included in the deformed fringe pattern without the need for capturing two fringe patterns with pi phase difference. The fringe pattern is subsequently demodulated using a standard Fourier transform profilometry algorithm. With this method, the deformed fringe pattern is adaptively decomposed into a finite number of intrinsic mode functions that vary from high frequency to low frequency by means of an algorithm referred to as a sifting process. Then the zero spectrum is separated from the high-frequency components effectively. Experiments validate the feasibility of this method.

  3. Accelerating the Non-equispaced Fast Fourier Transform on Commodity Graphics Hardware

    DEFF Research Database (Denmark)

    Sørensen, Thomas Sangild; Schaeffter, Tobias; Noe, Karsten Østergaard

    2008-01-01

    We present a fast parallel algorithm to compute the Non-equispaced fast Fourier transform on commodity graphics hardware (the GPU). We focus particularly on a novel implementation of the convolution step in the transform, which was previously its most time consuming part. We describe the performa......We present a fast parallel algorithm to compute the Non-equispaced fast Fourier transform on commodity graphics hardware (the GPU). We focus particularly on a novel implementation of the convolution step in the transform, which was previously its most time consuming part. We describe...

  4. Applications of Fourier transforms to generalized functions

    CERN Document Server

    Rahman, M

    2011-01-01

    This book explains how Fourier transforms can be applied to generalized functions. The generalized function is one of the important branches of mathematics and is applicable in many practical fields. Its applications to the theory of distribution and signal processing are especially important. The Fourier transform is a mathematical procedure that can be thought of as transforming a function from its time domain to the frequency domain.The book contains six chapters and three appendices. Chapter 1 deals with preliminary remarks on Fourier series from a general point of view and also contains an introduction to the first generalized function. Chapter 2 is concerned with the generalized functions and their Fourier transforms. Chapter 3 contains the Fourier transforms of particular generalized functions. The author has stated and proved 18 formulas dealing with the Fourier transforms of generalized functions, and demonstrated some important problems of practical interest. Chapter 4 deals with the asymptotic esti...

  5. Handbook of Fourier analysis & its applications

    CERN Document Server

    Marks, Robert J

    2009-01-01

    Fourier analysis has many scientific applications - in physics, number theory, combinatorics, signal processing, probability theory, statistics, option pricing, cryptography, acoustics, oceanography, optics and diffraction, geometry, and other areas. In signal processing and related fields, Fourier analysis is typically thought of as decomposing a signal into its component frequencies and their amplitudes. This practical, applications-based professional handbook comprehensively covers the theory and applications of Fourier Analysis, spanning topics from engineering mathematics, signal process

  6. Fourier transform n.m.r. spectroscopy

    International Nuclear Information System (INIS)

    Shaw, D.

    1976-01-01

    This book is orientated to techniques rather than applications. The basic theory of n.m.r. is dealt with in a unified approach to the Fourier theory. The middle section of the book concentrates on the practical aspects of Fourier n.m.r., both instrumental and experimental. The final chapters briefly cover general application of n.m.r., but concentrate strongly on those areas where Fourier n.m.r. can give information which is not available by conventional techniques

  7. A simple approach to Fourier aliasing

    International Nuclear Information System (INIS)

    Foadi, James

    2007-01-01

    In the context of discrete Fourier transforms the idea of aliasing as due to approximation errors in the integral defining Fourier coefficients is introduced and explained. This has the positive pedagogical effect of getting to the heart of sampling and the discrete Fourier transform without having to delve into effective, but otherwise long and structured, introductions to the topic, commonly met in advanced, specialized books

  8. Tunable fractional-order Fourier transformer

    International Nuclear Information System (INIS)

    Malyutin, A A

    2006-01-01

    A fractional two-dimensional Fourier transformer whose orders are tuned by means of optical quadrupoles is described. It is shown that in the optical scheme considered, the Fourier-transform order a element of [0,1] in one of the mutually orthogonal planes corresponds to the transform order (2-a) in another plane, i.e., to inversion and inverse Fourier transform of the order a. (laser modes and beams)

  9. Fourier transform n. m. r. spectroscopy

    Energy Technology Data Exchange (ETDEWEB)

    Shaw, D [Varian Ltd., Walton (UK)

    1976-01-01

    This book is orientated to techniques rather than applications. The basic theory of n.m.r. is dealt with in a unified approach to the Fourier theory. The middle section of the book concentrates on the practical aspects of Fourier n.m.r., both instrumental and experimental. The final chapters briefly cover general application of n.m.r., but concentrate strongly on those areas where Fourier n.m.r. can give information which is not available by conventional techniques.

  10. Metasurface Enabled Wide-Angle Fourier Lens.

    Science.gov (United States)

    Liu, Wenwei; Li, Zhancheng; Cheng, Hua; Tang, Chengchun; Li, Junjie; Zhang, Shuang; Chen, Shuqi; Tian, Jianguo

    2018-06-01

    Fourier optics, the principle of using Fourier transformation to understand the functionalities of optical elements, lies at the heart of modern optics, and it has been widely applied to optical information processing, imaging, holography, etc. While a simple thin lens is capable of resolving Fourier components of an arbitrary optical wavefront, its operation is limited to near normal light incidence, i.e., the paraxial approximation, which puts a severe constraint on the resolvable Fourier domain. As a result, high-order Fourier components are lost, resulting in extinction of high-resolution information of an image. Other high numerical aperture Fourier lenses usually suffer from the bulky size and costly designs. Here, a dielectric metasurface consisting of high-aspect-ratio silicon waveguide array is demonstrated experimentally, which is capable of performing 1D Fourier transform for a large incident angle range and a broad operating bandwidth. Thus, the device significantly expands the operational Fourier space, benefitting from the large numerical aperture and negligible angular dispersion at large incident angles. The Fourier metasurface will not only facilitate efficient manipulation of spatial spectrum of free-space optical wavefront, but also be readily integrated into micro-optical platforms due to its compact size. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  11. Array architectures for iterative algorithms

    Science.gov (United States)

    Jagadish, Hosagrahar V.; Rao, Sailesh K.; Kailath, Thomas

    1987-01-01

    Regular mesh-connected arrays are shown to be isomorphic to a class of so-called regular iterative algorithms. For a wide variety of problems it is shown how to obtain appropriate iterative algorithms and then how to translate these algorithms into arrays in a systematic fashion. Several 'systolic' arrays presented in the literature are shown to be specific cases of the variety of architectures that can be derived by the techniques presented here. These include arrays for Fourier Transform, Matrix Multiplication, and Sorting.

  12. Algorithming the Algorithm

    DEFF Research Database (Denmark)

    Mahnke, Martina; Uprichard, Emma

    2014-01-01

    Imagine sailing across the ocean. The sun is shining, vastness all around you. And suddenly [BOOM] you’ve hit an invisible wall. Welcome to the Truman Show! Ever since Eli Pariser published his thoughts on a potential filter bubble, this movie scenario seems to have become reality, just with slight...... changes: it’s not the ocean, it’s the internet we’re talking about, and it’s not a TV show producer, but algorithms that constitute a sort of invisible wall. Building on this assumption, most research is trying to ‘tame the algorithmic tiger’. While this is a valuable and often inspiring approach, we...

  13. Magneto-sensor circuit efficiency incremented by Fourier-transformation

    KAUST Repository

    Talukdar, Abdul Hafiz Ibne; Useinov, Arthur; Hussain, Muhammad Mustafa

    2011-01-01

    In this paper detection by recognized intelligent algorithm for different magnetic films with the aid of a cost-effective and simple high efficient circuit are realized. Well-known, magnetic films generate oscillating frequencies when they stay a part of an LC- oscillatory circuit. These frequencies can be further analyzed to gather information about their magnetic properties. For the first time in this work we apply the signal analysis in frequency domain to create the Fourier frequency spectra which was used to detect the sample properties and their recognition. In this paper we have summarized both the simulation and experimental results. © 2011 Elsevier Ltd. All rights reserved.

  14. Mesh adaptation technique for Fourier-domain fluorescence lifetime imaging

    International Nuclear Information System (INIS)

    Soloviev, Vadim Y.

    2006-01-01

    A novel adaptive mesh technique in the Fourier domain is introduced for problems in fluorescence lifetime imaging. A dynamical adaptation of the three-dimensional scheme based on the finite volume formulation reduces computational time and balances the ill-posed nature of the inverse problem. Light propagation in the medium is modeled by the telegraph equation, while the lifetime reconstruction algorithm is derived from the Fredholm integral equation of the first kind. Stability and computational efficiency of the method are demonstrated by image reconstruction of two spherical fluorescent objects embedded in a tissue phantom

  15. Magneto-sensor circuit efficiency incremented by Fourier-transformation

    KAUST Repository

    Talukdar, Abdul Hafiz Ibne

    2011-10-01

    In this paper detection by recognized intelligent algorithm for different magnetic films with the aid of a cost-effective and simple high efficient circuit are realized. Well-known, magnetic films generate oscillating frequencies when they stay a part of an LC- oscillatory circuit. These frequencies can be further analyzed to gather information about their magnetic properties. For the first time in this work we apply the signal analysis in frequency domain to create the Fourier frequency spectra which was used to detect the sample properties and their recognition. In this paper we have summarized both the simulation and experimental results. © 2011 Elsevier Ltd. All rights reserved.

  16. Analytic reconstruction algorithms for triple-source CT with horizontal data truncation

    International Nuclear Information System (INIS)

    Chen, Ming; Yu, Hengyong

    2015-01-01

    Purpose: This paper explores a triple-source imaging method with horizontal data truncation to enlarge the field of view (FOV) for big objects. Methods: The study is conducted by using theoretical analysis, mathematical deduction, and numerical simulations. The proposed algorithms are implemented in c + + and MATLAB. While the basic platform is constructed in MATLAB, the computationally intensive segments are coded in c + +, which are linked via a MEX interface. Results: A triple-source circular scanning configuration with horizontal data truncation is developed, where three pairs of x-ray sources and detectors are unevenly distributed on the same circle to cover the whole imaging object. For this triple-source configuration, a fan-beam filtered backprojection-type algorithm is derived for truncated full-scan projections without data rebinning. The algorithm is also extended for horizontally truncated half-scan projections and cone-beam projections in a Feldkamp-type framework. Using their method, the FOV is enlarged twofold to threefold to scan bigger objects with high speed and quality. The numerical simulation results confirm the correctness and effectiveness of the developed algorithms. Conclusions: The triple-source scanning configuration with horizontal data truncation cannot only keep most of the advantages of a traditional multisource system but also cover a larger FOV for big imaging objects. In addition, because the filtering is shift-invariant, the proposed algorithms are very fast and easily parallelized on graphic processing units

  17. The Fourier decomposition method for nonlinear and non-stationary time series analysis.

    Science.gov (United States)

    Singh, Pushpendra; Joshi, Shiv Dutt; Patney, Rakesh Kumar; Saha, Kaushik

    2017-03-01

    for many decades, there has been a general perception in the literature that Fourier methods are not suitable for the analysis of nonlinear and non-stationary data. In this paper, we propose a novel and adaptive Fourier decomposition method (FDM), based on the Fourier theory, and demonstrate its efficacy for the analysis of nonlinear and non-stationary time series. The proposed FDM decomposes any data into a small number of 'Fourier intrinsic band functions' (FIBFs). The FDM presents a generalized Fourier expansion with variable amplitudes and variable frequencies of a time series by the Fourier method itself. We propose an idea of zero-phase filter bank-based multivariate FDM (MFDM), for the analysis of multivariate nonlinear and non-stationary time series, using the FDM. We also present an algorithm to obtain cut-off frequencies for MFDM. The proposed MFDM generates a finite number of band-limited multivariate FIBFs (MFIBFs). The MFDM preserves some intrinsic physical properties of the multivariate data, such as scale alignment, trend and instantaneous frequency. The proposed methods provide a time-frequency-energy (TFE) distribution that reveals the intrinsic structure of a data. Numerical computations and simulations have been carried out and comparison is made with the empirical mode decomposition algorithms.

  18. Research on Palmprint Identification Method Based on Quantum Algorithms

    Directory of Open Access Journals (Sweden)

    Hui Li

    2014-01-01

    Full Text Available Quantum image recognition is a technology by using quantum algorithm to process the image information. It can obtain better effect than classical algorithm. In this paper, four different quantum algorithms are used in the three stages of palmprint recognition. First, quantum adaptive median filtering algorithm is presented in palmprint filtering processing. Quantum filtering algorithm can get a better filtering result than classical algorithm through the comparison. Next, quantum Fourier transform (QFT is used to extract pattern features by only one operation due to quantum parallelism. The proposed algorithm exhibits an exponential speed-up compared with discrete Fourier transform in the feature extraction. Finally, quantum set operations and Grover algorithm are used in palmprint matching. According to the experimental results, quantum algorithm only needs to apply square of N operations to find out the target palmprint, but the traditional method needs N times of calculation. At the same time, the matching accuracy of quantum algorithm is almost 100%.

  19. Novel Fourier-based iterative reconstruction for sparse fan projection using alternating direction total variation minimization

    International Nuclear Information System (INIS)

    Jin Zhao; Zhang Han-Ming; Yan Bin; Li Lei; Wang Lin-Yuan; Cai Ai-Long

    2016-01-01

    Sparse-view x-ray computed tomography (CT) imaging is an interesting topic in CT field and can efficiently decrease radiation dose. Compared with spatial reconstruction, a Fourier-based algorithm has advantages in reconstruction speed and memory usage. A novel Fourier-based iterative reconstruction technique that utilizes non-uniform fast Fourier transform (NUFFT) is presented in this work along with advanced total variation (TV) regularization for a fan sparse-view CT. The proposition of a selective matrix contributes to improve reconstruction quality. The new method employs the NUFFT and its adjoin to iterate back and forth between the Fourier and image space. The performance of the proposed algorithm is demonstrated through a series of digital simulations and experimental phantom studies. Results of the proposed algorithm are compared with those of existing TV-regularized techniques based on compressed sensing method, as well as basic algebraic reconstruction technique. Compared with the existing TV-regularized techniques, the proposed Fourier-based technique significantly improves convergence rate and reduces memory allocation, respectively. (paper)

  20. Properly used ''aliasing'' can give better resolution from fewer points in Fourier transform spectroscopy

    Science.gov (United States)

    D'Astous, Y.; Blanchard, M.

    1982-05-01

    In the past years, the Journal has published a number of articles1-5 devoted to the introduction of Fourier transform spectroscopy in the undergraduate labs. In most papers, the proposed experimental setup consists of a Michelson interferometer, a light source, a light detector, and a chart recorder. The student uses this setup to record an interferogram which is then Fourier transformed to obtain the spectrogram of the light source. Although attempts have been made to ease the task of performing the required Fourier transform,6 the use of computers and Cooley-Tukey's fast Fourier transform (FFT) algorithm7 is by far the simplest method to use. However, to be able to use FFT, one has to get a number of samples of the interferogram, a tedious job which should be kept to a minimum. (AIP)

  1. Generalization of the Fourier Convergence Analysis in the Neutron Diffusion Eigenvalue Problem

    International Nuclear Information System (INIS)

    Lee, Hyun Chul; Noh, Jae Man; Joo, Hyung Kook

    2005-01-01

    Fourier error analysis has been a standard technique for the stability and convergence analysis of linear and nonlinear iterative methods. Lee et al proposed new 2- D/1-D coupling methods and demonstrated several advantages of the new methods by performing a Fourier convergence analysis of the methods as well as two existing methods for a fixed source problem. We demonstrated the Fourier convergence analysis of one of the 2-D/1-D coupling methods applied to a neutron diffusion eigenvalue problem. However, the technique cannot be used directly to analyze the convergence of the other 2-D/1-D coupling methods since some algorithm-specific features were used in our previous study. In this paper we generalized the Fourier convergence analysis technique proposed and analyzed the convergence of the 2-D/1-D coupling methods applied to a neutron diffusion Eigenvalue problem using the generalized technique

  2. Effects of illumination on image reconstruction via Fourier ptychography

    Science.gov (United States)

    Cao, Xinrui; Sinzinger, Stefan

    2017-12-01

    The Fourier ptychographic microscopy (FPM) technique provides high-resolution images by combining a traditional imaging system, e.g. a microscope or a 4f-imaging system, with a multiplexing illumination system, e.g. an LED array and numerical image processing for enhanced image reconstruction. In order to numerically combine images that are captured under varying illumination angles, an iterative phase-retrieval algorithm is often applied. However, in practice, the performance of the FPM algorithm degrades due to the imperfections of the optical system, the image noise caused by the camera, etc. To eliminate the influence of the aberrations of the imaging system, an embedded pupil function recovery (EPRY)-FPM algorithm has been proposed [Opt. Express 22, 4960-4972 (2014)]. In this paper, we study how the performance of FPM and EPRY-FPM algorithms are affected by imperfections of the illumination system using both numerical simulations and experiments. The investigated imperfections include varying and non-uniform intensities, and wavefront aberrations. Our study shows that the aberrations of the illumination system significantly affect the performance of both FPM and EPRY-FPM algorithms. Hence, in practice, aberrations in the illumination system gain significant influence on the resulting image quality.

  3. Quantum arithmetic with the Quantum Fourier Transform

    OpenAIRE

    Ruiz-Perez, Lidia; Garcia-Escartin, Juan Carlos

    2014-01-01

    The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their capabilities. Among the new circuits, we propose a quantum method to compute the weighted average of a series of inputs in the transform domain.

  4. On the inverse windowed Fourier transform

    OpenAIRE

    Rebollo Neira, Laura; Fernández Rubio, Juan Antonio

    1999-01-01

    The inversion problem concerning the windowed Fourier transform is considered. It is shown that, out of the infinite solutions that the problem admits, the windowed Fourier transform is the "optimal" solution according to a maximum-entropy selection criterion. Peer Reviewed

  5. Wigner distribution and fractional Fourier transform

    NARCIS (Netherlands)

    Alieva, T.; Bastiaans, M.J.; Boashash, B.

    2003-01-01

    We have described the relationship between the fractional Fourier transform and the Wigner distribution by using the Radon-Wigner transform, which is a set of projections of the Wigner distribution as well as a set of squared moduli of the fractional Fourier transform. We have introduced the concept

  6. Fast compact algorithms and software for spline smoothing

    CERN Document Server

    Weinert, Howard L

    2012-01-01

    Fast Compact Algorithms and Software for Spline Smoothing investigates algorithmic alternatives for computing cubic smoothing splines when the amount of smoothing is determined automatically by minimizing the generalized cross-validation score. These algorithms are based on Cholesky factorization, QR factorization, or the fast Fourier transform. All algorithms are implemented in MATLAB and are compared based on speed, memory use, and accuracy. An overall best algorithm is identified, which allows very large data sets to be processed quickly on a personal computer.

  7. Discrete fourier transform (DFT) analysis for applications using iterative transform methods

    Science.gov (United States)

    Dean, Bruce H. (Inventor)

    2012-01-01

    According to various embodiments, a method is provided for determining aberration data for an optical system. The method comprises collecting a data signal, and generating a pre-transformation algorithm. The data is pre-transformed by multiplying the data with the pre-transformation algorithm. A discrete Fourier transform of the pre-transformed data is performed in an iterative loop. The method further comprises back-transforming the data to generate aberration data.

  8. Teaching Fourier optics through ray matrices

    International Nuclear Information System (INIS)

    Moreno, I; Sanchez-Lopez, M M; Ferreira, C; Davis, J A; Mateos, F

    2005-01-01

    In this work we examine the use of ray-transfer matrices for teaching and for deriving some topics in a Fourier optics course, exploiting the mathematical simplicity of ray matrices compared to diffraction integrals. A simple analysis of the physical meaning of the elements of the ray matrix provides a fast derivation of the conditions to obtain the optical Fourier transform. We extend this derivation to fractional Fourier transform optical systems, and derive the order of the transform from the ray matrix. Some examples are provided to stress this point of view, both with classical and with graded index lenses. This formulation cannot replace the complete explanation of Fourier optics provided by the wave theory, but it is a complementary tool useful to simplify many aspects of Fourier optics and to relate them to geometrical optics

  9. A Fourier transform with speed improvements for microprocessor applications

    Science.gov (United States)

    Lokerson, D. C.; Rochelle, R.

    1980-01-01

    A fast Fourier transform algorithm for the RCA 1802microprocessor was developed for spacecraft instrument applications. The computations were tailored for the restrictions an eight bit machine imposes. The algorithm incorporates some aspects of Walsh function sequency to improve operational speed. This method uses a register to add a value proportional to the period of the band being processed before each computation is to be considered. If the result overflows into the DF register, the data sample is used in computation; otherwise computation is skipped. This operation is repeated for each of the 64 data samples. This technique is used for both sine and cosine portions of the computation. The processing uses eight bit data, but because of the many computations that can increase the size of the coefficient, floating point form is used. A method to reduce the alias problem in the lower bands is also described.

  10. Discrete quantum Fourier transform in coupled semiconductor double quantum dot molecules

    International Nuclear Information System (INIS)

    Dong Ping; Yang Ming; Cao Zhuoliang

    2008-01-01

    In this Letter, we present a physical scheme for implementing the discrete quantum Fourier transform in a coupled semiconductor double quantum dot system. The main controlled-R gate operation can be decomposed into many simple and feasible unitary transformations. The current scheme would be a useful step towards the realization of complex quantum algorithms in the quantum dot system

  11. Franck-Condon Factors for Diatomics: Insights and Analysis Using the Fourier Grid Hamiltonian Method

    Science.gov (United States)

    Ghosh, Supriya; Dixit, Mayank Kumar; Bhattacharyya, S. P.; Tembe, B. L.

    2013-01-01

    Franck-Condon factors (FCFs) play a crucial role in determining the intensities of the vibrational bands in electronic transitions. In this article, a relatively simple method to calculate the FCFs is illustrated. An algorithm for the Fourier Grid Hamiltonian (FGH) method for computing the vibrational wave functions and the corresponding energy…

  12. A Novel Medical Image Watermarking in Three-dimensional Fourier Compressed Domain

    Directory of Open Access Journals (Sweden)

    Baoru Han

    2015-09-01

    Full Text Available Digital watermarking is a research hotspot in the field of image security, which is protected digital image copyright. In order to ensure medical image information security, a novel medical image digital watermarking algorithm in three-dimensional Fourier compressed domain is proposed. The novel medical image digital watermarking algorithm takes advantage of three-dimensional Fourier compressed domain characteristics, Legendre chaotic neural network encryption features and robust characteristics of differences hashing, which is a robust zero-watermarking algorithm. On one hand, the original watermarking image is encrypted in order to enhance security. It makes use of Legendre chaotic neural network implementation. On the other hand, the construction of zero-watermarking adopts differences hashing in three-dimensional Fourier compressed domain. The novel watermarking algorithm does not need to select a region of interest, can solve the problem of medical image content affected. The specific implementation of the algorithm and the experimental results are given in the paper. The simulation results testify that the novel algorithm possesses a desirable robustness to common attack and geometric attack.

  13. The Geostationary Fourier Transform Spectrometer

    Science.gov (United States)

    Key, Richard; Sander, Stanley; Eldering, Annmarie; Blavier, Jean-Francois; Bekker, Dmitriy; Manatt, Ken; Rider, David; Wu, Yen-Hung

    2012-01-01

    The Geostationary Fourier Transform Spectrometer (GeoFTS) is an imaging spectrometer designed for a geostationary orbit (GEO) earth science mission to measure key atmospheric trace gases and process tracers related to climate change and human activity. GEO allows GeoFTS to continuously stare at a region of the earth for frequent sampling to capture the variability of biogenic fluxes and anthropogenic emissions from city to continental spatial scales and temporal scales from diurnal, synoptic, seasonal to interannual. The measurement strategy provides a process based understanding of the carbon cycle from contiguous maps of carbon dioxide (CO2), methane (CH4), carbon monoxide (CO), and chlorophyll fluorescence (CF) collected many times per day at high spatial resolution (2.7kmx2.7km at nadir). The CO2/CH4/CO/CF measurement suite in the near infrared spectral region provides the information needed to disentangle natural and anthropogenic contributions to atmospheric carbon concentrations and to minimize uncertainties in the flow of carbon between the atmosphere and surface. The half meter cube size GeoFTS instrument is based on a Michelson interferometer design that uses all high TRL components in a modular configuration to reduce complexity and cost. It is self-contained and as independent of the spacecraft as possible with simple spacecraft interfaces, making it ideal to be a "hosted" payload on a commercial communications satellite mission. The hosted payload approach for measuring the major carbon-containing gases in the atmosphere from the geostationary vantage point will affordably advance the scientific understating of carbon cycle processes and climate change.

  14. Non-Harmonic Fourier Analysis for bladed wheels damage detection

    Science.gov (United States)

    Neri, P.; Peeters, B.

    2015-11-01

    The interaction between bladed wheels and the fluid distributed by the stator vanes results in cyclic loading of the rotating components. Compressors and turbines wheels are subject to vibration and fatigue issues, especially when resonance conditions are excited. Even if resonance conditions can be often predicted and avoided, high cycle fatigue failures can occur, causing safety issues and economic loss. Rigorous maintenance programs are then needed, forcing the system to expensive shut-down. Blade crack detection methods are beneficial for condition-based maintenance. While contact measurement systems are not always usable in exercise conditions (e.g. high temperature), non-contact methods can be more suitable. One (or more) stator-fixed sensor can measure all the blades as they pass by, in order to detect the damaged ones. The main drawback in this situation is the short acquisition time available for each blade, which is shortened by the high rotational speed of the components. A traditional Discrete Fourier Transform (DFT) analysis would result in a poor frequency resolution. A Non-Harmonic Fourier Analysis (NHFA) can be executed with an arbitrary frequency resolution instead, allowing to obtain frequency information even with short-time data samples. This paper shows an analytical investigation of the NHFA method. A data processing algorithm is then proposed to obtain frequency shift information from short time samples. The performances of this algorithm are then studied by experimental and numerical tests.

  15. A novel approach in recognizing magnetic material with simplified algorithm

    KAUST Repository

    Talukdar, Abdul Hafiz Ibne; Sultana, Mahbuba Q.; Useinov, Arthur

    2011-01-01

    . This signal was further analyzed (recognized) in frequency domain creating the Fourier frequency spectrum which is easily used to detect the response of magnetic sample. The novel algorithm in detecting magnetic field is presented here with both simulation

  16. Sound algorithms

    OpenAIRE

    De Götzen , Amalia; Mion , Luca; Tache , Olivier

    2007-01-01

    International audience; We call sound algorithms the categories of algorithms that deal with digital sound signal. Sound algorithms appeared in the very infancy of computer. Sound algorithms present strong specificities that are the consequence of two dual considerations: the properties of the digital sound signal itself and its uses, and the properties of auditory perception.

  17. Genetic algorithms

    Science.gov (United States)

    Wang, Lui; Bayer, Steven E.

    1991-01-01

    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

  18. Replica Fourier Transform: Properties and applications

    International Nuclear Information System (INIS)

    Crisanti, A.; De Dominicis, C.

    2015-01-01

    The Replica Fourier Transform is the generalization of the discrete Fourier Transform to quantities defined on an ultrametric tree. It finds use in conjunction of the replica method used to study thermodynamics properties of disordered systems such as spin glasses. Its definition is presented in a systematic and simple form and its use illustrated with some representative examples. In particular we give a detailed discussion of the diagonalization in the Replica Fourier Space of the Hessian matrix of the Gaussian fluctuations about the mean field saddle point of spin glass theory. The general results are finally discussed for a generic spherical spin glass model, where the Hessian can be computed analytically

  19. Fourier transforms in radar and signal processing

    CERN Document Server

    Brandwood, David

    2011-01-01

    Fourier transforms are used widely, and are of particular value in the analysis of single functions and combinations of functions found in radar and signal processing. Still, many problems that could have been tackled by using Fourier transforms may have gone unsolved because they require integration that is difficult and tedious. This newly revised and expanded edition of a classic Artech House book provides you with an up-to-date, coordinated system for performing Fourier transforms on a wide variety of functions. Along numerous updates throughout the book, the Second Edition includes a crit

  20. Fourier domain optical coherence tomography achieves full range complex imaging in vivo by introducing a carrier frequency during scanning

    International Nuclear Information System (INIS)

    Wang, Ruikang K

    2007-01-01

    The author describes a Fourier domain optical coherence tomography (FDOCT) system that is capable of full range complex imaging in vivo. This is achieved by introducing a constant carrier frequency into the OCT spectral interferograms at the time when imaging is performed. The complex functions of the spatial interferograms formed by each single wavelength are constructed before performing the Fourier transformation to localize the scatters within a sample. Two algorithms, based on Fourier filtering and Hilbert transformation, respectively, are described to achieve the full range complex FDOCT imaging. It is shown that the Hilbert transformation approach delivers better performance than the Fourier filtering method does in terms of tolerating the sample movement in vivo. The author finally demonstrates experimentally the system and algorithms for true in vivo imaging at a rate of 20 000 axial scans per second

  1. Speckle imaging algorithms for planetary imaging

    Energy Technology Data Exchange (ETDEWEB)

    Johansson, E. [Lawrence Livermore National Lab., CA (United States)

    1994-11-15

    I will discuss the speckle imaging algorithms used to process images of the impact sites of the collision of comet Shoemaker-Levy 9 with Jupiter. The algorithms use a phase retrieval process based on the average bispectrum of the speckle image data. High resolution images are produced by estimating the Fourier magnitude and Fourier phase of the image separately, then combining them and inverse transforming to achieve the final result. I will show raw speckle image data and high-resolution image reconstructions from our recent experiment at Lick Observatory.

  2. Fourier-based approach to interpolation in single-slice helical computed tomography

    International Nuclear Information System (INIS)

    La Riviere, Patrick J.; Pan Xiaochuan

    2001-01-01

    It has recently been shown that longitudinal aliasing can be a significant and detrimental presence in reconstructed single-slice helical computed tomography (CT) volumes. This aliasing arises because the directly measured data in helical CT are generally undersampled by a factor of at least 2 in the longitudinal direction and because the exploitation of the redundancy of fanbeam data acquired over 360 degree sign to generate additional longitudinal samples does not automatically eliminate the aliasing. In this paper we demonstrate that for pitches near 1 or lower, the redundant fanbeam data, when used properly, can provide sufficient information to satisfy a generalized sampling theorem and thus to eliminate aliasing. We develop and evaluate a Fourier-based algorithm, called 180FT, that accomplishes this. As background we present a second Fourier-based approach, called 360FT, that makes use only of the directly measured data. Both Fourier-based approaches exploit the fast Fourier transform and the Fourier shift theorem to generate from the helical projection data a set of fanbeam sinograms corresponding to equispaced transverse slices. Slice-by-slice reconstruction is then performed by use of two-dimensional fanbeam algorithms. The proposed approaches are compared to their counterparts based on the use of linear interpolation - the 360LI and 180LI approaches. The aliasing suppression property of the 180FT approach is a clear advantage of the approach and represents a step toward the desirable goal of achieving uniform longitudinal resolution properties in reconstructed helical CT volumes

  3. Fast and accurate implementation of Fourier spectral approximations of nonlocal diffusion operators and its applications

    International Nuclear Information System (INIS)

    Du, Qiang; Yang, Jiang

    2017-01-01

    This work is concerned with the Fourier spectral approximation of various integral differential equations associated with some linear nonlocal diffusion and peridynamic operators under periodic boundary conditions. For radially symmetric kernels, the nonlocal operators under consideration are diagonalizable in the Fourier space so that the main computational challenge is on the accurate and fast evaluation of their eigenvalues or Fourier symbols consisting of possibly singular and highly oscillatory integrals. For a large class of fractional power-like kernels, we propose a new approach based on reformulating the Fourier symbols both as coefficients of a series expansion and solutions of some simple ODE models. We then propose a hybrid algorithm that utilizes both truncated series expansions and high order Runge–Kutta ODE solvers to provide fast evaluation of Fourier symbols in both one and higher dimensional spaces. It is shown that this hybrid algorithm is robust, efficient and accurate. As applications, we combine this hybrid spectral discretization in the spatial variables and the fourth-order exponential time differencing Runge–Kutta for temporal discretization to offer high order approximations of some nonlocal gradient dynamics including nonlocal Allen–Cahn equations, nonlocal Cahn–Hilliard equations, and nonlocal phase-field crystal models. Numerical results show the accuracy and effectiveness of the fully discrete scheme and illustrate some interesting phenomena associated with the nonlocal models.

  4. Content adaptive illumination for Fourier ptychography.

    Science.gov (United States)

    Bian, Liheng; Suo, Jinli; Situ, Guohai; Zheng, Guoan; Chen, Feng; Dai, Qionghai

    2014-12-01

    Fourier ptychography (FP) is a recently reported technique, for large field-of-view and high-resolution imaging. Specifically, FP captures a set of low-resolution images, under angularly varying illuminations, and stitches them together in the Fourier domain. One of FP's main disadvantages is its long capturing process, due to the requisite large number of incident illumination angles. In this Letter, utilizing the sparsity of natural images in the Fourier domain, we propose a highly efficient method, termed adaptive Fourier ptychography (AFP), which applies content adaptive illumination for FP, to capture the most informative parts of the scene's spatial spectrum. We validate the effectiveness and efficiency of the reported framework, with both simulated and real experiments. Results show that the proposed AFP could shorten the acquisition time of conventional FP, by around 30%-60%.

  5. X-ray interferometric Fourier holography

    International Nuclear Information System (INIS)

    Balyan, M.K.

    2016-01-01

    The X-ray interferometric Fourier holography is proposed and theoretically investigated. Fourier The X-ray interferometric Young fringes and object image reconstruction are investigated. It is shown that the interference pattern of two slits formed on the exit surface of the crystal-analyzer (the third plate of the interferometer) is the X-ray interferometric Young fringes. An expression for X-ray interferometric Young fringes period is obtained. The subsequent reconstruction of the slit image as an object is performed by means of Fourier transform of the intensity distribution on the hologram. Three methods of reconstruction of the amplitude transmission complex function of the object are presented: analytical - approximate method, method of iteration and step by step method. As an example the X-ray Fourier interferometric hologram recording and the complex amplitude transmission function reconstruction for a beryllium circular wire are considered

  6. New focus on Fourier optics techniques

    NARCIS (Netherlands)

    Calvo, M.L.; Alieva, T.; Bastiaans, M.J.; Rodrigo Martín-Romo, J.A.; Rodríguez Merlo, D.; Vlad, V.I.

    2004-01-01

    We present a short overview on the application of fractional cyclic and linear canonical transformations to optical signal processing and dedicate some of the discussions to the particular features found in the fractional Fourier transform domain.

  7. The finite Fourier transform of classical polynomials

    OpenAIRE

    Dixit, Atul; Jiu, Lin; Moll, Victor H.; Vignat, Christophe

    2014-01-01

    The finite Fourier transform of a family of orthogonal polynomials $A_{n}(x)$, is the usual transform of the polynomial extended by $0$ outside their natural domain. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and Chebyshev families.

  8. On the Scaled Fractional Fourier Transformation Operator

    International Nuclear Information System (INIS)

    Hong-Yi, Fan; Li-Yun, Hu

    2008-01-01

    Based on our previous study [Chin. Phys. Lett. 24 (2007) 2238] in which the Fresnel operator corresponding to classical Fresnel transform was introduced, we derive the fractional Fourier transformation operator, and the optical operator method is then enriched

  9. Mountain Wave Analysis Using Fourier Methods

    National Research Council Canada - National Science Library

    Roadcap, John R

    2007-01-01

    ...) their requirements for only a coarse horizontal background state. Common traits of Fourier mountain wave models include use of the Boussinesq approximation and neglect of moisture and Coriolis terms...

  10. A new twist to fourier transforms

    CERN Document Server

    Meikle, Hamish D

    2004-01-01

    Making use of the inherent helix in the Fourier transform expression, this book illustrates both Fourier transforms and their properties in the round. The author draws on elementary complex algebra to manipulate the transforms, presenting the ideas in such a way as to avoid pages of complicated mathematics. Similarly, abbreviations are not used throughout and the language is kept deliberately clear so that the result is a text that is accessible to a much wider readership.The treatment is extended with the use of sampled data to finite and discrete transforms, the fast Fourier transform, or FFT, being a special case of a discrete transform. The application of Fourier transforms in statistics is illustrated for the first time using the examples operational research and later radar detection. In addition, a whole chapter on tapering or weighting functions is added for reference. The whole is rounded off by a glossary and examples of diagrams in three dimensions made possible by today's mathematics programs

  11. Mapped Fourier Methods for stiff problems in toroidal geometry

    OpenAIRE

    Guillard , Herve

    2014-01-01

    Fourier spectral or pseudo-spectral methods are usually extremely efficient for periodic problems. However this efficiency is lost if the solutions have zones of rapid variations or internal layers. For these cases, a large number of Fourier modes are required and this makes the Fourier method unpractical in many cases. This work investigates the use of mapped Fourier method as a way to circumvent this problem. Mapped Fourier method uses instead of the usual Fourier interpolant the compositio...

  12. Causal Correlation Functions and Fourier Transforms: Application in Calculating Pressure Induced Shifts

    Science.gov (United States)

    Ma, Q.; Tipping, R. H.; Lavrentieva, N. N.

    2012-01-01

    By adopting a concept from signal processing, instead of starting from the correlation functions which are even, one considers the causal correlation functions whose Fourier transforms become complex. Their real and imaginary parts multiplied by 2 are the Fourier transforms of the original correlations and the subsequent Hilbert transforms, respectively. Thus, by taking this step one can complete the two previously needed transforms. However, to obviate performing the Cauchy principal integrations required in the Hilbert transforms is the greatest advantage. Meanwhile, because the causal correlations are well-bounded within the time domain and band limited in the frequency domain, one can replace their Fourier transforms by the discrete Fourier transforms and the latter can be carried out with the FFT algorithm. This replacement is justified by sampling theory because the Fourier transforms can be derived from the discrete Fourier transforms with the Nyquis rate without any distortions. We apply this method in calculating pressure induced shifts of H2O lines and obtain more reliable values. By comparing the calculated shifts with those in HITRAN 2008 and by screening both of them with the pair identity and the smooth variation rules, one can conclude many of shift values in HITRAN are not correct.

  13. Algorithmic cryptanalysis

    CERN Document Server

    Joux, Antoine

    2009-01-01

    Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic

  14. Fourier Deconvolution Methods for Resolution Enhancement in Continuous-Wave EPR Spectroscopy.

    Science.gov (United States)

    Reed, George H; Poyner, Russell R

    2015-01-01

    An overview of resolution enhancement of conventional, field-swept, continuous-wave electron paramagnetic resonance spectra using Fourier transform-based deconvolution methods is presented. Basic steps that are involved in resolution enhancement of calculated spectra using an implementation based on complex discrete Fourier transform algorithms are illustrated. Advantages and limitations of the method are discussed. An application to an experimentally obtained spectrum is provided to illustrate the power of the method for resolving overlapped transitions. © 2015 Elsevier Inc. All rights reserved.

  15. Algorithmic mathematics

    CERN Document Server

    Hougardy, Stefan

    2016-01-01

    Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.

  16. Total algorithms

    NARCIS (Netherlands)

    Tel, G.

    We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of

  17. An L1-norm phase constraint for half-Fourier compressed sensing in 3D MR imaging.

    Science.gov (United States)

    Li, Guobin; Hennig, Jürgen; Raithel, Esther; Büchert, Martin; Paul, Dominik; Korvink, Jan G; Zaitsev, Maxim

    2015-10-01

    In most half-Fourier imaging methods, explicit phase replacement is used. In combination with parallel imaging, or compressed sensing, half-Fourier reconstruction is usually performed in a separate step. The purpose of this paper is to report that integration of half-Fourier reconstruction into iterative reconstruction minimizes reconstruction errors. The L1-norm phase constraint for half-Fourier imaging proposed in this work is compared with the L2-norm variant of the same algorithm, with several typical half-Fourier reconstruction methods. Half-Fourier imaging with the proposed phase constraint can be seamlessly combined with parallel imaging and compressed sensing to achieve high acceleration factors. In simulations and in in-vivo experiments half-Fourier imaging with the proposed L1-norm phase constraint enables superior performance both reconstruction of image details and with regard to robustness against phase estimation errors. The performance and feasibility of half-Fourier imaging with the proposed L1-norm phase constraint is reported. Its seamless combination with parallel imaging and compressed sensing enables use of greater acceleration in 3D MR imaging.

  18. Sparse-matrix factorizations for fast symmetric Fourier transforms

    International Nuclear Information System (INIS)

    Sequel, J.

    1987-01-01

    This work proposes new fast algorithms computing the discrete Fourier transform of certain families of symmetric sequences. Sequences commonly found in problems of structure determination by x-ray crystallography and in numerical solutions of boundary-value problems in partial differential equations are dealt with. In the algorithms presented, the redundancies in the input and output data, due to the presence of symmetries in the input data sequence, were eliminated. Using ring-theoretical methods a matrix representation is obtained for the remaining calculations; which factors as the product of a complex block-diagonal matrix times as integral matrix. A basic two-step algorithm scheme arises from this factorization with a first step consisting of pre-additions and a second step containing the calculations involved in computing with the blocks in the block-diagonal factor. These blocks are structured as block-Hankel matrices, and two sparse-matrix factoring formulas are developed in order to diminish their arithmetic complexity

  19. Direct fourier method reconstruction based on unequally spaced fast fourier transform

    International Nuclear Information System (INIS)

    Wu Xiaofeng; Zhao Ming; Liu Li

    2003-01-01

    First, We give an Unequally Spaced Fast Fourier Transform (USFFT) method, which is more exact and theoretically more comprehensible than its former counterpart. Then, with an interesting interpolation scheme, we discusse how to apply USFFT to Direct Fourier Method (DFM) reconstruction of parallel projection data. At last, an emulation experiment result is given. (authors)

  20. An Image Matching Method Based on Fourier and LOG-Polar Transform

    Directory of Open Access Journals (Sweden)

    Zhijia Zhang

    2014-04-01

    Full Text Available This Traditional template matching methods are not appropriate for the situation of large angle rotation between two images in the online detection for industrial production. Aiming at this problem, Fourier transform algorithm was introduced to correct image rotation angle based on its rotatary invariance in time-frequency domain, orienting image under test in the same direction with reference image, and then match these images using matching algorithm based on log-polar transform. Compared with the current matching algorithms, experimental results show that the proposed algorithm can not only match two images with rotation of arbitrary angle, but also possess a high matching accuracy and applicability. In addition, the validity and reliability of algorithm was verified by simulated matching experiment targeting circular images.

  1. Application and sensitivity investigation of Fourier transforms for microwave radiometric inversions

    Science.gov (United States)

    Holmes, J. J.; Balanis, C. A.

    1974-01-01

    Existing microwave radiometer technology now provides a suitable method for remote determination of the ocean surface's absolute brightness temperature. To extract the brightness temperature of the water from the antenna temperature equation, an unstable Fredholm integral equation of the first kind was solved. Fast Fourier Transform techniques were used to invert the integral after it is placed into a cross-correlation form. Application and verification of the methods to a two-dimensional modeling of a laboratory wave tank system were included. The instability of the Fredholm equation was then demonstrated and a restoration procedure was included which smooths the resulting oscillations. With the recent availability and advances of Fast Fourier Transform techniques, the method presented becomes very attractive in the evaluation of large quantities of data. Actual radiometric measurements of sea water are inverted using the restoration method, incorporating the advantages of the Fast Fourier Transform algorithm for computations.

  2. Using the fast fourier transform in binding free energy calculations.

    Science.gov (United States)

    Nguyen, Trung Hai; Zhou, Huan-Xiang; Minh, David D L

    2018-04-30

    According to implicit ligand theory, the standard binding free energy is an exponential average of the binding potential of mean force (BPMF), an exponential average of the interaction energy between the unbound ligand ensemble and a rigid receptor. Here, we use the fast Fourier transform (FFT) to efficiently evaluate BPMFs by calculating interaction energies when rigid ligand configurations from the unbound ensemble are discretely translated across rigid receptor conformations. Results for standard binding free energies between T4 lysozyme and 141 small organic molecules are in good agreement with previous alchemical calculations based on (1) a flexible complex ( R≈0.9 for 24 systems) and (2) flexible ligand with multiple rigid receptor configurations ( R≈0.8 for 141 systems). While the FFT is routinely used for molecular docking, to our knowledge this is the first time that the algorithm has been used for rigorous binding free energy calculations. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

  3. Closed form fourier-based transmit beamforming for MIMO radar

    KAUST Repository

    Lipor, John J.

    2014-05-01

    In multiple-input multiple-output (MIMO) radar setting, it is often desirable to design correlated waveforms such that power is transmitted only to a given set of locations, a process known as beampattern design. To design desired beam-pattern, current research uses iterative algorithms, first to synthesize the waveform covariance matrix, R, then to design the actual waveforms to realize R. In contrast to this, we present a closed form method to design R that exploits discrete Fourier transform and Toeplitz matrix. The resulting covariance matrix fulfills the practical constraints and performance is similar to that of iterative methods. Next, we present a radar architecture for the desired beampattern that does not require the synthesis of covariance matrix nor the design of correlated waveforms. © 2014 IEEE.

  4. Live face detection based on the analysis of Fourier spectra

    Science.gov (United States)

    Li, Jiangwei; Wang, Yunhong; Tan, Tieniu; Jain, Anil K.

    2004-08-01

    Biometrics is a rapidly developing technology that is to identify a person based on his or her physiological or behavioral characteristics. To ensure the correction of authentication, the biometric system must be able to detect and reject the use of a copy of a biometric instead of the live biometric. This function is usually termed "liveness detection". This paper describes a new method for live face detection. Using structure and movement information of live face, an effective live face detection algorithm is presented. Compared to existing approaches, which concentrate on the measurement of 3D depth information, this method is based on the analysis of Fourier spectra of a single face image or face image sequences. Experimental results show that the proposed method has an encouraging performance.

  5. Direct phase retrieval in double blind Fourier holography.

    Science.gov (United States)

    Raz, Oren; Leshem, Ben; Miao, Jianwei; Nadler, Boaz; Oron, Dan; Dudovich, Nirit

    2014-10-20

    Phase measurement is a long-standing challenge in a wide range of applications, from X-ray imaging to astrophysics and spectroscopy. While in some scenarios the phase is resolved by an interferometric measurement, in others it is reconstructed via numerical optimization, based on some a-priori knowledge about the signal. The latter commonly use iterative algorithms, and thus have to deal with their convergence, stagnation, and robustness to noise. Here we combine these two approaches and present a new scheme, termed double blind Fourier holography, providing an efficient solution to the phase problem in two dimensions, by solving a system of linear equations. We present and experimentally demonstrate our approach for the case of lens-less imaging.

  6. Fourier optical cryptosystem using complex spatial modulation

    International Nuclear Information System (INIS)

    Sarkadi, T; Koppa, P

    2014-01-01

    Our goal is to enhance the security level of a Fourier optical encryption system. Therefore we propose a Mach–Zehnder interferometer based encryption setup. The input data is organized in a binary array, and it is encoded in the two wave fronts propagated in the arms of the interferometer. Both input wave fronts are independently encrypted by Fourier systems, hence the proposed method has two encryption keys. During decryption, the encrypted wave fronts are propagated through the interferometer setup. The interference pattern of the output shows the reconstructed data in cases where the correct decryption Fourier keys are used. We propose a novel input image modulation method with a user defined phase parameter. We show that the security level of the proposed cryptosystem can be enhanced by an optimally chosen phase parameter. (paper)

  7. Harmonic analysis from Fourier to wavelets

    CERN Document Server

    Pereyra, Maria Cristina

    2012-01-01

    In the last 200 years, harmonic analysis has been one of the most influential bodies of mathematical ideas, having been exceptionally significant both in its theoretical implications and in its enormous range of applicability throughout mathematics, science, and engineering. In this book, the authors convey the remarkable beauty and applicability of the ideas that have grown from Fourier theory. They present for an advanced undergraduate and beginning graduate student audience the basics of harmonic analysis, from Fourier's study of the heat equation, and the decomposition of functions into sums of cosines and sines (frequency analysis), to dyadic harmonic analysis, and the decomposition of functions into a Haar basis (time localization). While concentrating on the Fourier and Haar cases, the book touches on aspects of the world that lies between these two different ways of decomposing functions: time-frequency analysis (wavelets). Both finite and continuous perspectives are presented, allowing for the introd...

  8. Projective Fourier duality and Weyl quantization

    International Nuclear Information System (INIS)

    Aldrovandi, R.; Saeger, L.A.

    1996-08-01

    The Weyl-Wigner correspondence prescription, which makes large use of Fourier duality, is reexamined from the point of view of Kac algebras, the most general background for non-commutative Fourier analysis allowing for that property. It is shown how the standard Kac structure has to be extended in order to accommodate the physical requirements. An Abelian and a symmetric projective Kac algebras are shown to provide, in close parallel to the standard case, a new dual framework and a well-defined notion of projective Fourier duality for the group of translations on the plane. The Weyl formula arises naturally as an irreducible component of the duality mapping between these projective algebras. (author). 29 refs

  9. Fourier duality as a quantization principle

    International Nuclear Information System (INIS)

    Aldrovandi, R.; Saeger, L.A.

    1996-08-01

    The Weyl-Wigner prescription for quantization on Euclidean phase spaces makes essential use of Fourier duality. The extension of this property to more general phase spaces requires the use of Kac algebras, which provide the necessary background for the implementation of Fourier duality on general locally groups. Kac algebras - and the duality they incorporate are consequently examined as candidates for a general quantization framework extending the usual formalism. Using as a test case the simplest non-trivial phase space, the half-plane, it is shown how the structures present in the complete-plane case must be modified. Traces, for example, must be replaced by their noncommutative generalizations - weights - and the correspondence embodied in the Weyl-Wigner formalism is no more complete. Provided the underlying algebraic structure is suitably adapted to each case, Fourier duality is shown to be indeed a very powerful guide to the quantization of general physical systems. (author). 30 refs

  10. Methods of Fourier analysis and approximation theory

    CERN Document Server

    Tikhonov, Sergey

    2016-01-01

    Different facets of interplay between harmonic analysis and approximation theory are covered in this volume. The topics included are Fourier analysis, function spaces, optimization theory, partial differential equations, and their links to modern developments in the approximation theory. The articles of this collection were originated from two events. The first event took place during the 9th ISAAC Congress in Krakow, Poland, 5th-9th August 2013, at the section “Approximation Theory and Fourier Analysis”. The second event was the conference on Fourier Analysis and Approximation Theory in the Centre de Recerca Matemàtica (CRM), Barcelona, during 4th-8th November 2013, organized by the editors of this volume. All articles selected to be part of this collection were carefully reviewed.

  11. Fourier analysis and boundary value problems

    CERN Document Server

    Gonzalez-Velasco, Enrique A

    1996-01-01

    Fourier Analysis and Boundary Value Problems provides a thorough examination of both the theory and applications of partial differential equations and the Fourier and Laplace methods for their solutions. Boundary value problems, including the heat and wave equations, are integrated throughout the book. Written from a historical perspective with extensive biographical coverage of pioneers in the field, the book emphasizes the important role played by partial differential equations in engineering and physics. In addition, the author demonstrates how efforts to deal with these problems have lead to wonderfully significant developments in mathematics.A clear and complete text with more than 500 exercises, Fourier Analysis and Boundary Value Problems is a good introduction and a valuable resource for those in the field.Key Features* Topics are covered from a historical perspective with biographical information on key contributors to the field* The text contains more than 500 exercises* Includes practical applicati...

  12. Implementation of quantum and classical discrete fractional Fourier transforms

    Science.gov (United States)

    Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N.; Szameit, Alexander

    2016-01-01

    Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools. PMID:27006089

  13. Implementation of quantum and classical discrete fractional Fourier transforms.

    Science.gov (United States)

    Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N; Szameit, Alexander

    2016-03-23

    Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools.

  14. Quantum copying and simplification of the quantum Fourier transform

    Science.gov (United States)

    Niu, Chi-Sheng

    Theoretical studies of quantum computation and quantum information theory are presented in this thesis. Three topics are considered: simplification of the quantum Fourier transform in Shor's algorithm, optimal eavesdropping in the BB84 quantum cryptographic protocol, and quantum copying of one qubit. The quantum Fourier transform preceding the final measurement in Shor's algorithm is simplified by replacing a network of quantum gates with one that has fewer and simpler gates controlled by classical signals. This simplification results from an analysis of the network using the consistent history approach to quantum mechanics. The optimal amount of information which an eavesdropper can gain, for a given level of noise in the communication channel, is worked out for the BB84 quantum cryptographic protocol. The optimal eavesdropping strategy is expressed in terms of various quantum networks. A consistent history analysis of these networks using two conjugate quantum bases shows how the information gain in one basis influences the noise level in the conjugate basis. The no-cloning property of quantum systems, which is the physics behind quantum cryptography, is studied by considering copying machines that generate two imperfect copies of one qubit. The best qualities these copies can have are worked out with the help of the Bloch sphere representation for one qubit, and a quantum network is worked out for an optimal copying machine. If the copying machine does not have additional ancillary qubits, the copying process can be viewed using a 2-dimensional subspace in a product space of two qubits. A special representation of such a two-dimensional subspace makes possible a complete characterization of this type of copying. This characterization in turn leads to simplified eavesdropping strategies in the BB84 and the B92 quantum cryptographic protocols.

  15. Fourier analysis in several complex variables

    CERN Document Server

    Ehrenpreis, Leon

    2006-01-01

    Suitable for advanced undergraduates and graduate students, this text develops comparison theorems to establish the fundamentals of Fourier analysis and to illustrate their applications to partial differential equations.The three-part treatment begins by establishing the quotient structure theorem or fundamental principle of Fourier analysis. Topics include the geometric structure of ideals and modules, quantitative estimates, and examples in which the theory can be applied. The second part focuses on applications to partial differential equations and covers the solution of homogeneous and inh

  16. Fourier transforms and convolutions for the experimentalist

    CERN Document Server

    Jennison, RC

    1961-01-01

    Fourier Transforms and Convolutions for the Experimentalist provides the experimentalist with a guide to the principles and practical uses of the Fourier transformation. It aims to bridge the gap between the more abstract account of a purely mathematical approach and the rule of thumb calculation and intuition of the practical worker. The monograph springs from a lecture course which the author has given in recent years and for which he has drawn upon a number of sources, including a set of notes compiled by the late Dr. I. C. Browne from a series of lectures given by Mr. J . A. Ratcliffe of t

  17. Electro-optic imaging Fourier transform spectrometer

    Science.gov (United States)

    Chao, Tien-Hsin (Inventor); Znod, Hanying (Inventor)

    2009-01-01

    An Electro-Optic Imaging Fourier Transform Spectrometer (EOIFTS) for Hyperspectral Imaging is described. The EOIFTS includes an input polarizer, an output polarizer, and a plurality of birefringent phase elements. The relative orientations of the polarizers and birefringent phase elements can be changed mechanically or via a controller, using ferroelectric liquid crystals, to substantially measure the spectral Fourier components of light propagating through the EIOFTS. When achromatic switches are used as an integral part of the birefringent phase elements, the EIOFTS becomes suitable for broadband applications, with over 1 micron infrared bandwidth.

  18. Predicting detection performance with model observers: Fourier domain or spatial domain?

    Science.gov (United States)

    Chen, Baiyu; Yu, Lifeng; Leng, Shuai; Kofler, James; Favazza, Christopher; Vrieze, Thomas; McCollough, Cynthia

    2016-02-27

    The use of Fourier domain model observer is challenged by iterative reconstruction (IR), because IR algorithms are nonlinear and IR images have noise texture different from that of FBP. A modified Fourier domain model observer, which incorporates nonlinear noise and resolution properties, has been proposed for IR and needs to be validated with human detection performance. On the other hand, the spatial domain model observer is theoretically applicable to IR, but more computationally intensive than the Fourier domain method. The purpose of this study is to compare the modified Fourier domain model observer to the spatial domain model observer with both FBP and IR images, using human detection performance as the gold standard. A phantom with inserts of various low contrast levels and sizes was repeatedly scanned 100 times on a third-generation, dual-source CT scanner at 5 dose levels and reconstructed using FBP and IR algorithms. The human detection performance of the inserts was measured via a 2-alternative-forced-choice (2AFC) test. In addition, two model observer performances were calculated, including a Fourier domain non-prewhitening model observer and a spatial domain channelized Hotelling observer. The performance of these two mode observers was compared in terms of how well they correlated with human observer performance. Our results demonstrated that the spatial domain model observer correlated well with human observers across various dose levels, object contrast levels, and object sizes. The Fourier domain observer correlated well with human observers using FBP images, but overestimated the detection performance using IR images.

  19. Numerical computation of the discrete Fourier transform and its applications in the statistic processing of experimental data

    International Nuclear Information System (INIS)

    Marinescu, D.C.; Radulescu, T.G.

    1977-06-01

    The Integral Fourier Transform has a large range of applications in such areas as communication theory, circuit theory, physics, etc. In order to perform discrete Fourier Transform the Finite Fourier Transform is defined; it operates upon N samples of a uniformely sampled continuous function. All the properties known in the continuous case can be found in the discrete case also. The first part of the paper presents the relationship between the Finite Fourier Transform and the Integral one. The computing of a Finite Fourier Transform is a problem in itself since in order to transform a set of N data we have to perform N 2 ''operations'' if the transformation relations are used directly. An algorithm known as the Fast Fourier Transform (FFT) reduces this figure from N 2 to a more reasonable Nlog 2 N, when N is a power of two. The original Cooley and Tuckey algorithm for FFT can be further improved when higher basis are used. The price to be paid in this case is the increase in complexity of such algorithms. The recurrence relations and a comparation among such algorithms are presented. The key point in understanding the application of FFT resides in the convolution theorem which states that the convolution (an N 2 type procedure) of the primitive functions is equivalent to the ordinar multiplication of their transforms. Since filtering is actually a convolution process we present several procedures to perform digital filtering by means of FFT. The best is the one using the segmentation of records and the transformation of pairs of records. In the digital processing of signals, besides digital filtering a special attention is paid to the estimation of various statistical characteristics of a signal as: autocorrelation and correlation functions, periodiograms, density power sepctrum, etc. We give several algorithms for the consistent and unbiased estimation of such functions, by means of FFT. (author)

  20. A study on the application of Fourier series in IMRT treatment planning.

    Science.gov (United States)

    Almeida-Trinidad, R; Garnica-Garza, H M

    2007-12-01

    In intensity-modulated radiotherapy, a set of x-ray fluence profiles is iteratively adjusted until a desired absorbed dose distribution is obtained. The purpose of this article is to present a method that allows the optimization of fluence profiles based on the Fourier series decomposition of an initial approximation to the profile. The method has the advantage that a new fluence profile can be obtained in a precise and controlled way with the tuning of only two parameters, namely the phase of the sine and cosine terms of one of the Fourier components, in contrast to the point-by-point tuning of the profile. Also, because the method uses analytical functions, the resultant profiles do not exhibit numerical artifacts. A test case consisting of a mathematical phantom with a target wrapped around a critical structure is discussed to illustrate the algorithm. It is shown that the degree of conformality of the absorbed dose distribution can be tailored by varying the number of Fourier terms made available to the optimization algorithm. For the test case discussed here, it is shown that the number of Fourier terms to be modified depends on the number of radiation beams incident on the target but it is in general in the order of 10 terms.

  1. Introduction to the discrete Fourier series considering both mathematical and engineering aspects - A linear-algebra approach

    Directory of Open Access Journals (Sweden)

    Ludwig Kohaupt

    2015-12-01

    Full Text Available The discrete Fourier series is a valuable tool developed and used by mathematicians and engineers alike. One of the most prominent applications is signal processing. Usually, it is important that the signals be transmitted fast, for example, when transmitting images over large distances such as between the moon and the earth or when generating images in computer tomography. In order to achieve this, appropriate algorithms are necessary. In this context, the fast Fourier transform (FFT plays a key role which is an algorithm for calculating the discrete Fourier transform (DFT; this, in turn, is tightly connected with the discrete Fourier series. The last one itself is the discrete analog of the common (continuous-time Fourier series and is usually learned by mathematics students from a theoretical point of view. The aim of this expository/pedagogical paper is to give an introduction to the discrete Fourier series for both mathematics and engineering students. It is intended to expand the purely mathematical view; the engineering aspect is taken into account by applying the FFT to an example from signal processing that is small enough to be used in class-room teaching and elementary enough to be understood also by mathematics students. The MATLAB program is employed to do the computations.

  2. The periodogram at the Fourier frequencies

    NARCIS (Netherlands)

    Kokoszka, P; Mikosch, T

    In the time series literature one can often find the claim that the periodogram ordinates of an lid sequence at the Fourier frequencies behave like an lid standard exponential sequence. We review some results about functions of these periodogram ordinates, including the convergence of extremes,

  3. Pi, Fourier Transform and Ludolph van Ceulen

    NARCIS (Netherlands)

    Vajta, Miklos

    2000-01-01

    The paper describes an interesting (and unexpected) application of the Fast Fourier transform in number theory. Calculating more and more decimals of p (first by hand and then from the mid-20th century, by digital computers) not only fascinated mathematicians from ancient times but kept them busy as

  4. Fourier transform infrared spectrometery: an undergraduate experiment

    International Nuclear Information System (INIS)

    Lerner, L

    2016-01-01

    Simple apparatus is developed, providing undergraduate students with a solid understanding of Fourier transform (FT) infrared (IR) spectroscopy in a hands on experiment. Apart from its application to measuring the mid-IR spectra of organic molecules, the experiment introduces several techniques with wide applicability in physics, including interferometry, the FT, digital data analysis, and control theory. (paper)

  5. Wigner distribution and fractional Fourier transform

    NARCIS (Netherlands)

    Alieva, T.; Bastiaans, M.J.

    2001-01-01

    The connection between the Wigner distribution and the squared modulus of the fractional Fourier transform - which are both well-known time-frequency representations of a signal - is established. In particular the Radon-Wigner transform is used, which relates projections of the Wigner distribution

  6. The Fourier transform of tubular densities

    KAUST Repository

    Prior, C B; Goriely, A

    2012-01-01

    molecules. We consider tubes of both finite radii and unrestricted radius. When there is overlap of the tube structure the net density is calculated using the super-position principle. The Fourier transform of this density is composed of two expressions, one

  7. Geometric Representations for Discrete Fourier Transforms

    Science.gov (United States)

    Cambell, C. W.

    1986-01-01

    Simple geometric representations show symmetry and periodicity of discrete Fourier transforms (DFT's). Help in visualizing requirements for storing and manipulating transform value in computations. Representations useful in any number of dimensions, but particularly in one-, two-, and three-dimensional cases often encountered in practice.

  8. Fourier analysis in combinatorial number theory

    International Nuclear Information System (INIS)

    Shkredov, Il'ya D

    2010-01-01

    In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.

  9. Fourier analysis in combinatorial number theory

    Energy Technology Data Exchange (ETDEWEB)

    Shkredov, Il' ya D [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)

    2010-09-16

    In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.

  10. A Fourier analysis of extremal events

    DEFF Research Database (Denmark)

    Zhao, Yuwei

    is the extremal periodogram. The extremal periodogram shares numerous asymptotic properties with the periodogram of a linear process in classical time series analysis: the asymptotic distribution of the periodogram ordinates at the Fourier frequencies have a similar form and smoothed versions of the periodogram...

  11. Bernoulli Polynomials, Fourier Series and Zeta Numbers

    DEFF Research Database (Denmark)

    Scheufens, Ernst E

    2013-01-01

    Fourier series for Bernoulli polynomials are used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent...

  12. The Fourier modal method for aperiodic structures

    NARCIS (Netherlands)

    Pisarenco, M.; Maubach, J.M.L.; Setija, I.D.; Mattheij, R.M.M.

    2010-01-01

    This paper extends the area of application of the Fourier modal method from periodic structures to non-periodic ones illuminated under arbitrary angles. This is achieved by placing perfectly matched layers at the lateral boundaries and reformulating the problem in terms of a contrast field.

  13. Euler Polynomials, Fourier Series and Zeta Numbers

    DEFF Research Database (Denmark)

    Scheufens, Ernst E

    2012-01-01

    Fourier series for Euler polynomials is used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent series....

  14. Fourier inversion on a reductive symmetric space

    NARCIS (Netherlands)

    Ban, E.P. van den

    1999-01-01

    Let X be a semisimple symmetric space. In previous papers, [8] and [9], we have dened an explicit Fourier transform for X and shown that this transform is injective on the space C 1 c (X) ofcompactly supported smooth functions on X. In the present paper, which is a continuation of these papers, we

  15. Fractional-Fourier-domain weighted Wigner distribution

    NARCIS (Netherlands)

    Stankovic, L.; Alieva, T.; Bastiaans, M.J.

    2001-01-01

    A fractional-Fourier-domain realization of the weighted Wigner distribution (or S-method), producing auto-terms close to the ones in the Wigner distribution itself, but with reduced cross-terms, is presented. The computational cost of this fractional-domain realization is the same as the

  16. Fourier Series Formalization in ACL2(r

    Directory of Open Access Journals (Sweden)

    Cuong K. Chau

    2015-09-01

    Full Text Available We formalize some basic properties of Fourier series in the logic of ACL2(r, which is a variant of ACL2 that supports reasoning about the real and complex numbers by way of non-standard analysis. More specifically, we extend a framework for formally evaluating definite integrals of real-valued, continuous functions using the Second Fundamental Theorem of Calculus. Our extended framework is also applied to functions containing free arguments. Using this framework, we are able to prove the orthogonality relationships between trigonometric functions, which are the essential properties in Fourier series analysis. The sum rule for definite integrals of indexed sums is also formalized by applying the extended framework along with the First Fundamental Theorem of Calculus and the sum rule for differentiation. The Fourier coefficient formulas of periodic functions are then formalized from the orthogonality relations and the sum rule for integration. Consequently, the uniqueness of Fourier sums is a straightforward corollary. We also present our formalization of the sum rule for definite integrals of infinite series in ACL2(r. Part of this task is to prove the Dini Uniform Convergence Theorem and the continuity of a limit function under certain conditions. A key technique in our proofs of these theorems is to apply the overspill principle from non-standard analysis.

  17. Clifford Fourier transform on vector fields.

    Science.gov (United States)

    Ebling, Julia; Scheuermann, Gerik

    2005-01-01

    Image processing and computer vision have robust methods for feature extraction and the computation of derivatives of scalar fields. Furthermore, interpolation and the effects of applying a filter can be analyzed in detail and can be advantages when applying these methods to vector fields to obtain a solid theoretical basis for feature extraction. We recently introduced the Clifford convolution, which is an extension of the classical convolution on scalar fields and provides a unified notation for the convolution of scalar and vector fields. It has attractive geometric properties that allow pattern matching on vector fields. In image processing, the convolution and the Fourier transform operators are closely related by the convolution theorem and, in this paper, we extend the Fourier transform to include general elements of Clifford Algebra, called multivectors, including scalars and vectors. The resulting convolution and derivative theorems are extensions of those for convolution and the Fourier transform on scalar fields. The Clifford Fourier transform allows a frequency analysis of vector fields and the behavior of vector-valued filters. In frequency space, vectors are transformed into general multivectors of the Clifford Algebra. Many basic vector-valued patterns, such as source, sink, saddle points, and potential vortices, can be described by a few multivectors in frequency space.

  18. Fourier transforms on a semisimple symmetric space

    NARCIS (Netherlands)

    Ban, E.P. van den; Schlichtkrull, H.

    1994-01-01

    Let G=H be a semisimple symmetric space, that is, G is a connected semisimple real Lie group with an involution ?, and H is an open subgroup of the group of xed points for ? in G. The main purpose of this paper is to study an explicit Fourier transform on G=H. In terms of general representation

  19. Fourier transforms on a semisimple symmetric space

    NARCIS (Netherlands)

    Ban, E.P. van den; Carmona, J.; Delorme, P.

    1997-01-01

    Let G=H be a semisimple symmetric space, that is, G is a connected semisimple real Lie group with an involution ?, and H is an open subgroup of the group of xed points for ? in G. The main purpose of this paper is to study an explicit Fourier transform on G=H. In terms of general representation

  20. Double-resolution electron holography with simple Fourier transform of fringe-shifted holograms.

    Science.gov (United States)

    Volkov, V V; Han, M G; Zhu, Y

    2013-11-01

    We propose a fringe-shifting holographic method with an appropriate image wave recovery algorithm leading to exact solution of holographic equations. With this new method the complex object image wave recovered from holograms appears to have much less traditional artifacts caused by the autocorrelation band present practically in all Fourier transformed holograms. The new analytical solutions make possible a double-resolution electron holography free from autocorrelation band artifacts and thus push the limits for phase resolution. The new image wave recovery algorithm uses a popular Fourier solution of the side band-pass filter technique, while the fringe-shifting holographic method is simple to implement in practice. Published by Elsevier B.V.

  1. The fit of an X-ray diffraction profile by Fourier analysis

    International Nuclear Information System (INIS)

    Bourniquel, B.; Feron, J.

    1985-01-01

    The fast Fourier transform algorithm commonly used for line profile analysis requires a list of values of the diffracted intensity with constant sintheta step; raw data are usually obtained at constant 2theta step; to interpolate between the measured values an analytic expression of the profile function is very useful. Statistical estimation is used to fit an analytic function to data; the only assumption made is the continuity of this function and no critical initialization is needed. Three different expressions are used: a Fourier sum for the peak and two polynomials of a suitable variable for the tails; the algorithm provides continuity for the function and its first derivative. Simulated examples using a Lorentzian and a Gaussian function are given and several criteria of goodness of fit are examined. The program runs on a PDP 11/03 digital computer with only 45 kbytes available memory. (orig.)

  2. A new fourth-order Fourier-Bessel split-step method for the extended nonlinear Schroedinger equation

    International Nuclear Information System (INIS)

    Nash, Patrick L.

    2008-01-01

    Fourier split-step techniques are often used to compute soliton-like numerical solutions of the nonlinear Schroedinger equation. Here, a new fourth-order implementation of the Fourier split-step algorithm is described for problems possessing azimuthal symmetry in 3 + 1-dimensions. This implementation is based, in part, on a finite difference approximation Δ perpendicular FDA of 1/r (∂)/(∂r) r(∂)/(∂r) that possesses an associated exact unitary representation of e i/2λΔ perpendicular FDA . The matrix elements of this unitary matrix are given by special functions known as the associated Bessel functions. Hence the attribute Fourier-Bessel for the method. The Fourier-Bessel algorithm is shown to be unitary and unconditionally stable. The Fourier-Bessel algorithm is employed to simulate the propagation of a periodic series of short laser pulses through a nonlinear medium. This numerical simulation calculates waveform intensity profiles in a sequence of planes that are transverse to the general propagation direction, and labeled by the cylindrical coordinate z. These profiles exhibit a series of isolated pulses that are offset from the time origin by characteristic times, and provide evidence for a physical effect that may be loosely termed normal mode condensation. Normal mode condensation is consistent with experimentally observed pulse filamentation into a packet of short bursts, which may occur as a result of short, intense irradiation of a medium

  3. Quantum walks and search algorithms

    CERN Document Server

    Portugal, Renato

    2013-01-01

    This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks. It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next. This book is self-contained with main topics that include: Grover's algorithm, describing its geometrical interpretation and evolution by means of the spectral decomposition of the evolution operater Analytical solutions of quantum walks on important graphs like line, cycles, two-dimensional lattices, and hypercubes using Fourier transforms Quantum walks on generic graphs, describing methods to calculate the limiting d...

  4. Accelerated Compressed Sensing Based CT Image Reconstruction.

    Science.gov (United States)

    Hashemi, SayedMasoud; Beheshti, Soosan; Gill, Patrick R; Paul, Narinder S; Cobbold, Richard S C

    2015-01-01

    In X-ray computed tomography (CT) an important objective is to reduce the radiation dose without significantly degrading the image quality. Compressed sensing (CS) enables the radiation dose to be reduced by producing diagnostic images from a limited number of projections. However, conventional CS-based algorithms are computationally intensive and time-consuming. We propose a new algorithm that accelerates the CS-based reconstruction by using a fast pseudopolar Fourier based Radon transform and rebinning the diverging fan beams to parallel beams. The reconstruction process is analyzed using a maximum-a-posterior approach, which is transformed into a weighted CS problem. The weights involved in the proposed model are calculated based on the statistical characteristics of the reconstruction process, which is formulated in terms of the measurement noise and rebinning interpolation error. Therefore, the proposed method not only accelerates the reconstruction, but also removes the rebinning and interpolation errors. Simulation results are shown for phantoms and a patient. For example, a 512 × 512 Shepp-Logan phantom when reconstructed from 128 rebinned projections using a conventional CS method had 10% error, whereas with the proposed method the reconstruction error was less than 1%. Moreover, computation times of less than 30 sec were obtained using a standard desktop computer without numerical optimization.

  5. Accelerated Compressed Sensing Based CT Image Reconstruction

    Directory of Open Access Journals (Sweden)

    SayedMasoud Hashemi

    2015-01-01

    Full Text Available In X-ray computed tomography (CT an important objective is to reduce the radiation dose without significantly degrading the image quality. Compressed sensing (CS enables the radiation dose to be reduced by producing diagnostic images from a limited number of projections. However, conventional CS-based algorithms are computationally intensive and time-consuming. We propose a new algorithm that accelerates the CS-based reconstruction by using a fast pseudopolar Fourier based Radon transform and rebinning the diverging fan beams to parallel beams. The reconstruction process is analyzed using a maximum-a-posterior approach, which is transformed into a weighted CS problem. The weights involved in the proposed model are calculated based on the statistical characteristics of the reconstruction process, which is formulated in terms of the measurement noise and rebinning interpolation error. Therefore, the proposed method not only accelerates the reconstruction, but also removes the rebinning and interpolation errors. Simulation results are shown for phantoms and a patient. For example, a 512 × 512 Shepp-Logan phantom when reconstructed from 128 rebinned projections using a conventional CS method had 10% error, whereas with the proposed method the reconstruction error was less than 1%. Moreover, computation times of less than 30 sec were obtained using a standard desktop computer without numerical optimization.

  6. Image registration under translation and rotation in two-dimensional planes using Fourier slice theorem.

    Science.gov (United States)

    Pohit, M; Sharma, J

    2015-05-10

    Image recognition in the presence of both rotation and translation is a longstanding problem in correlation pattern recognition. Use of log polar transform gives a solution to this problem, but at a cost of losing the vital phase information from the image. The main objective of this paper is to develop an algorithm based on Fourier slice theorem for measuring the simultaneous rotation and translation of an object in a 2D plane. The algorithm is applicable for any arbitrary object shift for full 180° rotation.

  7. Interferogram conditioning for improved Fourier analysis and application to X-ray phase imaging by grating interferometry.

    Science.gov (United States)

    Montaux-Lambert, Antoine; Mercère, Pascal; Primot, Jérôme

    2015-11-02

    An interferogram conditioning procedure, for subsequent phase retrieval by Fourier demodulation, is presented here as a fast iterative approach aiming at fulfilling the classical boundary conditions imposed by Fourier transform techniques. Interference fringe patterns with typical edge discontinuities were simulated in order to reveal the edge artifacts that classically appear in traditional Fourier analysis, and were consecutively used to demonstrate the correction efficiency of the proposed conditioning technique. Optimization of the algorithm parameters is also presented and discussed. Finally, the procedure was applied to grating-based interferometric measurements performed in the hard X-ray regime. The proposed algorithm enables nearly edge-artifact-free retrieval of the phase derivatives. A similar enhancement of the retrieved absorption and fringe visibility images is also achieved.

  8. Automatic Fourier transform and self-Fourier beams due to parabolic potential

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Yiqi, E-mail: zhangyiqi@mail.xjtu.edu.cn [Key Laboratory for Physical Electronics and Devices of the Ministry of Education & Shaanxi Key Lab of Information Photonic Technique, Xi’an Jiaotong University, Xi’an 710049 (China); Liu, Xing [Key Laboratory for Physical Electronics and Devices of the Ministry of Education & Shaanxi Key Lab of Information Photonic Technique, Xi’an Jiaotong University, Xi’an 710049 (China); Belić, Milivoj R., E-mail: milivoj.belic@qatar.tamu.edu [Science Program, Texas A& M University at Qatar, P.O. Box 23874 Doha (Qatar); Zhong, Weiping [Department of Electronic and Information Engineering, Shunde Polytechnic, Shunde 528300 (China); Petrović, Milan S. [Institute of Physics, P.O. Box 68, 11001 Belgrade (Serbia); Zhang, Yanpeng, E-mail: ypzhang@mail.xjtu.edu.cn [Key Laboratory for Physical Electronics and Devices of the Ministry of Education & Shaanxi Key Lab of Information Photonic Technique, Xi’an Jiaotong University, Xi’an 710049 (China)

    2015-12-15

    We investigate the propagation of light beams including Hermite–Gauss, Bessel–Gauss and finite energy Airy beams in a linear medium with parabolic potential. Expectedly, the beams undergo oscillation during propagation, but quite unexpectedly they also perform automatic Fourier transform, that is, periodic change from the beam to its Fourier transform and back. In addition to oscillation, the finite-energy Airy beams exhibit periodic inversion during propagation. The oscillating period of parity-asymmetric beams is twice that of the parity-symmetric beams. Based on the propagation in parabolic potential, we introduce a class of optically-interesting beams that are self-Fourier beams—that is, the beams whose Fourier transforms are the beams themselves.

  9. Non-rigid registration of tomographic images with Fourier transforms

    International Nuclear Information System (INIS)

    Osorio, Ar; Isoardi, Ra; Mato, G

    2007-01-01

    Spatial image registration of deformable body parts such as thorax and abdomen has important medical applications, but at the same time, it represents an important computational challenge. In this work we propose an automatic algorithm to perform non-rigid registration of tomographic images using a non-rigid model based on Fourier transforms. As a measure of similarity, we use the correlation coefficient, finding that the optimal order of the transformation is n = 3 (36 parameters). We apply this method to a digital phantom and to 7 pairs of patient images corresponding to clinical CT scans. The preliminary results indicate a fairly good agreement according to medical experts, with an average registration error of 2 mm for the case of clinical images. For 2D images (dimensions 512x512), the average running time for the algorithm is 15 seconds using a standard personal computer. Summarizing, we find that intra-modality registration of the abdomen can be achieved with acceptable accuracy for slight deformations and can be extended to 3D with a reasonable execution time

  10. (Anti)symmetric multivariate exponential functions and corresponding Fourier transforms

    International Nuclear Information System (INIS)

    Klimyk, A U; Patera, J

    2007-01-01

    We define and study symmetrized and antisymmetrized multivariate exponential functions. They are defined as determinants and antideterminants of matrices whose entries are exponential functions of one variable. These functions are eigenfunctions of the Laplace operator on the corresponding fundamental domains satisfying certain boundary conditions. To symmetric and antisymmetric multivariate exponential functions there correspond Fourier transforms. There are three types of such Fourier transforms: expansions into the corresponding Fourier series, integral Fourier transforms and multivariate finite Fourier transforms. Eigenfunctions of the integral Fourier transforms are found

  11. Application of the one-dimensional Fourier transform for tracking moving objects in noisy environments

    Science.gov (United States)

    Rajala, S. A.; Riddle, A. N.; Snyder, W. E.

    1983-01-01

    In Riddle and Rajala (1981), an algorithm was presented which operates on an image sequence to identify all sets of pixels having the same velocity. The algorithm operates by performing a transformation in which all pixels with the same two-dimensional velocity map to a peak in a transform space. The transform can be decomposed into applications of the one-dimensional Fourier transform and therefore can gain from the computational advantages of the FFT. The aim of this paper is the concern with the fundamental limitations of that algorithm, particularly as relates to its sensitivity to image-disturbing parameters as noise, jitter, and clutter. A modification to the algorithm is then proposed which increases its robustness in the presence of these disturbances.

  12. Fourier analysis of parallel inexact Block-Jacobi splitting with transport synthetic acceleration in slab geometry

    International Nuclear Information System (INIS)

    Rosa, M.; Warsa, J. S.; Chang, J. H.

    2006-01-01

    A Fourier analysis is conducted for the discrete-ordinates (SN) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) and Richardson iteration preconditioned with Transport Synthetic Acceleration (TSA), using the Parallel Block-Jacobi (PBJ) algorithm. Both 'traditional' TSA (TTSA) and a 'modified' TSA (MTSA), in which only the scattering in the low order equations is reduced by some non-negative factor β and < 1, are considered. The results for the un-accelerated algorithm show that convergence of the PBJ algorithm can degrade. The PBJ algorithm with TTSA can be effective provided the β parameter is properly tuned for a given scattering ratio c, but is potentially unstable. Compared to TTSA, MTSA is less sensitive to the choice of β, more effective for the same computational effort (c'), and it is unconditionally stable. (authors)

  13. Efficiency of free-energy calculations of spin lattices by spectral quantum algorithms

    International Nuclear Information System (INIS)

    Master, Cyrus P.; Yamaguchi, Fumiko; Yamamoto, Yoshihisa

    2003-01-01

    Ensemble quantum algorithms are well suited to calculate estimates of the energy spectra for spin-lattice systems. Based on the phase estimation algorithm, these algorithms efficiently estimate discrete Fourier coefficients of the density of states. Their efficiency in calculating the free energy per spin of general spin lattices to bounded error is examined. We find that the number of Fourier components required to bound the error in the free energy due to the broadening of the density of states scales polynomially with the number of spins in the lattice. However, the precision with which the Fourier components must be calculated is found to be an exponential function of the system size

  14. Fourier analysis: from cloaking to imaging

    Science.gov (United States)

    Wu, Kedi; Cheng, Qiluan; Wang, Guo Ping

    2016-04-01

    Regarding invisibility cloaks as an optical imaging system, we present a Fourier approach to analytically unify both Pendry cloaks and complementary media-based invisibility cloaks into one kind of cloak. By synthesizing different transfer functions, we can construct different devices to realize a series of interesting functions such as hiding objects (events), creating illusions, and performing perfect imaging. In this article, we give a brief review on recent works of applying Fourier approach to analysis invisibility cloaks and optical imaging through scattering layers. We show that, to construct devices to conceal an object, no constructive materials with extreme properties are required, making most, if not all, of the above functions realizable by using naturally occurring materials. As instances, we experimentally verify a method of directionally hiding distant objects and create illusions by using all-dielectric materials, and further demonstrate a non-invasive method of imaging objects completely hidden by scattering layers.

  15. Fourier analysis: from cloaking to imaging

    International Nuclear Information System (INIS)

    Wu, Kedi; Ping Wang, Guo; Cheng, Qiluan

    2016-01-01

    Regarding invisibility cloaks as an optical imaging system, we present a Fourier approach to analytically unify both Pendry cloaks and complementary media-based invisibility cloaks into one kind of cloak. By synthesizing different transfer functions, we can construct different devices to realize a series of interesting functions such as hiding objects (events), creating illusions, and performing perfect imaging. In this article, we give a brief review on recent works of applying Fourier approach to analysis invisibility cloaks and optical imaging through scattering layers. We show that, to construct devices to conceal an object, no constructive materials with extreme properties are required, making most, if not all, of the above functions realizable by using naturally occurring materials. As instances, we experimentally verify a method of directionally hiding distant objects and create illusions by using all-dielectric materials, and further demonstrate a non-invasive method of imaging objects completely hidden by scattering layers. (review)

  16. Multichannel Dynamic Fourier-Transform IR Spectrometer

    Science.gov (United States)

    Balashov, A. A.; Vaguine, V. A.; Golyak, Il. S.; Morozov, A. N.; Khorokhorin, A. I.

    2017-09-01

    A design of a multichannel continuous scan Fourier-transform IR spectrometer for simultaneous recording and analysis of the spectral characteristics of several objects is proposed. For implementing the design, a multi-probe fiber is used, constructed from several optical fibers connected into a single optical connector and attached at the output of the interferometer. The Fourier-transform spectrometer is used as a signal modulator. Each fiber is individually mated with an investigated sample and a dedicated radiation detector. For the developed system, the radiation intensity of the spectrometer is calculated from the condition of the minimum spectral resolution and parameters of the optical fibers. Using the proposed design, emission spectra of a gas-discharge neon lamp have been recorded using a single fiber 1 mm in diameter with a numerical aperture NA = 0.22.

  17. Discrete Fourier transform in nanostructures using scattering

    International Nuclear Information System (INIS)

    Leuenberger, Michael N.; Flatte, Michael E.; Loss, Daniel; Awschalom, D.D.

    2004-01-01

    In this article, we show that the discrete Fourier transform (DFT) can be performed by scattering a coherent particle or laser beam off an electrically controllable two-dimensional (2D) potential that has the shape of rings or peaks. After encoding the initial vector into the two-dimensional potential by means of electric gates, the Fourier-transformed vector can be read out by detectors surrounding the potential. The wavelength of the laser beam determines the necessary accuracy of the 2D potential, which makes our method very fault-tolerant. Since the time to perform the DFT is much smaller than the clock cycle of today's computers, our proposed device performs DFTs at the frequency of the computer clock speed

  18. The PROSAIC Laplace and Fourier Transform

    International Nuclear Information System (INIS)

    Smith, G.A.

    1994-01-01

    Integral Transform methods play an extremely important role in many branches of science and engineering. The ease with which many problems may be solved using these techniques is well known. In Electrical Engineering especially, Laplace and Fourier Transforms have been used for a long time as a way to change the solution of differential equations into trivial algebraic manipulations or to provide alternate representations of signals and data. These techniques, while seemingly overshadowed by today's emphasis on digital analysis, still form an invaluable basis in the understanding of systems and circuits. A firm grasp of the practical aspects of these subjects provides valuable conceptual tools. This tutorial paper is a review of Laplace and Fourier Transforms from an applied perspective with an emphasis on engineering applications. The interrelationship of the time and frequency domains will be stressed, in an attempt to comfort those who, after living so much of their lives in the time domain, find thinking in the frequency domain disquieting

  19. Fourier transform of momentum distribution in vanadium

    International Nuclear Information System (INIS)

    Singh, A.K.; Manuel, A.A.; Peter, M.; Singru, R.M.

    1985-01-01

    Experimental Compton profile and 2D-angular correlation of positron annihilation radiation data from vanadium are analyzed by the mean of their Fourier transform. They are compared with the functions calculated with the help of both the linear muffin-tin orbital and the Hubbard-Mijnarends band structure methods. The results show that the functions are influenced by the positron wave function, by the e + -e - many-body correlations and by the differences in the electron wave functions used for the band structure calculations. It is concluded that Fourier analysis is a sensitive approach to investigate the momentum distributions in transition metals and to understnad the effects of the positron. (Auth.)

  20. Correcting sample drift using Fourier harmonics.

    Science.gov (United States)

    Bárcena-González, G; Guerrero-Lebrero, M P; Guerrero, E; Reyes, D F; Braza, V; Yañez, A; Nuñez-Moraleda, B; González, D; Galindo, P L

    2018-07-01

    During image acquisition of crystalline materials by high-resolution scanning transmission electron microscopy, the sample drift could lead to distortions and shears that hinder their quantitative analysis and characterization. In order to measure and correct this effect, several authors have proposed different methodologies making use of series of images. In this work, we introduce a methodology to determine the drift angle via Fourier analysis by using a single image based on the measurements between the angles of the second Fourier harmonics in different quadrants. Two different approaches, that are independent of the angle of acquisition of the image, are evaluated. In addition, our results demonstrate that the determination of the drift angle is more accurate by using the measurements of non-consecutive quadrants when the angle of acquisition is an odd multiple of 45°. Copyright © 2018 Elsevier Ltd. All rights reserved.

  1. Fourier evaluation of broad Moessbauer spectra

    International Nuclear Information System (INIS)

    Vincze, I.

    1981-01-01

    It is shown by the Fourier analysis of broad Moessbauer spectra that the even part of the distribution of the dominant hyperfine interaction (hyperfine field or quadrupole splitting) can be obtained directly without using least-square fitting procedures. Also the odd part of this distribution correlated with other hyperfine parameters (e.g. isomer shift) can be directly determined. Examples for amorphous magnetic and paramagnetic iron-based alloys are presented. (author)

  2. Fourier evaluation of broad Moessbauer spectra

    International Nuclear Information System (INIS)

    Vincze, I.

    1981-09-01

    It is shown by the Fourier analysis of broad Moessbauer spectra that the even part of the distribution of the dominant hyperfine interaction (hyperfine field or quadrupole splitting) can be obtained directly without using least-square fitting procedures. Also the odd part of this distribution correlated with other hyperfine parameters (e.g. isomer shift) can be directly determined. Examples covering the case of amorphous magnetic and paramagnetic iron-based alloys are presented. (author)

  3. Fourier Transform Spectrometer Controller for Partitioned Architectures

    DEFF Research Database (Denmark)

    Tamas-Selicean, Domitian; Keymeulen, D.; Berisford, D.

    2013-01-01

    The current trend in spacecraft computing is to integrate applications of different criticality levels on the same platform using no separation. This approach increases the complexity of the development, verification and integration processes, with an impact on the whole system life cycle. Resear......, such as avionics and automotive. In this paper we investigate the challenges of developing and the benefits of integrating a scientific instrument, namely a Fourier Transform Spectrometer, in such a partitioned architecture....

  4. A Fourier analysis of extreme events

    DEFF Research Database (Denmark)

    Mikosch, Thomas Valentin; Zhao, Yuwei

    2014-01-01

    The extremogram is an asymptotic correlogram for extreme events constructed from a regularly varying stationary sequence. In this paper, we define a frequency domain analog of the correlogram: a periodogram generated from a suitable sequence of indicator functions of rare events. We derive basic ...... properties of the periodogram such as the asymptotic independence at the Fourier frequencies and use this property to show that weighted versions of the periodogram are consistent estimators of a spectral density derived from the extremogram....

  5. Sets of Fourier coefficients using numerical quadrature

    International Nuclear Information System (INIS)

    Lyness, J. N.

    2001-01-01

    One approach to the calculation of Fourier trigonometric coefficients f(r) of a given function f(x) is to apply the trapezoidal quadrature rule to the integral representation f(r)=(line i ntegral)(sub 0)(sup 1) f(x)e(sup -2(pi)irx)dx. Some of the difficulties in this approach are discussed. A possible way of overcoming many of these is by means of a subtraction function. Thus, one sets f(x)= h(sub p-1)(x)+ g(sub p)(x), where h(sub -1)(x) is an algebraic polynomial of degree p-1, specified in such a way that the Fourier series of g(sub p)(x) converges more rapidly than that of f(x). To obtain the Fourier coefficients of f(x), one uses an analytic expression for those of h(sub p-1)(x) and numerical quadrature to approximately those of g(sub p)(x)

  6. The derivative-free Fourier shell identity for photoacoustics.

    Science.gov (United States)

    Baddour, Natalie

    2016-01-01

    In X-ray tomography, the Fourier slice theorem provides a relationship between the Fourier components of the object being imaged and the measured projection data. The Fourier slice theorem is the basis for X-ray Fourier-based tomographic inversion techniques. A similar relationship, referred to as the 'Fourier shell identity' has been previously derived for photoacoustic applications. However, this identity relates the pressure wavefield data function and its normal derivative measured on an arbitrary enclosing aperture to the three-dimensional Fourier transform of the enclosed object evaluated on a sphere. Since the normal derivative of pressure is not normally measured, the applicability of the formulation is limited in this form. In this paper, alternative derivations of the Fourier shell identity in 1D, 2D polar and 3D spherical polar coordinates are presented. The presented formulations do not require the normal derivative of pressure, thereby lending the formulas directly adaptable for Fourier based absorber reconstructions.

  7. Fourier correction for spatially variant collimator blurring in SPECT

    International Nuclear Information System (INIS)

    Xia, W.; Lewitt, R.M.; Edholm, P.R.

    1995-01-01

    In single-photon emission computed tomography (SPECT), projection data are acquired by rotating the photon detector around a patient, either in a circular orbit or in a noncircular orbit. The projection data of the desired spatial distribution of emission activity is blurred by the point-response function of the collimator that is used to define the range of directions of gamma-ray photons reaching the detector. The point-response function of the collimator is not spatially stationary, but depends on the distance from the collimator to the point. Conventional methods for deblurring collimator projection data are based on approximating the actual distance-dependent point-response function by a spatially invariant blurring function, so that deconvolution methods can be applied independently to the data at each angle of view. A method is described in this paper for distance-dependent preprocessing of SPECT projection data prior to image reconstruction. Based on the special distance-dependent characteristics of the Fourier coefficients of the sinogram, a spatially variant inverse filter can be developed to process the projection data in all views simultaneously. The algorithm is first derived from fourier analysis of the projection data from the circular orbit geometry. For circular orbit projection data, experimental results from both simulated data and real phantom data indicate the potential of this method. It is shown that the spatial filtering method can be extended to the projection data from the noncircular orbit geometry. Experiments on simulated projection data from an elliptical orbit demonstrate correction of the spatially variant blurring and distortion in the reconstructed image caused by the noncircular orbit geometry

  8. Fourier transform methods for calculating action variables and semiclassical eigenvalues for coupled oscillator systems

    International Nuclear Information System (INIS)

    Eaker, C.W.; Schatz, G.C.; De Leon, N.; Heller, E.J.

    1984-01-01

    Two methods for calculating the good action variables and semiclassical eigenvalues for coupled oscillator systems are presented, both of which relate the actions to the coefficients appearing in the Fourier representation of the normal coordinates and momenta. The two methods differ in that one is based on the exact expression for the actions together with the EBK semiclassical quantization condition while the other is derived from the Sorbie--Handy (SH) approximation to the actions. However, they are also very similar in that the actions in both methods are related to the same set of Fourier coefficients and both require determining the perturbed frequencies in calculating actions. These frequencies are also determined from the Fourier representations, which means that the actions in both methods are determined from information entirely contained in the Fourier expansion of the coordinates and momenta. We show how these expansions can very conveniently be obtained from fast Fourier transform (FFT) methods and that numerical filtering methods can be used to remove spurious Fourier components associated with the finite trajectory integration duration. In the case of the SH based method, we find that the use of filtering enables us to relax the usual periodicity requirement on the calculated trajectory. Application to two standard Henon--Heiles models is considered and both are shown to give semiclassical eigenvalues in good agreement with previous calculations for nondegenerate and 1:1 resonant systems. In comparing the two methods, we find that although the exact method is quite general in its ability to be used for systems exhibiting complex resonant behavior, it converges more slowly with increasing trajectory integration duration and is more sensitive to the algorithm for choosing perturbed frequencies than the SH based method

  9. Fourier spectral simulations for wake fields in conducting cavities

    International Nuclear Information System (INIS)

    Min, M.; Chin, Y.-H.; Fischer, P.F.; Chae, Y.-Chul; Kim, K.-J.

    2007-01-01

    We investigate Fourier spectral time-domain simulations applied to wake field calculations in two-dimensional cylindrical structures. The scheme involves second-order explicit leap-frogging in time and Fourier spectral approximation in space, which is obtained from simply replacing the spatial differentiation operator of the YEE scheme by the Fourier differentiation operator on nonstaggered grids. This is a first step toward investigating high-order computational techniques with the Fourier spectral method, which is relatively simple to implement.

  10. A Note on Fourier and the Greenhouse Effect

    OpenAIRE

    Postma, Joseph E.

    2015-01-01

    Joseph Fourier's discovery of the greenhouse effect is discussed and is compared to the modern conception of the greenhouse effect. It is confirmed that what Fourier discovered is analogous to the modern concept of the greenhouse effect. However, the modern concept of the greenhouse effect is found to be based on a paradoxical analogy to Fourier's greenhouse work and so either Fourier's greenhouse work, the modern conception of the greenhouse effect, or the modern definition of heat is incorr...

  11. Hyperbolic Cross Truncations for Stochastic Fourier Cosine Series

    Science.gov (United States)

    Zhang, Zhihua

    2014-01-01

    Based on our decomposition of stochastic processes and our asymptotic representations of Fourier cosine coefficients, we deduce an asymptotic formula of approximation errors of hyperbolic cross truncations for bivariate stochastic Fourier cosine series. Moreover we propose a kind of Fourier cosine expansions with polynomials factors such that the corresponding Fourier cosine coefficients decay very fast. Although our research is in the setting of stochastic processes, our results are also new for deterministic functions. PMID:25147842

  12. Optimal Padding for the Two-Dimensional Fast Fourier Transform

    Science.gov (United States)

    Dean, Bruce H.; Aronstein, David L.; Smith, Jeffrey S.

    2011-01-01

    One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that

  13. Versatility of the CFR algorithm for limited angle reconstruction

    International Nuclear Information System (INIS)

    Fujieda, I.; Heiskanen, K.; Perez-Mendez, V.

    1990-01-01

    The constrained Fourier reconstruction (CFR) algorithm and the iterative reconstruction-reprojection (IRR) algorithm are evaluated based on their accuracy for three types of limited angle reconstruction problems. The cFR algorithm performs better for problems such as Xray CT imaging of a nuclear reactor core with one large data gap due to structural blocking of the source and detector pair. For gated heart imaging by Xray CT, radioisotope distribution imaging by PET or SPECT, using a polygonal array of gamma cameras with insensitive gaps between camera boundaries, the IRR algorithm has a slight advantage over the CFR algorithm but the difference is not significant

  14. Some Applications of Fourier's Great Discovery for Beginners

    Science.gov (United States)

    Kraftmakher, Yaakov

    2012-01-01

    Nearly two centuries ago, Fourier discovered that any periodic function of period T can be presented as a sum of sine waveforms of frequencies equal to an integer times the fundamental frequency [omega] = 2[pi]/T (Fourier's series). It is impossible to overestimate the importance of Fourier's discovery, and all physics or engineering students…

  15. Fourier Transforms Simplified: Computing an Infrared Spectrum from an Interferogram

    Science.gov (United States)

    Hanley, Quentin S.

    2012-01-01

    Fourier transforms are used widely in chemistry and allied sciences. Examples include infrared, nuclear magnetic resonance, and mass spectroscopies. A thorough understanding of Fourier methods assists the understanding of microscopy, X-ray diffraction, and diffraction gratings. The theory of Fourier transforms has been presented in this "Journal",…

  16. A Fourier-based compressed sensing technique for accelerated CT image reconstruction using first-order methods

    International Nuclear Information System (INIS)

    Choi, Kihwan; Li, Ruijiang; Nam, Haewon; Xing, Lei

    2014-01-01

    As a solution to iterative CT image reconstruction, first-order methods are prominent for the large-scale capability and the fast convergence rate O(1/k 2 ). In practice, the CT system matrix with a large condition number may lead to slow convergence speed despite the theoretically promising upper bound. The aim of this study is to develop a Fourier-based scaling technique to enhance the convergence speed of first-order methods applied to CT image reconstruction. Instead of working in the projection domain, we transform the projection data and construct a data fidelity model in Fourier space. Inspired by the filtered backprojection formalism, the data are appropriately weighted in Fourier space. We formulate an optimization problem based on weighted least-squares in the Fourier space and total-variation (TV) regularization in image space for parallel-beam, fan-beam and cone-beam CT geometry. To achieve the maximum computational speed, the optimization problem is solved using a fast iterative shrinkage-thresholding algorithm with backtracking line search and GPU implementation of projection/backprojection. The performance of the proposed algorithm is demonstrated through a series of digital simulation and experimental phantom studies. The results are compared with the existing TV regularized techniques based on statistics-based weighted least-squares as well as basic algebraic reconstruction technique. The proposed Fourier-based compressed sensing (CS) method significantly improves both the image quality and the convergence rate compared to the existing CS techniques. (paper)

  17. A Fourier-based compressed sensing technique for accelerated CT image reconstruction using first-order methods.

    Science.gov (United States)

    Choi, Kihwan; Li, Ruijiang; Nam, Haewon; Xing, Lei

    2014-06-21

    As a solution to iterative CT image reconstruction, first-order methods are prominent for the large-scale capability and the fast convergence rate [Formula: see text]. In practice, the CT system matrix with a large condition number may lead to slow convergence speed despite the theoretically promising upper bound. The aim of this study is to develop a Fourier-based scaling technique to enhance the convergence speed of first-order methods applied to CT image reconstruction. Instead of working in the projection domain, we transform the projection data and construct a data fidelity model in Fourier space. Inspired by the filtered backprojection formalism, the data are appropriately weighted in Fourier space. We formulate an optimization problem based on weighted least-squares in the Fourier space and total-variation (TV) regularization in image space for parallel-beam, fan-beam and cone-beam CT geometry. To achieve the maximum computational speed, the optimization problem is solved using a fast iterative shrinkage-thresholding algorithm with backtracking line search and GPU implementation of projection/backprojection. The performance of the proposed algorithm is demonstrated through a series of digital simulation and experimental phantom studies. The results are compared with the existing TV regularized techniques based on statistics-based weighted least-squares as well as basic algebraic reconstruction technique. The proposed Fourier-based compressed sensing (CS) method significantly improves both the image quality and the convergence rate compared to the existing CS techniques.

  18. Application of Fractional Fourier Transform to Moving Target Indication via Along-Track Interferometry

    Directory of Open Access Journals (Sweden)

    Chiu Shen

    2005-01-01

    Full Text Available A relatively unknown yet powerful technique, the so-called fractional Fourier transform (FrFT, is applied to SAR along-track interferometry (SAR-ATI in order to estimate moving target parameters. By mapping a target's signal onto a fractional Fourier axis, the FrFT permits a constant-velocity target to be focused in the fractional Fourier domain thereby affording orders of magnitude improvement in SCR. Moving target velocity and position parameters are derived and expressed in terms of an optimum fractional angle and a measured fractional Fourier position , allowing a target to be accurately repositioned and its velocity components computed without actually forming an SAR image. The new estimation algorithm is compared with the matched filter bank approach, showing some of the advantages of the FrFT method. The proposed technique is applied to the data acquired by the two-aperture CV580 airborne radar system configured in its along-track mode. Results show that the method is effective in estimating target velocity and position parameters.

  19. Image/patient registration from (partial) projection data by the Fourier phase matching method

    International Nuclear Information System (INIS)

    Weiguo Lu; You, J.

    1999-01-01

    A technique for 2D or 3D image/patient registration, PFPM (projection based Fourier phase matching method), is proposed. This technique provides image/patient registration directly from sequential tomographic projection data. The method can also deal with image files by generating 2D Radon transforms slice by slice. The registration in projection space is done by calculating a Fourier invariant (FI) descriptor for each one-dimensional projection datum, and then registering the FI descriptor by the Fourier phase matching (FPM) method. The algorithm has been tested on both synthetic and experimental data. When dealing with translated, rotated and uniformly scaled 2D image registration, the performance of the PFPM method is comparable to that of the IFPM (image based Fourier phase matching) method in robustness, efficiency, insensitivity to the offset between images, and registration time. The advantages of the former are that subpixel resolution is feasible, and it is more insensitive to image noise due to the averaging effect of the projection acquisition. Furthermore, the PFPM method offers the ability to generalize to 3D image/patient registration and to register partial projection data. By applying patient registration directly from tomographic projection data, image reconstruction is not needed in the therapy set-up verification, thus reducing computational time and artefacts. In addition, real time registration is feasible. Registration from partial projection data meets the geometry and dose requirements in many application cases and makes dynamic set-up verification possible in tomotherapy. (author)

  20. A new method to cluster genomes based on cumulative Fourier power spectrum.

    Science.gov (United States)

    Dong, Rui; Zhu, Ziyue; Yin, Changchuan; He, Rong L; Yau, Stephen S-T

    2018-06-20

    Analyzing phylogenetic relationships using mathematical methods has always been of importance in bioinformatics. Quantitative research may interpret the raw biological data in a precise way. Multiple Sequence Alignment (MSA) is used frequently to analyze biological evolutions, but is very time-consuming. When the scale of data is large, alignment methods cannot finish calculation in reasonable time. Therefore, we present a new method using moments of cumulative Fourier power spectrum in clustering the DNA sequences. Each sequence is translated into a vector in Euclidean space. Distances between the vectors can reflect the relationships between sequences. The mapping between the spectra and moment vector is one-to-one, which means that no information is lost in the power spectra during the calculation. We cluster and classify several datasets including Influenza A, primates, and human rhinovirus (HRV) datasets to build up the phylogenetic trees. Results show that the new proposed cumulative Fourier power spectrum is much faster and more accurately than MSA and another alignment-free method known as k-mer. The research provides us new insights in the study of phylogeny, evolution, and efficient DNA comparison algorithms for large genomes. The computer programs of the cumulative Fourier power spectrum are available at GitHub (https://github.com/YaulabTsinghua/cumulative-Fourier-power-spectrum). Copyright © 2018. Published by Elsevier B.V.

  1. Large quantum Fourier transforms are never exactly realized by braiding conformal blocks

    International Nuclear Information System (INIS)

    Freedman, Michael H.; Wang, Zhenghan

    2007-01-01

    Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set {U(2), controlled-NOT}, the discrete Fourier transforms F N =(ω ij ) NxN , i,j=0,1,...,N-1, ω=e 2πi at ∼sol∼ at N , can be realized exactly by quantum circuits of size O(n 2 ), n=ln N, and so can the discrete sine or cosine transforms. In topological quantum computing, the simplest universal topological quantum computer is based on the Fibonacci (2+1)-topological quantum field theory (TQFT), where the standard quantum circuits are replaced by unitary transformations realized by braiding conformal blocks. We report here that the large Fourier transforms F N and the discrete sine or cosine transforms can never be realized exactly by braiding conformal blocks for a fixed TQFT. It follows that an approximation is unavoidable in the implementation of Fourier transforms by braiding conformal blocks

  2. Cone-beam and fan-beam image reconstruction algorithms based on spherical and circular harmonics

    International Nuclear Information System (INIS)

    Zeng, Gengsheng L; Gullberg, Grant T

    2004-01-01

    A cone-beam image reconstruction algorithm using spherical harmonic expansions is proposed. The reconstruction algorithm is in the form of a summation of inner products of two discrete arrays of spherical harmonic expansion coefficients at each cone-beam point of acquisition. This form is different from the common filtered backprojection algorithm and the direct Fourier reconstruction algorithm. There is no re-sampling of the data, and spherical harmonic expansions are used instead of Fourier expansions. As a special case, a new fan-beam image reconstruction algorithm is also derived in terms of a circular harmonic expansion. Computer simulation results for both cone-beam and fan-beam algorithms are presented for circular planar orbit acquisitions. The algorithms give accurate reconstructions; however, the implementation of the cone-beam reconstruction algorithm is computationally intensive. A relatively efficient algorithm is proposed for reconstructing the central slice of the image when a circular scanning orbit is used

  3. Alternating multivariate trigonometric functions and corresponding Fourier transforms

    International Nuclear Information System (INIS)

    Klimyk, A U; Patera, J

    2008-01-01

    We define and study multivariate sine and cosine functions, symmetric with respect to the alternating group A n , which is a subgroup of the permutation (symmetric) group S n . These functions are eigenfunctions of the Laplace operator. They determine Fourier-type transforms. There exist three types of such transforms: expansions into corresponding sine-Fourier and cosine-Fourier series, integral sine-Fourier and cosine-Fourier transforms, and multivariate finite sine and cosine transforms. In all these transforms, alternating multivariate sine and cosine functions are used as a kernel

  4. Validation of Fourier analysis of videokeratographic data.

    Science.gov (United States)

    Sideroudi, Haris; Labiris, Georgios; Ditzel, Fienke; Tsaragli, Efi; Georgatzoglou, Kimonas; Siganos, Haralampos; Kozobolis, Vassilios

    2017-06-15

    The aim was to assess the repeatability of Fourier transfom analysis of videokeratographic data using Pentacam in normal (CG), keratoconic (KC) and post-CXL (CXL) corneas. This was a prospective, clinic-based, observational study. One randomly selected eye from all study participants was included in the analysis: 62 normal eyes (CG group), 33 keratoconus eyes (KC group), while 34 eyes, which had already received CXL treatment, formed the CXL group. Fourier analysis of keratometric data were obtained using Pentacam, by two different operators within each of two sessions. Precision, repeatability and Intraclass Correlation Coefficient (ICC), were calculated for evaluating intrassesion and intersession repeatability for the following parameters: Spherical Component (SphRmin, SphEcc), Maximum Decentration (Max Dec), Regular Astigmatism, and Irregularitiy (Irr). Bland-Altman analysis was used for assessing interobserver repeatability. All parameters were presented to be repeatable, reliable and reproductible in all groups. Best intrasession and intersession repeatability and reliability were detected for parameters SphRmin, SphEcc and Max Dec parameters for both operators using ICC (intrasession: ICC > 98%, intersession: ICC > 94.7%) and within subject standard deviation. Best precision and lowest range of agreement was found for the SphRmin parameter (CG: 0.05, KC: 0.16, and CXL: 0.2) in all groups, while the lowest repeatability, reliability and reproducibility was detected for the Irr parameter. The Pentacam system provides accurate measurements of Fourier tranform keratometric data. A single Pentacam scan will be sufficient for most clinical applications.

  5. Fourier optics treatment of classical relativistic electrodynamics

    Energy Technology Data Exchange (ETDEWEB)

    Geloni, G.; Saldin, E.; Schneidmiller, E.; Yurkov, M.

    2006-08-15

    In this paper we couple Synchrotron Radiation (SR) theory with a branch of physical optics, namely laser beam optics. We show that the theory of laser beams is successful in characterizing radiation fields associated with any SR source. Both radiation beam generated by an ultra-relativistic electron in a magnetic device and laser beam are solutions of the wave equation based on paraxial approximation. It follows that they are similar in all aspects. In the space-frequency domain SR beams appear as laser beams whose transverse extents are large compared with the wavelength. In practical solutions (e.g. undulator, bending magnet sources), radiation beams exhibit a virtual ''waist'' where the wavefront is often plane. Remarkably, the field distribution of a SR beam across the waist turns out to be strictly related with the inverse Fourier transform of the far-field angle distribution. Then, we take advantage of standard Fourier Optics techniques and apply the Fresnel propagation formula to characterize the SR beam. Altogether, we show that it is possible to reconstruct the near-field distribution of the SR beam outside the magnetic setup from the knowledge of the far-field pattern. The general theory of SR in the near-zone developed in this paper is illustrated for the special cases of undulator radiation, edge radiation and transition undulator radiation. Using known analytical formulas for the far-field pattern and its inverse Fourier transform we find analytical expressions for near-field distributions in terms of far-field distributions. Finally, we compare these expressions with incorrect or incomplete literature. (orig.)

  6. Algorithmic alternatives

    International Nuclear Information System (INIS)

    Creutz, M.

    1987-11-01

    A large variety of Monte Carlo algorithms are being used for lattice gauge simulations. For purely bosonic theories, present approaches are generally adequate; nevertheless, overrelaxation techniques promise savings by a factor of about three in computer time. For fermionic fields the situation is more difficult and less clear. Algorithms which involve an extrapolation to a vanishing step size are all quite closely related. Methods which do not require such an approximation tend to require computer time which grows as the square of the volume of the system. Recent developments combining global accept/reject stages with Langevin or microcanonical updatings promise to reduce this growth to V/sup 4/3/

  7. Combinatorial algorithms

    CERN Document Server

    Hu, T C

    2002-01-01

    Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

  8. Fourier transforms in the complex domain

    CERN Document Server

    Wiener, N

    1934-01-01

    With the aid of Fourier-Mellin transforms as a tool in analysis, the authors were able to attack such diverse analytic questions as those of quasi-analytic functions, Mercer's theorem on summability, Milne's integral equation of radiative equilibrium, the theorems of Münz and Szász concerning the closure of sets of powers of an argument, Titchmarsh's theory of entire functions of semi-exponential type with real negative zeros, trigonometric interpolation and developments in polynomials of the form \\sum^N_1A_ne^{i\\lambda_nx}, lacunary series, generalized harmonic analysis in the complex domain,

  9. Analog fourier transform channelizer and OFDM receiver

    OpenAIRE

    2007-01-01

    An OFDM receiver having an analog multiplier based I-Q channelizing filter, samples and holds consecutive analog I-Q samples of an I-Q baseband, the I-Q basebands having OFDM sub-channels. A lattice of analog I-Q multipliers and analog I-Q summers concurrently receives the held analog I-Q samples, performs analog I-Q multiplications and analog I-Q additions to concurrently generate a plurality of analog I-Q output signals, representing an N-point discrete Fourier transform of the held analog ...

  10. Fourier-Mukai, 34 years on

    Science.gov (United States)

    Bruzzo, Ugo; Maciocia, Antony

    2017-12-01

    This special issue celebrates the 34 years since the discovery of the Fourier-Mukai Transform by Shigeru Mukai. It mostly contains papers presented at the conference held in the Mathematics Research Centre of the University of Warwick, 15th to 19th June 2015 as part of a year long Warwick symposium on Derived categories and applications. The conference was also the annual conference of the Vector Bundles on Algebraic Curves series led by Peter Newstead. The symposium was principally supported by the Engineering and Physical Sciences Research Council of the UK and there was further funding from the London Mathematical Society and the Foundation Compositio.

  11. Noise figure of amplified dispersive Fourier transformation

    International Nuclear Information System (INIS)

    Goda, Keisuke; Jalali, Bahram

    2010-01-01

    Amplified dispersive Fourier transformation (ADFT) is a powerful tool for fast real-time spectroscopy as it overcomes the limitations of traditional optical spectrometers. ADFT maps the spectrum of an optical pulse into a temporal waveform using group-velocity dispersion and simultaneously amplifies it in the optical domain. It greatly simplifies spectroscopy by replacing the diffraction grating and detector array in the conventional spectrometer with a dispersive fiber and single-pixel photodetector, enabling ultrafast real-time spectroscopic measurements. Following our earlier work on the theory of ADFT, here we study the effect of noise on ADFT. We derive the noise figure of ADFT and discuss its dependence on various parameters.

  12. Fourier transform infrared spectroscopy of peptides.

    Science.gov (United States)

    Bakshi, Kunal; Liyanage, Mangala R; Volkin, David B; Middaugh, C Russell

    2014-01-01

    Fourier transform infrared (FTIR) spectroscopy provides data that are widely used for secondary structure characterization of peptides. A wide array of available sampling methods permits structural analysis of peptides in diverse environments such as aqueous solution (including optically turbid media), powders, detergent micelles, and lipid bilayers. In some cases, side chain vibrations can also be resolved and used for tertiary structure and chemical analysis. Data from several low-resolution spectroscopic techniques, including FTIR, can be combined to generate an empirical phase diagram, an overall picture of peptide structure as a function of environmental conditions that can aid in the global interpretation of large amounts of spectroscopic data.

  13. Functional Fourier transforms and the loop equation

    International Nuclear Information System (INIS)

    Bershadskii, M.A.; Vaisburd, I.D.; Migdal, A.A.

    1986-01-01

    The Migdal-Makeenko momentum-space loop equation is investigated. This equation is derived from the ordinary loop equation by taking the Fourier transform of the Wilson functional. A perturbation theory is constructed for the new equation and it is proved that the action of the loop operator is determined by vertex functions which coincide with those of the previous equation. It is shown how the ghost loop arises in direct iterations of the momentum-space equation with respect to the coupling constant. A simple example is used to illustrate the mechanism of appearance of an integration in the interior loops in transition to observables

  14. Fourier transform spectroscopy of six stars

    Energy Technology Data Exchange (ETDEWEB)

    Mendoza V, E E [Universidad Nacional Autonoma de Mexico, Mexico City. Inst. de Astronomia

    1981-01-01

    This paper outlines results from a digital analysis of the Fourier transform spectroscopy of six stars: ..sigma.. Aur, rho Ori, ..cap alpha.. Lyr, zeta Aql and ..cap alpha.. Cyg. Nearly 1200 different spectral lines have been identified in the spectra of these six stars in the wavelength interval 4800-10200 A where the spectra are of very high quality, less than the one per cent level of noise versus signal. ..cap alpha.. Lyr and ..cap alpha.. Cyg show spectral line and profile variations easily seen in their spectra.

  15. Generalized Fourier transforms Fk,a

    DEFF Research Database (Denmark)

    Salem, Ben Said; Kobayashi, Toshiyuki; Ørsted, Bent

    2009-01-01

    We construct a two-parameter family of actions ωk,a of the Lie algebra by differential-difference operators on . Here, k is a multiplicity-function for the Dunkl operators, and a>0 arises from the interpolation of the Weil representation and the minimal unitary representation of the conformal gro...... of our semigroup Ωk,a provides us with (k,a) -generalized Fourier transforms , which includes the Dunkl transform ( a=2 ) and a new unitary operator ( a=1 ) as a Dunkl-type generalization of the classical Hankel transform....

  16. Fully three-dimensional reconstruction from data collected on concentric cubes in Fourier space: implementation and a sample application to MRI [magnetic resonance imaging

    International Nuclear Information System (INIS)

    Herman, G.T.; Roberts, D.; Axel, L.

    1992-01-01

    An algorithm is proposed for rapid and accurate reconstruction from data collected in Fourier space at points arranged on a grid of concentric cubes. The whole process has computational complexity of the same order as required for the 3D fast Fourier transform and so (for medically relevant sizes of the data set) it is faster than backprojection into the same size rectangular grid. The design of the algorithm ensures that no interpolations are needed, in contrast to methods involving backprojection with their unavoidable interpolations. As an application, a 3D data collection method for MRI has been designed which directly samples the Fourier transform of the object to be reconstructed on concentric cubes as needed for the algorithm. (author)

  17. Autodriver algorithm

    Directory of Open Access Journals (Sweden)

    Anna Bourmistrova

    2011-02-01

    Full Text Available The autodriver algorithm is an intelligent method to eliminate the need of steering by a driver on a well-defined road. The proposed method performs best on a four-wheel steering (4WS vehicle, though it is also applicable to two-wheel-steering (TWS vehicles. The algorithm is based on coinciding the actual vehicle center of rotation and road center of curvature, by adjusting the kinematic center of rotation. The road center of curvature is assumed prior information for a given road, while the dynamic center of rotation is the output of dynamic equations of motion of the vehicle using steering angle and velocity measurements as inputs. We use kinematic condition of steering to set the steering angles in such a way that the kinematic center of rotation of the vehicle sits at a desired point. At low speeds the ideal and actual paths of the vehicle are very close. With increase of forward speed the road and tire characteristics, along with the motion dynamics of the vehicle cause the vehicle to turn about time-varying points. By adjusting the steering angles, our algorithm controls the dynamic turning center of the vehicle so that it coincides with the road curvature center, hence keeping the vehicle on a given road autonomously. The position and orientation errors are used as feedback signals in a closed loop control to adjust the steering angles. The application of the presented autodriver algorithm demonstrates reliable performance under different driving conditions.

  18. The Fourier transform of tubular densities

    KAUST Repository

    Prior, C B

    2012-05-18

    We consider the Fourier transform of tubular volume densities, with arbitrary axial geometry and (possibly) twisted internal structure. This density can be used to represent, among others, magnetic flux or the electron density of biopolymer molecules. We consider tubes of both finite radii and unrestricted radius. When there is overlap of the tube structure the net density is calculated using the super-position principle. The Fourier transform of this density is composed of two expressions, one for which the radius of the tube is less than the curvature of the axis and one for which the radius is greater (which must have density overlap). This expression can accommodate an asymmetric density distribution and a tube structure which has non-uniform twisting. In addition we give several simpler expressions for isotropic densities, densities of finite radius, densities which decay at a rate sufficient to minimize local overlap and finally individual surfaces of the tube manifold. These simplified cases can often be expressed as arclength integrals and can be evaluated using a system of first-order ODEs. © 2012 IOP Publishing Ltd.

  19. Fourier transform ion cyclotron resonance mass spectrometry

    Science.gov (United States)

    Marshall, Alan G.

    1998-06-01

    As for Fourier transform infrared (FT-IR) interferometry and nuclear magnetic resonance (NMR) spectroscopy, the introduction of pulsed Fourier transform techniques revolutionized ion cyclotron resonance mass spectrometry: increased speed (factor of 10,000), increased sensitivity (factor of 100), increased mass resolution (factor of 10,000-an improvement not shared by the introduction of FT techniques to IR or NMR spectroscopy), increased mass range (factor of 500), and automated operation. FT-ICR mass spectrometry is the most versatile technique for unscrambling and quantifying ion-molecule reaction kinetics and equilibria in the absence of solvent (i.e., the gas phase). In addition, FT-ICR MS has the following analytically important features: speed (~1 second per spectrum); ultrahigh mass resolution and ultrahigh mass accuracy for analysis of mixtures and polymers; attomole sensitivity; MSn with one spectrometer, including two-dimensional FT/FT-ICR/MS; positive and/or negative ions; multiple ion sources (especially MALDI and electrospray); biomolecular molecular weight and sequencing; LC/MS; and single-molecule detection up to 108 Dalton. Here, some basic features and recent developments of FT-ICR mass spectrometry are reviewed, with applications ranging from crude oil to molecular biology.

  20. Approximate modal analysis using Fourier decomposition

    International Nuclear Information System (INIS)

    Kozar, Ivica; Jericevic, Zeljko; Pecak, Tatjana

    2010-01-01

    The paper presents a novel numerical approach for approximate solution of eigenvalue problem and investigates its suitability for modal analysis of structures with special attention on plate structures. The approach is based on Fourier transformation of the matrix equation into frequency domain and subsequent removal of potentially less significant frequencies. The procedure results in a much reduced problem that is used in eigenvalue calculation. After calculation eigenvectors are expanded and transformed back into time domain. The principles are presented in Jericevic [1]. Fourier transform can be formulated in a way that some parts of the matrix that should not be approximated are not transformed but are fully preserved. In this paper we present formulation that preserves central or edge parts of the matrix and compare it with the formulation that performs transform on the whole matrix. Numerical experiments on transformed structural dynamic matrices describe quality of the approximations obtained in modal analysis of structures. On the basis of the numerical experiments, from the three approaches to matrix reduction one is recommended.

  1. Fourier transform inequalities for phylogenetic trees.

    Science.gov (United States)

    Matsen, Frederick A

    2009-01-01

    Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for phylogenetic trees. A mutation matrix, by its definition, is the exponential of a matrix with non-negative off-diagonal entries; this positivity requirement implies non-trivial constraints on the site-pattern frequency vectors. We call these additional constraints "edge-parameter inequalities". In this paper, we first motivate the edge-parameter inequalities by considering a pathological site-pattern frequency vector corresponding to a quartet tree with a negative internal edge. This site-pattern frequency vector nevertheless satisfies all of the constraints described up to now in the literature. We next describe two complete sets of edge-parameter inequalities for the group-based models; these constraints are square-free monomial inequalities in the Fourier transformed coordinates. These inequalities, along with the phylogenetic invariants, form a complete description of the set of site-pattern frequency vectors corresponding to bona fide trees. Said in mathematical language, this paper explicitly presents two finite lists of inequalities in Fourier coordinates of the form "monomial < or = 1", each list characterizing the phylogenetically relevant semialgebraic subsets of the phylogenetic varieties.

  2. The Fourier transform of tubular densities

    International Nuclear Information System (INIS)

    Prior, C B; Goriely, A

    2012-01-01

    We consider the Fourier transform of tubular volume densities, with arbitrary axial geometry and (possibly) twisted internal structure. This density can be used to represent, among others, magnetic flux or the electron density of biopolymer molecules. We consider tubes of both finite radii and unrestricted radius. When there is overlap of the tube structure the net density is calculated using the super-position principle. The Fourier transform of this density is composed of two expressions, one for which the radius of the tube is less than the curvature of the axis and one for which the radius is greater (which must have density overlap). This expression can accommodate an asymmetric density distribution and a tube structure which has non-uniform twisting. In addition we give several simpler expressions for isotropic densities, densities of finite radius, densities which decay at a rate sufficient to minimize local overlap and finally individual surfaces of the tube manifold. These simplified cases can often be expressed as arclength integrals and can be evaluated using a system of first-order ODEs. (paper)

  3. Fourier transform zero field NMR and NQR

    International Nuclear Information System (INIS)

    Zax, D.B.

    1985-01-01

    In many systems the chemical shifts measured by traditional high resolution solid state NMR methods are insufficiently sensitive, or the information contained in the dipole-dipole couplings is more important. In these cases, Fourier transform zero field magnetic resonance may make an important contribution. Zero field NMR and NQR is the subject of this thesis. Chapter I presents the quantum mechanical background and notational formalism for what follows. Chapter II gives a brief review of high resolution magnetic resonance methods, with particular emphasis on techniques applicable to dipole-dipole and quadrupolar couplings. Level crossings between spin-1/2 and quadrupolar spins during demagnetization transfer polarization from high to low λ nuclei. This is the basis of very high sensitivity zero field NQR measurements by field cycling. Chapter III provides a formal presentation of the high resolution Fourier transform zero field NMR method. Theoretical signal functions are calculated for common spin systems, and examples of typical spectra are presented. Chapters IV and V review the experimental progress in zero field NMR of dipole-dipole coupled spin-1/2 nuclei and for quadrupolar spin systems. Variations of the simple experiment describe in earlier chapters that use pulsed dc fields are presented in Chapter VI

  4. Fourier transform spectra of quantum dots

    Science.gov (United States)

    Damian, V.; Ardelean, I.; Armăşelu, Anca; Apostol, D.

    2010-05-01

    Semiconductor quantum dots are nanometer-sized crystals with unique photochemical and photophysical properties that are not available from either isolated molecules or bulk solids. These nanocrystals absorb light over a very broad spectral range as compared to molecular fluorophores which have very narrow excitation spectra. High-quality QDs are proper to be use in different biological and medical applications (as fluorescent labels, the cancer treatment and the drug delivery). In this article, we discuss Fourier transform visible spectroscopy of commercial quantum dots. We reveal that QDs produced by Evident Technologies when are enlightened by laser or luminescent diode light provides a spectral shift of their fluorescence spectra correlated to exciting emission wavelengths, as shown by the ARCspectroNIR Fourier Transform Spectrometer. In the final part of this paper we show an important biological application of CdSe/ZnS core-shell ODs as microbial labeling both for pure cultures of cyanobacteria (Synechocystis PCC 6803) and for mixed cultures of phototrophic and heterotrophic microorganisms.

  5. On localization for double Fourier series

    Science.gov (United States)

    Goffman, Casper; Waterman, Daniel

    1978-01-01

    The localization theorems for Fourier series of functions of a single variable are classical and easy to prove. The situation is different for Fourier series of functions of several variables, even if one restricts consideration to rectangular, in particular square, partial sums. We show that the answer to the problem can be obtained by considering the notion of generalized bounded variation, which we introduced. Given a nondecreasing sequence {λn} of positive numbers such that Σ 1/λn diverges, a function g defined on an interval I of R1 is said to be of Λ-bounded variation (ΛBV) if Σ|g(an) — g(bn)|/λn converges for every sequence of nonoverlapping intervals (an, bn) [unk]I. If λn = n, we say that g is of harmonic bounded variation (HBV). The definition suitably modified can be extended to functions of several variables. We show that in the case of two variables the localization principle holds for rectangular partial sums if ΛBV = HBV, and that if ΛBV is not contained in HBV, then the localization principle does not hold for ΛBV even in the case of square partial sums. PMID:16592492

  6. The prosaic Laplace and Fourier transform

    International Nuclear Information System (INIS)

    Smith, G.A.

    1995-01-01

    Integral Transform methods play an extremely important role in many branches of science and engineering. The ease with which many problems may be solved using these techniques is well known. In Electrical Engineering especially, Laplace and Fourier Transforms have been used for a long time as a way to change the solution of differential equations into trivial algebraic manipulations or to provide alternate representations of signals and data. These techniques, while seemingly overshadowed by today's emphasis on digital analysis, still form an invaluable basis in the understanding of systems and circuits. A firm grasp of the practical aspects of these subjects provides valuable conceptual tools. This tutorial paper is a review of Laplace and Fourier Transforms from an applied perspective with an emphasis on engineering applications. The interrelationship of the time and frequency domains will be stressed, in an attempt to comfort those who, after living so much of their lives in the time domain, find thinking in the frequency domain disquieting. copyright 1995 American Institute of Physics

  7. Digital Fourier microscopy for soft matter dynamics

    International Nuclear Information System (INIS)

    Giavazzi, Fabio; Cerbino, Roberto

    2014-01-01

    Soft matter is studied with a large portfolio of methods. Light scattering and video microscopy are the most employed at optical wavelengths. Light scattering provides ensemble-averaged information on soft matter in the reciprocal space. The wave-vectors probed correspond to length scales ranging from a few nanometers to fractions of millimetre. Microscopy probes the sample directly in the real space, by offering a unique access to the local properties. However, optical resolution issues limit the access to length scales smaller than approximately 200 nm. We describe recent work that bridges the gap between scattering and microscopy. Several apparently unrelated techniques are found to share a simple basic idea: the correlation properties of the sample can be characterized in the reciprocal space via spatial Fourier analysis of images collected in the real space. We describe the main features of such digital Fourier microscopy (DFM), by providing examples of several possible experimental implementations of it, some of which not yet realized in practice. We also provide an overview of experimental results obtained with DFM for the study of the dynamics of soft materials. Finally, we outline possible future developments of DFM that would ease its adoption as a standard laboratory method. (topical review)

  8. Suppression law of quantum states in a 3D photonic fast Fourier transform chip

    Science.gov (United States)

    Crespi, Andrea; Osellame, Roberto; Ramponi, Roberta; Bentivegna, Marco; Flamini, Fulvio; Spagnolo, Nicolò; Viggianiello, Niko; Innocenti, Luca; Mataloni, Paolo; Sciarrino, Fabio

    2016-01-01

    The identification of phenomena able to pinpoint quantum interference is attracting large interest. Indeed, a generalization of the Hong–Ou–Mandel effect valid for any number of photons and optical modes would represent an important leap ahead both from a fundamental perspective and for practical applications, such as certification of photonic quantum devices, whose computational speedup is expected to depend critically on multi-particle interference. Quantum distinctive features have been predicted for many particles injected into multimode interferometers implementing the Fourier transform over the optical modes. Here we develop a scalable approach for the implementation of the fast Fourier transform algorithm using three-dimensional photonic integrated interferometers, fabricated via femtosecond laser writing technique. We observe the suppression law for a large number of output states with four- and eight-mode optical circuits: the experimental results demonstrate genuine quantum interference between the injected photons, thus offering a powerful tool for diagnostic of photonic platforms. PMID:26843135

  9. Tutorial on Fourier space coverage for scattering experiments, with application to SAR

    Science.gov (United States)

    Deming, Ross W.

    2010-04-01

    The Fourier Diffraction Theorem relates the data measured during electromagnetic, optical, or acoustic scattering experiments to the spatial Fourier transform of the object under test. The theorem is well-known, but since it is based on integral equations and complicated mathematical expansions, the typical derivation may be difficult for the non-specialist. In this paper, the theorem is derived and presented using simple geometry, plus undergraduatelevel physics and mathematics. For practitioners of synthetic aperture radar (SAR) imaging, the theorem is important to understand because it leads to a simple geometric and graphical understanding of image resolution and sampling requirements, and how they are affected by radar system parameters and experimental geometry. Also, the theorem can be used as a starting point for imaging algorithms and motion compensation methods. Several examples are given in this paper for realistic scenarios.

  10. Fast data reconstructed method of Fourier transform imaging spectrometer based on multi-core CPU

    Science.gov (United States)

    Yu, Chunchao; Du, Debiao; Xia, Zongze; Song, Li; Zheng, Weijian; Yan, Min; Lei, Zhenggang

    2017-10-01

    Imaging spectrometer can gain two-dimensional space image and one-dimensional spectrum at the same time, which shows high utility in color and spectral measurements, the true color image synthesis, military reconnaissance and so on. In order to realize the fast reconstructed processing of the Fourier transform imaging spectrometer data, the paper designed the optimization reconstructed algorithm with OpenMP parallel calculating technology, which was further used for the optimization process for the HyperSpectral Imager of `HJ-1' Chinese satellite. The results show that the method based on multi-core parallel computing technology can control the multi-core CPU hardware resources competently and significantly enhance the calculation of the spectrum reconstruction processing efficiency. If the technology is applied to more cores workstation in parallel computing, it will be possible to complete Fourier transform imaging spectrometer real-time data processing with a single computer.

  11. Fourier analysis of cell-wise Block-Jacobi splitting in two-dimensional geometry

    International Nuclear Information System (INIS)

    Rosa, M.; Warsa, J. S.; Kelley, T. M.

    2009-01-01

    A Fourier analysis is conducted in two-dimensional (2D) geometry for the discrete ordinates (S N ) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) using the cell-wise Block-Jacobi (BJ) algorithm. The results of the Fourier analysis show that convergence of cell-wise BJ can degrade, leading to a spectral radius equal to 1, in problems containing optically thin cells. For problems containing cells that are optically thick, instead, the spectral radius tends to 0. Hence, in the optically thick-cell regime, cell-wise BJ is rapidly convergent even for problems that are scattering dominated, with a scattering ratio c close to 1. (authors)

  12. An improved acoustic Fourier boundary element method formulation using fast Fourier transform integration

    NARCIS (Netherlands)

    Kuijpers, A.H.W.M.; Verbeek, G.; Verheij, J.W.

    1997-01-01

    Effective use of the Fourier series boundary element method (FBEM) for everyday applications is hindered by the significant numerical problems that have to be overcome for its implementation. In the FBEM formulation for acoustics, some integrals over the angle of revolution arise, which need to be

  13. Data preprocessing methods for robust Fourier ptychographic microscopy

    Science.gov (United States)

    Zhang, Yan; Pan, An; Lei, Ming; Yao, Baoli

    2017-12-01

    Fourier ptychographic microscopy (FPM) is a recently developed computational imaging technique that achieves gigapixel images with both high resolution and large field-of-view. In the current FPM experimental setup, the dark-field images with high-angle illuminations are easily overwhelmed by stray lights and background noises due to the low signal-to-noise ratio, thus significantly degrading the achievable resolution of the FPM approach. We provide an overall and systematic data preprocessing scheme to enhance the FPM's performance, which involves sampling analysis, underexposed/overexposed treatments, background noises suppression, and stray lights elimination. It is demonstrated experimentally with both US Air Force (USAF) 1951 resolution target and biological samples that the benefit of the noise removal by these methods far outweighs the defect of the accompanying signal loss, as part of the lost signals can be compensated by the improved consistencies among the captured raw images. In addition, the reported nonparametric scheme could be further cooperated with the existing state-of-the-art algorithms with a great flexibility, facilitating a stronger noise-robust capability of the FPM approach in various applications.

  14. Universal discrete Fourier optics RF photonic integrated circuit architecture.

    Science.gov (United States)

    Hall, Trevor J; Hasan, Mehedi

    2016-04-04

    This paper describes a coherent electro-optic circuit architecture that generates a frequency comb consisting of N spatially separated orders using a generalised Mach-Zenhder interferometer (MZI) with its N × 1 combiner replaced by an optical N × N Discrete Fourier Transform (DFT). Advantage may be taken of the tight optical path-length control, component and circuit symmetries and emerging trimming algorithms offered by photonic integration in any platform that offers linear electro-optic phase modulation such as LiNbO3, silicon, III-V or hybrid technology. The circuit architecture subsumes all MZI-based RF photonic circuit architectures in the prior art given an appropriate choice of output port(s) and dimension N although the principal application envisaged is phase correlated subcarrier generation for all optical orthogonal frequency division multiplexing. A transfer matrix approach is used to model the operation of the architecture. The predictions of the model are validated by simulations performed using an industry standard software tool. Implementation is found to be practical.

  15. Algorithmic Self

    DEFF Research Database (Denmark)

    Markham, Annette

    This paper takes an actor network theory approach to explore some of the ways that algorithms co-construct identity and relational meaning in contemporary use of social media. Based on intensive interviews with participants as well as activity logging and data tracking, the author presents a richly...... layered set of accounts to help build our understanding of how individuals relate to their devices, search systems, and social network sites. This work extends critical analyses of the power of algorithms in implicating the social self by offering narrative accounts from multiple perspectives. It also...... contributes an innovative method for blending actor network theory with symbolic interaction to grapple with the complexity of everyday sensemaking practices within networked global information flows....

  16. Application of the fractional Fourier transform to the design of LCOS based optical interconnects and fiber switches.

    Science.gov (United States)

    Robertson, Brian; Zhang, Zichen; Yang, Haining; Redmond, Maura M; Collings, Neil; Liu, Jinsong; Lin, Ruisheng; Jeziorska-Chapman, Anna M; Moore, John R; Crossland, William A; Chu, D P

    2012-04-20

    It is shown that reflective liquid crystal on silicon (LCOS) spatial light modulator (SLM) based interconnects or fiber switches that use defocus to reduce crosstalk can be evaluated and optimized using a fractional Fourier transform if certain optical symmetry conditions are met. Theoretically the maximum allowable linear hologram phase error compared to a Fourier switch is increased by a factor of six before the target crosstalk for telecom applications of -40 dB is exceeded. A Gerchberg-Saxton algorithm incorporating a fractional Fourier transform modified for use with a reflective LCOS SLM is used to optimize multi-casting holograms in a prototype telecom switch. Experiments are in close agreement to predicted performance.

  17. Fourier transform and its application to 1D and 2D NMR

    International Nuclear Information System (INIS)

    Canet, D.

    1988-01-01

    In this review article, the following points are developed: Pulsed NMR and Fourier transform; Fourier transform and two-dimensional spectroscopy; Mathematical properties of Fourier transform; Fourier transform of a sine function- one dimensional NMR; Fourier transform of a product of sine functions - two-dimensional NMR; Data manipulations in the time domain; Numerical Fourier transform [fr

  18. Multicomplementary operators via finite Fourier transform

    International Nuclear Information System (INIS)

    Klimov, Andrei B; Sanchez-Soto, Luis L; Guise, Hubert de

    2005-01-01

    A complete set of d + 1 mutually unbiased bases exists in a Hilbert space of dimension d, whenever d is a power of a prime. We discuss a simple construction of d + 1 disjoint classes (each one having d - 1 commuting operators) such that the corresponding eigenstates form sets of unbiased bases. Such a construction works properly for prime dimension. We investigate an alternative construction in which the real numbers that label the classes are replaced by a finite field having d elements. One of these classes is diagonal, and can be mapped to cyclic operators by means of the finite Fourier transform, which allows one to understand complementarity in a similar way as for the position-momentum pair in standard quantum mechanics. The relevant examples of two and three qubits and two qutrits are discussed in detail

  19. Fractional Fourier transform for confluent hypergeometric beams

    International Nuclear Information System (INIS)

    Tang, Bin; Jiang, Chun; Zhu, Haibin

    2012-01-01

    Based on the definition of the fractional Fourier transform (FRFT) in the cylindrical coordinate system, the propagation properties of a new family of paraxial laser beams named confluent hypergeometric (HyG) beams, of which intensity profile is similar to that for the Bessel modes, passing through FRFT optical systems have been studied in detail by some typical numerical examples. The results indicate that the normalized intensity distribution of a HyG beam in the FRFT plane is closely related to not only the fractional order p but also the beam parameters m,n, and focal length f. -- Highlights: ► We study the propagation of a HyG beam through FRFT optical systems. ► The intensity of the beam in the FRFT plane is closely related to some parameters. ► We can control the properties of HyG beams by properly choosing the parameters.

  20. Rotational Fourier tracking of diffusing polygons.

    Science.gov (United States)

    Mayoral, Kenny; Kennair, Terry P; Zhu, Xiaoming; Milazzo, James; Ngo, Kathy; Fryd, Michael M; Mason, Thomas G

    2011-11-01

    We use optical microscopy to measure the rotational Brownian motion of polygonal platelets that are dispersed in a liquid and confined by depletion attractions near a wall. The depletion attraction inhibits out-of-plane translational and rotational Brownian fluctuations, thereby facilitating in-plane imaging and video analysis. By taking fast Fourier transforms (FFTs) of the images and analyzing the angular position of rays in the FFTs, we determine an isolated particle's rotational trajectory, independent of its position. The measured in-plane rotational diffusion coefficients are significantly smaller than estimates for the bulk; this difference is likely due to the close proximity of the particles to the wall arising from the depletion attraction.

  1. Two-dimensional fourier transform spectrometer

    Science.gov (United States)

    DeFlores, Lauren; Tokmakoff, Andrei

    2013-09-03

    The present invention relates to a system and methods for acquiring two-dimensional Fourier transform (2D FT) spectra. Overlap of a collinear pulse pair and probe induce a molecular response which is collected by spectral dispersion of the signal modulated probe beam. Simultaneous collection of the molecular response, pulse timing and characteristics permit real time phasing and rapid acquisition of spectra. Full spectra are acquired as a function of pulse pair timings and numerically transformed to achieve the full frequency-frequency spectrum. This method demonstrates the ability to acquire information on molecular dynamics, couplings and structure in a simple apparatus. Multi-dimensional methods can be used for diagnostic and analytical measurements in the biological, biomedical, and chemical fields.

  2. Double-resolution electron holography with simple Fourier transform of fringe-shifted holograms

    International Nuclear Information System (INIS)

    Volkov, V.V.; Han, M.G.; Zhu, Y.

    2013-01-01

    We propose a fringe-shifting holographic method with an appropriate image wave recovery algorithm leading to exact solution of holographic equations. With this new method the complex object image wave recovered from holograms appears to have much less traditional artifacts caused by the autocorrelation band present practically in all Fourier transformed holograms. The new analytical solutions make possible a double-resolution electron holography free from autocorrelation band artifacts and thus push the limits for phase resolution. The new image wave recovery algorithm uses a popular Fourier solution of the side band-pass filter technique, while the fringe-shifting holographic method is simple to implement in practice. - Highlights: • We propose a fringe-shifting holographic method simple enough for practical implementations. • Our new image-wave-recovery algorithm follows from exact solution of holographic equations. • With autocorrelation band removal from holograms it is possible to achieve double-resolution electron holography data free from several commonly known artifacts. • The new fringe-shifting method can reach an image wave resolution close to single fringe spacing

  3. Double-resolution electron holography with simple Fourier transform of fringe-shifted holograms

    Energy Technology Data Exchange (ETDEWEB)

    Volkov, V.V., E-mail: volkov@bnl.gov; Han, M.G.; Zhu, Y.

    2013-11-15

    We propose a fringe-shifting holographic method with an appropriate image wave recovery algorithm leading to exact solution of holographic equations. With this new method the complex object image wave recovered from holograms appears to have much less traditional artifacts caused by the autocorrelation band present practically in all Fourier transformed holograms. The new analytical solutions make possible a double-resolution electron holography free from autocorrelation band artifacts and thus push the limits for phase resolution. The new image wave recovery algorithm uses a popular Fourier solution of the side band-pass filter technique, while the fringe-shifting holographic method is simple to implement in practice. - Highlights: • We propose a fringe-shifting holographic method simple enough for practical implementations. • Our new image-wave-recovery algorithm follows from exact solution of holographic equations. • With autocorrelation band removal from holograms it is possible to achieve double-resolution electron holography data free from several commonly known artifacts. • The new fringe-shifting method can reach an image wave resolution close to single fringe spacing.

  4. FPGA Implementation of Real-Time Compressive Sensing with Partial Fourier Dictionary

    Directory of Open Access Journals (Sweden)

    Yinghui Quan

    2016-01-01

    Full Text Available This paper presents a novel real-time compressive sensing (CS reconstruction which employs high density field-programmable gate array (FPGA for hardware acceleration. Traditionally, CS can be implemented using a high-level computer language in a personal computer (PC or multicore platforms, such as graphics processing units (GPUs and Digital Signal Processors (DSPs. However, reconstruction algorithms are computing demanding and software implementation of these algorithms is extremely slow and power consuming. In this paper, the orthogonal matching pursuit (OMP algorithm is refined to solve the sparse decomposition optimization for partial Fourier dictionary, which is always adopted in radar imaging and detection application. OMP reconstruction can be divided into two main stages: optimization which finds the closely correlated vectors and least square problem. For large scale dictionary, the implementation of correlation is time consuming since it often requires a large number of matrix multiplications. Also solving the least square problem always needs a scalable matrix decomposition operation. To solve these problems efficiently, the correlation optimization is implemented by fast Fourier transform (FFT and the large scale least square problem is implemented by Conjugate Gradient (CG technique, respectively. The proposed method is verified by FPGA (Xilinx Virtex-7 XC7VX690T realization, revealing its effectiveness in real-time applications.

  5. On a General Class of Trigonometric Functions and Fourier Series

    Science.gov (United States)

    Pavao, H. Germano; Capelas de Oliveira, E.

    2008-01-01

    We discuss a general class of trigonometric functions whose corresponding Fourier series can be used to calculate several interesting numerical series. Particular cases are presented. (Contains 4 notes.)

  6. Reducing Approximation Error in the Fourier Flexible Functional Form

    Directory of Open Access Journals (Sweden)

    Tristan D. Skolrud

    2017-12-01

    Full Text Available The Fourier Flexible form provides a global approximation to an unknown data generating process. In terms of limiting function specification error, this form is preferable to functional forms based on second-order Taylor series expansions. The Fourier Flexible form is a truncated Fourier series expansion appended to a second-order expansion in logarithms. By replacing the logarithmic expansion with a Box-Cox transformation, we show that the Fourier Flexible form can reduce approximation error by 25% on average in the tails of the data distribution. The new functional form allows for nested testing of a larger set of commonly implemented functional forms.

  7. Parallel algorithms

    CERN Document Server

    Casanova, Henri; Robert, Yves

    2008-01-01

    ""…The authors of the present book, who have extensive credentials in both research and instruction in the area of parallelism, present a sound, principled treatment of parallel algorithms. … This book is very well written and extremely well designed from an instructional point of view. … The authors have created an instructive and fascinating text. The book will serve researchers as well as instructors who need a solid, readable text for a course on parallelism in computing. Indeed, for anyone who wants an understandable text from which to acquire a current, rigorous, and broad vi

  8. Algorithm 865

    DEFF Research Database (Denmark)

    Gustavson, Fred G.; Reid, John K.; Wasniewski, Jerzy

    2007-01-01

    We present subroutines for the Cholesky factorization of a positive-definite symmetric matrix and for solving corresponding sets of linear equations. They exploit cache memory by using the block hybrid format proposed by the authors in a companion article. The matrix is packed into n(n + 1)/2 real...... variables, and the speed is usually better than that of the LAPACK algorithm that uses full storage (n2 variables). Included are subroutines for rearranging a matrix whose upper or lower-triangular part is packed by columns to this format and for the inverse rearrangement. Also included is a kernel...

  9. Anatomic and energy variation of scatter compensation for digital chest radiography with Fourier deconvolution

    International Nuclear Information System (INIS)

    Floyd, C.E.; Beatty, P.T.; Ravin, C.E.

    1988-01-01

    The Fourier deconvolution algorithm for scatter compensation in digital chest radiography has been evaluated in four anatomically different regions at three energies. A shift invariant scatter distribution shape, optimized for the lung region at 140 kVp, was applied at 90 kVp and 120 kVp in the lung, retrocardiac, subdiaphragmatic, and thoracic spine regions. Scatter estimates from the deconvolution were compared with measured values. While some regional variation is apparent, the use of a shift invariant scatter distribution shape (optimized for a given energy) produces reasonable scatter compensation in the chest. A different set of deconvolution parameters were required at the different energies

  10. Efficient evaluation of the Fourier transform over products of Slater-type orbitals on different centers

    International Nuclear Information System (INIS)

    Niehaus, T A; Lopez, R; Rico, J F

    2008-01-01

    Using the shift-operator technique, a compact formula for the Fourier transform of a product of two Slater-type orbitals located on different atomic centers is derived. The result is valid for arbitrary quantum numbers and was found to be numerically stable for a wide range of geometrical parameters and momenta. Details of the implementation are presented together with benchmark data for representative integrals. We also discuss the assets and drawbacks of alternative algorithms available and analyze the numerical efficiency of the new scheme

  11. A symplectic Poisson solver based on Fast Fourier Transformation. The first trial

    International Nuclear Information System (INIS)

    Vorobiev, L.G.; Hirata, Kohji.

    1995-11-01

    A symplectic Poisson solver calculates numerically a potential and fields due to a 2D distribution of particles in a way that the symplecticity and smoothness are assured automatically. Such a code, based on Fast Fourier Transformation combined with Bicubic Interpolation, is developed for the use in multi-turn particle simulation in circular accelerators. Beside that, it may have a number of applications, where computations of space charge forces should obey a symplecticity criterion. Detailed computational schemes of all algorithms will be outlined to facilitate practical programming. (author)

  12. Modeling laser-driven electron acceleration using WARP with Fourier decomposition

    Energy Technology Data Exchange (ETDEWEB)

    Lee, P., E-mail: patrick.lee@u-psud.fr [LPGP, CNRS, Univ. Paris-Sud, Université Paris-Saclay, 91405 Orsay (France); Audet, T.L. [LPGP, CNRS, Univ. Paris-Sud, Université Paris-Saclay, 91405 Orsay (France); Lehe, R.; Vay, J.-L. [Lawrence Berkeley National Laboratory, Berkeley, CA 94720 (United States); Maynard, G.; Cros, B. [LPGP, CNRS, Univ. Paris-Sud, Université Paris-Saclay, 91405 Orsay (France)

    2016-09-01

    WARP is used with the recent implementation of the Fourier decomposition algorithm to model laser-driven electron acceleration in plasmas. Simulations were carried out to analyze the experimental results obtained on ionization-induced injection in a gas cell. The simulated results are in good agreement with the experimental ones, confirming the ability of the code to take into account the physics of electron injection and reduce calculation time. We present a detailed analysis of the laser propagation, the plasma wave generation and the electron beam dynamics.

  13. Image security based on iterative random phase encoding in expanded fractional Fourier transform domains

    Science.gov (United States)

    Liu, Zhengjun; Chen, Hang; Blondel, Walter; Shen, Zhenmin; Liu, Shutian

    2018-06-01

    A novel image encryption method is proposed by using the expanded fractional Fourier transform, which is implemented with a pair of lenses. Here the centers of two lenses are separated at the cross section of axis in optical system. The encryption system is addressed with Fresnel diffraction and phase modulation for the calculation of information transmission. The iterative process with the transform unit is utilized for hiding secret image. The structure parameters of a battery of lenses can be used for additional keys. The performance of encryption method is analyzed theoretically and digitally. The results show that the security of this algorithm is enhanced markedly by the added keys.

  14. Robust alignment of chromatograms by statistically analyzing the shifts matrix generated by moving window fast Fourier transform cross-correlation.

    Science.gov (United States)

    Zhang, Mingjing; Wen, Ming; Zhang, Zhi-Min; Lu, Hongmei; Liang, Yizeng; Zhan, Dejian

    2015-03-01

    Retention time shift is one of the most challenging problems during the preprocessing of massive chromatographic datasets. Here, an improved version of the moving window fast Fourier transform cross-correlation algorithm is presented to perform nonlinear and robust alignment of chromatograms by analyzing the shifts matrix generated by moving window procedure. The shifts matrix in retention time can be estimated by fast Fourier transform cross-correlation with a moving window procedure. The refined shift of each scan point can be obtained by calculating the mode of corresponding column of the shifts matrix. This version is simple, but more effective and robust than the previously published moving window fast Fourier transform cross-correlation method. It can handle nonlinear retention time shift robustly if proper window size has been selected. The window size is the only one parameter needed to adjust and optimize. The properties of the proposed method are investigated by comparison with the previous moving window fast Fourier transform cross-correlation and recursive alignment by fast Fourier transform using chromatographic datasets. The pattern recognition results of a gas chromatography mass spectrometry dataset of metabolic syndrome can be improved significantly after preprocessing by this method. Furthermore, the proposed method is available as an open source package at https://github.com/zmzhang/MWFFT2. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  15. A novel approach in recognizing magnetic material with simplified algorithm

    KAUST Repository

    Talukdar, Abdul Hafiz Ibne

    2011-04-01

    In this article a cost-effective and simple system (circuit and algorithm) which allows recognizing different kinds of films by their magneto-field conductive properties is demonstrated. The studied signals are generated by a proposed circuit. This signal was further analyzed (recognized) in frequency domain creating the Fourier frequency spectrum which is easily used to detect the response of magnetic sample. The novel algorithm in detecting magnetic field is presented here with both simulation and experimental results. © 2011 IEEE.

  16. Fan beam image reconstruction with generalized Fourier slice theorem.

    Science.gov (United States)

    Zhao, Shuangren; Yang, Kang; Yang, Kevin

    2014-01-01

    For parallel beam geometry the Fourier reconstruction works via the Fourier slice theorem (or central slice theorem, projection slice theorem). For fan beam situation, Fourier slice can be extended to a generalized Fourier slice theorem (GFST) for fan-beam image reconstruction. We have briefly introduced this method in a conference. This paper reintroduces the GFST method for fan beam geometry in details. The GFST method can be described as following: the Fourier plane is filled by adding up the contributions from all fanbeam projections individually; thereby the values in the Fourier plane are directly calculated for Cartesian coordinates such avoiding the interpolation from polar to Cartesian coordinates in the Fourier domain; inverse fast Fourier transform is applied to the image in Fourier plane and leads to a reconstructed image in spacial domain. The reconstructed image is compared between the result of the GFST method and the result from the filtered backprojection (FBP) method. The major differences of the GFST and the FBP methods are: (1) The interpolation process are at different data sets. The interpolation of the GFST method is at projection data. The interpolation of the FBP method is at filtered projection data. (2) The filtering process are done in different places. The filtering process of the GFST is at Fourier domain. The filtering process of the FBP method is the ramp filter which is done at projections. The resolution of ramp filter is variable with different location but the filter in the Fourier domain lead to resolution invariable with location. One advantage of the GFST method over the FBP method is in short scan situation, an exact solution can be obtained with the GFST method, but it can not be obtained with the FBP method. The calculation of both the GFST and the FBP methods are at O(N^3), where N is the number of pixel in one dimension.

  17. TH-E-17A-01: Internal Respiratory Surrogate for 4D CT Using Fourier Transform and Anatomical Features

    Energy Technology Data Exchange (ETDEWEB)

    Hui, C; Suh, Y; Robertson, D; Pan, T; Das, P; Crane, C; Beddar, S [MD Anderson Cancer Center, Houston, TX (United States)

    2014-06-15

    Purpose: To develop a novel algorithm to generate internal respiratory signals for sorting of four-dimensional (4D) computed tomography (CT) images. Methods: The proposed algorithm extracted multiple time resolved features as potential respiratory signals. These features were taken from the 4D CT images and its Fourier transformed space. Several low-frequency locations in the Fourier space and selected anatomical features from the images were used as potential respiratory signals. A clustering algorithm was then used to search for the group of appropriate potential respiratory signals. The chosen signals were then normalized and averaged to form the final internal respiratory signal. Performance of the algorithm was tested in 50 4D CT data sets and results were compared with external signals from the real-time position management (RPM) system. Results: In almost all cases, the proposed algorithm generated internal respiratory signals that visibly matched the external respiratory signals from the RPM system. On average, the end inspiration times calculated by the proposed algorithm were within 0.1 s of those given by the RPM system. Less than 3% of the calculated end inspiration times were more than one time frame away from those given by the RPM system. In 3 out of the 50 cases, the proposed algorithm generated internal respiratory signals that were significantly smoother than the RPM signals. In these cases, images sorted using the internal respiratory signals showed fewer artifacts in locations corresponding to the discrepancy in the internal and external respiratory signals. Conclusion: We developed a robust algorithm that generates internal respiratory signals from 4D CT images. In some cases, it even showed the potential to outperform the RPM system. The proposed algorithm is completely automatic and generally takes less than 2 min to process. It can be easily implemented into the clinic and can potentially replace the use of external surrogates.

  18. TH-E-17A-01: Internal Respiratory Surrogate for 4D CT Using Fourier Transform and Anatomical Features

    International Nuclear Information System (INIS)

    Hui, C; Suh, Y; Robertson, D; Pan, T; Das, P; Crane, C; Beddar, S

    2014-01-01

    Purpose: To develop a novel algorithm to generate internal respiratory signals for sorting of four-dimensional (4D) computed tomography (CT) images. Methods: The proposed algorithm extracted multiple time resolved features as potential respiratory signals. These features were taken from the 4D CT images and its Fourier transformed space. Several low-frequency locations in the Fourier space and selected anatomical features from the images were used as potential respiratory signals. A clustering algorithm was then used to search for the group of appropriate potential respiratory signals. The chosen signals were then normalized and averaged to form the final internal respiratory signal. Performance of the algorithm was tested in 50 4D CT data sets and results were compared with external signals from the real-time position management (RPM) system. Results: In almost all cases, the proposed algorithm generated internal respiratory signals that visibly matched the external respiratory signals from the RPM system. On average, the end inspiration times calculated by the proposed algorithm were within 0.1 s of those given by the RPM system. Less than 3% of the calculated end inspiration times were more than one time frame away from those given by the RPM system. In 3 out of the 50 cases, the proposed algorithm generated internal respiratory signals that were significantly smoother than the RPM signals. In these cases, images sorted using the internal respiratory signals showed fewer artifacts in locations corresponding to the discrepancy in the internal and external respiratory signals. Conclusion: We developed a robust algorithm that generates internal respiratory signals from 4D CT images. In some cases, it even showed the potential to outperform the RPM system. The proposed algorithm is completely automatic and generally takes less than 2 min to process. It can be easily implemented into the clinic and can potentially replace the use of external surrogates

  19. Efficient Computer Implementations of Fast Fourier Transforms.

    Science.gov (United States)

    1980-12-01

    fit in computer? Yes, continue (9) Determine fastest algorithm between WFTA and PFA from Table 4.6. For N=420, WFTA PFA Mult 1296 2528 Add 11352 10956...real adds = 24tN/4 + 2(3tN/4) = 15tN/2 (G.8) 260 All odd prime C<ictors ciual to or (,rater than 5 iso the general transform section. Based on the

  20. An effective algorithm for computing global sensitivity indices (EASI)

    International Nuclear Information System (INIS)

    Plischke, Elmar

    2010-01-01

    We present an algorithm named EASI that estimates first order sensitivity indices from given data using Fast Fourier Transformations. Hence it can be used as a post-processing module for pre-computed model evaluations. Ideas for the estimation of higher order sensitivity indices are also discussed.

  1. A multiresolution remeshed Vortex-In-Cell algorithm using patches

    DEFF Research Database (Denmark)

    Rasmussen, Johannes Tophøj; Cottet, Georges-Henri; Walther, Jens Honore

    2011-01-01

    We present a novel multiresolution Vortex-In-Cell algorithm using patches of varying resolution. The Poisson equation relating the fluid vorticity and velocity is solved using Fast Fourier Transforms subject to free space boundary conditions. Solid boundaries are implemented using the semi...

  2. Fast numerical algorithm for the linear canonical transform.

    Science.gov (United States)

    Hennelly, Bryan M; Sheridan, John T

    2005-05-01

    The linear canonical transform (LCT) describes the effect of any quadratic phase system (QPS) on an input optical wave field. Special cases of the LCT include the fractional Fourier transform (FRT), the Fourier transform (FT), and the Fresnel transform (FST) describing free-space propagation. Currently there are numerous efficient algorithms used (for purposes of numerical simulation in the area of optical signal processing) to calculate the discrete FT, FRT, and FST. All of these algorithms are based on the use of the fast Fourier transform (FFT). In this paper we develop theory for the discrete linear canonical transform (DLCT), which is to the LCT what the discrete Fourier transform (DFT) is to the FT. We then derive the fast linear canonical transform (FLCT), an N log N algorithm for its numerical implementation by an approach similar to that used in deriving the FFT from the DFT. Our algorithm is significantly different from the FFT, is based purely on the properties of the LCT, and can be used for FFT, FRT, and FST calculations and, in the most general case, for the rapid calculation of the effect of any QPS.

  3. The methods for generating tomographic images using transmition, emission and nuclear magnetic resonance techniques. II. Fourier method and iterative methods

    International Nuclear Information System (INIS)

    Ursu, I.; Demco, D.E.; Gligor, T.D.; Pop, G.; Dollinger, R.

    1987-01-01

    In a wide variety of applications it is necessary to infer the structure of a multidimensional object from a set of its projections. Computed tomography is at present largely extended in the medical field, but the industrial application may ultimately far exceed its medical applications. Two techniques for reconstructing objects from their projections are presented: Fourier methods and iterative techniques. The paper also contains a brief comparative study of the reconstruction algorithms. (authors)

  4. A high-speed computerized tomography image reconstruction using direct two-dimensional Fourier transform method

    International Nuclear Information System (INIS)

    Niki, Noboru; Mizutani, Toshio; Takahashi, Yoshizo; Inouye, Tamon.

    1983-01-01

    The nescessity for developing real-time computerized tomography (CT) aiming at the dynamic observation of organs such as hearts has lately been advocated. It is necessary for its realization to reconstruct the images which are markedly faster than present CTs. Although various reconstructing methods have been proposed so far, the method practically employed at present is the filtered backprojection (FBP) method only, which can give high quality image reconstruction, but takes much computing time. In the past, the two-dimensional Fourier transform (TFT) method was regarded as unsuitable to practical use because the quality of images obtained was not good, in spite of the promising method for high speed reconstruction because of its less computing time. However, since it was revealed that the image quality by TFT method depended greatly on interpolation accuracy in two-dimensional Fourier space, the authors have developed a high-speed calculation algorithm that can obtain high quality images by pursuing the relationship between the image quality and the interpolation method. In this case, radial data sampling points in Fourier space are increased to β-th power of 2 times, and the linear or spline interpolation is used. Comparison of this method with the present FBP method resulted in the conclusion that the image quality is almost the same in practical image matrix, the computational time by TFT method becomes about 1/10 of FBP method, and the memory capacity also reduces by about 20 %. (Wakatsuki, Y.)

  5. Fourier-Mellin moment-based intertwining map for image encryption

    Science.gov (United States)

    Kaur, Manjit; Kumar, Vijay

    2018-03-01

    In this paper, a robust image encryption technique that utilizes Fourier-Mellin moments and intertwining logistic map is proposed. Fourier-Mellin moment-based intertwining logistic map has been designed to overcome the issue of low sensitivity of an input image. Multi-objective Non-Dominated Sorting Genetic Algorithm (NSGA-II) based on Reinforcement Learning (MNSGA-RL) has been used to optimize the required parameters of intertwining logistic map. Fourier-Mellin moments are used to make the secret keys more secure. Thereafter, permutation and diffusion operations are carried out on input image using secret keys. The performance of proposed image encryption technique has been evaluated on five well-known benchmark images and also compared with seven well-known existing encryption techniques. The experimental results reveal that the proposed technique outperforms others in terms of entropy, correlation analysis, a unified average changing intensity and the number of changing pixel rate. The simulation results reveal that the proposed technique provides high level of security and robustness against various types of attacks.

  6. Non-stationary component extraction in noisy multicomponent signal using polynomial chirping Fourier transform.

    Science.gov (United States)

    Lu, Wenlong; Xie, Junwei; Wang, Heming; Sheng, Chuan

    2016-01-01

    Inspired by track-before-detection technology in radar, a novel time-frequency transform, namely polynomial chirping Fourier transform (PCFT), is exploited to extract components from noisy multicomponent signal. The PCFT combines advantages of Fourier transform and polynomial chirplet transform to accumulate component energy along a polynomial chirping curve in the time-frequency plane. The particle swarm optimization algorithm is employed to search optimal polynomial parameters with which the PCFT will achieve a most concentrated energy ridge in the time-frequency plane for the target component. The component can be well separated in the polynomial chirping Fourier domain with a narrow-band filter and then reconstructed by inverse PCFT. Furthermore, an iterative procedure, involving parameter estimation, PCFT, filtering and recovery, is introduced to extract components from a noisy multicomponent signal successively. The Simulations and experiments show that the proposed method has better performance in component extraction from noisy multicomponent signal as well as provides more time-frequency details about the analyzed signal than conventional methods.

  7. Lacunary Fourier Series and a Qualitative Uncertainty Principle for ...

    Indian Academy of Sciences (India)

    We define lacunary Fourier series on a compact connected semisimple Lie group . If f ∈ L 1 ( G ) has lacunary Fourier series and vanishes on a non empty open subset of , then we prove that vanishes identically. This result can be viewed as a qualitative uncertainty principle.

  8. Bilaterally symmetric Fourier approximations of the skull outlines of ...

    Indian Academy of Sciences (India)

    Present work illustrates a scheme of quantitative description of the shape of the skull outlines of temnospondyl amphibians using bilaterally symmetric closed Fourier curves. Some special points have been identified on the Fourier fits of the skull outlines, which are the local maxima, or minima of the distances from the ...

  9. Fourier transformations for difference analogs of the harmonic oscillator

    International Nuclear Information System (INIS)

    Askey, R.; Atakishiyev, N.M.

    1995-01-01

    The relation between the Mehler bilinear generating function for the Hermite polynomials and the kernel of the Fourier transformation that connect the spaces of coordinate and momentum is discussed. On the base of the relation the discrete analogs of the Fourier transformation for the Kravchuk and Charlier functions are considered. 6 refs

  10. The Fourier Transform for Certain HyperKähler Fourfolds

    NARCIS (Netherlands)

    Shen, M.; Vial, C.

    2016-01-01

    Using a codimension-1 algebraic cycle obtained from the Poincaré line bundle, Beauville defined the Fourier transform on the Chow groups of an abelian variety A and showed that the Fourier transform induces a decomposition of the Chow ring CH∗(A). By using a codimension-2 algebraic cycle

  11. Infrared Fourier spectres of pectin obtained from pumpkin

    International Nuclear Information System (INIS)

    Usmanova, S.R.; Dzhonmurodov, A.S.; Nazirova, Kh.I.; Mukhidinov, Z.K.

    2015-01-01

    Present article is devoted to infrared Fourier spectres of pectin obtained from pumpkin. The analysis of pectin obtained from pumpkin was conducted by means of infrared spectrophotometer with Fourier transformation. The infrared spectroscopic study of pectin polysaccharide fraction of pectin matter, as well as pectin helium and micro helium obtained by means of fast extraction was conducted.

  12. Time-of-flight Fourier spectrometry of UCN

    International Nuclear Information System (INIS)

    Kulin, G.V.; Frank, A.I.; Goryunov, S.V.; Kustov, D.V.; Geltenbort, P.; Jentshel, M.; Strepetov, A.N.; Bushuev, V.A.

    2014-01-01

    The results of preliminary experiments on TOF Fourier UCN spectrometry are presented. The description of the new Fourier spectrometer that may be used for the measurement of the UCN spectra arising from diffraction by a moving grating is given. The results of preliminary experiments and Monte Carlo calculations give reason to hope for the success of the planned experiment.

  13. Fourier path-integral Monte Carlo methods: Partial averaging

    International Nuclear Information System (INIS)

    Doll, J.D.; Coalson, R.D.; Freeman, D.L.

    1985-01-01

    Monte Carlo Fourier path-integral techniques are explored. It is shown that fluctuation renormalization techniques provide an effective means for treating the effects of high-order Fourier contributions. The resulting formalism is rapidly convergent, is computationally convenient, and has potentially useful variational aspects

  14. Exploring Fourier Series and Gibbs Phenomenon Using Mathematica

    Science.gov (United States)

    Ghosh, Jonaki B.

    2011-01-01

    This article describes a laboratory module on Fourier series and Gibbs phenomenon which was undertaken by 32 Year 12 students. It shows how the use of CAS played the role of an "amplifier" by making higher level mathematical concepts accessible to students of year 12. Using Mathematica students were able to visualise Fourier series of…

  15. Fourier transform in multimode systems in the Bargmann representation

    International Nuclear Information System (INIS)

    Lei, C; Vourdas, A

    2007-01-01

    A Fourier transform in a multimode system is studied, using the Bargmann representation. The growth of a Bargmann function is shown to be related to the second-order correlation of the corresponding state. Both the total growth and the total second-order correlation remain unchanged under the Fourier transform. Examples with coherent states, squeezed states and Mittag-Leffler states are discussed

  16. Revisiting the quantum harmonic oscillator via unilateral Fourier transforms

    International Nuclear Information System (INIS)

    Nogueira, Pedro H F; Castro, Antonio S de

    2016-01-01

    The literature on the exponential Fourier approach to the one-dimensional quantum harmonic oscillator problem is revised and criticized. It is shown that the solution of this problem has been built on faulty premises. The problem is revisited via the Fourier sine and cosine transform method and the stationary states are properly determined by requiring definite parity and square-integrable eigenfunctions. (paper)

  17. Realization of quantum Fourier transform over ZN

    International Nuclear Information System (INIS)

    Fu Xiang-Qun; Bao Wan-Su; Li Fa-Da; Zhang Yu-Chao

    2014-01-01

    Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform (QFT) over Z N based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over Z N can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t-bit quantile transform, and introduce the definition of t-bit semiclassical QFT over Z N . According to probability amplitude, we prove that the transform can be used to realize QFT over Z N and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over Z N . (general)

  18. First order deformations of the Fourier matrix

    Energy Technology Data Exchange (ETDEWEB)

    Banica, Teodor, E-mail: teo.banica@gmail.com [Department of Mathematics, Cergy-Pontoise University, 95000 Cergy-Pontoise (France)

    2014-01-15

    The N × N complex Hadamard matrices form a real algebraic manifold C{sub N}. The singularity at a point H ∈ C{sub N} is described by a filtration of cones T{sub H}{sup ×}C{sub N}⊂T{sub H}{sup ∘}C{sub N}⊂T{sub H}C{sub N}⊂T{sup ~}{sub H}C{sub N}, coming from the trivial, affine, smooth, and first order deformations. We study here these cones in the case where H = F{sub N} is the Fourier matrix, (w{sup ij}) with w = e{sup 2πi/N}, our main result being a simple description of T{sup ~}{sub H}C{sub N}. As a consequence, the rationality conjecture dim{sub R}(T{sup ~}{sub H}C{sub N})=dim{sub Q}(T{sup ~}{sub H}C{sub N}∩M{sub N}(Q)) holds at H = F{sub N}.

  19. The relationship between shock response spectrum and fast Fourier transform

    International Nuclear Information System (INIS)

    Zola, Maurizio

    2001-01-01

    In this paper the basic relationship between response spectrum and fast Fourier transform is laid down. Since a long time the response spectrum has been used by structural engineers in the seismic domain and nowadays it is going to be used to define transient motions. This way to define the excitation is more general and more real than the use of classical shape pulses for the reproduction of real environment. Nevertheless the response spectrum of a real excitation represents a loss of some information with respect to the Fourier transform. A useful discussion could arise from these observations. Appendix A gives the relationship between the mathematic Fourier transform and the digital Fourier transform given by computers, while Appendix B gives some examples of response spectra and Fourier transforms of simple functions. (author)

  20. Mathematical principles of signal processing Fourier and wavelet analysis

    CERN Document Server

    Brémaud, Pierre

    2002-01-01

    Fourier analysis is one of the most useful tools in many applied sciences. The recent developments of wavelet analysis indicates that in spite of its long history and well-established applications, the field is still one of active research. This text bridges the gap between engineering and mathematics, providing a rigorously mathematical introduction of Fourier analysis, wavelet analysis and related mathematical methods, while emphasizing their uses in signal processing and other applications in communications engineering. The interplay between Fourier series and Fourier transforms is at the heart of signal processing, which is couched most naturally in terms of the Dirac delta function and Lebesgue integrals. The exposition is organized into four parts. The first is a discussion of one-dimensional Fourier theory, including the classical results on convergence and the Poisson sum formula. The second part is devoted to the mathematical foundations of signal processing - sampling, filtering, digital signal proc...

  1. Applied Fourier analysis from signal processing to medical imaging

    CERN Document Server

    Olson, Tim

    2017-01-01

    The first of its kind, this focused textbook serves as a self-contained resource for teaching from scratch the fundamental mathematics of Fourier analysis and illustrating some of its most current, interesting applications, including medical imaging and radar processing. Developed by the author from extensive classroom teaching experience, it provides a breadth of theory that allows students to appreciate the utility of the subject, but at as accessible a depth as possible. With myriad applications included, this book can be adapted to a one or two semester course in Fourier Analysis or serve as the basis for independent study. Applied Fourier Analysis assumes no prior knowledge of analysis from its readers, and begins by making the transition from linear algebra to functional analysis. It goes on to cover basic Fourier series and Fourier transforms before delving into applications in sampling and interpolation theory, digital communications, radar processing, medical i maging, and heat and wave equations. Fo...

  2. Solution of 3-dimensional diffusion equation by finite Fourier transformation

    International Nuclear Information System (INIS)

    Krishnani, P.D.

    1978-01-01

    Three dimensional diffusion equation in Cartesian co-ordinates is solved by using the finite Fourier transformation. This method is different from the usual Fourier transformation method in the sense that the solutions are obtained without performing the inverse Fourier transformation. The advantage has been taken of the fact that the flux is finite and integrable in the finite region. By applying this condition, a two-dimensional integral equation, involving flux and its normal derivative at the boundary, is obtained. By solving this equation with given boundary conditions, all of the boundary values are determined. In order to calculate the flux inside the region, flux is expanded into three-dimensional Fourier series. The Fourier coefficients of the flux in the region are calculated from the boundary values. The advantage of this method is that the integrated flux is obtained without knowing the fluxes inside the region as in the case of finite difference method. (author)

  3. Fourier convergence analysis applied to neutron diffusion Eigenvalue problem

    International Nuclear Information System (INIS)

    Lee, Hyun Chul; Noh, Jae Man; Joo, Hyung Kook

    2004-01-01

    Fourier error analysis has been a standard technique for the stability and convergence analysis of linear and nonlinear iterative methods. Though the methods can be applied to Eigenvalue problems too, all the Fourier convergence analyses have been performed only for fixed source problems and a Fourier convergence analysis for Eigenvalue problem has never been reported. Lee et al proposed new 2-D/1-D coupling methods and they showed that the new ones are unconditionally stable while one of the two existing ones is unstable at a small mesh size and that the new ones are better than the existing ones in terms of the convergence rate. In this paper the convergence of method A in reference 4 for the diffusion Eigenvalue problem was analyzed by the Fourier analysis. The Fourier convergence analysis presented in this paper is the first one applied to a neutronics eigenvalue problem to the best of our knowledge

  4. Double Fourier analysis for Emotion Identification in Voiced Speech

    International Nuclear Information System (INIS)

    Sierra-Sosa, D.; Bastidas, M.; Ortiz P, D.; Quintero, O.L.

    2016-01-01

    We propose a novel analysis alternative, based on two Fourier Transforms for emotion recognition from speech. Fourier analysis allows for display and synthesizes different signals, in terms of power spectral density distributions. A spectrogram of the voice signal is obtained performing a short time Fourier Transform with Gaussian windows, this spectrogram portraits frequency related features, such as vocal tract resonances and quasi-periodic excitations during voiced sounds. Emotions induce such characteristics in speech, which become apparent in spectrogram time-frequency distributions. Later, the signal time-frequency representation from spectrogram is considered an image, and processed through a 2-dimensional Fourier Transform in order to perform the spatial Fourier analysis from it. Finally features related with emotions in voiced speech are extracted and presented. (paper)

  5. Development of an polarization sensitive Fourier domain optical coherence tomography and it utilization on the Mueller matrix determination

    International Nuclear Information System (INIS)

    Raele, Marcus Paulo

    2009-01-01

    This study approached theoretical and experimental aspects related with the development of a polarization sensitive, Fourier domain, optical coherence tomography system (PS-FD-OCT) and its utilization on the Mueller Matrix determination. This work began with a bibliographic revision, which describes since the early studies to the actual state of the art of the technique. The mathematical formalism of Fourier domain low coherence interferometry and light polarization was performed as well. Studies based on numerical simulations, of three different algorithm types, responsible to recover the scattering profile, were done. The implemented algorithms were: Direct Fourier Transform, Interpolation and zero-filling. By the end of the simulation study, was possible to conclude that the algorithm zero-filling 2N presented better characteristics when compared with the others. In the experimental part, firstly different OCT setups were assembled and measurements were done in order to verify aspects related with the theory. Then, using a polymeric sample, birefringence images were performed, which allowed determining the sample birefringence quantitatively. Finally, images taken of different polarization states were collected, and through then images related with the Mueller Matrix elements were calculated, which were analyzed individually. (author)

  6. Geographical traceability of Marsdenia tenacissima by Fourier transform infrared spectroscopy and chemometrics

    Science.gov (United States)

    Li, Chao; Yang, Sheng-Chao; Guo, Qiao-Sheng; Zheng, Kai-Yan; Wang, Ping-Li; Meng, Zhen-Gui

    2016-01-01

    A combination of Fourier transform infrared spectroscopy with chemometrics tools provided an approach for studying Marsdenia tenacissima according to its geographical origin. A total of 128 M. tenacissima samples from four provinces in China were analyzed with FTIR spectroscopy. Six pattern recognition methods were used to construct the discrimination models: support vector machine-genetic algorithms, support vector machine-particle swarm optimization, K-nearest neighbors, radial basis function neural network, random forest and support vector machine-grid search. Experimental results showed that K-nearest neighbors was superior to other mathematical algorithms after data were preprocessed with wavelet de-noising, with a discrimination rate of 100% in both the training and prediction sets. This study demonstrated that FTIR spectroscopy coupled with K-nearest neighbors could be successfully applied to determine the geographical origins of M. tenacissima samples, thereby providing reliable authentication in a rapid, cheap and noninvasive way.

  7. Matching-pursuit/split-operator Fourier-transform simulations of nonadiabatic quantum dynamics

    Science.gov (United States)

    Wu, Yinghua; Herman, Michael F.; Batista, Victor S.

    2005-03-01

    A rigorous and practical approach for simulations of nonadiabatic quantum dynamics is introduced. The algorithm involves a natural extension of the matching-pursuit/split-operator Fourier-transform (MP/SOFT) method [Y. Wu and V. S. Batista, J. Chem. Phys. 121, 1676 (2004)] recently developed for simulations of adiabatic quantum dynamics in multidimensional systems. The MP/SOFT propagation scheme, extended to nonadiabatic dynamics, recursively applies the time-evolution operator as defined by the standard perturbation expansion to first-, or second-order, accuracy. The expansion is implemented in dynamically adaptive coherent-state representations, generated by an approach that combines the matching-pursuit algorithm with a gradient-based optimization method. The accuracy and efficiency of the resulting propagation method are demonstrated as applied to the canonical model systems introduced by Tully for testing simulations of dual curve-crossing nonadiabatic dynamics.

  8. Noise analysis of the measurement of group delay in Fourier white-light interferometric cross correlation

    International Nuclear Information System (INIS)

    Laude, Vincent

    2002-01-01

    The problem of noise analysis in measuring the group delay introduced by a dispersive optical element by use of white-light interferometric cross correlation is investigated. Two noise types, detection noise and position noise, are specifically analyzed. Detection noise is shown to be highly sensitive to the spectral content of the white-light source at the frequency considered and to the temporal acquisition window. Position noise, which arises from the finite accuracy of the measurement of the scanning mirror's position, can severely damage the estimation of the group delay. Such is shown to be the case for fast Fourier transform-based estimation algorithms. A new algorithm that is insensitive to scanning delay errors is proposed, and subfemtosecond accuracy is obtained without any postprocessing

  9. Thyroid lesions diagnosis by Fourier transformed infrared absorption spectroscopy (FTIR)

    International Nuclear Information System (INIS)

    Albero, Felipe Guimaraes

    2009-01-01

    Thyroid nodules are a common disorder, with 4-7% of incidence in the Brazilian population. Although the fine needle aspiration (FNA) is an accurate method for thyroid tumors diagnosis, the discrimination between benign and malignant neoplasm is currently not possible in some cases with high incidence of false negative diagnosis, leading to a surgical intervention due to the risk of carcinomas. The aim of this study was to verify if the Fourier Transform infrared spectroscopy (FTIR) can contribute to the diagnosis of thyroid carcinomas and goiters, using samples of tissue and aspirates. Samples of FNA, homogenates and tissues of thyroid nodules with histopathological diagnosis were obtained and prepared for FTIR spectroscopy analysis. The FNA and homogenates samples were measured by μ-FTIR (between 950 . 1750 cm -1 ), at a nominal resolution of 4 cm -1 and 120 scans). Tissue samples were analyzed directly by ATR-FTIR technique, at a resolution 2 cm -1 , with 60 scans in the same region. All spectra were corrected by the baseline and normalized by amides area (1550-1640 cm -1 ) in order to minimize variations of sample homogeneity. Then, spectra were converted into second derivatives using the Savitzk-Golay algorithm with a 13 points window. The Ward's minimum variance algorithm and Euclidean distances among the points were used for cluster analysis. Some FNA samples showed complex spectral pattern. All samples showed some cell pellets and large amount of hormone, represented by the bands of 1545 and 1655 cm -1 . Bands in 1409, 1412, 1414, 1578 and 1579 cm -1 were also found, indicating possible presence of sugar, DNA, citric acid or metabolic products. In this study, it was obtained an excellent separation between goiter and malign lesion for the samples of tissues, with 100% of specificity in specific cluster and 67% sensibility and 50 of specificity. In homogenate and FNA samples this sensibility and specificity were lower, because among these samples, it were

  10. A new fast algorithm for computing a complex number: Theoretic transforms

    Science.gov (United States)

    Reed, I. S.; Liu, K. Y.; Truong, T. K.

    1977-01-01

    A high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.

  11. The Scope Of Fourier Transform Infrared (FTIR)

    Science.gov (United States)

    Hirschfeld, T.

    1981-10-01

    Three auarters of a century after its inception, a generation after its advantages were recognized, and a decade after its first commercialization, FT-IR dominates the growth of the IR market, and reigns alone over its high performance end. What lies ahead for FT-IR now? On one hand, the boundary between it and the classical scanning spectrometers is becoming fuzzy, as gratings attempt to use as much of FT-IR's computer technology as they can handle, and smaller FT systems invade the medium cost instrument range. On the other hand, technology advances in IR detectors, non-Fourier interference devices, and the often announced tunable laser are at long last getting set to make serious inroads in the field (although not necessarily in the manner most of us expected). However, the dominance of FT-IR as the leading edge of IR spectroscopy seems assured for a good many years. The evolution of FT-IR will be dominated by demands not yet fully satisfied such as rapid sample turnover, better quantitation, automated interpretation, higher GC-IR sensitivity, improved LC-IR, and, above all else, reliability and ease of use. These developments will be based on multiple small advances in hardware, large advances in the way systems are put together, and the traditional yearly revolutionary advances of the computer industry. The big question in the field will, however, still be whether our ambition and our skill can continue to keep up with the advances of our tools. It will be fun.

  12. Cryogenic Scan Mechanism for Fourier Transform Spectrometer

    Science.gov (United States)

    Brasunas, John C.; Francis, John L.

    2011-01-01

    A compact and lightweight mechanism has been developed to accurately move a Fourier transform spectrometer (FTS) scan mirror (a cube corner) in a near-linear fashion with near constant speed at cryogenic temperatures. This innovation includes a slide mechanism to restrict motion to one dimension, an actuator to drive the motion, and a linear velocity transducer (LVT) to measure the speed. The cube corner mirror is double-passed in one arm of the FTS; double-passing is required to compensate for optical beam shear resulting from tilting of the moving cube corner. The slide, actuator, and LVT are off-the-shelf components that are capable of cryogenic vacuum operation. The actuator drives the slide for the required travel of 2.5 cm. The LVT measures translation speed. A proportional feedback loop compares the LVT voltage with the set voltage (speed) to derive an error signal to drive the actuator and achieve near constant speed. When the end of the scan is reached, a personal computer reverses the set voltage. The actuator and LVT have no moving parts in contact, and have magnetic properties consistent with cryogenic operation. The unlubricated slide restricts motion to linear travel, using crossed roller bearings consistent with 100-million- stroke operation. The mechanism tilts several arc seconds during transport of the FTS mirror, which would compromise optical fringe efficiency when using a flat mirror. Consequently, a cube corner mirror is used, which converts a tilt into a shear. The sheared beam strikes (at normal incidence) a flat mirror at the end of the FTS arm with the moving mechanism, thereby returning upon itself and compensating for the shear

  13. A transformada de Fourier em basic The Fourier transform (FFT in basic

    Directory of Open Access Journals (Sweden)

    Mauricio Gomes Constantino

    2000-06-01

    Full Text Available In this paper we describe three computer programs in Basic language about the Fourier transform (FFT which are available in the Internet site http://artemis.ffclrp.usp.br/SoftwareE.htm (in English or http://artemis.ffclrp.usp.br/softwareP.htm (in Portuguese since October 1998. Those are addresses to the Web Page of our Laboratory of Organic Synthesis. The programs can be downloaded and used by anyone who is interested on the subject. The texts, menus and captions in the programs are written in English.

  14. Algorithmic chemistry

    Energy Technology Data Exchange (ETDEWEB)

    Fontana, W.

    1990-12-13

    In this paper complex adaptive systems are defined by a self- referential loop in which objects encode functions that act back on these objects. A model for this loop is presented. It uses a simple recursive formal language, derived from the lambda-calculus, to provide a semantics that maps character strings into functions that manipulate symbols on strings. The interaction between two functions, or algorithms, is defined naturally within the language through function composition, and results in the production of a new function. An iterated map acting on sets of functions and a corresponding graph representation are defined. Their properties are useful to discuss the behavior of a fixed size ensemble of randomly interacting functions. This function gas'', or Turning gas'', is studied under various conditions, and evolves cooperative interaction patterns of considerable intricacy. These patterns adapt under the influence of perturbations consisting in the addition of new random functions to the system. Different organizations emerge depending on the availability of self-replicators.

  15. An efficient pricing algorithm for swing options based on Fourier cosine expansions

    NARCIS (Netherlands)

    Zhang, B.; Oosterlee, C.W.

    2013-01-01

    Swing options give contract holders the right to modify amounts of future delivery of certain commodities, such as electricity or gas. We assume that these options can be exercised at any time before the end of the contract, and more than once. However, a recovery time between any two consecutive

  16. ITERATIVE ALGORITHM FOR NONUNIFORM INVERSE FAST FOURIER TRANSFORM (NU- IFFT). (R825225)

    Science.gov (United States)

    The perspectives, information and conclusions conveyed in research project abstracts, progress reports, final reports, journal abstracts and journal publications convey the viewpoints of the principal investigator and may not represent the views and policies of ORD and EPA. Concl...

  17. An efficient pricing algorithm for swing options based on Fourier cosine expansions

    NARCIS (Netherlands)

    B. Zhang (Bo); C.W. Oosterlee (Kees)

    2013-01-01

    htmlabstractSwing options give contract holders the right to modify amounts of future delivery of certain commodities, such as electricity or gas. We assume that these options can be exercised at any time before the end of the contract, and more than once. However, a recovery time between any two

  18. Corrected Fourier series and its application to function approximation

    Directory of Open Access Journals (Sweden)

    Qing-Hua Zhang

    2005-01-01

    Full Text Available Any quasismooth function f(x in a finite interval [0,x0], which has only a finite number of finite discontinuities and has only a finite number of extremes, can be approximated by a uniformly convergent Fourier series and a correction function. The correction function consists of algebraic polynomials and Heaviside step functions and is required by the aperiodicity at the endpoints (i.e., f(0≠f(x0 and the finite discontinuities in between. The uniformly convergent Fourier series and the correction function are collectively referred to as the corrected Fourier series. We prove that in order for the mth derivative of the Fourier series to be uniformly convergent, the order of the polynomial need not exceed (m+1. In other words, including the no-more-than-(m+1 polynomial has eliminated the Gibbs phenomenon of the Fourier series until its mth derivative. The corrected Fourier series is then applied to function approximation; the procedures to determine the coefficients of the corrected Fourier series are illustrated in detail using examples.

  19. Distributed Kalman filtering compared to Fourier domain preconditioned conjugate gradient for laser guide star tomography on extremely large telescopes.

    Science.gov (United States)

    Gilles, Luc; Massioni, Paolo; Kulcsár, Caroline; Raynaud, Henri-François; Ellerbroek, Brent

    2013-05-01

    This paper discusses the performance and cost of two computationally efficient Fourier-based tomographic wavefront reconstruction algorithms for wide-field laser guide star (LGS) adaptive optics (AO). The first algorithm is the iterative Fourier domain preconditioned conjugate gradient (FDPCG) algorithm developed by Yang et al. [Appl. Opt.45, 5281 (2006)], combined with pseudo-open-loop control (POLC). FDPCG's computational cost is proportional to N log(N), where N denotes the dimensionality of the tomography problem. The second algorithm is the distributed Kalman filter (DKF) developed by Massioni et al. [J. Opt. Soc. Am. A28, 2298 (2011)], which is a noniterative spatially invariant controller. When implemented in the Fourier domain, DKF's cost is also proportional to N log(N). Both algorithms are capable of estimating spatial frequency components of the residual phase beyond the wavefront sensor (WFS) cutoff frequency thanks to regularization, thereby reducing WFS spatial aliasing at the expense of more computations. We present performance and cost analyses for the LGS multiconjugate AO system under design for the Thirty Meter Telescope, as well as DKF's sensitivity to uncertainties in wind profile prior information. We found that, provided the wind profile is known to better than 10% wind speed accuracy and 20 deg wind direction accuracy, DKF, despite its spatial invariance assumptions, delivers a significantly reduced wavefront error compared to the static FDPCG minimum variance estimator combined with POLC. Due to its nonsequential nature and high degree of parallelism, DKF is particularly well suited for real-time implementation on inexpensive off-the-shelf graphics processing units.

  20. Optimization and experimental realization of the quantum permutation algorithm

    Science.gov (United States)

    Yalçınkaya, I.; Gedik, Z.

    2017-12-01

    The quantum permutation algorithm provides computational speed-up over classical algorithms for determining the parity of a given cyclic permutation. For its n -qubit implementations, the number of required quantum gates scales quadratically with n due to the quantum Fourier transforms included. We show here for the n -qubit case that the algorithm can be simplified so that it requires only O (n ) quantum gates, which theoretically reduces the complexity of the implementation. To test our results experimentally, we utilize IBM's 5-qubit quantum processor to realize the algorithm by using the original and simplified recipes for the 2-qubit case. It turns out that the latter results in a significantly higher success probability which allows us to verify the algorithm more precisely than the previous experimental realizations. We also verify the algorithm for the first time for the 3-qubit case with a considerable success probability by taking the advantage of our simplified scheme.

  1. Residual Stress Studies Using the Cairo Fourier Diffractometer Facility

    International Nuclear Information System (INIS)

    Maayouf, R.M.A.; El-Shaer, Y.H.

    2002-01-01

    The present paper deals with residual stress studies using the Cairo Fourier diffractometer facility CFDF. The CFDF is a reverse - time of -flight (RTOF) diffractometer; applies a Fourier chopper. The measurements were performed for copper samples in order to study the residual stress after welding. The maximum modulation of the Fourier chopper during the measurements was 136 khz; leading to a time resolution half-width of about 7 μ s. It has been found from the present measurements that, the resulting diffraction spectra could be successfully used for studying the residual stress; in the wavelength range between 0.7-2.9 A degree at ∼ 0.45 % relative resolution

  2. The application and improvement of Fourier transform spectrometer experiment

    Science.gov (United States)

    Liu, Zhi-min; Gao, En-duo; Zhou, Feng-qi; Wang, Lan-lan; Feng, Xiao-hua; Qi, Jin-quan; Ji, Cheng; Wang, Luning

    2017-08-01

    According to teaching and experimental requirements of Optoelectronic information science and Engineering, in order to consolidate theoretical knowledge and improve the students practical ability, the Fourier transform spectrometer ( FTS) experiment, its design, application and improvement are discussed in this paper. The measurement principle and instrument structure of Fourier transform spectrometer are introduced, and the spectrums of several common Laser devices are measured. Based on the analysis of spectrum and test, several possible improvement methods are proposed. It also helps students to understand the application of Fourier transform in physics.

  3. Fourier transform spectroscopy of semiconductor materials

    International Nuclear Information System (INIS)

    Jonak-Auer, I.

    1996-11-01

    In order to determine the type of charge carriers, i.e. electrons or holes, participating in optical transitions, cyclotron resonance experiments using circularly polarized radiation were performed on strained-layer [111]-oriented InGaAs/(Al)GaAs multiple quantum wells and on a [100]-oriented InAs/GaSb double-heterostructure. Because of the rather complicated band-structures of these samples it is a priori unknown which carriers take part in transitions. The measurements yield the surprising result, that for the InGaAs/GaAs multiple quantum well the experimentally observed cyclotron resonance appears in the electron-active polarization in the frequency-regime of the Far Infrared (FIR), but in the hole-active polarization in the range of millimeter waves, whereas for the InGaAs/AlGaAs sample the resonance is caused by holes also in the FIR. Since by theoretical considerations the possibility of electrons causing the FIR cyclotron resonance could be excluded, the measurements are interpreted as being caused by holes due to broken selection rules. In the InAs/GaSb sample hole cyclotron resonance could for the first time be measured on a double-heterostructure. As for the application oriented measurements, they comprised a study of the hydrogen content of amorphous silicon nitride layers, and were performed in collaboration with Austria Mikro Systeme International AG. Fourier spectroscopy is a fast and non-destructive means for determining impurity concentrations. Radiation in the Mid Infrared regime stimulates N-H and Si-H stretching vibrations which lead to absorption peaks and can directly be attributed to the hydrogen concentration via calibration factors taken from the literature. In comparison with recommended procedures in the literature, a much higher accuracy in determining the areas of the absorption peaks could be gained in the course of this thesis by a proper polynomial fit of the background spectrum outside the absorption lines. The hydrogen content of

  4. Combined Helmholtz Integral Equation - Fourier series formulation of acoustical radiation and scattering problems

    CSIR Research Space (South Africa)

    Fedotov, I

    2006-07-01

    Full Text Available The Combined Helmholtz Integral Equation – Fourier series Formulation (CHIEFF) is based on representation of a velocity potential in terms of Fourier series and finding the Fourier coefficients of this expansion. The solution could be substantially...

  5. Almost everywhere convergence over cubes of multiple trigonometric Fourier series

    International Nuclear Information System (INIS)

    Antonov, N Yu

    2004-01-01

    Under certain conditions on a function φ:[0,+∞)→[0,+∞) we prove a theorem asserting that the convergence almost everywhere of trigonometric Fourier series for all functions of class φ(L) [-π,π) implies the convergence over cubes of the multiple Fourier series and all its conjugates for an arbitrary function f element of φ(L)(log + L) d-1 ) [-π,π) d , d element of N. It follows from this and an earlier result of the author on the convergence almost everywhere of Fourier series of functions of one variable and class L(log + L)(log + log + log + L)) [-π,π) that if f element of L(log + L) d (log + log + log + L)) [-π,π) d , d element of N, then the Fourier series of f and all its conjugates converge over cubes almost everywhere

  6. On the Equisummability of Hermite and Fourier Expansions

    Indian Academy of Sciences (India)

    We prove an equisummability result for the Fourier expansions and Hermite expansions as well as special Hermite expansions. We also prove the uniform boundedness of the Bochner-Riesz means associated to the Hermite expansions for polyradial functions.

  7. q-Generalization of the inverse Fourier transform

    International Nuclear Information System (INIS)

    Jauregui, M.; Tsallis, C.

    2011-01-01

    A wide class of physical distributions appears to follow the q-Gaussian form, which plays the role of attractor according to a q-generalized Central Limit Theorem, where a q-generalized Fourier transform plays an important role. We introduce here a method which determines a distribution from the knowledge of its q-Fourier transform and some supplementary information. This procedure involves a recently q-generalized representation of the Dirac delta and the class of functions on which it acts. The present method conveniently extends the inverse of the standard Fourier transform, and is therefore expected to be very useful in the study of many complex systems. - Highlights: → We present a method to invert the q-Fourier transform of a distribution. → We illustrate when Dirac delta can be represented using q-exponentials. → We describe a family of functions for which this new representation works.

  8. On Sums of Numerical Series and Fourier Series

    Science.gov (United States)

    Pavao, H. Germano; de Oliveira, E. Capelas

    2008-01-01

    We discuss a class of trigonometric functions whose corresponding Fourier series, on a conveniently chosen interval, can be used to calculate several numerical series. Particular cases are presented and two recent results involving numerical series are recovered. (Contains 1 note.)

  9. On the physical relevance of the discrete Fourier transform

    CSIR Research Space (South Africa)

    Greben, JM

    1991-11-01

    Full Text Available This paper originated from the author's dissatisfaction with the way the discrete Fourier transform is usually presented in the literature. Although mathematically correct, the physical meaning of the common representation is unsatisfactory...

  10. Decay properties of linear thermoelastic plates: Cattaneo versus Fourier law

    KAUST Repository

    Said-Houari, Belkacem

    2013-02-01

    In this article, we investigate the decay properties of the linear thermoelastic plate equations in the whole space for both Fourier and Cattaneo\\'s laws of heat conduction. We point out that while the paradox of infinite propagation speed inherent in Fourier\\'s law is removed by changing to the Cattaneo law, the latter always leads to a loss of regularity of the solution. The main tool used to prove our results is the energy method in the Fourier space together with some integral estimates. We prove the decay estimates for initial data U0 ∈ Hs(ℝ) ∩ L1(ℝ). In addition, by restricting the initial data to U0 ∈ Hs(ℝ) ∩ L1,γ(ℝ) and γ ∈ [0, 1], we can derive faster decay estimates with the decay rate improvement by a factor of t-γ/2. © 2013 Copyright Taylor and Francis Group, LLC.

  11. Extending Single-Molecule Microscopy Using Optical Fourier Processing

    Science.gov (United States)

    2015-01-01

    This article surveys the recent application of optical Fourier processing to the long-established but still expanding field of single-molecule imaging and microscopy. A variety of single-molecule studies can benefit from the additional image information that can be obtained by modulating the Fourier, or pupil, plane of a widefield microscope. After briefly reviewing several current applications, we present a comprehensive and computationally efficient theoretical model for simulating single-molecule fluorescence as it propagates through an imaging system. Furthermore, we describe how phase/amplitude-modulating optics inserted in the imaging pathway may be modeled, especially at the Fourier plane. Finally, we discuss selected recent applications of Fourier processing methods to measure the orientation, depth, and rotational mobility of single fluorescent molecules. PMID:24745862

  12. Decay properties of linear thermoelastic plates: Cattaneo versus Fourier law

    KAUST Repository

    Said-Houari, Belkacem

    2013-01-01

    In this article, we investigate the decay properties of the linear thermoelastic plate equations in the whole space for both Fourier and Cattaneo's laws of heat conduction. We point out that while the paradox of infinite propagation speed inherent

  13. A fourier transform quality measure for iris images

    CSIR Research Space (South Africa)

    Makinana, S

    2014-08-01

    Full Text Available to ensure that good quality images are selected for feature extraction, in order to improve iris recognition system. In addition, this research proposes a measure of iris image quality using a Fourier Transform. The experimental results demonstrate...

  14. Error Analysis for Fourier Methods for Option Pricing

    KAUST Repository

    Hä ppö lä , Juho

    2016-01-01

    We provide a bound for the error committed when using a Fourier method to price European options when the underlying follows an exponential Levy dynamic. The price of the option is described by a partial integro-differential equation (PIDE

  15. Surface Fourier-transform lens using a metasurface

    International Nuclear Information System (INIS)

    Li, Yun Bo; Cai, Ben Geng; Cheng, Qiang; Cui, Tie Jun

    2015-01-01

    We propose a surface (or 2D) Fourier-transform lens using a gradient refractive index (GRIN) metasurface in the microwave band, which is composed of sub-wavelength quasi-periodical metallic patches on a grounded dielectric substrate. Such a metasurface supports the transverse magnetic (TM) modes of surface waves. To gradually change the size of textures, we obtain different surface refractive indices, which can be tailored to fit the required refractive-index profile of a surface Fourier-transform lens. According to the theory of spatial Fourier transformation, we make use of the proposed lens to realize surface plane-wave scanning under different feeding locations. The simulation and experimental results jointly confirm the validity of the surface Fourier-transform lens. The proposed method can also be extended to the terahertz frequency. (paper)

  16. Fourier-Based Transmit Beampattern Design Using MIMO Radar

    KAUST Repository

    Lipor, John; Ahmed, Sajid; Alouini, Mohamed-Slim

    2014-01-01

    a constant-envelope or drawing from a finite alphabet. In this paper, a closed-form method to design for a uniform linear array is proposed that utilizes the discrete Fourier transform (DFT) coefficients and Toeplitz matrices. The resulting

  17. The Fourier law in a momentum-conserving chain

    NARCIS (Netherlands)

    Giardinà, C.; Kurchan, J.

    2005-01-01

    We introduce a family of models for heat conduction with and without momentum conservation. They are analytically solvable in the high temperature limit and can also be efficiently simulated. In all cases the Fourier law is verified in one dimension.

  18. Innovative design method of automobile profile based on Fourier descriptor

    Science.gov (United States)

    Gao, Shuyong; Fu, Chaoxing; Xia, Fan; Shen, Wei

    2017-10-01

    Aiming at the innovation of the contours of automobile side, this paper presents an innovative design method of vehicle side profile based on Fourier descriptor. The design flow of this design method is: pre-processing, coordinate extraction, standardization, discrete Fourier transform, simplified Fourier descriptor, exchange descriptor innovation, inverse Fourier transform to get the outline of innovative design. Innovative concepts of the innovative methods of gene exchange among species and the innovative methods of gene exchange among different species are presented, and the contours of the innovative design are obtained separately. A three-dimensional model of a car is obtained by referring to the profile curve which is obtained by exchanging xenogeneic genes. The feasibility of the method proposed in this paper is verified by various aspects.

  19. Fourier analysis in dynamic non periodic phenomena in nuclear medicine

    International Nuclear Information System (INIS)

    Constantinesco, A.; Lallot, C.

    1984-01-01

    The success of Fourier analysis in assessing cardiac function has led us to investigate other possible uses of this technique. We show that phase analysis applied to dynamic non periodic activity changes gives useful parametric functional images. The phase image is comparable to a transit time image, the amplitude image is comparable to the maximum variations of activity and the mean image corresponds to a normalized sum of images. Exemples of this powerful application of Fourier analysis are discussed [fr

  20. Simple optical setup implementation for digital Fourier transform holography

    Energy Technology Data Exchange (ETDEWEB)

    De Oliveira, G N [Pos-graduacao em Engenharia Mecanica, TEM/PGMEC, Universidade Federal Fluminense, Rua Passo da Patria, 156, Niteroi, R.J., Cep.: 24.210-240 (Brazil); Rodrigues, D M C; Dos Santos, P A M, E-mail: pams@if.uff.br [Instituto de Fisica, Laboratorio de Optica Nao-linear e Aplicada, Universidade Federal Fluminense, Av. Gal. Nilton Tavares de Souza, s/n, Gragoata, Niteroi, R.J., Cep.:24.210-346 (Brazil)

    2011-01-01

    In the present work a simple implementation of Digital Fourier Transform Holography (DFTH) setup is discussed. This is obtained making a very simple modification in the classical setup arquiteture of the Fourier Transform holography. It is also demonstrated the easy and practical viability of the setup in an interferometric application for mechanical parameters determination. The work is also proposed as an interesting advanced introductory training for graduated students in digital holography.

  1. A New Nonlinear Unit Root Test with Fourier Function

    OpenAIRE

    Güriş, Burak

    2017-01-01

    Traditional unit root tests display a tendency to be nonstationary in the case of structural breaks and nonlinearity. To eliminate this problem this paper proposes a new flexible Fourier form nonlinear unit root test. This test eliminates this problem to add structural breaks and nonlinearity together to the test procedure. In this test procedure, structural breaks are modeled by means of a Fourier function and nonlinear adjustment is modeled by means of an Exponential Smooth Threshold Autore...

  2. Self-Fourier functions and coherent laser combination

    International Nuclear Information System (INIS)

    Corcoran, C J; Pasch, K A

    2004-01-01

    The Gaussian and Comb functions are generally quoted as being the two basic functions that are their own Fourier transforms. In 1991, Caola presented a recipe for generating functions that are their own Fourier transforms by symmetrizing any transformable function and then adding its own Fourier transform to it. In this letter, we present a new method for generating a set of functions that are exactly their own Fourier transforms, and which have direct application to laser cavity design for a wide variety of applications. The generated set includes the Gaussian and Comb functions as special cases and forms a continuous bridge of functions between them. The new generating method uses the Gaussian and Comb functions as bases and does not rely on the Fourier operator itself. This self-Fourier function promises to be particularly useful in high-power laser design through coherent laser beam combination. Although these results are presented in a single dimension as with a linear array, the results are equally valid in two dimensions. (letter to the editor)

  3. Mathematical and information-geometrical entropy for phenomenological Fourier and non-Fourier heat conduction

    Science.gov (United States)

    Li, Shu-Nan; Cao, Bing-Yang

    2017-09-01

    The second law of thermodynamics governs the direction of heat transport, which provides the foundational definition of thermodynamic Clausius entropy. The definitions of entropy are further generalized for the phenomenological heat transport models in the frameworks of classical irreversible thermodynamics and extended irreversible thermodynamics (EIT). In this work, entropic functions from mathematics are combined with phenomenological heat conduction models and connected to several information-geometrical conceptions. The long-time behaviors of these mathematical entropies exhibit a wide diversity and physical pictures in phenomenological heat conductions, including the tendency to thermal equilibrium, and exponential decay of nonequilibrium and asymptotics, which build a bridge between the macroscopic and microscopic modelings. In contrast with the EIT entropies, the mathematical entropies expressed in terms of the internal energy function can avoid singularity paired with nonpositive local absolute temperature caused by non-Fourier heat conduction models.

  4. The geometric phase analysis method based on the local high resolution discrete Fourier transform for deformation measurement

    International Nuclear Information System (INIS)

    Dai, Xianglu; Xie, Huimin; Wang, Huaixi; Li, Chuanwei; Wu, Lifu; Liu, Zhanwei

    2014-01-01

    The geometric phase analysis (GPA) method based on the local high resolution discrete Fourier transform (LHR-DFT) for deformation measurement, defined as LHR-DFT GPA, is proposed to improve the measurement accuracy. In the general GPA method, the fundamental frequency of the image plays a crucial role. However, the fast Fourier transform, which is generally employed in the general GPA method, could make it difficult to locate the fundamental frequency accurately when the fundamental frequency is not located at an integer pixel position in the Fourier spectrum. This study focuses on this issue and presents a LHR-DFT algorithm that can locate the fundamental frequency with sub-pixel precision in a specific frequency region for the GPA method. An error analysis is offered and simulation is conducted to verify the effectiveness of the proposed method; both results show that the LHR-DFT algorithm can accurately locate the fundamental frequency and improve the measurement accuracy of the GPA method. Furthermore, typical tensile and bending tests are carried out and the experimental results verify the effectiveness of the proposed method. (paper)

  5. Linogram and other direct Fourier methods for tomographic reconstruction

    International Nuclear Information System (INIS)

    Magnusson, M.

    1993-01-01

    Computed tomography (CT) is an outstanding break-through in technology as well as in medical diagnostics. The aim in CT is to produce an image with good image quality as fast as possible. The two most well-known methods for CT-reconstruction are the Direct Fourier Method (DFM) and the Filtered Backprojection Method (FBM). This thesis is divided in four parts. In part 1 we give an introduction to the principles of CT as well as a basic treatise of the DFM and the FBM. We also present a short CT history as well as brief descriptions of techniques related to X-ray CT such as SPECT, PET and MRI. Part 2 is devoted to the Linogram Method (LM). The method is presented both intuitively and rigorously and a complete algorithm is given for the discrete case. The implementation has been done using the SNARK subroutine package with various parameters and phantom images. For comparison, the FBM has been applied to the same input projection data. The experiments show that the LM gives almost the same image quality, pixel for pixel, as the FBM. In part 3 we show that the LM is a close relative to the common DFM. We give a new extended explanation of artifacts in DFMs. The source of the problem is twofold: interpolation errors and circular convolution. By identifying the second effect as distinct from the first one, we are able to suggest and verify remedies for the DFM which brings the image quality on par with FBM. One of these remedies is the LM. A slight difficulty with both LM and ordinary DFM techniques is that they require a special projection geometry, whereas most commercial CT-scanners provides fan beam projection data. However, the wanted linogram projection data can be interpolated from fan beam projection data. In part 4, we show that it is possible to obtain good image quality with both LM and DFM techniques using fan beam projection indata. The thesis concludes that the computation cost can be essentially decreased by using LM or other DFMs instead of FBM

  6. Pseudo-deterministic Algorithms

    OpenAIRE

    Goldwasser , Shafi

    2012-01-01

    International audience; In this talk we describe a new type of probabilistic algorithm which we call Bellagio Algorithms: a randomized algorithm which is guaranteed to run in expected polynomial time, and to produce a correct and unique solution with high probability. These algorithms are pseudo-deterministic: they can not be distinguished from deterministic algorithms in polynomial time by a probabilistic polynomial time observer with black box access to the algorithm. We show a necessary an...

  7. Fourier analysis of parallel block-Jacobi splitting with transport synthetic acceleration in two-dimensional geometry

    International Nuclear Information System (INIS)

    Rosa, M.; Warsa, J. S.; Chang, J. H.

    2007-01-01

    A Fourier analysis is conducted in two-dimensional (2D) Cartesian geometry for the discrete-ordinates (SN) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) and Richardson iteration preconditioned with Transport Synthetic Acceleration (TSA), using the Parallel Block-Jacobi (PBJ) algorithm. The results for the un-accelerated algorithm show that convergence of PBJ can degrade, leading in particular to stagnation of GMRES(m) in problems containing optically thin sub-domains. The results for the accelerated algorithm indicate that TSA can be used to efficiently precondition an iterative method in the optically thin case when implemented in the 'modified' version MTSA, in which only the scattering in the low order equations is reduced by some non-negative factor β<1. (authors)

  8. Exact fan-beam and 4π-acquisition cone-beam SPECT algorithms with uniform attenuation correction

    International Nuclear Information System (INIS)

    Tang Qiulin; Zeng, Gengsheng L.; Wu Jiansheng; Gullberg, Grant T.

    2005-01-01

    This paper presents analytical fan-beam and cone-beam reconstruction algorithms that compensate for uniform attenuation in single photon emission computed tomography. First, a fan-beam algorithm is developed by obtaining a relationship between the two-dimensional (2D) Fourier transform of parallel-beam projections and fan-beam projections. Using this relationship, 2D Fourier transforms of equivalent parallel-beam projection data are obtained from the fan-beam projection data. Then a quasioptimal analytical reconstruction algorithm for uniformly attenuated Radon data, developed by Metz and Pan, is used to reconstruct the image. A cone-beam algorithm is developed by extending the fan-beam algorithm to 4π solid angle geometry. The cone-beam algorithm is also an exact algorithm

  9. Simulating first order optical systems—algorithms for and composition of discrete linear canonical transforms

    Science.gov (United States)

    Healy, John J.

    2018-01-01

    The linear canonical transforms (LCTs) are a parameterised group of linear integral transforms. The LCTs encompass a number of well-known transformations as special cases, including the Fourier transform, fractional Fourier transform, and the Fresnel integral. They relate the scalar wave fields at the input and output of systems composed of thin lenses and free space, along with other quadratic phase systems. In this paper, we perform a systematic search of all algorithms based on up to five stages of magnification, chirp multiplication and Fourier transforms. Based on that search, we propose a novel algorithm, for which we present numerical results. We compare the sampling requirements of three algorithms. Finally, we discuss some issues surrounding the composition of discrete LCTs.

  10. Automotive FMCW Radar-Enhanced Range Estimation via a Local Resampling Fourier Transform

    Directory of Open Access Journals (Sweden)

    Cailing Wang

    2016-02-01

    Full Text Available In complex traffic scenarios, more accurate measurement and discrimination for an automotive frequency-modulated continuous-wave (FMCW radar is required for intelligent robots, driverless cars and driver-assistant systems. A more accurate range estimation method based on a local resampling Fourier transform (LRFT for a FMCW radar is developed in this paper. Radar signal correlation in the phase space sees a higher signal-noise-ratio (SNR to achieve more accurate ranging, and the LRFT - which acts on a local neighbour as a refinement step - can achieve a more accurate target range. The rough range is estimated through conditional pulse compression (PC and then, around the initial rough estimation, a refined estimation through the LRFT in the local region achieves greater precision. Furthermore, the LRFT algorithm is tested in numerous simulations and physical system experiments, which show that the LRFT algorithm achieves a more precise range estimation than traditional FFT-based algorithms, especially for lower bandwidth signals.

  11. Polynomial Phase Estimation Based on Adaptive Short-Time Fourier Transform.

    Science.gov (United States)

    Jing, Fulong; Zhang, Chunjie; Si, Weijian; Wang, Yu; Jiao, Shuhong

    2018-02-13

    Polynomial phase signals (PPSs) have numerous applications in many fields including radar, sonar, geophysics, and radio communication systems. Therefore, estimation of PPS coefficients is very important. In this paper, a novel approach for PPS parameters estimation based on adaptive short-time Fourier transform (ASTFT), called the PPS-ASTFT estimator, is proposed. Using the PPS-ASTFT estimator, both one-dimensional and multi-dimensional searches and error propagation problems, which widely exist in PPSs field, are avoided. In the proposed algorithm, the instantaneous frequency (IF) is estimated by S-transform (ST), which can preserve information on signal phase and provide a variable resolution similar to the wavelet transform (WT). The width of the ASTFT analysis window is equal to the local stationary length, which is measured by the instantaneous frequency gradient (IFG). The IFG is calculated by the principal component analysis (PCA), which is robust to the noise. Moreover, to improve estimation accuracy, a refinement strategy is presented to estimate signal parameters. Since the PPS-ASTFT avoids parameter search, the proposed algorithm can be computed in a reasonable amount of time. The estimation performance, computational cost, and implementation of the PPS-ASTFT are also analyzed. The conducted numerical simulations support our theoretical results and demonstrate an excellent statistical performance of the proposed algorithm.

  12. Estimation of pathological tremor from recorded signals based on adaptive sliding fast Fourier transform

    Directory of Open Access Journals (Sweden)

    Shengxin Wang

    2016-06-01

    Full Text Available Pathological tremor is an approximately rhythmic movement and considerably affects patients’ daily living activities. Biomechanical loading and functional electrical stimulation are proposed as potential alternatives for canceling the pathological tremor. However, the performance of suppression methods is associated with the separation of tremor from the recorded signals. In this literature, an algorithm incorporating a fast Fourier transform augmented with a sliding convolution window, an interpolation procedure, and a damping module of the frequency is presented to isolate tremulous components from the measured signals and estimate the instantaneous tremor frequency. Meanwhile, a mechanism platform is designed to provide the simulation tremor signals with different degrees of voluntary movements. The performance of the proposed algorithm and existing procedures is compared with simulated signals and experimental signals collected from patients. The results demonstrate that the proposed solution could detect the unknown dominant frequency and distinguish the tremor components with higher accuracy. Therefore, this algorithm is useful for actively compensating tremor by functional electrical stimulation without affecting the voluntary movement.

  13. Criteria for confirming sequence periodicity identified by Fourier transform analysis: application to GCR2, a candidate plant GPCR?

    Science.gov (United States)

    Illingworth, Christopher J R; Parkes, Kevin E; Snell, Christopher R; Mullineaux, Philip M; Reynolds, Christopher A

    2008-03-01

    Methods to determine periodicity in protein sequences are useful for inferring function. Fourier transformation is one approach but care is required to ensure the periodicity is genuine. Here we have shown that empirically-derived statistical tables can be used as a measure of significance. Genuine protein sequences data rather than randomly generated sequences were used as the statistical backdrop. The method has been applied to G-protein coupled receptor (GPCR) sequences, by Fourier transformation of hydrophobicity values, codon frequencies and the extent of over-representation of codon pairs; the latter being related to translational step times. Genuine periodicity was observed in the hydrophobicity whereas the apparent periodicity (as inferred from previously reported measures) in the translation step times was not validated statistically. GCR2 has recently been proposed as the plant GPCR receptor for the hormone abscisic acid. It has homology to the Lanthionine synthetase C-like family of proteins, an observation confirmed by fold recognition. Application of the Fourier transform algorithm to the GCR2 family revealed strongly predicted seven fold periodicity in hydrophobicity, suggesting why GCR2 has been reported to be a GPCR, despite negative indications in most transmembrane prediction algorithms. The underlying multiple sequence alignment, also required for the Fourier transform analysis of periodicity, indicated that the hydrophobic regions around the 7 GXXG motifs commence near the C-terminal end of each of the 7 inner helices of the alpha-toroid and continue to the N-terminal region of the helix. The results clearly explain why GCR2 has been understandably but erroneously predicted to be a GPCR.

  14. Electro-Optical Imaging Fourier-Transform Spectrometer

    Science.gov (United States)

    Chao, Tien-Hsin; Zhou, Hanying

    2006-01-01

    An electro-optical (E-O) imaging Fourier-transform spectrometer (IFTS), now under development, is a prototype of improved imaging spectrometers to be used for hyperspectral imaging, especially in the infrared spectral region. Unlike both imaging and non-imaging traditional Fourier-transform spectrometers, the E-O IFTS does not contain any moving parts. Elimination of the moving parts and the associated actuator mechanisms and supporting structures would increase reliability while enabling reductions in size and mass, relative to traditional Fourier-transform spectrometers that offer equivalent capabilities. Elimination of moving parts would also eliminate the vibrations caused by the motions of those parts. Figure 1 schematically depicts a traditional Fourier-transform spectrometer, wherein a critical time delay is varied by translating one the mirrors of a Michelson interferometer. The time-dependent optical output is a periodic representation of the input spectrum. Data characterizing the input spectrum are generated through fast-Fourier-transform (FFT) post-processing of the output in conjunction with the varying time delay.

  15. Fast Fourier single-pixel imaging via binary illumination.

    Science.gov (United States)

    Zhang, Zibang; Wang, Xueying; Zheng, Guoan; Zhong, Jingang

    2017-09-20

    Fourier single-pixel imaging (FSI) employs Fourier basis patterns for encoding spatial information and is capable of reconstructing high-quality two-dimensional and three-dimensional images. Fourier-domain sparsity in natural scenes allows FSI to recover sharp images from undersampled data. The original FSI demonstration, however, requires grayscale Fourier basis patterns for illumination. This requirement imposes a limitation on the imaging speed as digital micro-mirror devices (DMDs) generate grayscale patterns at a low refreshing rate. In this paper, we report a new strategy to increase the speed of FSI by two orders of magnitude. In this strategy, we binarize the Fourier basis patterns based on upsampling and error diffusion dithering. We demonstrate a 20,000 Hz projection rate using a DMD and capture 256-by-256-pixel dynamic scenes at a speed of 10 frames per second. The reported technique substantially accelerates image acquisition speed of FSI. It may find broad imaging applications at wavebands that are not accessible using conventional two-dimensional image sensors.

  16. Ballooning modes or Fourier modes in a toroidal plasma?

    International Nuclear Information System (INIS)

    Connor, J.W.; Taylor, J.B.

    1987-01-01

    The relationship between two different descriptions of eigenmodes in a torus is investigated. In one the eigenmodes are similar to Fourier modes in a cylinder and are highly localized near a particular rational surface. In the other they are the so-called ballooning modes that extend over many rational surfaces. Using a model that represents both drift waves and resistive interchanges the transition from one of these structures to the other is investigated. In this simplified model the transition depends on a single parameter which embodies the competition between toroidal coupling of Fourier modes (which enhances ballooning) and variation in frequency of Fourier modes from one rational surface to another (which diminishes ballooning). As the coupling is increased each Fourier mode acquires a sideband on an adjacent rational surface and these sidebands then expand across the radius to form the extended mode described by the conventional ballooning mode approximation. This analysis shows that the ballooning approximation is appropriate for drift waves in a tokamak but not for resistive interchanges in a pinch. In the latter the conventional ballooning effect is negligible but they may nevertheless show a ballooning feature. This is localized near the same rational surface as the primary Fourier mode and so does not lead to a radially extended structure

  17. Comparative analysis of imaging configurations and objectives for Fourier microscopy.

    Science.gov (United States)

    Kurvits, Jonathan A; Jiang, Mingming; Zia, Rashid

    2015-11-01

    Fourier microscopy is becoming an increasingly important tool for the analysis of optical nanostructures and quantum emitters. However, achieving quantitative Fourier space measurements requires a thorough understanding of the impact of aberrations introduced by optical microscopes that have been optimized for conventional real-space imaging. Here we present a detailed framework for analyzing the performance of microscope objectives for several common Fourier imaging configurations. To this end, we model objectives from Nikon, Olympus, and Zeiss using parameters that were inferred from patent literature and confirmed, where possible, by physical disassembly. We then examine the aberrations most relevant to Fourier microscopy, including the alignment tolerances of apodization factors for different objective classes, the effect of magnification on the modulation transfer function, and vignetting-induced reductions of the effective numerical aperture for wide-field measurements. Based on this analysis, we identify an optimal objective class and imaging configuration for Fourier microscopy. In addition, the Zemax files for the objectives and setups used in this analysis have been made publicly available as a resource for future studies.

  18. Screening retinal transplants with Fourier-domain OCT

    Science.gov (United States)

    Rao, Bin

    2009-02-01

    Transplant technologies have been studied for the recovery of vision loss from retinitis pigmentosa (RP) and age-related macular degeneration (AMD). In several rodent retinal degeneration models and in patients, retinal progenitor cells transplanted as layers to the subretinal space have been shown to restore or preserve vision. The methods for evaluation of transplants are expensive considering the large amount of animals. Alternatively, time-domain Stratus OCT was previously shown to be able to image the morphological structure of transplants to some extent, but could not clearly identify laminated transplants. The efficacy of screening retinal transplants with Fourier-domain OCT was studied on 37 S334ter line 3 rats with retinal degeneration 6-67 days after transplant surgery. The transplants were morphologically categorized as no transplant, detachment, rosettes, small laminated area and larger laminated area with both Fourier-domain OCT and histology. The efficacy of Fourier-domain OCT in screening retinal transplants was evaluated by comparing the categorization results with OCT and histology. Additionally, 4 rats were randomly selected for multiple OCT examinations (1, 5, 9, 14 and 21days post surgery) in order to determine the earliest image time of OCT examination since the transplanted tissue may need some time to show its tendency of growing. Finally, we demonstrated the efficacy of Fourier-domain OCT in screening retinal transplants in early stages and determined the earliest imaging time for OCT. Fourier-domain OCT makes itself valuable in saving resource spent on animals with unsuccessful transplants.

  19. A Compressed Sensing-based Image Reconstruction Algorithm for Solar Flare X-Ray Observations

    Energy Technology Data Exchange (ETDEWEB)

    Felix, Simon; Bolzern, Roman; Battaglia, Marina, E-mail: simon.felix@fhnw.ch, E-mail: roman.bolzern@fhnw.ch, E-mail: marina.battaglia@fhnw.ch [University of Applied Sciences and Arts Northwestern Switzerland FHNW, 5210 Windisch (Switzerland)

    2017-11-01

    One way of imaging X-ray emission from solar flares is to measure Fourier components of the spatial X-ray source distribution. We present a new compressed sensing-based algorithm named VIS-CS, which reconstructs the spatial distribution from such Fourier components. We demonstrate the application of the algorithm on synthetic and observed solar flare X-ray data from the Reuven Ramaty High Energy Solar Spectroscopic Imager satellite and compare its performance with existing algorithms. VIS-CS produces competitive results with accurate photometry and morphology, without requiring any algorithm- and X-ray-source-specific parameter tuning. Its robustness and performance make this algorithm ideally suited for the generation of quicklook images or large image cubes without user intervention, such as for imaging spectroscopy analysis.

  20. A Compressed Sensing-based Image Reconstruction Algorithm for Solar Flare X-Ray Observations

    Science.gov (United States)

    Felix, Simon; Bolzern, Roman; Battaglia, Marina

    2017-11-01

    One way of imaging X-ray emission from solar flares is to measure Fourier components of the spatial X-ray source distribution. We present a new compressed sensing-based algorithm named VIS_CS, which reconstructs the spatial distribution from such Fourier components. We demonstrate the application of the algorithm on synthetic and observed solar flare X-ray data from the Reuven Ramaty High Energy Solar Spectroscopic Imager satellite and compare its performance with existing algorithms. VIS_CS produces competitive results with accurate photometry and morphology, without requiring any algorithm- and X-ray-source-specific parameter tuning. Its robustness and performance make this algorithm ideally suited for the generation of quicklook images or large image cubes without user intervention, such as for imaging spectroscopy analysis.

  1. Hamiltonian Algorithm Sound Synthesis

    OpenAIRE

    大矢, 健一

    2013-01-01

    Hamiltonian Algorithm (HA) is an algorithm for searching solutions is optimization problems. This paper introduces a sound synthesis technique using Hamiltonian Algorithm and shows a simple example. "Hamiltonian Algorithm Sound Synthesis" uses phase transition effect in HA. Because of this transition effect, totally new waveforms are produced.

  2. Progressive geometric algorithms

    NARCIS (Netherlands)

    Alewijnse, S.P.A.; Bagautdinov, T.M.; de Berg, M.T.; Bouts, Q.W.; ten Brink, Alex P.; Buchin, K.A.; Westenberg, M.A.

    2015-01-01

    Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms

  3. Progressive geometric algorithms

    NARCIS (Netherlands)

    Alewijnse, S.P.A.; Bagautdinov, T.M.; Berg, de M.T.; Bouts, Q.W.; Brink, ten A.P.; Buchin, K.; Westenberg, M.A.

    2014-01-01

    Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms

  4. General simulation algorithm for autocorrelated binary processes.

    Science.gov (United States)

    Serinaldi, Francesco; Lombardo, Federico

    2017-02-01

    The apparent ubiquity of binary random processes in physics and many other fields has attracted considerable attention from the modeling community. However, generation of binary sequences with prescribed autocorrelation is a challenging task owing to the discrete nature of the marginal distributions, which makes the application of classical spectral techniques problematic. We show that such methods can effectively be used if we focus on the parent continuous process of beta distributed transition probabilities rather than on the target binary process. This change of paradigm results in a simulation procedure effectively embedding a spectrum-based iterative amplitude-adjusted Fourier transform method devised for continuous processes. The proposed algorithm is fully general, requires minimal assumptions, and can easily simulate binary signals with power-law and exponentially decaying autocorrelation functions corresponding, for instance, to Hurst-Kolmogorov and Markov processes. An application to rainfall intermittency shows that the proposed algorithm can also simulate surrogate data preserving the empirical autocorrelation.

  5. General simulation algorithm for autocorrelated binary processes

    Science.gov (United States)

    Serinaldi, Francesco; Lombardo, Federico

    2017-02-01

    The apparent ubiquity of binary random processes in physics and many other fields has attracted considerable attention from the modeling community. However, generation of binary sequences with prescribed autocorrelation is a challenging task owing to the discrete nature of the marginal distributions, which makes the application of classical spectral techniques problematic. We show that such methods can effectively be used if we focus on the parent continuous process of beta distributed transition probabilities rather than on the target binary process. This change of paradigm results in a simulation procedure effectively embedding a spectrum-based iterative amplitude-adjusted Fourier transform method devised for continuous processes. The proposed algorithm is fully general, requires minimal assumptions, and can easily simulate binary signals with power-law and exponentially decaying autocorrelation functions corresponding, for instance, to Hurst-Kolmogorov and Markov processes. An application to rainfall intermittency shows that the proposed algorithm can also simulate surrogate data preserving the empirical autocorrelation.

  6. The Algorithmic Imaginary

    DEFF Research Database (Denmark)

    Bucher, Taina

    2017-01-01

    the notion of the algorithmic imaginary. It is argued that the algorithmic imaginary – ways of thinking about what algorithms are, what they should be and how they function – is not just productive of different moods and sensations but plays a generative role in moulding the Facebook algorithm itself...... of algorithms affect people's use of these platforms, if at all? To help answer these questions, this article examines people's personal stories about the Facebook algorithm through tweets and interviews with 25 ordinary users. To understand the spaces where people and algorithms meet, this article develops...

  7. The BR eigenvalue algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Geist, G.A. [Oak Ridge National Lab., TN (United States). Computer Science and Mathematics Div.; Howell, G.W. [Florida Inst. of Tech., Melbourne, FL (United States). Dept. of Applied Mathematics; Watkins, D.S. [Washington State Univ., Pullman, WA (United States). Dept. of Pure and Applied Mathematics

    1997-11-01

    The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.

  8. Post-processing of EPR spectrum from dosimetric substances through filtering of Discrete Fourier Transform

    International Nuclear Information System (INIS)

    Vieira, Fabio P.B.; Bevilacqua, Joyce S.

    2014-01-01

    The use of electron paramagnetic resonance spectrometers - EPR - in radiation dosimetry is known for more than four decades. It is an important tool in the retrospective determination of doses absorbed. To estimate the dose absorbed by the sample, it is necessary to know the amplitude of the peak to peak signature of the substance in its EPR spectrum. This information can be compromised by the presence of spurious information: noise - of random and low intensity nature; and the behavior of the baseline - coming from the coupling between the resonator tube and the sample analyzed. Due to the intrinsic characteristics of the three main components of the signal, i.e. signature, noise, and baseline - the analysis in the frequency domain allows, through post-processing techniques to filter spurious information. In this work, an algorithm that retrieves the signature of a substance has been implemented. The Discrete Fourier Transform is applied to the signal and without user intervention, the noise is filtered. From the filtered signal, recovers the signature by Inverse Discrete Fourier Transform. The peak to peak amplitude, and the absorbed dose is calculated with an error of less than 1% for signals wherein the base line is linearized. Some more general cases are under investigation and with little user intervention, you can get the same error

  9. Estimation of Interchannel Time Difference in Frequency Subbands Based on Nonuniform Discrete Fourier Transform

    Directory of Open Access Journals (Sweden)

    Qiu Bo

    2008-01-01

    Full Text Available Binaural cue coding (BCC is an efficient technique for spatial audio rendering by using the side information such as interchannel level difference (ICLD, interchannel time difference (ICTD, and interchannel correlation (ICC. Of the side information, the ICTD plays an important role to the auditory spatial image. However, inaccurate estimation of the ICTD may lead to the audio quality degradation. In this paper, we develop a novel ICTD estimation algorithm based on the nonuniform discrete Fourier transform (NDFT and integrate it with the BCC approach to improve the decoded auditory image. Furthermore, a new subjective assessment method is proposed for the evaluation of auditory image widths of decoded signals. The test results demonstrate that the NDFT-based scheme can achieve much wider and more externalized auditory image than the existing BCC scheme based on the discrete Fourier transform (DFT. It is found that the present technique, regardless of the image width, does not deteriorate the sound quality at the decoder compared to the traditional scheme without ICTD estimation.

  10. A fractional Fourier transform analysis of the scattering of ultrasonic waves

    Science.gov (United States)

    Tant, Katherine M.M.; Mulholland, Anthony J.; Langer, Matthias; Gachagan, Anthony

    2015-01-01

    Many safety critical structures, such as those found in nuclear plants, oil pipelines and in the aerospace industry, rely on key components that are constructed from heterogeneous materials. Ultrasonic non-destructive testing (NDT) uses high-frequency mechanical waves to inspect these parts, ensuring they operate reliably without compromising their integrity. It is possible to employ mathematical models to develop a deeper understanding of the acquired ultrasonic data and enhance defect imaging algorithms. In this paper, a model for the scattering of ultrasonic waves by a crack is derived in the time–frequency domain. The fractional Fourier transform (FrFT) is applied to an inhomogeneous wave equation where the forcing function is prescribed as a linear chirp, modulated by a Gaussian envelope. The homogeneous solution is found via the Born approximation which encapsulates information regarding the flaw geometry. The inhomogeneous solution is obtained via the inverse Fourier transform of a Gaussian-windowed linear chirp excitation. It is observed that, although the scattering profile of the flaw does not change, it is amplified. Thus, the theory demonstrates the enhanced signal-to-noise ratio permitted by the use of coded excitation, as well as establishing a time–frequency domain framework to assist in flaw identification and classification. PMID:25792967

  11. Adaptive synchrosqueezing based on a quilted short-time Fourier transform

    Science.gov (United States)

    Berrian, Alexander; Saito, Naoki

    2017-08-01

    In recent years, the synchrosqueezing transform (SST) has gained popularity as a method for the analysis of signals that can be broken down into multiple components determined by instantaneous amplitudes and phases. One such version of SST, based on the short-time Fourier transform (STFT), enables the sharpening of instantaneous frequency (IF) information derived from the STFT, as well as the separation of amplitude-phase components corresponding to distinct IF curves. However, this SST is limited by the time-frequency resolution of the underlying window function, and may not resolve signals exhibiting diverse time-frequency behaviors with sufficient accuracy. In this work, we develop a framework for an SST based on a "quilted" short-time Fourier transform (SST-QSTFT), which allows adaptation to signal behavior in separate time-frequency regions through the use of multiple windows. This motivates us to introduce a discrete reassignment frequency formula based on a finite difference of the phase spectrum, ensuring computational accuracy for a wider variety of windows. We develop a theoretical framework for the SST-QSTFT in both the continuous and the discrete settings, and describe an algorithm for the automatic selection of optimal windows depending on the region of interest. Using synthetic data, we demonstrate the superior numerical performance of SST-QSTFT relative to other SST methods in a noisy context. Finally, we apply SST-QSTFT to audio recordings of animal calls to demonstrate the potential of our method for the analysis of real bioacoustic signals.

  12. Incubator embedded cell culture imaging system (EmSight) based on Fourier ptychographic microscopy.

    Science.gov (United States)

    Kim, Jinho; Henley, Beverley M; Kim, Charlene H; Lester, Henry A; Yang, Changhuei

    2016-08-01

    Multi-day tracking of cells in culture systems can provide valuable information in bioscience experiments. We report the development of a cell culture imaging system, named EmSight, which incorporates multiple compact Fourier ptychographic microscopes with a standard multiwell imaging plate. The system is housed in an incubator and presently incorporates six microscopes. By using the same low magnification objective lenses as the objective and the tube lens, the EmSight is configured as a 1:1 imaging system that, providing large field-of-view (FOV) imaging onto a low-cost CMOS imaging sensor. The EmSight improves the image resolution by capturing a series of images of the sample at varying illumination angles; the instrument reconstructs a higher-resolution image by using the iterative Fourier ptychographic algorithm. In addition to providing high-resolution brightfield and phase imaging, the EmSight is also capable of fluorescence imaging at the native resolution of the objectives. We characterized the system using a phase Siemens star target, and show four-fold improved coherent resolution (synthetic NA of 0.42) and a depth of field of 0.2 mm. To conduct live, long-term dopaminergic neuron imaging, we cultured ventral midbrain from mice driving eGFP from the tyrosine hydroxylase promoter. The EmSight system tracks movements of dopaminergic neurons over a 21 day period.

  13. Fourier analysis of Solar atmospheric numerical simulations accelerated with GPUs (CUDA).

    Science.gov (United States)

    Marur, A.

    2015-12-01

    Solar dynamics from the convection zone creates a variety of waves that may propagate through the solar atmosphere. These waves are important in facilitating the energy transfer between the sun's surface and the corona as well as propagating energy throughout the solar system. How and where these waves are dissipated remains an open question. Advanced 3D numerical simulations have furthered our understanding of the processes involved. Fourier transforms to understand the nature of the waves by finding the frequency and wavelength of these waves through the simulated atmosphere, as well as the nature of their propagation and where they get dissipated. In order to analyze the different waves produced by the aforementioned simulations and models, Fast Fourier Transform algorithms will be applied. Since the processing of the multitude of different layers of the simulations (of the order of several 100^3 grid points) would be time intensive and inefficient on a CPU, CUDA, a computing architecture that harnesses the power of the GPU, will be used to accelerate the calculations.

  14. An illustration of harmonic regression based on the results of the fast Fourier transformation

    Directory of Open Access Journals (Sweden)

    Bertfai Imre

    2002-01-01

    Full Text Available The well-known methodology of the Fourier analysis is put against the background in the 2nd half of the century parallel to the development of the time-domain approach in the analysis of mainly economical time series. However, from the author's point of view, the former possesses some hidden analytical advantages which deserve to be re-introduced to the toolbox of analysts. This paper, through several case studies, reports research results for computer algorithm providing a harmonic model for time series. The starting point of the particular method is a harmonic analysis (Fourier-analysis or Lomb-periodogram. The results are optimized in a multifold manner resulting in a model which is easy to handle and able to forecast the underlying data. The results provided are particularly free from limitations characteristic for that methods. Furthermore, the calculated results are easy to interpret and use for further decisions. Nevertheless, the author intends to enhance the procedure in several ways. The method shown seems to be very effective and useful in modeling time series consisting of periodic terms. An additional advantage is the easy interpretation of the obtained parameters.

  15. Research on FBG-based longitudinal-acousto-optic modulator with Fourier mode coupling method.

    Science.gov (United States)

    Li, Zhuoxuan; Pei, Li; Liu, Chao; Ning, Tigang; Yu, Shaowei

    2012-10-20

    Fourier mode coupling model was first applied to achieve the spectra property of a fiber Bragg grating (FBG)-based longitudinal-acousto-optic modulator. Compared with traditional analysis algorithms, such as the transfer matrix method, the Fourier mode coupling model could improve the computing efficiency up to 100 times with a guarantee of accuracy. In this paper, based on the theoretical analysis of this model, the spectra characteristics of the modulator in different frequencies and acoustically induced strains were numerically simulated. In the experiment, a uniform FBG was modulated by acoustic wave (AW) at 12 different frequencies. In particular, the modulator responses at 563 and 885.5 KHz with three different lead zirconate titanate (PZT) loads applied were plotted for illustration, and the linear fitting of experimental data demonstrated a good match with the simulation result. The acoustic excitation of the longitudinal wave is obtained using a conic silica horn attached to the surface of a shear-mode PZT plate paralleled to the fiber axis. This way of generating longitudinal AW with a transversal PZT may shed light on the optimal structural design for the FBG-based longitudinal-acousto-optic modulator.

  16. Approximation for discrete Fourier transform and application in study of three-dimensional interacting electron gas.

    Science.gov (United States)

    Yan, Xin-Zhong

    2011-07-01

    The discrete Fourier transform is approximated by summing over part of the terms with corresponding weights. The approximation reduces significantly the requirement for computer memory storage and enhances the numerical computation efficiency with several orders without losing accuracy. As an example, we apply the algorithm to study the three-dimensional interacting electron gas under the renormalized-ring-diagram approximation where the Green's function needs to be self-consistently solved. We present the results for the chemical potential, compressibility, free energy, entropy, and specific heat of the system. The ground-state energy obtained by the present calculation is compared with the existing results of Monte Carlo simulation and random-phase approximation.

  17. Detection of Left-Sided and Right-Sided Hearing Loss via Fractional Fourier Transform

    Directory of Open Access Journals (Sweden)

    Shuihua Wang

    2016-05-01

    Full Text Available In order to detect hearing loss more efficiently and accurately, this study proposed a new method based on fractional Fourier transform (FRFT. Three-dimensional volumetric magnetic resonance images were obtained from 15 patients with left-sided hearing loss (LHL, 20 healthy controls (HC, and 14 patients with right-sided hearing loss (RHL. Twenty-five FRFT spectrums were reduced by principal component analysis with thresholds of 90%, 95%, and 98%, respectively. The classifier is the single-hidden-layer feed-forward neural network (SFN trained by the Levenberg–Marquardt algorithm. The results showed that the accuracies of all three classes are higher than 95%. In all, our method is promising and may raise interest from other researchers.

  18. Imaging open-path Fourier transform infrared spectrometer for 3D cloud profiling

    Science.gov (United States)

    Rentz Dupuis, Julia; Mansur, David J.; Vaillancourt, Robert; Carlson, David; Evans, Thomas; Schundler, Elizabeth; Todd, Lori; Mottus, Kathleen

    2010-04-01

    OPTRA has developed an imaging open-path Fourier transform infrared (I-OP-FTIR) spectrometer for 3D profiling of chemical and biological agent simulant plumes released into test ranges and chambers. An array of I-OP-FTIR instruments positioned around the perimeter of the test site, in concert with advanced spectroscopic algorithms, enables real time tomographic reconstruction of the plume. The approach is intended as a referee measurement for test ranges and chambers. This Small Business Technology Transfer (STTR) effort combines the instrumentation and spectroscopic capabilities of OPTRA, Inc. with the computed tomographic expertise of the University of North Carolina, Chapel Hill. In this paper, we summarize the design and build and detail system characterization and test of a prototype I-OP-FTIR instrument. System characterization includes radiometric performance and spectral resolution. Results from a series of tomographic reconstructions of sulfur hexafluoride plumes in a laboratory setting are also presented.

  19. Fourier domain image fusion for differential X-ray phase-contrast breast imaging

    International Nuclear Information System (INIS)

    Coello, Eduardo; Sperl, Jonathan I.; Bequé, Dirk; Benz, Tobias; Scherer, Kai; Herzen, Julia; Sztrókay-Gaul, Anikó; Hellerhoff, Karin; Pfeiffer, Franz; Cozzini, Cristina; Grandl, Susanne

    2017-01-01

    X-Ray Phase-Contrast (XPC) imaging is a novel technology with a great potential for applications in clinical practice, with breast imaging being of special interest. This work introduces an intuitive methodology to combine and visualize relevant diagnostic features, present in the X-ray attenuation, phase shift and scattering information retrieved in XPC imaging, using a Fourier domain fusion algorithm. The method allows to present complementary information from the three acquired signals in one single image, minimizing the noise component and maintaining visual similarity to a conventional X-ray image, but with noticeable enhancement in diagnostic features, details and resolution. Radiologists experienced in mammography applied the image fusion method to XPC measurements of mastectomy samples and evaluated the feature content of each input and the fused image. This assessment validated that the combination of all the relevant diagnostic features, contained in the XPC images, was present in the fused image as well.

  20. Emotion recognition based on multiple order features using fractional Fourier transform

    Science.gov (United States)

    Ren, Bo; Liu, Deyin; Qi, Lin

    2017-07-01

    In order to deal with the insufficiency of recently algorithms based on Two Dimensions Fractional Fourier Transform (2D-FrFT), this paper proposes a multiple order features based method for emotion recognition. Most existing methods utilize the feature of single order or a couple of orders of 2D-FrFT. However, different orders of 2D-FrFT have different contributions on the feature extraction of emotion recognition. Combination of these features can enhance the performance of an emotion recognition system. The proposed approach obtains numerous features that extracted in different orders of 2D-FrFT in the directions of x-axis and y-axis, and uses the statistical magnitudes as the final feature vectors for recognition. The Support Vector Machine (SVM) is utilized for the classification and RML Emotion database and Cohn-Kanade (CK) database are used for the experiment. The experimental results demonstrate the effectiveness of the proposed method.