English
Related papers

Related papers: Well-Posedness of Sparse Frequency Estimation

200 papers

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

We assume the direct sum <A> o <B> for the signal subspace. As a result of post- measurement, a number of operational contexts presuppose the a priori knowledge of the LB -dimensional "interfering" subspace <B> and the goal is to estimate…

Applications · Statistics 2017-04-17 Guillaume Bouleux , Rémy Boyer

We consider the multi-frequency inverse source problem in the presence of a non-homogeneous medium using passive measurements. Precisely, we derive stability estimates for determining the source from the knowledge of only the imaginary part…

Analysis of PDEs · Mathematics 2024-04-23 Faouzi Triki , Kristoffer Linder-Steinlein , Mirza Karamehmedovic

The problem of compressing a real-valued sparse source using compressive sensing techniques is studied. The rate distortion optimality of a coding scheme in which compressively sensed signals are quantized and then reconstructed is…

Information Theory · Computer Science 2010-11-09 Rajiv Soundararajan , Sriram Vishwanath

Recent advancements in photon induced near-field electron microscopy (PINEM) enable the preparation, coherent manipulation and characterization of free-electron quantum states. The available measurement consists of electron energy…

Numerical Analysis · Mathematics 2026-03-17 Florian Oberender

Sparsity promoting regularization is an important technique for signal reconstruction and several other ill-posed problems. Theoretical investigation typically bases on the assumption that the unknown solution has a sparse representation…

Numerical Analysis · Mathematics 2013-11-11 Jens Flemming , Markus Hegland

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

Quadratically-constrained basis pursuit has become a popular device in sparse regularization; in particular, in the context of compressed sensing. However, the majority of theoretical error estimates for this regularizer assume an a priori…

Information Theory · Computer Science 2017-11-23 Simone Brugiapaglia , Ben Adcock

In this article, high frequency stability estimates for the determination of the potential in the Schr\"odinger equation are studied when the boundary measurements are made on slightly more than half the boundary. The estimates reflect the…

Analysis of PDEs · Mathematics 2021-10-19 Anupam Pal Choudhury , Venkateswaran P. Krishnan

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

Information Theory · Computer Science 2015-05-18 Dmitry Malioutov , Sujay Sanghavi , Alan Willsky

This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a…

Probability · Mathematics 2010-11-10 Holger Rauhut , Karin Schnass , Pierre Vandergheynst

In this paper we establish accuracy bounds of Prony's method (PM) for recovery of sparse measures from incomplete and noisy frequency measurements, or the so-called problem of super-resolution, when the minimal separation between the points…

Numerical Analysis · Mathematics 2024-04-17 Rami Katz , Nuha Diab , Dmitry Batenkov

In this work, we improve upon the guarantees for sparse random embeddings, as they were recently provided and analyzed by Freksen at al. (NIPS'18) and Jagadeesan (NIPS'19). Specifically, we show that (a) our bounds are explicit as opposed…

Machine Learning · Computer Science 2022-02-23 Maciej Skorski , Alessandro Temperoni , Martin Theobald

Consider a regression model with fixed design and Gaussian noise where the regression function can potentially be well approximated by a function that admits a sparse representation in a given dictionary. This paper resorts to exponential…

Statistics Theory · Mathematics 2013-01-08 Philippe Rigollet , Alexandre B. Tsybakov

It is known that sparse recovery by measurements from random circulant matrices provides good recovery bounds. We generalize this to measurements that arise as a random orbit of a group representation for some finite group G. We derive…

Information Theory · Computer Science 2025-09-17 Hartmut Führ , Timm Gilles

We consider the problem of establishing nonlinear smoothing as a general feature of nonlinear dispersive equations, i.e. the improved regularity of the integral term in Duhamel's formula, with respect to the initial data and the…

Analysis of PDEs · Mathematics 2023-02-08 Simão Correia , Filipe Oliveira , Jorge Drumond Silva

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing. In this paper, the high-dimensional setting is considered. It is shown…

Information Theory · Computer Science 2013-02-06 Galen Reeves , Michael Gastpar

We establish stability inequalities for the problem of determining the potential, appearing in a Sch\"odinger equation, from partial boundary data in the high frequency limit. These stability inequalities hold under the assumption that the…

Analysis of PDEs · Mathematics 2025-01-23 Mourad Choulli

Finding the sparse representation of a signal in an overcomplete dictionary has attracted a lot of attention over the past years. This paper studies ProSparse, a new polynomial complexity algorithm that solves the sparse representation…

Information Theory · Computer Science 2017-07-11 Yue M. Lu , Jon Oñativia , Pier Luigi Dragotti

Estimating covariance matrices with high-dimensional complex data presents significant challenges, particularly concerning positive definiteness, sparsity, and numerical stability. Existing robust sparse estimators often fail to guarantee…

Methodology · Statistics 2025-12-30 Shaoxin Wang , Ziyun Ma
‹ Prev 1 2 3 10 Next ›