压缩感知回顾与展望

焦李成, 杨淑媛, 刘芳, 侯彪 - 电子学报, 2011 - ejournal.org.cn
压缩感知是建立在矩阵分析, 统计概率论, 拓扑几何, 优化与运筹学, 泛函分析等基础上的一种
全新的信息获取与处理的理论框架. 它基于信号的可压缩性, 通过低维空间, 低分辨率, 欠Nyquist …

[图书][B] An invitation to compressive sensing

S Foucart, H Rauhut, S Foucart, H Rauhut - 2013 - Springer
This first chapter formulates the objectives of compressive sensing. It introduces the
standard compressive problem studied throughout the book and reveals its ubiquity in many …

[HTML][HTML] Matrix factorization techniques in machine learning, signal processing, and statistics

KL Du, MNS Swamy, ZQ Wang, WH Mow - Mathematics, 2023 - mdpi.com
Compressed sensing is an alternative to Shannon/Nyquist sampling for acquiring sparse or
compressible signals. Sparse coding represents a signal as a sparse linear combination of …

Sparse methods for direction-of-arrival estimation

Z Yang, J Li, P Stoica, L Xie - Academic Press Library in Signal Processing …, 2018 - Elsevier
Abstract Direction-of-arrival (DOA) estimation refers to the process of retrieving the direction
information of several electromagnetic waves/sources from the outputs of a number of …

Orthogonal matching pursuit for sparse signal recovery with noise

TT Cai, L Wang - IEEE Transactions on Information theory, 2011 - ieeexplore.ieee.org
We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-
dimensional sparse signal based on a small number of noisy linear measurements. OMP is …

A probabilistic and RIPless theory of compressed sensing

EJ Candes, Y Plan - IEEE transactions on information theory, 2011 - ieeexplore.ieee.org
This paper introduces a simple and very general theory of compressive sensing. In this
theory, the sensing mechanism simply selects sensing vectors independently at random …

The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing

AM Tillmann, ME Pfetsch - IEEE Transactions on Information …, 2013 - ieeexplore.ieee.org
This paper deals with the computational complexity of conditions which guarantee that the
NP-hard problem of finding the sparsest solution to an underdetermined linear system can …

Analysis of orthogonal matching pursuit using the restricted isometry property

MA Davenport, MB Wakin - IEEE Transactions on Information …, 2010 - ieeexplore.ieee.org
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse
approximation. In this paper we demonstrate that the restricted isometry property (RIP) can …

Sparse representation of a polytope and recovery of sparse signals and low-rank matrices

TT Cai, A Zhang - IEEE transactions on information theory, 2013 - ieeexplore.ieee.org
This paper considers compressed sensing and affine rank minimization in both noiseless
and noisy cases and establishes sharp restricted isometry conditions for sparse signal and …

A user's guide to compressed sensing for communications systems

K Hayashi, M Nagahara, T Tanaka - IEICE transactions on …, 2013 - search.ieice.org
This survey provides a brief introduction to compressed sensing as well as several major
algorithms to solve it and its various applications to communications systems. We firstly …