English
Related papers

Related papers: Low-complexity Sparse Array Synthesis Based on Off…

200 papers

With the increasing popularity of large-scale antenna arrays, the subarraying technology becomes more attractive. In this paper, we propose two effective subarraying methods right after formulating the subarray synthesis as a compressive…

Signal Processing · Electrical Eng. & Systems 2022-01-03 Songjie Yang , Wanting Lyu , Zhongpei Zhang

Compressed sensing (CS) schemes are proposed for monostatic as well as synthetic aperture radar (SAR) imaging with chirped signals and Ultra-Narrowband (UNB) continuous waveforms. In particular, a simple, perturbation method is developed to…

Data Analysis, Statistics and Probability · Physics 2015-06-11 Albert Fannjiang , Hsiao-Chieh Tseng

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 widely used compressive sensing (CS) algorithm for recovering sparse signals in noisy linear regression models. The performance of OMP depends on its stopping criteria (SC). SC for OMP discussed in…

Machine Learning · Statistics 2017-03-16 Sreejith Kallummil , Sheetal Kalyani

The Orthogonal Matching Pursuit (OMP) for compressed sensing iterates over a scheme of support augmentation and signal estimation. We present two novel matching pursuit algorithms with intrinsic regularization of the signal estimation step…

Information Theory · Computer Science 2019-02-22 Robert Seidel

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

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

Sampling rate is the bottleneck for spectrum sensing over multi-GHz bandwidth. Recent progress in compressed sensing (CS) initialized several sub-Nyquist rate approaches to overcome the problem. However, efforts to design CS reconstruction…

Information Theory · Computer Science 2011-02-15 Peng Zhang , Robert Qiu

Recently, many practical algorithms have been proposed to recover the sparse signal from fewer measurements. Orthogonal matching pursuit (OMP) is one of the most effective algorithm. In this paper, we use the restricted isometry property to…

Functional Analysis · Mathematics 2011-06-01 Yi Shen , Song Li

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

The aim of antenna array synthesis is to achieve a desired radiation pattern with the minimum number of antenna elements. In this paper the antenna synthesis problem is studied from a totally new perspective. One of the key principles of…

Information Theory · Computer Science 2008-11-06 Lianlin Li , wenji zhang , Fang Li

Orthogonal Matching Pursuit (OMP) has been a powerful method in sparse signal recovery and approximation. However, OMP suffers computational issues when the signal has a large number of non-zeros. This paper advances OMP and its extension…

Computer Vision and Pattern Recognition · Computer Science 2025-04-28 Huiyuan Yu , Jia He , Maggie Cheng

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

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

Orthogonal Matching Pursuit (OMP) plays an important role in data science and its applications such as sparse subspace clustering and image processing. However, the existing OMP-based approaches lack of data adaptiveness so that the data…

Machine Learning · Computer Science 2019-09-02 Jiaqiyu Zhan , Zhiqiang Bai , Yuesheng Zhu

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

Direction of Arrival (DOA) estimation of multiple narrow-band coherent or partially coherent sources is a major challenge in array signal processing. Though many subspace- based algorithms are available in literature, none of them tackle…

Information Theory · Computer Science 2018-01-26 Abhishek Aich , P. Palanisamy

In the area of near-field millimeter-wave imaging, the generalized sparse array synthesis (SAS) method is in great demand. The traditional methods usually employ the greedy algorithms, which may have the convergence problem. This paper…

Signal Processing · Electrical Eng. & Systems 2022-08-10 Shuoguang Wang , Shiyong Li , Ahmad Hoorfar , Ke Miao , Guoqiang Zhao , Houjun Sun

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

Compressive sensing (CS) can effectively recover a signal when it is sparse in some discrete atoms. However, in some applications, signals are sparse in a continuous parameter space, e.g., frequency space, rather than discrete atoms.…

Signal Processing · Electrical Eng. & Systems 2018-08-30 Tianyao Huang , Yimin Liu , Huadong Meng , Xiqin Wang
‹ Prev 1 2 3 10 Next ›