Searcharxiv⌕ Search

arXiv subjects

Albert Fannjiang

Publications and source records attributed to Albert Fannjiang.

At least 37 records · Page 2Linked to original sources
arXiv2013

Fourier phasing with phase-uncertain mask

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 (UDR) 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.

physics.optics↗
arXiv2013

Compressive Radar with Off-Grid Targets: A Perturbation Approach

Compressed sensing (CS) schemes are proposed for monostatic as well as synthetic aperture radar (SAR) imaging with chirped signals and Ultra-Narrowband (UNB) continuous waveforms. In particular, a simple, perturbation method is developed to reduce the gridding error for off-grid targets. A coherence bound is obtained for the resulting measurement matrix. A greedy pursuit algorithm, Support-Constrained Orthogonal Matching Pursuit (SCOMP), is proposed to take advantage of the support constraint in the perturbation formulation and proved to have the capacity of determining the off-grid targets to the grid accuracy under favorable conditions. Alternatively, the Locally Optimized Thresholding (LOT) is proposed to enhance the performance of the CS method, Basis Pursuit (BP). For the advantages of higher signal-to-noise ratio and signal-to-interference ratio, it is proposed that Spotlight SAR imaging be implemented with CS techniques and multi-frequency UNB waveforms. Numerical simulations show promising results of the proposed approach and algorithms.

physics.data-an↗
arXiv2012

TV-min and Greedy Pursuit for Constrained Joint Sparsity and Application to Inverse Scattering

