English
Related papers

Related papers: Orthogonal Matching Pursuit based Reconstruction f…

200 papers

Spike and slab priors play a key role in inducing sparsity for sparse signal recovery. The use of such priors results in hard non-convex and mixed integer programming problems. Most of the existing algorithms to solve the optimization…

Methodology · Statistics 2019-04-02 Fekadu L. Bayisa , Zhiyong Zhou , Ottmar Cronie , Jun Yu

Phase retrieval aims at recovering a complex-valued signal from magnitude-only measurements, which attracts much attention since it has numerous applications in many disciplines. However, phase recovery involves solving a system of…

Information Theory · Computer Science 2017-06-13 Wen-Jun Zeng , H. C. So

We study the problem of recovering the underlining sparse signals from clean or noisy phaseless measurements. Due to the sparse prior of signals, we adopt an L0regularized variational model to ensure only a small number of nonzero elements…

Optimization and Control · Mathematics 2016-12-09 Yuping Duan , Chunlin Wu , Zhi-Feng Pang , Huibin Chang

This paper proposes a compressed sensing-based high-resolution direction-of-arrival estimation method called gradient orthogonal matching pursuit (GOMP). It contains two main steps: a sparse coding approximation step using the well-known…

Signal Processing · Electrical Eng. & Systems 2021-10-08 Khaled Ardah , Martin Haardt

Orthogonal matching pursuit (OMP) is a canonical greedy algorithm for sparse signal reconstruction. When the signal of interest is block sparse, i.e., it has nonzero coefficients occurring in clusters, the block version of OMP algorithm…

Information Theory · Computer Science 2011-04-07 Jun Wang , Gang Li , Hao Zhang , Xiqin Wang

A novel sparse array synthesis method for non-uniform planar arrays is proposed, which belongs to compressive sensing (CS)-based systhesis. Particularly, we propose an off-grid refinement technique to simultaneously optimize the antenna…

Signal Processing · Electrical Eng. & Systems 2022-07-29 Songjie Yang , Baojuan Liu , Zhiqin Hong , Zhongpei Zhang

Sparse signals (i.e., vectors with a small number of non-zero entries) build the foundation of most kernel (or nullspace) results, uncertainty relations, and recovery guarantees in the sparse signal processing and compressive sensing…

Information Theory · Computer Science 2015-07-13 Christoph Studer

Visible light communications (VLC) have recently attracted a growing interest and can be a potential solution to realize indoor wireless communication with high bandwidth capacity for RF-restricted environments such as airplanes and…

Information Theory · Computer Science 2016-11-18 Bilal A. Ranjha , Mohammadreza A. Kashani , Mohsen Kavehrad , Peng Deng

Periodic nonuniform sampling is a known method to sample spectrally sparse signals below the Nyquist rate. This strategy relies on the implicit assumption that the individual samplers are exposed to the entire frequency range. This…

Information Theory · Computer Science 2009-01-27 Moshe Mishali , Yonina C. Eldar , Joel A. Tropp

In this paper, we propose an adaptive step size strategy for a class of line search methods for orthogonality constrained minimization problems, which avoids the classic backtracking procedure. We prove the convergence of the line search…

Optimization and Control · Mathematics 2020-02-21 Xiaoying Dai , Liwei Zhang , Aihui Zhou

Signal recovery from nonlinear measurements involves solving an iterative optimization problem. In this paper, we present a framework to optimize the sensing parameters to improve the quality of the signal recovered by the given iterative…

Image and Video Processing · Electrical Eng. & Systems 2020-06-09 Zikui Cai , Rakib Hyder , M. Salman Asif

In this paper, we study the missing sample recovery problem using methods based on sparse approximation. In this regard, we investigate the algorithms used for solving the inverse problem associated with the restoration of missed samples of…

Machine Learning · Statistics 2017-06-29 Amirhossein Javaheri , Hadi Zayyani , Farokh Marvasti

Analog circuit design can be considered as an optimization problem with the targeted circuit specifications as constraints. When stringent circuit specifications are considered, it is desired to have an optimization methodology that adapts…

Neural and Evolutionary Computing · Computer Science 2024-12-24 Ria Rashid , Abhishek Gupta

A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover a k-sparse n-dimensional real vector from 4 k log(n) noise-free linear measurements obtained through a random Gaussian measurement matrix…

Information Theory · Computer Science 2015-05-28 Alyson K. Fletcher , Sundeep Rangan

We shall show that if the restricted isometry constant (RIC) $\delta_{s+1}(A)$ of the measurement matrix $A$ satisfies $$ \delta_{s+1}(A) < \frac{1}{\sqrt{s + 1}}, $$ then the greedy algorithm Orthogonal Matching Pursuit(OMP) will succeed.…

Information Theory · Computer Science 2015-01-09 Qun Mo

A new pattern search method for bound constrained optimization is introduced. The proposed algorithm employs the coordinate directions, in a suitable way, with a nonmonotone line search for accepting the new iterate, without using…

Optimization and Control · Mathematics 2018-06-25 Johanna A. Frau , Elvio A. Pilotta

In this work, we investigate an efficient numerical approach for solving higher order statistical methods for blind and semi-blind signal recovery from non-ideal channels. We develop numerical algorithms based on convex optimization…

Information Theory · Computer Science 2016-11-17 Huy-Dung Han , Zhi Ding , Muhammad Zia

We present two modulation and detection techniques that are designed to allow for efficient equalization for channels that exhibit an arbitrary Doppler spread but no delay spread. These techniques are based on principles similar to…

Signal Processing · Electrical Eng. & Systems 2020-01-08 Thomas Dean , Mainak Chowdhury , Nicole Grimwood , Andrea Goldsmith

In this paper, we present new results on using orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries for complex cases (i.e., complex measurement vector, complex dictionary and complex…

Information Theory · Computer Science 2012-06-12 Rong Fan , Qun Wan , Yipeng Liu , Hui Chen , Xiao Zhang

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