Stable signal recovery from incomplete and inaccurate measurements
By E.J. Candes, Justin K. Romberg, Terence Tao. 2005
7,765 citations recorded by the source corpus.
Suppose we wish to recover a vector x0 ∈ ℝ𝓂 (e.g., a digital signal or image) from incomplete and contaminated observations y = A x0 + e; A is an 𝓃 × 𝓂 matrix with far fewer rows than columns (𝓃 ≪ 𝓂) and e is an error term. Is it possible to recover x0 accurately based on the data y?
Subfields: Applied Mathematics, Computational Mechanics, Computer Vision and Pattern Recognition, Optimization & Training
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Applied Mathematics
- E.J. Candes
- Yonina C. Eldar
- Richard Baraniuk
- Roman Vershynin
- Martin J. Wainwright
- Marco F. Duarte
- Justin K. Romberg
- Mark Rudelson
In Computational Mechanics
- E.J. Candes
- Richard Baraniuk
- Yonina C. Eldar
- Marco F. Duarte
- Wotao Yin
- Martin J. Wainwright
- Justin K. Romberg
- Francis R. Bach
In Computer Vision and Pattern Recognition
- Luc Van Gool
- Ming-Hsuan Yang
- Dacheng Tao
- Lei Zhang
- Xiaogang Wang
- Trevor Darrell
- Jitendra Malik
- Yi Yang
In Optimization & Training
- Peter Richtárik
- Francis R. Bach
- Simon Lacoste-Julien
- Nicolas Loizou
- Wotao Yin
- Jakub Konecný
- Michael I. Jordan
- Martin J. Wainwright
Citations in the corpus
- D2C: Diffusion-Decoding Models for Few-Shot Conditional Generation (2021, background): “These properties c include (but are not limited to2) labels [61], text descriptions [60, 76], noisy or partial observations [11, 5, 47, 24], and manipulation constraints [69].”
- Discovering governing equations from data by sparse identification of nonlinear dynamical systems (2015, methodology): “This formulation is closely related to the compressive sensing framework, which allows for the sparse vector ξ to be determined from relatively few incoherent random measurements [15, 16, 17, 18, 19, 20].”
- Geometric median and robust estimation in Banach spaces (2013, neutral): “We stated the bounds only for the Euclidean distance ‖λ̂∗ε −λ0‖; this formulation is close to the compressed sensing framework [12].”
- LOGAN: Latent Optimisation for Generative Adversarial Networks (2019, methodology): “Inspired by compressed sensing (Candes et al., 2006; Donoho, 2006), Wu et al. (2019) introduced latent optimisation for GANs.”
- Robust Lasso With Missing and Grossly Corrupted Observations (2011, neutral): “A standard bound in [36] gives us: ∑q i=3 ‖hTi‖2 ≤ k−1/2 ‖hT c‖1.”
- Solving Linear Inverse Problems Using the Prior Implicit in a Denoiser (2020, background): “Compressive sensing [49, 50] provides a set of theoretical results regarding recovery of sparse signals from a small number of linear measurements.”
- Uncertainty Principles and Vector Quantization (2006, background): “The UUP with parameters ε, δ ∈ (0 , 1) states that there exists λ > 0 such that, for See also [5], [6] for more refined versions.”
- Towards Efficient Data Valuation Based on the Shapley Value (2019, background): “This result can also be generalized to noisy measurements [3].”
- 11-magic : Recovery of sparse signals via convex programming (2005, methodology): “As shown in [5], if a sufficiently sparse x0 exists such that b = Ax0 + e, for some small error term ‖e‖2 ≤ , then the solution x2 to (P2) will be close to x0.”
- Knowledge (2017, background): “21 This is the Hebbian theory, named after Hebb (1949). Hebb himself traced this rule, however, back to Sigmund Freud.”
- Demand Response Optimization for Smart Home Scheduling Under Real-Time Pricing (2012, background): “It should be noted that the characteristic function defined in (5) is called weighted regularization term commonly considered in automatic model selection and sparse signal processing [13], [14].”
- Random Sampling of Sparse Trigonometric Polynomials (2005, neutral): “C A ] Key Words: random sampling, trigonometric polynomials, Basis Pursuit, ℓ1-minimization, sparse recovery, set partitions, random matrices AMS Subject classification: 94A20, 42A05, 15A52, 05A18, 90C05, 90C25”
- The adaptive and the thresholded Lasso for potentially misspecified models (and a lower bound for the Lasso) (2011, neutral): “Thresholding and multistage procedures are also considered in [12, 13].”
- Exact Recovery of Chaotic Systems from Highly Corrupted Data (2016, background): “As shown in [Don06, CRT06, CDD09], a certain null-space property for an m × n matrix A is a sufficient and necessary condition for sparse solutions to be exactly recovered via (cid:96) 1 minimization.”