English
Related papers

Related papers: Novel Algorithm for Sparse Solutions to Linear Inv…

200 papers

We address the problem of recovering a sparse signal from clipped or quantized measurements. We show how these two problems can be formulated as minimizing the distance to a convex feasibility set, which provides a convex and differentiable…

Signal Processing · Electrical Eng. & Systems 2018-12-05 Lucas Rencker , Francis Bach , Wenwu Wang , Mark D. Plumbley

Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common methods the signal is recovered in the sparse domain. A method for the reconstruction of sparse signal which reconstructs the…

Information Theory · Computer Science 2015-04-28 Ljubisa Stankovic , Milos Dakovic

In this paper, we consider the problem of recovering an unknown sparse matrix X from the matrix sketch Y = AX B^T. The dimension of Y is less than that of X, and A and B are known matrices. This problem can be solved using standard…

Numerical Analysis · Computer Science 2013-11-12 Thakshila Wimalajeewa , Yonina C. Eldar , Pramod K. Varshney

In this paper, utilizing techniques in compressed sensing, parallel optimization and deep learning, we propose a model-driven approach to jointly design the common measurement matrix and GROUP LASSO-based jointly sparse signal recovery…

Information Theory · Computer Science 2020-02-10 Shuaichao Li , Wanqing Zhang , Ying Cui

A compressed sensing method consists of a rectangular measurement matrix, $M \in \mathbbm{R}^{m \times N}$ with $m \ll N$, together with an associated recovery algorithm, $\mathcal{A}: \mathbbm{R}^m \rightarrow \mathbbm{R}^N$. Compressed…

Information Theory · Computer Science 2013-02-26 M. A. Iwen

In the Multiple Measurements Vector (MMV) model, measurement vectors are connected to unknown, jointly sparse signal vectors through a linear regression model employing a single known measurement matrix (or dictionary). Typically, the…

Methodology · Statistics 2024-08-05 Esa Ollila

In this work, we provide non-asymptotic, probabilistic guarantees for successful recovery of the common nonzero support of jointly sparse Gaussian sources in the multiple measurement vector (MMV) problem. The support recovery problem is…

Information Theory · Computer Science 2021-07-27 Saurabh Khanna , Chandra R. Murthy

We consider the \textit{phase retrieval} problem of recovering a sparse signal $\mathbf{x}$ in $\mathbb{R}^d$ from intensity-only measurements in dimension $d \geq 2$. Phase retrieval can be equivalently formulated as the problem of…

Combinatorics · Mathematics 2021-09-01 Alexei Novikov , Stephen White

As an extension of orthogonal matching pursuit (OMP) improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm…

Information Theory · Computer Science 2015-06-15 Jian Wang , Suhyuk Kwon , Ping Li , Byonghyo Shim

Matrix recovery from sparse observations is an extensively studied topic emerging in various applications, such as recommendation system and signal processing, which includes the matrix completion and compressed sensing models as special…

Methodology · Statistics 2026-04-13 Ziyuan Chen , Ying Yang , Fang Yao

This paper provides a sparse signal recovery algorithm, DU-PSISTA (Deep Unfolded-Periodic Sketched Iterative Shrinkage-Thresholding Algorithm), which aims to balance computational efficiency and accuracy for recovering high-dimensional…

Signal Processing · Electrical Eng. & Systems 2026-04-23 Tatsuki Tokumura , Ayano Nakai-Kasai , Tadashi Wadayama

Sparse signal recovery based on nonconvex and nonsmooth optimization problems has significant applications and demonstrates superior performance in signal processing and machine learning. This work deals with a scale-invariant…

Optimization and Control · Mathematics 2025-09-29 Lang Yu , Nanjing Huang

Iterative algorithms based on thresholding, feedback and null space tuning (NST+HT+FB) for sparse signal recovery are exceedingly effective and fast, particularly for large scale problems. The core algorithm is shown to converge in finitely…

Numerical Analysis · Mathematics 2017-11-08 Ningning Han , Shidong Li , Zhanjie Song , Hong Wang

This paper considers the problem of reconstructing sparse or compressible signals from one-bit quantized measurements. We study a new method that uses a log-sum penalty function, also referred to as the Gaussian entropy, for sparse signal…

Information Theory · Computer Science 2012-10-17 Jun Fang , Yanning Shen , Hongbin Li

In this paper, we consider the challenge of reconstructing jointly sparse vectors from linear measurements. Firstly, we show that by utilizing the rank of the output data matrix we can reduce the problem to a full column rank case. This…

Numerical Analysis · Mathematics 2019-05-28 Armenak Petrosyan , Hoang Tran , Clayton Webster

In many practical applications such as direction-of-arrival (DOA) estimation and line spectral estimation, the sparsifying dictionary is usually characterized by a set of unknown parameters in a continuous domain. To apply the conventional…

Information Theory · Computer Science 2015-06-18 Jun Fang , Jing Li , Yanning Shen , Hongbin Li , Shaoqian Li

In this paper, we consider orthogonal matching pursuit (OMP) algorithm for multiple measurement vectors (MMV) problem. The robustness of OMPMMV is studied under general perturbations---when the measurement vectors as well as the sensing…

Information Theory · Computer Science 2011-09-30 Jie Ding , Laming Chen , Yuantao Gu

Joint sparsity has attracted considerable attention in recent years in many fields including sparse signal recovery in compressed sensing (CS), statistics, and machine learning. Traditional convex models suffer from the suboptimal…

Numerical Analysis · Computer Science 2017-06-27 Yaru Fan , Yilun Wang , Tingzhu Huang

In this paper, we introduce a sparse approximation property of order $s$ for a measurement matrix ${\bf A}$: $$\|{\bf x}_s\|_2\le D \|{\bf A}{\bf x}\|_2+ \beta \frac{\sigma_s({\bf x})}{\sqrt{s}} \quad {\rm for\ all} \ {\bf x},$$ where ${\bf…

Information Theory · Computer Science 2015-05-28 Qiyu Sun

We propose a robust and efficient approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on…

Information Theory · Computer Science 2015-10-28 Sohail Bahmani , Justin Romberg