English
Related papers

Related papers: Small coherence implies the weak Null Space Proper…

200 papers

Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large)…

Information Theory · Computer Science 2013-04-04 Jean Barbier , Florent Krzakala , Marc Mézard , Lenka Zdeborová

We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…

Dynamical Systems · Mathematics 2023-09-15 Darren Creutz , Ronnie Pavlov

For an operator $T:X\to Y$, denote $m(T)=\inf\{\|Tx\|:x\in S_X\}$. A sequence $(x_n)$ in $S_X$ is said to be minimizing for $T$ if $\|Tx_n\|\to m(T)$. The weak minimizing property (WmP), introduced by Chakraborty, requires that every…

Functional Analysis · Mathematics 2026-05-05 Anselmo Raposo , Geivison Ribeiro

We consider the decomposition of a signal over an overcomplete set of vectors. Minimization of the $\ell^1$-norm of the coefficient vector can often retrieve the sparsest solution (so-called "$\ell^1/\ell^0$-equivalence"), a generally…

Computer Vision and Pattern Recognition · Computer Science 2019-01-10 Chelsea Weaver , Naoki Saito

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

$\ell_1$ minimization is often used for finding the sparse solutions of an under-determined linear system. In this paper we focus on finding sharp performance bounds on recovering approximately sparse signals using $\ell_1$ minimization,…

Information Theory · Computer Science 2010-05-21 Weiyu Xu , Babak Hassibi

In this paper, {the goal is to design deterministic sampling patterns on the sphere and the rotation group} and, thereby, construct sensing matrices for sparse recovery of band-limited functions. It is first shown that random sensing…

Information Theory · Computer Science 2020-04-22 Arya Bangun , Arash Behboodi , Rudolf Mathar

The space of all finite non-empty subsets of a topological space $X$, also known as the Ran space of $X$, is weakly contractible for $X$ path connected. We consider subspaces $\mathrm{Ran}_{\leqslant n}(X)$ of the Ran space given by all…

Algebraic Topology · Mathematics 2026-02-20 Jānis Lazovskis

The aim of this note is to obtain results about when the norm of a projective tensor product is strongly subdifferentiable. We prove that if $X\hat{\otimes}_\pi Y$ is strongly subdifferentiable and either $X$ or $Y$ has the metric…

Functional Analysis · Mathematics 2022-09-08 Abraham Rueda Zoca

We study the recovery results of $\ell_p$-constrained compressive sensing (CS) with $p\geq 1$ via robust width property and determine conditions on the number of measurements for standard Gaussian matrices under which the property holds…

Information Theory · Computer Science 2017-08-28 Zhiyong Zhou , Jun Yu

A matrix $\Phi \in \mathbb{R}^{Q \times N}$ satisfies the restricted isometry property if $\|\Phi x\|_2^2$ is approximately equal to $\|x\|_2^2$ for all $k$-sparse vectors $x$. We give a construction of RIP matrices with the optimal $Q =…

Information Theory · Computer Science 2024-12-19 Shravas Rao

Solving compressed sensing problems relies on the properties of sparse signals. It is commonly assumed that the sparsity s needs to be less than one half of the spark of the sensing matrix A, and then the unique sparsest solution exists,…

Information Theory · Computer Science 2016-10-24 Chun-Kit Lai , Shidong Li , Daniel Mondo

A nonempty closed convex bounded subset $C$ of a Banach space is said to have the weak approximate fixed point property if for every continuous map $f:C\to C$ there is a sequence $\{x_n\}$ in $C$ such that $x_n-f(x_n)$ converge weakly to 0.…

Functional Analysis · Mathematics 2011-03-18 Ondřej F. K. Kalenda

The paper introduces a framework for the recoverability analysis in compressive sensing for imaging applications such as CI cameras, rapid MRI and coded apertures. This is done using the fact that the Spherical Section Property (SSP) of a…

Information Theory · Computer Science 2012-12-07 Mahdi S. Hosseini , Konstantinos N. Plataniotis

Under the assumption that a finite signal with different sampling lengths or different sampling frequencies is considered as equivalent, the signal space is considered as the quotient space of $\mathbb{R}^{\infty}$ over equivalence. The…

Systems and Control · Electrical Eng. & Systems 2024-11-21 Daizhan Cheng

It is demonstrated that a weak measurement of the squared quadrature observable may yield negative values for coherent states. This result cannot be reproduced by a classical theory where quadratures are stochastic $c$-numbers. The real…

Quantum Physics · Physics 2009-11-10 Lars M. Johansen

For high dimensional sparse linear regression problems, we propose a sequential convex relaxation algorithm (iSCRA-TL1) by solving inexactly a sequence of truncated $\ell_1$-norm regularized minimization problems, in which the working index…

Statistics Theory · Mathematics 2024-11-05 Shujun Bi , Yonghua Yang , Shaohua Pan

Coherence phenomena appear in two different situations. In the context of category theory the term `coherence constraints' refers to a set of diagrams whose commutativity implies the commutativity of a larger class of diagrams. In the…

q-alg · Mathematics 2007-05-23 Martin Markl , Steve Shnider

This study aims at contributing to lower bounds for empirical compatibility constants or empirical restricted eigenvalues. This is of importance in compressed sensing and theory for $\ell_1$-regularized estimators. Let $X$ be an $n \times…

Statistics Theory · Mathematics 2014-11-11 Sara van de Geer , Alan Muro

Compressed sensing is by now well-established as an effective tool for extracting sparsely distributed information, where sparsity is a discrete concept, referring to the number of dominant nonzero signal components in some basis for the…

Information Theory · Computer Science 2015-06-15 Dinesh Ramasamy , Sriram Venkateswaran , Upamanyu Madhow