Searcharxiv⌕ Search

arXiv subjects

Qiyu Sun

Publications and source records attributed to Qiyu Sun.

At least 73 records · Page 4Linked to original sources
arXiv2018

CAPRL: Signal Recovery from Compressive Affine Phase Retrieval via Lifting

In this paper, we consider compressive/sparse affine phase retrieval proposed in [B. Gao B, Q. Sun, Y. Wang and Z. Xu, Adv. in Appl. Math., 93(2018), 121-141]. By the lift technique, and heuristic nuclear norm for convex relaxation of rank and $\ell$ one norm convex relaxation of sparsity, we establish convex models , which are called compressive affine phase retrieval via lifting (CAPRL). In order to compute these models, we develop inertial proximal ADMM for multiple separated operators and also give out its convergence analysis. Our numerical experiments via proposed algorithm show that sparse signal can be exactly and stably recovered via CAPRL. We also list some other applications of our proposed algorithm.

math.OC↗
arXiv2018

Stable Phaseless Sampling and Reconstruction of Real-Valued Signals with Finite Rate of Innovations

A spatial signal is defined by its evaluations on the whole domain. In this paper, we consider stable reconstruction of real-valued signals with finite rate of innovations (FRI), up to a sign, from their magnitude measurements on the whole domain or their phaseless samples on a discrete subset. FRI signals appear in many engineering applications such as magnetic resonance spectrum, ultra wide-band communication and electrocardiogram. For an FRI signal, we introduce an undirected graph to describe its topological structure. We establish the equivalence between the graph connectivity and phase retrievability of FRI signals, and we apply the graph connected component decomposition to find all FRI signals that have the same magnitude measurements as the original FRI signal has. We construct discrete sets with finite density explicitly so that magnitude measurements of FRI signals on the whole domain are determined by their samples taken on those discrete subsets. In this paper, we also propose a stable algorithm with linear complexity to reconstruct FRI signals from their phaseless samples on the above phaseless sampling set. The proposed algorithm is demonstrated theoretically and numerically to provide a suboptimal approximation to the original FRI signal in magnitude measurements.

cs.IT↗
arXiv2017

Nonsubsampled Graph Filter Banks and Distributed Implementation

In this paper, we consider nonsubsampled graph filter banks (NSGFBs) to process data on a graph in a distributed manner. Given an analysis filter bank with small bandwidth, we propose algebraic and optimization methods of constructing synthesis filter banks such that the corresponding NSGFBs provide a perfect signal reconstruction in the noiseless setting. Moreover, we prove that the proposed NSGFBs can control the resonance effect in the presence of bounded noise and they can limit the influence of shot noise primarily to a small neighborhood of its location on the graph. For an NSGFB on a graph of large size, a distributed implementation has a significant advantage, since data processing and communication demands for the agent at each vertex depend mainly on its neighboring topology. In this paper, we propose an iterative distributed algorithm to implement the proposed NSGFBs. Based on NSGFBs, we also develop a distributed denoising technique which is demonstrated to have satisfactory performance on noise suppression.

cs.IT↗
arXiv2017

Polynomial control on stability, inversion and powers of matrices on simple graphs

Spatially distributed networks of large size arise in a variety of science and engineering problems, such as wireless sensor networks and smart power grids. Most of their features can be described by properties of their state-space matrices whose entries have indices in the vertex set of a graph. In this paper, we introduce novel % Banach algebras of Beurling type that contain matrices on a connected simple graph having polynomial off-diagonal decay, and we show that they are Banach subalgebras of ${\mathcal B}(\ell^p), 1\le p\le \infty$, the space of all bounded operators on the space $\ell^p$ of all $p$-summable sequences. The $\ell^p$-stability of state-space matrices is an essential hypothesis for the robustness of spatially distributed networks. In this paper, we establish the equivalence among $\ell^p$-stabilities of matrices in Beurling algebras for different exponents $1\le p\le \infty$, with quantitative analysis for the lower stability bounds. Admission of norm-control inversion plays a crucial role in some engineering practice. In this paper, we prove that matrices in Beurling subalgebras of ${\mathcal B}(\ell^2)$ have norm-controlled inversion and we find a norm-controlled polynomial with close to optimal degree. Polynomial estimate to powers of matrices is important for numerical implementation of spatially distributed networks. In this paper, we apply our results on norm-controlled inversion to obtain a polynomial estimate to powers of matrices in Beurling algebras. The polynomial estimate is a noncommutative extension about convolution powers of a complex function and is applicable to estimate the probability of hopping from one agent to another agent in a stationary Markov chain on a spatially distributed network.