This paper proposes a general framework for compressed sensing of constrained joint sparsity (CJS) which includes total variation minimization (TV-min) as an example. TV- and 2-norm error bounds, independent of the ambient dimension, are derived for the CJS version of Basis Pursuit and Orthogonal Matching Pursuit. As an application the results extend Cand`es, Romberg and Tao's proof of exact recovery of piecewise constant objects with noiseless incomplete Fourier data to the case of noisy data.

math.OC↗
arXiv2012

Absolute Uniqueness of Phase Retrieval with Random Illumination

Random illumination is proposed to enforce absolute uniqueness and resolve all types of ambiguity, trivial or nontrivial, from phase retrieval. Almost sure irreducibility is proved for any complex-valued object of a full rank support. While the new irreducibility result can be viewed as a probabilistic version of the classical result by Bruck, Sodin and Hayes, it provides a novel perspective and an effective method for phase retrieval. In particular, almost sure uniqueness, up to a global phase, is proved for complex-valued objects under general two-point conditions. Under a tight sector constraint absolute uniqueness is proved to hold with probability exponentially close to unity as the object sparsity increases. Under a magnitude constraint with random amplitude illumination, uniqueness modulo global phase is proved to hold with probability exponentially close to unity as object sparsity increases. For general complex-valued objects without any constraint, almost sure uniqueness up to global phase is established with two sets of Fourier magnitude data under two independent illuminations. Numerical experiments suggest that random illumination essentially alleviates most, if not all, numerical problems commonly associated with the standard phasing algorithms.

physics.optics↗
arXiv2012

Phase Retrieval with Random Phase Illumination

This paper presents a detailed, numerical study on the performance of the standard phasing algorithms with random phase illumination (RPI). Phasing with high resolution RPI and the oversampling ratio $σ=4$ determines a unique phasing solution up to a global phase factor. Under this condition, the standard phasing algorithms converge rapidly to the true solution without stagnation. Excellent approximation is achieved after a small number of iterations, not just with high resolution but also low resolution RPI in the presence of additive as well multiplicative noises. It is shown that RPI with $σ=2$ is sufficient for phasing complex-valued images under a sector condition and $σ=1$ for phasing nonnegative images. The Error Reduction algorithm with RPI is proved to converge to the true solution under proper conditions.

physics.optics↗
arXiv2011

Mismatch and resolution in compressive imaging

Highly coherent sensing matrices arise in discretization of continuum problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold as well as in using highly coherent, redundant dictionaries as sparsifying operators. Algorithms (BOMP, BLOOMP) based on techniques of band exclusion and local optimization are proposed to enhance Orthogonal Matching Pursuit (OMP) and deal with such coherent sensing matrices. BOMP and BLOOMP have provably performance guarantee of reconstructing sparse, widely separated objects {\em independent} of the redundancy and have a sparsity constraint and computational cost similar to OMP's. Numerical study demonstrates the effectiveness of BLOOMP for compressed sensing with highly coherent, redundant sensing matrices.

cs.IT↗
arXiv2011

Compressive Imaging of Subwavelength Structures II. Periodic Rough Surfaces

A compressed sensing scheme for near-field imaging of corrugations of relative sparse Fourier components is proposed. The scheme employs random sparse measurement of near field to recover the angular spectrum of the scattered field. It is shown heuristically and numerically that under the Rayleigh hypothesis the angular spectrum is compressible and amenable to compressed sensing techniques. Iteration schemes are developed for recovering the surface profile from the angular spectrum. The proposed nonlinear least squares in the Fourier basis produces accurate reconstructions even when the Rayleigh hypothesis is known to be false.

physics.optics↗
arXiv2011

Exact Localization and Superresolution with Noisy Data and Random Illumination

This paper studies the problem of exact localization of sparse (point or extended) objects with noisy data. The crux of the proposed approach consists of random illumination. Several recovery methods are analyzed: the Lasso, BPDN and the One-Step Thresholding (OST). For independent random probes, it is shown that both recovery methods can localize exactly $s=\cO(m)$, up to a logarithmic factor, objects where $m$ is the number of data. Moreover, when the number of random probes is large the Lasso with random illumination has a performance guarantee for superresolution, beating the Rayleigh resolution limit. Numerical evidence confirms the predictions and indicates that the performance of the Lasso is superior to that of the OST for the proposed set-up with random illumination.

cs.IT↗
arXiv2009

Compressed Remote Sensing of Sparse Objects

The linear inverse source and scattering problems are studied from the perspective of compressed sensing, in particular the idea that sufficient incoherence and sparsity guarantee uniqueness of the solution. By introducing the sensor as well as target ensembles, the maximum number of recoverable targets is proved to be at least proportional to the number of measurement data modulo a log-square factor with overwhelming probability. Important contributions of the analysis include the discoveries of the threshold aperture, consistent with the classical Rayleigh criterion, and the decoherence effect induced by random antenna locations. The prediction of theorems are confirmed by numerical simulations.

physics.data-an↗
arXiv2006

Radiative Transfer Limits of Two-Frequency Wigner Distribution for Random Parabolic Waves

The present note establishes the self-averaging, radiative transfer limit for the two-frequency Wigner distribution for classical waves in random media. Depending on the ratio of the wavelength to the correlation length the limiting equation is either a Boltzmann-like integral equation or a Fokker-Planck-like differential equation in the phase space. The limiting equation is used to estimate three physical parameters: the spatial spread, the coherence length and the coherence bandwidth. In the longitudinal case, the Fokker-Planck-like equation can be solved exactly.

physics.optics↗
arXiv2006

Time Reversal Communication in Rayleigh-Fading Broadcast Channels with Pinholes

The paper presents an analysis of the time reversal in independent-multipath Rayleigh-fading channels with $N$ inputs (transmitters) and $M$ outputs (receivers). The main issues addressed are the condition of statistical stability, the rate of information transfer and the effect of pinholes. The stability condition is proved to be $MC\ll N_{\rm eff}B$ for broadband channels and $M\ll N_{\rm eff}$ for narrowband channels where $C$ is the symbol rate, $B$ is the bandwidth and $N_{\rm eff}$ is the {\em effective} number (maybe less than 1) of transmitters. It is shown that when the number of screens, $n-1$, is relatively low compared to the logarithm of numbers of pinholes $N_{\rm eff}$ is given by the {\em harmonic} (or {\em inverse}) {\em sum} of the number of transmitters and the numbers of pinholes at all screens. The novel idea of the effective number of time reversal array (TRA) elements is introduced to derive the stability condition and estimate the channel capacity in the presence of multi-screen pinholes. The information rate, under the constraints of the noise power $ν$ per unit frequency and the average total power $P$, attains the supremum $P/ν$ in the regime $M\wedge N_{\rm eff}\gg P/(νB)$. In particular, when $N_{\rm eff}\gg M\gg P/(Bν)$ the optimal information rate can be achieved with statistically stable, sharply focused signals.

physics.class-ph↗
arXiv2005

Time Reversal of Broadband Signals in a Strongly Fluctuating MIMO Channel: Stability and Resolution

We analyze the time reversal of a multiple-input-multiple-output (MIMO) system in a space-frequency-selective multi-path fading channel described by the stochastic Schrödinger equation with a random potential in the strong-fluctuation regime. We prove that in a broadband limit the conditions for stable super-resolution are the {\em packing} condition that the spacing among the $N$ transmitters and $M$ receivers be more than the coherence length $\ell_c$ and the consecutive symbols in the data-streams are separated by more than the inverse of the bandwidth $B^{-1}$ and the {\em multiplexing} condition that the number of the degrees of freedom per unit time at the transmitters ($\sim NB$) be much larger than the number of the degrees of freedom ($\sim MC$) per unit time in the ensemble of intended messages. Here $C$ is the number of symbols per unit time in the data-streams intended for each receiver. When the two conditions are met, all receivers receive simultaneously streams of statistically stable, sharply focused signals intended for them, free of fading and interference. This indicates the rough multiplexing gain of $NB$ in channel capacity, with the maximal gain per unit {\em angular} cross section given by $BL^d \ell_c^{-d}$ where $L$ is the distance from the transmitters to the receivers. We show that under the ideal packing condition time reversal can result in a high signal-to-interference ratio and low probability of intercept, and hence is an effective means for achieving the information capacity of multi-path channels in the presence of multiple users (receivers).

physics.class-ph↗
arXiv2005

Time Reversal Communication in Multi-Path Fading Channels with Pinholes

The paper presents an analysis of the time reversal in multi-path Rayleigh-fading channels with $N$ inputs (transmitters) and $M$ outputs (receivers). The main issues addressed are the condition of statistical stability, the rate of information transfer and the effect of pinholes. The stability condition is proved to be $MC\ll N_{\rm eff}B$ for broadband channels and $M\ll N_{\rm eff}$ for narrowband channels where $C$ is the symbol rate, $B$ is the bandwidth and $N_{\rm eff}$ is the {\em effective} number of transmitters. It is shown that when the number of layers, $n-1$, is relatively low compared to the logarithm of numbers of pinholes $N_{\rm eff}$ is given by $n^{-1}$ times the harmonic mean of the number of transmitters and the numbers of pinholes at all layers. On the other hand, when the number of layers is relatively large the effective number of pinholes diminishes exponentially. The energy efficiency is shown to be optimal when the power supply is set to the noise level times $BN_{\rm eff}$ and that the maximal information rate is roughly $BN_{\rm eff}$ when the stability condition is violated.

quant-ph↗
arXiv2005

Phase Space Models for Stochastic Nonlinear Parabolic Waves: Wave Spread and Singularity

We derive several kinetic equations to model the large scale, low Fresnel number behavior of the nonlinear Schrodinger (NLS) equation with a rapidly fluctuating random potential. There are three types of kinetic equations the longitudinal, the transverse and the longitudinal with friction. For these nonlinear kinetic equations we address two problems: the rate of dispersion and the singularity formation. For the problem of dispersion, we show that the kinetic equations of the longitudinal type produce the cubic-in-time law, that the transverse type produce the quadratic-in-time law and that the one with friction produces the linear-in-time law for the variance prior to any singularity. For the problem of singularity, we show that the singularity and blow-up conditions in the transverse case remain the same as those for the homogeneous NLS equation with critical or supercritical self-focusing nonlinearity, but they have changed in the longitudinal case and in the frictional case due to the evolution of the Hamiltonian.

nlin.CD↗
arXiv2005

Superresolution and Duality for Time-Reversal of Waves in Self-Similar Media

We analyze the time reversal of waves in a turbulent medium using the parabolic Markovian model. We prove that the time reversal resolution can be a nonlinear function of the wavelength and independent of the aperture. We establish a duality relation between the turbulence-induced wave spread and the time-reversal resolution which can be viewed as an uncertainty inequality for random media. The inequality becomes an equality when the wave structure function is Gaussian.

physics.optics↗
arXiv2004

Scaling Limits for Beam Wave Propagation in Atmospheric Turbulence

We prove the convergence of the solutions of the parabolic wave equation to that of the Gaussian white-noise model widely used in the physical literature. The random medium is isotropic and is assumed to have integrable correlation coefficient in the propagation direction. We discuss the limits of vanishing inner scale and divergent outer scale of the turbulent medium.

math-ph↗
arXiv2003

Noise induced dissipation in Lebesgue-measure preserving maps on $d-$dimensional torus

We consider dissipative systems resulting from the Gaussian and $alpha$-stable noise perturbations of measure-preserving maps on the $d$ dimensional torus. We study the dissipation time scale and its physical implications as the noise level $\vep$ vanishes. We show that nonergodic maps give rise to an $O(1/\vep)$ dissipation time whereas ergodic toral automorphisms, including cat maps and their $d$-dimensional generalizations, have an $O(\ln{(1/\vep)})$ dissipation time with a constant related to the minimal, {\em dimensionally averaged entropy} among the automorphism's irreducible blocks. Our approach reduces the calculation of the dissipation time to a nonlinear, arithmetic optimization problem which is solved asymptotically by means of some fundamental theorems in theories of convexity, Diophantine approximation and arithmetic progression. We show that the same asymptotic can be reproduced by degenerate noises as well as mere coarse-graining. We also discuss the implication of the dissipation time in kinematic dynamo.

math.DS↗