Search

A recent trend in the signal/image processing literature is the optimization of Fourier sampling schemes for specific datasets of signals. In this paper, we explain why choosing optimal non Cartesian Fourier sampling patterns is a difficult nonconvex problem by bringing to light two optimization issues. The first one is the existence of a combinatorial number of spurious minimizers for a generic class of signals. The second one is a vanishing gradient effect for the high frequencies. We conclude the paper by showing how using large datasets can mitigate the first effect and illustrate experimentally the benefits of using stochastic gradient algorithms with a variable metric. [ABSTRACT FROM AUTHOR]

The Fourier transform method (FTM), which can reconstruct a wavefront from a single hologram, is widely used in digital holography (DH) as a reconstruction technique. However, the space-bandwidth product (SBP) is limited because of the frequency filtering required. We propose a wavefront reconstruction algorithm based on compressed sensing that can obtain a high SBP for use instead of the FTM. The proposed method can reconstruct a high-SBP wavefront by solving the hologram recording model with total variation regularization. We demonstrate the proposed method's effectiveness via simulations and experiments. The method can be applied to conventional off-axis DH without alteration and thus can be applied in various fields. [ABSTRACT FROM AUTHOR]

We propose and numerically explore a method that upgrades a conventional single-shot microscope into a single-shot ptychographic microscope, without impairing its optical performance. It is based on splitting the microscope's intermediate image plane into multiple replicas, and detecting a set of their coded Fourier transform magnitudes, using a different sensor for each replica. To code each beam, it is transmitted through a distinct coding mask. A ptychographic phase-retrieval algorithm is used to reconstruct the imaged object's complex-valued transmission function. The proposed method also enables ultrahigh-speed imaging by using a pulse-burst as illumination and applying a multi-state reconstruction algorithm. This approach paves the way to both single-frame and ultrahigh-speed, diffraction-limited microscopy of complex-valued objects. [ABSTRACT FROM AUTHOR]

Quantum computers hold the promise to solve certain problems exponentially faster than their classical counterparts. Trapped atomic ions are among the physical systems in which building such a computing device seems viable. In this work we present a small-scale quantum information processor based on a string of 40Ca+ ions confined in a macroscopic linear Paul trap. We review our set of operations which includes non-coherent operations allowing us to realize arbitrary Markovian processes. In order to build a larger quantum information processor it is mandatory to reduce the error rate of the available operations which is only possible if the physics of the noise processes is well understood. We identify the dominant noise sources in our system and discuss their effects on different algorithms. Finally we demonstrate how our entire set of operations can be used to facilitate the implementation of algorithms by examples of the quantum Fourier transform and the quantum order finding algorithm. [ABSTRACT FROM AUTHOR]

The classic imaging geometry for computed tomography is for the collection of un-truncated projections and the reconstruction of a global image, with the Fourier transform as the theoretical foundation that is intrinsically nonlocal. Recently, interior tomography research has led to theoretically exact relationships between localities in the projection and image spaces and practically promising reconstruction algorithms. Initially, interior tomography was developed for x-ray computed tomography. Then, it was elevated to have the status of a general imaging principle. Finally, a novel framework known as 'omni-tomography' is being developed for a grand fusion of multiple imaging modalities, allowing tomographic synchrony of diversified features. [ABSTRACT FROM AUTHOR]

The estimation of lower atmospheric refractivity from radar sea clutter (RFC) is a complicated nonlinear optimization problem. This paper deals with the RFC problem in a Bayesian framework. It uses the unbiased Markov Chain Monte Carlo (MCMC) sampling technique, which can provide accurate posterior probability distributions of the estimated refractivity parameters by using an electromagnetic split-step fast Fourier transform terrain parabolic equation propagation model within a Bayesian inversion framework. In contrast to the global optimization algorithm, the Bayesian-MCMC can obtain not only the approximate solutions, but also the probability distributions of the solutions, that is, uncertainty analyses of solutions. The Bayesian-MCMC algorithm is implemented on the simulation radar sea-clutter data and the real radar seaclutter data. Reference data are assumed to be simulation data and refractivity profiles are obtained using a helicopter. The inversion algorithm is assessed (i) by comparing the estimated refractivity profiles from the assumed simulation and the helicopter sounding data; (ii) the one-dimensional (1D) and two-dimensional (2D) posterior probability distribution of solutions. [ABSTRACT FROM AUTHOR]

