English
Related papers

Related papers: Signal Recovery in Uncorrelated and Correlated Dic…

200 papers

We study the problem of recovering sparse signals from compressed linear measurements. This problem, often referred to as sparse recovery or sparse reconstruction, has generated a great deal of interest in recent years. To recover the…

Methodology · Statistics 2016-01-01 Jian Wang , Ping Li

Orthogonal least square (OLS) is an important sparse signal recovery algorithm for compressive sensing, which enjoys superior probability of success over other well-known recovery algorithms under conditions of correlated measurement…

Information Theory · Computer Science 2018-08-02 Samrat Mukhopadhyay , Siddhartha Satpathi , Mrityunjoy Chakraborty

We consider the Orthogonal Least-Squares (OLS) algorithm for the recovery of a $m$-dimensional $k$-sparse signal from a low number of noisy linear measurements. The Exact Recovery Condition (ERC) in bounded noisy scenario is established for…

Machine Learning · Statistics 2016-08-09 Abolfazl Hashemi , Haris Vikalo

In this paper, we study the orthogonal least squares (OLS) algorithm for sparse recovery. On the one hand, we show that if the sampling matrix $\mathbf{A}$ satisfies the restricted isometry property (RIP) of order $K + 1$ with isometry…

Information Theory · Computer Science 2017-10-11 Jinming Wen , Jian Wang , Qinyu Zhang

Orthogonal least squares (OLS) is a classic algorithm for sparse recovery, function approximation, and subset selection. In this paper, we analyze the performance guarantee of the OLS algorithm. Specifically, we show that OLS guarantees the…

Information Theory · Computer Science 2020-08-24 Junhan Kim , Jian Wang , Byonghyo Shim

Orthogonal matching pursuit (OMP) and orthogonal least squares (OLS) are widely used for sparse signal reconstruction in under-determined linear regression problems. The performance of these compressed sensing (CS) algorithms depends…

Machine Learning · Statistics 2017-07-28 Sreejith Kallummil , Sheetal Kalyani

Orthogonal least squares (OLS)-type algorithms are efficient in reconstructing sparse signals, which include the well-known OLS, multiple OLS (MOLS) and block OLS (BOLS). In this paper, we first investigate the noiseless exact recovery…

Signal Processing · Electrical Eng. & Systems 2022-10-13 L. Lu , W. Xu , Y. Wang , Z. Tian

Spare representation of signals has received significant attention in recent years. Based on these developments, a sparse representation-based classification (SRC) has been proposed for a variety of classification and related tasks,…

Computer Vision and Pattern Recognition · Computer Science 2016-07-19 Minshan Cui , Saurabh Prasad

We study the problem of inferring a sparse vector from random linear combinations of its components. We propose the Accelerated Orthogonal Least-Squares (AOLS) algorithm that improves performance of the well-known Orthogonal Least-Squares…

Machine Learning · Statistics 2018-04-17 Abolfazl Hashemi , Haris Vikalo

Tropp's analysis of Orthogonal Matching Pursuit (OMP) using the Exact Recovery Condition (ERC) is extended to a first exact recovery analysis of Orthogonal Least Squares (OLS). We show that when the ERC is met, OLS is guaranteed to exactly…

Computation · Statistics 2013-04-25 Charles Soussen , Rémi Gribonval , Jérôme Idier , Cédric Herzet

Support recovery of sparse signals from compressed linear measurements is a fundamental problem in compressed sensing (CS). In this paper, we study the orthogonal matching pursuit (OMP) algorithm for the recovery of support under noise. We…

Information Theory · Computer Science 2015-10-28 Jian Wang

Orthogonal matching pursuit (OMP) is a greedy algorithm popularly being used for the recovery of sparse signals. In this paper, we study the performance of OMP for support recovery of sparse signal under noise. Our analysis shows that under…

Information Theory · Computer Science 2020-12-14 Hengkuan Lu , Jian Wang

Sparse linear regression, which entails finding a sparse solution to an underdetermined system of linear equations, can formally be expressed as an $l_0$-constrained least-squares problem. The Orthogonal Least-Squares (OLS) algorithm…

Machine Learning · Statistics 2016-08-01 Abolfazl Hashemi , Haris Vikalo

Orthogonal matching pursuit~(OMP) is a commonly used greedy algorithm for recovering sparse signals from compressed measurements. In this paper, we introduce a variant of the OMP algorithm to reduce the complexity of reconstructing a class…

Signal Processing · Electrical Eng. & Systems 2025-11-25 Xinwei Zhao , Jinming Wen , Hongqi Yang , Xiao Ma

Orthogonal matching pursuit (OMP) is a widely used greedy algorithm for sparse signal recovery in compressed sensing (CS). Prior work on OMP, however, has only provided reconstruction guarantees under the assumption that the columns of the…

Signal Processing · Electrical Eng. & Systems 2023-03-03 Hamed Masoumi , Michel Verhaegen , Nitin Jonathan Myers

Orthogonal matching pursuit (OMP) is a greedy algorithm widely used for the recovery of sparse signals from compressed measurements. In this paper, we analyze the number of iterations required for the OMP algorithm to perform exact recovery…

Information Theory · Computer Science 2016-02-23 Jian Wang , Byonghyo Shim

Compressed sensing is a developing field aiming at reconstruction of sparse signals acquired in reduced dimensions, which make the recovery process under-determined. The required solution is the one with minimum $\ell_0$ norm due to…

Information Theory · Computer Science 2012-09-06 Nazim Burak Karahanoglu , Hakan Erdogan

As a greedy algorithm to recover sparse signals from compressed measurements, orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the OMP for pursuing…

Information Theory · Computer Science 2014-04-01 Jian Wang , Seokbeop Kwon , Byonghyo Shim

In this paper, we consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding…

Information Theory · Computer Science 2011-06-15 Prateek Jain , Ambuj Tewari , Inderjit S. Dhillon

Exact recovery of $K$-sparse signals $x \in \mathbb{R}^{n}$ from linear measurements $y=Ax$, where $A\in \mathbb{R}^{m\times n}$ is a sensing matrix, arises from many applications. The orthogonal matching pursuit (OMP) algorithm is widely…

Information Theory · Computer Science 2020-08-13 Jinming Wen , Rui Zhang , Wei Yu
‹ Prev 1 2 3 10 Next ›