math.FA↗
arXiv2017

Phaseless Sampling and Reconstruction of Real-Valued Signals in Shift-Invariant Spaces

Sampling in shift-invariant spaces is a realistic model for signals with smooth spectrum. In this paper, we consider phaseless sampling and reconstruction of real-valued signals in a shift-invariant space from their magnitude measurements on the whole Euclidean space and from their phaseless samples taken on a discrete set with finite sampling density. We introduce an undirected graph to a signal and use connectivity of the graph to characterize whether the signal can be determined, up to a sign, from its magnitude measurements on the whole Euclidean space. Under the local complement property assumption on a shift-invariant space, we find a discrete set with finite sampling density such that signals in the shift-invariant space, that are determined from their magnitude measurements on the whole Euclidean space, can be reconstructed in a stable way from their phaseless samples taken on that discrete set. In this paper, we also propose a reconstruction algorithm which provides a suboptimal approximation to the original signal when its noisy phaseless samples are available only. Finally, numerical simulations are performed to demonstrate the robust reconstruction of box spline signals from their noisy phaseless samples.

cs.IT↗
arXiv2016

Phase Retrieval From the Magnitudes of Affine Linear Measurements

In this paper, we consider the phase retrieval problem in which one aims to recover a signal from the magnitudes of affine measurements. Let $\{{\mathbf a}_j\}_{j=1}^m \subset {\mathbb H}^d$ and ${\mathbf b}=(b_1, \ldots, b_m)^\top\in{\mathbb H}^m$, where ${\mathbb H}={\mathbb R}$ or ${\mathbb C}$. We say $\{{\mathbf a}_j\}_{j=1}^m$ and $\mathbf b$ are affine phase retrievable for ${\mathbb H}^d$ if any ${\mathbf x}\in{\mathbb H}^d$ can be recovered from the magnitudes of the affine measurements $\{|<{\mathbf a}_j,{\mathbf x}>+b_j|,\, 1\leq j\leq m\}$. We develop general framework for affine phase retrieval and prove necessary and sufficient conditions for $\{{\mathbf a}_j\}_{j=1}^m$ and $\mathbf b$ to be affine phase retrievable. We establish results on minimal measurements and generic measurements for affine phase retrieval as well as on sparse affine phase retrieval. In particular, we also highlight some notable differences between affine phase retrieval and the standard phase retrieval in which one aims to recover a signal $\mathbf x$ from the magnitudes of its linear measurements. In standard phase retrieval, one can only recover $\mathbf x$ up to a unimodular constant, while affine phase retrieval removes this ambiguity. We prove that unlike standard phase retrieval, the affine phase retrievable measurements $\{{\mathbf a}_j\}_{j=1}^m$ and $\mathbf b$ do not form an open set in ${\mathbb H}^{m\times d}\times {\mathbb H}^m$. Also in the complex setting, the standard phase retrieval requires $4d-O(\log_2d)$ measurements, while the affine phase retrieval only needs $m=3d$ measurements.

cs.IT↗
arXiv2016

Phase retrieval from multiple-window short-time Fourier measurements

In this paper, we introduce two symmetric directed graphs depending on supports of signals and windows, and we show that the connectivity of those graphs provides either necessary and sufficient conditions to phase retrieval of a signal from magnitude measurements of its multiple-window short-time Fourier transform. Also we propose an algebraic reconstruction algorithm, and provide an error estimate to our algorithm when magnitude measurements are corrupted by deterministic/random noises.

cs.IT↗
arXiv2016

Phase Retrieval of Real-Valued Signals in a Shift-Invariant Space

Phase retrieval arises in various fields of science and engineering and it is well studied in a finite-dimensional setting. In this paper, we consider an infinite-dimensional phase retrieval problem to reconstruct real-valued signals living in a shift-invariant space from its phaseless samples taken either on the whole line or on a set with finite sampling rate. We find the equivalence between nonseparability of signals in a linear space and its phase retrievability with phaseless samples taken on the whole line. For a spline signal of order $N$, we show that it can be well approximated, up to a sign, from its noisy phaseless samples taken on a set with sampling rate $2N-1$. We propose an algorithm to reconstruct nonseparable signals in a shift-invariant space generated by a compactly supported continuous function. The proposed algorithm is robust against bounded sampling noise and it could be implemented in a distributed manner.

