Related papers: Nonlinear frames and sparse reconstructions in Ban…
We consider a second-order elliptic boundary value problem with strongly monotone and Lipschitz-continuous nonlinearity. We design and study its adaptive numerical approximation interconnecting a finite element discretization, the…
We consider algorithms and recovery guarantees for the analysis sparse model in which the signal is sparse with respect to a highly coherent frame. We consider the use of a monotone version of the fast iterative shrinkage- thresholding…
Nonstationary Gabor frames, recently introduced in adaptive signal analysis, represent a natural generalization of classical Gabor frames by allowing for adaptivity of windows and lattice in either time or frequency. Due to the lack of a…
In this short note, we consider the worst case noise robustness of any phase retrieval algorithm which aims to reconstruct all nonvanishing vectors $\mathbf{x} \in \mathbb{C}^d$ (up to a single global phase multiple) from the magnitudes of…
This paper presents a new Bayesian spectral unmixing algorithm to analyse remote scenes sensed via sparse multispectral Lidar measurements. To a first approximation, in the presence of a target, each Lidar waveform consists of a main peak,…
Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is…
This book discusses the interactions between the (nonlinear) metric structure of Banach spaces and their linear asymptotic behavior. The overarching problem is to understand how the various linear structures of a Banach space are preserved…
In the theory of compressed sensing (CS), the sparsity $\|x\|_0$ of the unknown signal $\mathbf{x} \in \mathcal{R}^n$ is of prime importance and the focus of reconstruction algorithms has mainly been either $\|x\|_0$ or its convex…
We address the problem of reconstructing a multi-band signal from its sub-Nyquist point-wise samples. To date, all reconstruction methods proposed for this class of signals assumed knowledge of the band locations. In this paper, we develop…
We use $KKM$ theorem to prove the existence of a new fixed point theorem for non-expansive mapping:Let M be a bounded closed convex subset of Hilbert space H, and $A:M\rightarrow M$ be a non-expansive mapping, then exists a fixed point of A…
The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp. finite-dimensional)…
We introduce LiPopt, a polynomial optimization framework for computing increasingly tighter upper bounds on the Lipschitz constant of neural networks. The underlying optimization problems boil down to either linear (LP) or semidefinite…
Context. The LOw Frequency ARray (LOFAR) radio telescope is a giant digital phased array interferometer with multiple antennas distributed in Europe. It provides discrete sets of Fourier components of the sky brightness. Recovering the…
A simultaneous input and state interval observer is presented for Lipschitz continuous nonlinear systems with unknown inputs and bounded noise signals for the case when the direct feedthrough matrix has full column rank. The observer…
In this work, we introduce a new class of non-convex functions, called implicit concave functions, which are compositions of a concave function with a continuously differentiable mapping. We analyze the properties of their minimization by…
We develope a local theory for frames on finite dimensional Hilbert spaces. In particular, a bounded frame on a finite dimensional Hilbert space contains a subset which is a good Riesz basis for a percentage (arbitrarily close to one) of…
We propose a hierarchical learning strategy aimed at generating sparse representations and associated models for large noisy datasets. The hierarchy follows from approximation spaces identified at successively finer scales. For promoting…
Sparse signal recovery algorithms like sparse Bayesian learning work well but the complexity quickly grows when tackling higher dimensional parametric dictionaries. In this work we propose a novel Bayesian strategy to address the two…
Let $E$, $F$ be separable Hilbert spaces, and assume that $E$ is infinite-dimensional. We show that for every continuous mapping $f:E\to F$ and every continuous function $\varepsilon: E\to (0, \infty)$ there exists a $C^{\infty}$ mapping…
Signal models formed as linear combinations of few atoms from an over-complete dictionary or few frame vectors from a redundant frame have become central to many applications in high dimensional signal processing and data analysis. A core…