Journal Article10.1002/CPA.20132
For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution
3K
TL;DR: In this article, the authors consider linear equations y = Φx where y is a given vector in ℝn and Φ is a n × m matrix with n 0 so that for large n and for all Φ's except a negligible fraction, the solution x1of the 1-minimization problem is unique and equal to x0.
read more
Abstract: We consider linear equations y = Φx where y is a given vector in ℝn and Φ is a given n × m matrix with n 0 so that for large n and for all Φ's except a negligible fraction, the following property holds: For every y having a representation y = Φx0by a coefficient vector x0 ∈ ℝmwith fewer than ρ · n nonzeros, the solution x1of the 1-minimization problem
is unique and equal to x0. In contrast, heuristic attempts to sparsely solve such systems—greedy algorithms and thresholding—perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almost-spherical sections in Banach space theory, and deviation bounds for the eigenvalues of random Wishart matrices. © 2006 Wiley Periodicals, Inc.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Relating observability and compressed sensing of time-varying signals in recurrent linear networks
TL;DR: This paper studies how the dynamics of recurrent networks, formulated as general dynamical systems, mediate the recovery of sparse, time-varying signals in a dynamic, recurrent network setting, and develops analytical conditions that ensure exact and stable input recovery.
17
Monaural Music Source Separation Using Convolutional Sparse Coding
TL;DR: The result shows that the proposed approach remains effective with a larger dictionary, and compares favorably with the state-of-the-art nonnegative matrix factorization approach, however, in the absence of the score and in the case of a small dictionary, the approach may not be better.
17
A Diagnostic Biomarker for Breast Cancer Screening via Hilbert Embedded Deep Low-Rank Matrix Approximation
TL;DR: In this article, an embedding method is proposed to address this problem and deep-semi-non-negative matrix factorization (Deep-SemiNMF) for thermography is introduced, then tested for 208 breast cancer screening cases.
17
Deep Learning for Direct Automatic Target Recognition from SAR Data
Samia Kazemi,Bariscan Yonel,Birsen Yazici +2 more
- 22 Apr 2019
TL;DR: A deep neural network architecture is presented that classifies targets directly from the slow-time and fast-time sampled received signal, and classification decisions are made based on how closely optimized sets of vectors corresponding to each class represent a new sample.
17
Label Noise Cleansing with Sparse Graph for Hyperspectral Image Classification
TL;DR: Experimental results on two standard hyperspectral image datasets show that the proposed SALP over four major classifiers can significantly decrease the influence of noisy labels, and the method achieves better performance compared with the baselines.
17
References
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
TL;DR: In this paper, the authors considered the model problem of reconstructing an object from incomplete frequency samples and showed that with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the lscr/sub 1/ minimization problem.
Atomic Decomposition by Basis Pursuit
TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
11.3K
Matching pursuits with time-frequency dictionaries
Stéphane Mallat,Zhifeng Zhang +1 more
TL;DR: The authors introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of functions, chosen in order to best match the signal structures.
10.2K
Greed is good: algorithmic results for sparse approximation
TL;DR: This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries and develops a sufficient condition under which OMP can identify atoms from an optimal approximation of a nonsparse signal.
Optimally sparse representation in general (nonorthogonal) dictionaries via 1 minimization
David L. Donoho,Michael Elad +1 more
TL;DR: This article obtains parallel results in a more general setting, where the dictionary D can arise from two or several bases, frames, or even less structured systems, and sketches three applications: separating linear features from planar ones in 3D data, noncooperative multiuser encoding, and identification of over-complete independent component models.
3.5K