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]

For acoustic procedures which rely on the speed of sound to derive process parameters, the determination of the acoustic time of flight (TOF) is essential. In this work, a method for the determination of the TOF is presented. It is intended for reverberant and noisy environments and can be applied in the gas holdup determination in bubbly liquids via acoustic transmission tomography for example. The method includes the selection and design of the transmitted signal to optimize the disambiguate of the autocorrelation, the narrowing of the time window based on the fractional Fourier transform to accelerate the TOF estimation. Furthermore, it includes the consideration of the system-induced signal distortion through prior quasi-anechoic measurements and the sparse reconstruction of the spatial impulse response for TOF estimation using non-negative sparse deconvolution algorithms. The method is tested analytically on numerically generated signals and various sparse deconvolution algorithms are investigated with respect to their applicability and limitations. [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]

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]