Photoacoustic computed tomography (PACT), also known as optoacoustic tomography, is an emerging imaging modality that has great potential for a wide range of biomedical imaging applications. In this note, we derive a hybrid reconstruction formula that is mathematically exact and operates on a data function that is expressed in the temporal frequency and spatial domains. This formula explicitly reveals new insights into how the spatial frequency components of the sought-after object function are determined by the temporal frequency components of the data functionmeasured with a circular or spherical measurement geometry in two- and three-dimensional implementations of PACT, respectively. The structure of the reconstruction formula is surprisingly simple compared with existing Fourier-domain reconstruction formulae. It also yields a straightforward numerical implementation that is robust and two orders ofmagnitude more computationally efficient than filtered backprojection algorithms. [ABSTRACT FROM AUTHOR]

Passive Fourier transform infrared (FTIR) remote sensing measurement of chemical gas cloud is a vital technology. It takes an important part in many fields for the detection of released gases. The principle of concentration measurement is based on the Beer-Lambert law. Unlike the active measurement, for the passive remote sensing, in most cases, the difference between the temperature of the gas cloud and the brightness temperature of the background is usually a few kelvins. The gas cloud emission is almost equal to the background emission, thereby the emission of the gas cloud cannot be ignored. The concentration retrieval algorithm is quite different from the active measurement. In this paper, the concentration retrieval algorithm for the passive FTIR remote measurement of gas cloud is presented in detail, which involves radiative transfer model, radiometric calibration, absorption coefficient calculation, et al. The background spectrum has a broad feature, which is a slowly varying function of frequency. In this paper, the background spectrum is fitted with a polynomial by using the Levenberg-Marquardt method which is a kind of nonlinear least squares fitting algorithm. No background spectra are required. Thus, this method allows mobile, real-time and fast measurements of gas clouds. [ABSTRACT FROM AUTHOR]

We develop fast discrete Fourier transforms (and their adjoints) from a square in space to a disk in the Fourier domain. Since our new transforms are not unitary, we develop a fast inversion algorithm and derive corresponding estimates that allow us to avoid iterative methods typically used for inversion. We consider the eigenfunctions of the corresponding band-limiting and space-limiting operator to describe spaces on which these new transforms can be inverted and made useful. In the process, we construct polar grids which provide quadratures and interpolation with controlled accuracy for functions band-limited within a disk. For rapid computation of the involved trigonometric sums we use the unequally spaced fast Fourier transform, thus yielding fast algorithms for all new transforms. We also introduce polar grids motivated by linearized scattering problems which are obtained by discretizing a family of circles. These circles are generated by using a single circle passing through the origin and rotating this circle with the origin as a pivot. For such grids, we provide a fast algorithm for interpolation to a near optimal grid in the disk, yielding an accurate adjoint transform and inversion algorithm. [ABSTRACT FROM AUTHOR]

A number of elegant approaches have been developed for the identification of quantum circuits which can be efficiently simulated on a classical computer. Recently, these methods have been employed to demonstrate the classical simulability of the quantum Fourier transform (QFT). Here we show that one can demonstrate a number of simulability results for QFT circuits in a straightforward manner using Griffiths and Niu's semi-classical QFT construction (Griffiths and Niu 1996 Phys. Rev. Lett. 76 3228). We use this to analyse the simulability properties of the QFT with a variety of classes of entangled input states. We then discuss the consequences of these results in the context of Shor's factorization algorithm. [ABSTRACT FROM AUTHOR]

Radio interferometers consisting of identical antennas arranged on a regular lattice permit fast Fourier transform beamforming, which reduces the correlation cost from in the number of antennas to . We develop a formalism for describing this process and apply this formalism to derive a number of algorithms with a range of observational applications. These include algorithms for forming arbitrarily pointed tied-array beams from the regularly spaced Fourier transform–formed beams, sculpting the beams to suppress sidelobes while only losing percent-level sensitivity, and optimally estimating the position of a detected source from its observed brightness in the set of beams. We also discuss the effect that correlations in the visibility-space noise, due to cross talk and sky contributions, have on the optimality of Fourier transform beamforming, showing that it does not strictly preserve the sky information of the n2 correlation, even for an idealized array. Our results have applications to a number of upcoming interferometers, in particular the Canadian Hydrogen Intensity Mapping Experiment–Fast Radio Burst (CHIME/FRB) project. [ABSTRACT FROM AUTHOR]