cs.IT↗
arXiv2015

Spatially Distributed Sampling and Reconstruction

A spatially distributed system contains a large amount of agents with limited sensing, data processing, and communication capabilities. Recent technological advances have opened up possibilities to deploy spatially distributed systems for signal sampling and reconstruction. In this paper, we introduce a graph structure for a distributed sampling and reconstruction system by coupling agents in a spatially distributed system with innovative positions of signals. A fundamental problem in sampling theory is the robustness of signal reconstruction in the presence of sampling noises. For a distributed sampling and reconstruction system, the robustness could be reduced to the stability of its sensing matrix. In a traditional centralized sampling and reconstruction system, the stability of the sensing matrix could be verified by its central processor, but the above procedure is infeasible in a distributed sampling and reconstruction system as it is decentralized. In this paper, we split a distributed sampling and reconstruction system into a family of overlapping smaller subsystems, and we show that the stability of the sensing matrix holds if and only if its quasi-restrictions to those subsystems have uniform stability. This new stability criterion could be pivotal for the design of a robust distributed sampling and reconstruction system against supplement, replacement and impairment of agents, as we only need to check the uniform stability of affected subsystems. In this paper, we also propose an exponentially convergent distributed algorithm for signal reconstruction, that provides a suboptimal approximation to the original signal in the presence of bounded sampling noises.

cs.IT↗
arXiv2015

Nonlinear frames and sparse reconstructions in Banach spaces

In the first part of this paper, we consider nonlinear extension of frame theory by introducing bi-Lipschitz maps $F$ between Banach spaces. Our linear model of bi-Lipschitz maps is the analysis operator associated with Hilbert frames, $p$-frames, Banach frames, g-frames and fusion frames. In general Banach space setting, stable algorithm to reconstruct a signal $x$ from its noisy measurement $F(x)+ε$ may not exist. In this paper, we establish exponential convergence of two iterative reconstruction algorithms when $F$ is not too far from some bounded below linear operator with bounded pseudo-inverse, and when $F$ is a well-localized map between two Banach spaces with dense Hilbert subspaces. The crucial step to prove the later conclusion is a novel fixed point theorem for a well-localized map on a Banach space. In the second part of this paper, we consider stable reconstruction of sparse signals in a union ${\bf A}$ of closed linear subspaces of a Hilbert space ${\bf H}$ from their nonlinear measurements. We create an optimization framework called sparse approximation triple $({\bf A}, {\bf M}, {\bf H})$, and show that the minimizer $$x^*={\rm argmin}_{\hat x\in {\mathbf M}\ {\rm with} \ \|F(\hat x)-F(x^0)\|\le ε} \|\hat x\|_{\mathbf M}$$ provides a suboptimal approximation to the original sparse signal $x^0\in {\bf A}$ when the measurement map $F$ has the sparse Riesz property and almost linear property on ${\mathbf A}$. The above two new properties is also discussed in this paper when $F$ is not far away from a linear measurement operator $T$ having the restricted isometry property.

cs.IT↗
arXiv2014

Spectral measures with arbitrary Hausdorff dimensions

In this paper, we consider spectral properties of Riesz product measures supported on homogeneous Cantor sets and we show the existence of spectral measures with arbitrary Hausdorff dimensions, including non-atomic zero-dimensional spectral measures and one-dimensional singular spectral measures.

math.FA↗
arXiv2014

Sparsity and Spatial Localization Measures for Spatially Distributed Systems

We consider the class of spatially decaying systems, where the underlying dynamics are spatially decaying and the sensing and controls are spatially distributed. This class of systems arise in various applications where there is a notion of spatial distance with respect to which couplings between the subsystems can be quantified using a class of coupling weight functions. We exploit spatial decay property of the underlying dynamics of the system to introduce a class of sparsity and spatial localization measures for spatially distributed systems. We develop a new methodology based on concepts of $q$-Banach algebras of spatially decaying operators that enable us to establish a relationship between spatial decay properties of spatially decaying systems and their sparsity and spatial localization features. Moreover, it is shown that the inverse-closedness property of operator algebras plays a central role in exploiting various structural properties of spatially decaying systems. We characterize conditions for exponentially stability of spatially decaying system over $q$-Banach algebras and prove that the unique solutions of the Lyapunov and Riccati equations over a proper $q$-Banach algebra also belong to the same $q$-Banach algebra. It is shown that the quadratically optimal state feedback controllers for spatially decaying systems are sparse and spatially localized in the sense that they have near-optimal sparse information structures.

