English
Related papers

Related papers: Compressive Radar with Off-Grid Targets: A Perturb…

200 papers

We propose a new technique for adaptive identification of sparse systems based on the compressed sensing (CS) theory. We manipulate the transmitted pilot (input signal) and the received signal such that the weights of adaptive filter…

Information Theory · Computer Science 2012-04-05 Seyed Hossein Hosseini , Mahrokh G. Shayesteh

Compressive sensing (CS) technologies present many advantages over other existing approaches for implementing wideband spectrum sensing in cognitive radios (CRs), such as reduced sampling rate and computational complexity. However, there…

Information Theory · Computer Science 2016-07-15 Jing Jiang , Hongjian Sun , David Baglee , H. Vincent Poor

We study the compressed sensing (CS) signal estimation problem where an input signal is measured via a linear matrix multiplication under additive noise. While this setup usually assumes sparsity or compressibility in the input signal…

Information Theory · Computer Science 2014-12-23 Junan Zhu , Dror Baron , Marco F. Duarte

Compressed Sensing (CS) seeks to recover an unknown vector with $N$ entries by making far fewer than $N$ measurements; it posits that the number of compressed sensing measurements should be comparable to the information content of the…

Information Theory · Computer Science 2010-04-29 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner

Motivated by the question of optimal functional approximation via compressed sensing, we propose generalizations of the Iterative Hard Thresholding and the Compressive Sampling Matching Pursuit algorithms able to promote sparse in levels…

Information Theory · Computer Science 2021-11-01 Ben Adcock , Simone Brugiapaglia , Matthew King-Roskamp

In this paper, we consider the problem of sparse signal detection based on partial support set estimation with compressive measurements in a distributed network. Multiple nodes in the network are assumed to observe sparse signals which…

Applications · Statistics 2016-08-10 Thakshila Wimalajeewa , Pramod K. Varshney

Compressive sensing (CS) is a new technology which allows the acquisition of signals directly in compressed form, using far fewer measurements than traditional theory dictates. Recently, many so-called signal space methods have been…

Numerical Analysis · Mathematics 2015-11-13 Xiaoyi Gu , Deanna Needell , Shenyinying Tu

We study the reconstruction of discrete-valued sparse signals from underdetermined systems of linear equations. On the one hand, classical compressed sensing (CS) is designed to deal with real-valued sparse signals. On the other hand,…

Information Theory · Computer Science 2013-10-10 Susanne Sparrer , Robert F. H. Fischer

A novel probabilistic sparsity-promoting method for robust near-field (NF) antenna characterization is proposed. It leverages on the measurements-by-design (MebD) paradigm and it exploits some a-priori information on the antenna under test…

Information Theory · Computer Science 2022-10-26 Marco Salucci , Nicola Anselmi , Marco Donald Migliore , Andrea Massa

Massive MIMO is a promising technique for future 5G communications due to its high spectrum and energy efficiency. To realize its potential performance gain, accurate channel estimation is essential. However, due to massive number of…

Information Theory · Computer Science 2016-11-17 Zhen Gao , Linglong Dai , Wei Dai , Byonghyo Shim , Zhaocheng Wang

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

We discuss a method for sparse signal approximation, which is based on the correlation of the target signal with a pseudo-random signal, and uses a modification of the greedy matching pursuit algorithm. We show that this approach provides…

Data Analysis, Statistics and Probability · Physics 2011-05-26 M. Andrecut

In this paper, we propose a compressed sensing (CS) framework that consists of three parts: a unit-norm tight frame (UTF), a random diagonal matrix and a column-wise orthonormal matrix. We prove that this structure satisfies the restricted…

Information Theory · Computer Science 2015-06-23 Peng Zhang , Lu Gan , Sumei Sun , Cong Ling

This paper deals with the design of a sensing matrix along with a sparse recovery algorithm by utilizing the probability-based prior information for compressed sensing system. With the knowledge of the probability for each atom of the…

Machine Learning · Computer Science 2019-10-29 Q. Jiang , S. Li , Z. Zhu , H. Bai , X. He , R. C. de Lamare

Compressed sensing (CS) is an emerging field that has attracted considerable research interest over the past few years. Previous review articles in CS limit their scope to standard discrete-to-discrete measurement architectures using…

Information Theory · Computer Science 2011-07-29 Marco F. Duarte , Yonina C. Eldar

Image-based anomaly detection systems are of vital importance in various manufacturing applications. The resolution and acquisition rate of such systems is increasing significantly in recent years under the fast development of image sensing…

Image and Video Processing · Electrical Eng. & Systems 2022-07-19 Shancong Mou , Jianjun Shi

Wideband wireless channel is a time dispersive channel and becomes strongly frequency-selective. However, in most cases, the channel is composed of a few dominant taps and a large part of taps is approximately zero or zero. To exploit the…

Information Theory · Computer Science 2010-05-14 Guan Gui , Qun Wan , Wei Peng , Fumiyuki Adachi

Compressive sensing aims to recover a high-dimensional sparse signal from a relatively small number of measurements. In this paper, a novel design of the measurement matrix is proposed. The design is inspired by the construction of…

Information Theory · Computer Science 2016-03-22 Xu Chen , Dongning Guo

A method to improve l1 performance of the CS (Compressive Sampling) for A-scan SFCW-GPR (Stepped Frequency Continuous Wave-Ground Penetrating Radar) signals with known spectral energy density is proposed. Instead of random sampling, the…

Information Theory · Computer Science 2013-11-05 Andriyan Bayu Suksmono

In compressive sensing, the basis pursuit algorithm aims to find the sparsest solution to an underdetermined linear equation system. In this paper, we generalize basis pursuit to finding the sparsest solution to higher order nonlinear…

Information Theory · Computer Science 2013-04-23 Henrik Ohlsson , Allen Y. Yang , Roy Dong , S. Shankar Sastry
‹ Prev 1 3 4 5 6 7 10 Next ›