To overcome the difficulty of realizing large-scale quantum Fourier transform (QFT) within existing technology, this paper implements a resource-saving method (named t-bit semiclassical QFT over ), which could realize large-scale QFT using an arbitrary-scale quantum register. By developing a feasible method to realize the control quantum gate Rk, we experimentally realize the 2-bit semiclassical QFT over on IBM’s quantum cloud computer, which shows the feasibility of the method. Then, we compare the actual performance of 2-bit semiclassical QFT with standard QFT in the experiments. The squared statistical overlap experimental data shows that the fidelity of 2-bit semiclassical QFT is higher than that of standard QFT, which is mainly due to fewer two-qubit gates in the semiclassical QFT. Furthermore, based on the proposed method, N = 15 is successfully factorized by implementing Shor’s algorithm. [ABSTRACT FROM AUTHOR]

Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perform computation. However, few of the continuous variable (CV) quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently. [ABSTRACT FROM AUTHOR]

We investigate the structure-preserving numerical algorithm of the Degasperis—Procesi equation which can be transformed into a bi-Hamiltonian form using the discrete variational derivative method. Based on two different space discretization methods, the Fourier pseudospectral method and the wavelet collocation method, we develop two modified structure-preserving schemes under the periodic boundary condition. These proposed schemes are proved to preserve the Hamiltonian invariants theoretically and numerically. Meanwhile, the numerical results confirm that they can simulate the propagation of solitons effectively for a long time. [ABSTRACT FROM AUTHOR]

In simultaneous multi-wavelength phase-shifting interferometry, we propose a novel frequency domain phase retrieval (FDPR) algorithm. First, using only a one-time phase-shifting operation, a sequence of simultaneous multi-wavelength phase-shifting interferograms (SPSMWIs) are captured by a monochrome charge-coupled device. Second, by performing a Fourier transform for each pixel of SPSMWIs, the wrapped phases of each wavelength can be retrieved from the complex amplitude located in the spectral peak of each wavelength. Finally, the phase of the synthetic wavelength can be obtained by the subtraction between the wrapped phases of a single wavelength. In this study, the principle and the application condition of the proposed approach are discussed. Both the simulation and the experimental result demonstrate the simple and convenient performance of the proposed FDPR approach. [ABSTRACT FROM AUTHOR]

The ill-posedness of the attenuated Radon transform is a challenging issue in practice due to the Poisson noise and the high level of attenuation. The investigation of the smoothing properties of the underlying operator is essential for developing a stable inversion. In this paper, we consider the framework of Sobolev spaces and derive analytically a reconstruction algorithm based on the method of the approximate inverse. The derived method inherits the efficiency and stability of the approximate inverse and supplies a method of extraction of contours. These algorithms appear to be efficient for an attenuation of human body type. However, for higher attenuations the ill-posedness increases exponentially what deteriorates accordingly the quality of reconstructions. Nevertheless, a high attenuation map affects less the contour extraction of a high contrast function and so can be neglected. This leads to simplifying the proposed method and circumvents in this case the artifacts due to the attenuation as attested by simulation results. [ABSTRACT FROM AUTHOR]

We present an implementation of the -statistic to carry out the first search in data from the Virgo laser interferometric gravitational wave detector for periodic gravitational waves from a priori unknown, isolated rotating neutron stars. We searched a frequency f0 range from 100 Hz to 1 kHz and the frequency dependent spindown f1 range from Hz s−1 to zero. A large part of this frequency–spindown space was unexplored by any of the all-sky searches published so far. Our method consisted of a coherent search over two-day periods using the ℱ-statistic, followed by a search for coincidences among the candidates from the two-day segments. We have introduced a number of novel techniques and algorithms that allow the use of the fast Fourier transform (FFT) algorithm in the coherent part of the search resulting in a fifty-fold speed-up in computation of the -statistic with respect to the algorithm used in the other pipelines. No significant gravitational wave signal was found. The sensitivity of the search was estimated by injecting signals into the data. In the most sensitive parts of the detector band more than 90% of signals would have been detected with dimensionless gravitational-wave amplitude greater than . [ABSTRACT FROM AUTHOR]

