scholarly journals Complex Phase Retrieval from Subgaussian Measurements

2020 ◽  
Vol 26 (6) ◽  
Author(s):  
Felix Krahmer ◽  
Dominik Stöger

AbstractPhase retrieval refers to the problem of reconstructing an unknown vector $$x_0 \in {\mathbb {C}}^n$$ x 0 ∈ C n or $$x_0 \in {\mathbb {R}}^n $$ x 0 ∈ R n from m measurements of the form $$y_i = \big \vert \langle \xi ^{\left( i\right) }, x_0 \rangle \big \vert ^2 $$ y i = | ⟨ ξ i , x 0 ⟩ | 2 , where $$ \left\{ \xi ^{\left( i\right) } \right\} ^m_{i=1} \subset {\mathbb {C}}^m $$ ξ i i = 1 m ⊂ C m are known measurement vectors. While Gaussian measurements allow for recovery of arbitrary signals provided the number of measurements scales at least linearly in the number of dimensions, it has been shown that ambiguities may arise for certain other classes of measurements $$ \left\{ \xi ^{\left( i\right) } \right\} ^{m}_{i=1}$$ ξ i i = 1 m such as Bernoulli measurements or Fourier measurements. In this paper, we will prove that even when a subgaussian vector $$ \xi ^{\left( i\right) } \in {\mathbb {C}}^m $$ ξ i ∈ C m does not fulfill a small-ball probability assumption, the PhaseLift method is still able to reconstruct a large class of signals $$x_0 \in {\mathbb {R}}^n$$ x 0 ∈ R n from the measurements. This extends recent work by Krahmer and Liu from the real-valued to the complex-valued case. However, our proof strategy is quite different and we expect some of the new proof ideas to be useful in several other measurement scenarios as well. We then extend our results $$x_0 \in {\mathbb {C}}^n $$ x 0 ∈ C n up to an additional assumption which, as we show, is necessary.

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Lung-Hui Chen

Abstract In this paper, we discuss how to partially determine the Fourier transform F ⁢ ( z ) = ∫ - 1 1 f ⁢ ( t ) ⁢ e i ⁢ z ⁢ t ⁢ 𝑑 t , z ∈ ℂ , F(z)=\int_{-1}^{1}f(t)e^{izt}\,dt,\quad z\in\mathbb{C}, given the data | F ⁢ ( z ) | {\lvert F(z)\rvert} or arg ⁡ F ⁢ ( z ) {\arg F(z)} for z ∈ ℝ {z\in\mathbb{R}} . Initially, we assume [ - 1 , 1 ] {[-1,1]} to be the convex hull of the support of the signal f. We start with reviewing the computation of the indicator function and indicator diagram of a finite-typed complex-valued entire function, and then connect to the spectral invariant of F ⁢ ( z ) {F(z)} . Then we focus to derive the unimodular part of the entire function up to certain non-uniqueness. We elaborate on the translation of the signal including the non-uniqueness associates of the Fourier transform. We show that the phase retrieval and magnitude retrieval are conjugate problems in the scattering theory of waves.


Author(s):  
Moritz Moeller ◽  
Tino Ullrich

AbstractIn this paper we study $$L_2$$ L 2 -norm sampling discretization and sampling recovery of complex-valued functions in RKHS on $$D \subset \mathbb {R}^d$$ D ⊂ R d based on random function samples. We only assume the finite trace of the kernel (Hilbert–Schmidt embedding into $$L_2$$ L 2 ) and provide several concrete estimates with precise constants for the corresponding worst-case errors. In general, our analysis does not need any additional assumptions and also includes the case of non-Mercer kernels and also non-separable RKHS. The fail probability is controlled and decays polynomially in n, the number of samples. Under the mild additional assumption of separability we observe improved rates of convergence related to the decay of the singular values. Our main tool is a spectral norm concentration inequality for infinite complex random matrices with independent rows complementing earlier results by Rudelson, Mendelson, Pajor, Oliveira and Rauhut.


2021 ◽  
Vol 157 (7) ◽  
pp. 1610-1651
Author(s):  
Pascal Autissier ◽  
Dante Bonolis ◽  
Youness Lamzouri

In this paper, we investigate the distribution of the maximum of partial sums of families of $m$ -periodic complex-valued functions satisfying certain conditions. We obtain precise uniform estimates for the distribution function of this maximum in a near-optimal range. Our results apply to partial sums of Kloosterman sums and other families of $\ell$ -adic trace functions, and are as strong as those obtained by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular, we improve on the recent work of the third author for Birch sums. However, unlike character sums, we are able to construct families of $m$ -periodic complex-valued functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality is sharp.


2005 ◽  
Vol 169 (3) ◽  
pp. 305-314 ◽  
Author(s):  
Rafał Latała ◽  
Krzysztof Oleszkiewicz

Sign in / Sign up

Export Citation Format

Share Document