math.OC↗
arXiv2014

Sampling and Galerkin reconstruction in reproducing kernel spaces

In this paper, we consider sampling in a reproducing kernel subspace of $L^p$. We introduce a pre-reconstruction operator associated with a sampling scheme and propose a Galerkin reconstruction in general Banach space setting. We show that the proposed Galerkin method provides a quasi-optimal approximation, and the corresponding Galerkin equations could be solved by an iterative approximation-projection algorithm. We also present detailed analysis and numerical simulations of the Galerkin method for reconstructing signals with finite rate of innovation.

cs.IT↗
arXiv2013

The $abc$-problem for Gabor systems

A Gabor system generated by a window function $ϕ$ and a rectangular lattice $a \Z\times \Z/b$ is given by $${\mathcal G}(ϕ, a \Z\times \Z/b):=\{e^{-2πi n t/b} ϕ(t- m a):\ (m, n)\in \Z\times \Z\}.$$ One of fundamental problems in Gabor analysis is to identify window functions $ϕ$ and time-frequency shift lattices $a \Z\times \Z/b$ such that the corresponding Gabor system ${\mathcal G}(ϕ, a \Z\times \Z/b)$ is a Gabor frame for $L^2(\R)$, the space of all square-integrable functions on the real line $\R$. In this paper, we provide a full classification of triples $(a,b,c)$ for which the Gabor system ${\mathcal G}(χ_I, a \Z\times \Z/b)$ generated by the ideal window function $χ_I$ on an interval $I$ of length $c$ is a Gabor frame for $L^2(\R)$. For the classification of such triples $(a, b, c)$ (i.e., the $abc$-problem for Gabor systems), we introduce maximal invariant sets of some piecewise linear transformations and establish the equivalence between Gabor frame property and triviality of maximal invariant sets. We then study dynamic system associated with the piecewise linear transformations and explore various properties of their maximal invariant sets. By performing holes-removal surgery for maximal invariant sets to shrink and augmentation operation for a line with marks to expand, we finally parameterize those triples $(a, b, c)$ for which maximal invariant sets are trivial. The novel techniques involving non-ergodicity of dynamical systems associated with some novel non-contractive and non-measure-preserving transformations lead to our arduous answer to the $abc$-problem for Gabor systems.

cs.IT↗
arXiv2013

Recovery of bilevel causal signals with finite rate of innovation using positive sampling kernels

Bilevel signal $x$ with maximal local rate of innovation $R$ is a continuous-time signal that takes only two values 0 and 1 and that there is at most one transition position in any time period of 1/R.In this note, we introduce a recovery method for bilevel causal signals $x$ with maximal local rate of innovation $R$ from their uniform samples $x*h(nT), n\ge 1$, where the sampling kernel $h$ is causal and positive on $(0, T)$, and the sampling rate $τ:=1/T$ is at (or above) the maximal local rate of innovation $R$. We also discuss stability of the bilevel signal recovery procedure in the presence of bounded noises.

cs.IT↗
arXiv2013

Localized nonlinear functional equations and two sampling problems in signal processing

Let $1\le p\le \infty$. In this paper, we consider solving a nonlinear functional equation $$f(x)=y,$$ where $x, y$ belong to $\ell^p$ and $f$ has continuous bounded gradient in an inverse-closed subalgebra of ${\mathcal B}(\ell^2)$, the Banach algebra of all bounded linear operators on the Hilbert space $\ell^2$. We introduce strict monotonicity property for functions $f$ on Banach spaces $\ell^p$ so that the above nonlinear functional equation is solvable and the solution $x$ depends continuously on the given data $y$ in $\ell^p$. We show that the Van-Cittert iteration converges in $\ell^p$ with exponential rate and hence it could be used to locate the true solution of the above nonlinear functional equation. We apply the above theory to handle two problems in signal processing: nonlinear sampling termed with instantaneous companding and subsequently average sampling; and local identification of innovation positions and qualification of amplitudes of signals with finite rate of innovation.

math.FA↗