This paper deals with image restoration problems where the data are nonuniform samples of the Fourier transform of the unknown object. We study the inverse problem in both semidiscrete and fully discrete formulations, and our analysis leads to an optimization problem involving the minimization of the data discrepancy under nonnegativity constraints. In particular, we show that such a problem is equivalent to a deconvolution problem in the image space. We propose a practical algorithm, based on the gradient projection method, to compute a regularized solution in the discrete case. The key point in our deconvolution-based approach is that the fast Fourier transform can be employed in the algorithm implementation without the need of preprocessing the data. A numerical experimentation on simulated and real data from the NASA RHESSI mission is also performed. [ABSTRACT FROM AUTHOR]

We consider a near-field inverse scattering problem for the wave equation: find the shape of a Dirichlet scattering object from time domain measurements of scattered waves. For this time-domain inverse problem, we propose a linear sampling method, a well-known technique for corresponding frequency domain inverse scattering problems. The problem setting and the algorithm incorporate two basic features. First, the data for the method consist of measurements of causal waves, that is, of waves that vanish before some moment in time. Second, the inversion algorithm directly works on the time-domain data without using a Fourier transformation. The first point is related to the applications we have in mind, which include for instance ground-penetrating radar imaging. The second feature allows us to naturally incorporate multiple (in fact, a continuum of) frequencies in the inversion algorithm. Consequently, it offers the potential of improving the quality of the reconstruction compared to frequency domain methods working with a single frequency. We demonstrate this potential by several numerical examples. [ABSTRACT FROM AUTHOR]

Two physical interpretations of chirp transform related to Fresnel diffraction and Wigner distribution function are given. The chirp transform can be regarded as a Fresnel diffraction observed on a spherical tangent to the diffraction plane, or a rotation and stretching transformation of the Wigner distribution function space. A general fast algorithm for the numerical calculation of chirp transform is developed by employing two fast Fourier transform algorithms. The algorithm, by which a good evaluation can be achieved, unifies the calculations of Fresnel diffraction, arbitrary fractional-order Fourier transforms and other scalar diffraction systems. The algorithm is used to calculate the Fourier transform of a Gaussian function and the Fourier transform, the Fresnel transform, the Fractional-order Fourier transforms of a rectangle function to evaluate the performance of this algorithm. The calculated results are in good agreement with the analytical results, both in the amplitude and phase. [ABSTRACT FROM AUTHOR]

We present a strategy for detecting gravitational wave signals from the Galactic white dwarf binaries in the Mock LISA Data Challenge 3 (MLDC3) and estimate their parameters. Our method is based on the matched filtering in the form of the {\mathcal F} -statistic. We perform the search on three-dimensional space (sky coordinate and frequency of gravitational wave) below 3 mHz and include the fourth parameter (frequency derivative) at high frequencies. A template bank is used to search for the strongest signal in the data, then we remove it and repeat the search until we do not have signals in the data above a preselected threshold. For the template bank, we construct an optimal grid that realizes the best lattice covering with a constraint such that the nodes of the grid coincide with the Fourier frequencies. This enables the use of the fast Fourier transform algorithm to calculate the {\mathcal F} -statistic. [ABSTRACT FROM AUTHOR]

A novel three-dimensional wide-angle beam propagation method based on the split-step fast Fourier transform is developed. The formulation is based on the three-dimensional Helmholtz wave equation. Each propagation step is performed by utilizing both the FFT and split-step scheme. The solution of Helmholtz wave equation does not make the slowly varying envelope and one-way propagation approximations. To validate the efficiency and accuracy, numerical results for a propagation beam in a tilted step-index optical waveguide are compared with other beam propagation algorithms. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Many experiments, and in particular gravitational wave detectors, produce continuous streams of data whose frequency representations contain discrete, relatively narrowband coherent features at high amplitude. We discuss the application of digital Fourier transforms (DFTs) to characterization of these features, hereafter frequently referred to as lines. Application of DFTs to continuously produced time-domain data is achieved through an algorithm [7], hereafter referred to as EFC, for efficient time-domain determination of the Fourier coefficients of a data set. We first define EFC and discuss parameters relating to the algorithm that determine its properties and action on the data. In gravitational wave interferometers, these lines are commonly due to parasitic sources of coherent background interference coupling into the instrument. Using GEO 600 data, we next demonstrate that time-domain subtraction of lines can proceed without detrimental effects either on features at frequencies separated from that of the subtracted line, or on features at the frequency of the line but having different stationarity properties. [ABSTRACT FROM AUTHOR]