English
Related papers

Related papers: OMP Based Joint Sparsity Pattern Recovery Under Co…

200 papers

To strike a balance between energy efficiency and data quality control, this paper proposes a sensor censoring scheme for distributed sparse signal recovery via compressive-sensing based wireless sensor networks. In the proposed approach,…

Information Theory · Computer Science 2018-01-16 Jwo-Yuh Wu , Ming-Hsun Yang , Tsang-Yi Wang

We address the communication overhead of distributed sparse matrix-(multiple)-vector multiplication in the context of large-scale eigensolvers, using filter diagonalization as an example. The basis of our study is a performance model which…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-27 Andreas Alvermann , Georg Hager , Holger Fehske

We consider the problem of sparse normal means estimation in a distributed setting with communication constraints. We assume there are $M$ machines, each holding $d$-dimensional observations of a $K$-sparse vector $\mu$ corrupted by…

Machine Learning · Statistics 2022-02-15 Chen Amiraz , Robert Krauthgamer , Boaz Nadler

We study the support recovery problem for compressed sensing, where the goal is to reconstruct the a high-dimensional $K$-sparse signal $\mathbf{x}\in\mathbb{R}^N$, from low-dimensional linear measurements with and without noise. Our key…

Information Theory · Computer Science 2018-02-27 Xiao Li , Dong Yin , Sameer Pawar , Ramtin Pedarsani , Kannan Ramchandran

We consider a collection of independent random variables that are identically distributed, except for a small subset which follows a different, anomalous distribution. We study the problem of detecting which random variables in the…

Information Theory · Computer Science 2018-06-21 Natalie Durgin , Rachel Grotheer , Chenxi Huang , Shuang Li , Anna Ma , Deanna Needell , Jing Qin

We present improved sampling complexity bounds for stable and robust sparse recovery in compressed sensing. Our unified analysis based on l1 minimization encompasses the case where (i) the measurements are block-structured samples in order…

Information Theory · Computer Science 2020-05-22 Ben Adcock , Claire Boyer , Simone Brugiapaglia

Greedy algorithms for minimizing L0-norm of sparse decomposition have profound application impact on many signal processing problems. In the sparse coding setup, given the observations $\mathrm{y}$ and the redundant dictionary…

Numerical Analysis · Computer Science 2015-02-13 Yuanyi Xue , Yao Wang

Cross-correlation is a popular signal processing technique used in numerous location tracking systems for obtaining reliable range information. However, its efficient design and practical implementation has not yet been achieved on mote…

Other Computer Science · Computer Science 2016-06-14 Prasant Misra , Wen Hu , Mingrui Yang , Marco Duarte , Sanjay Jha

Real-world applications such as magnetic resonance imaging with multiple coils, multi-user communication, and diffuse optical tomography often assume a linear model where several sparse signals sharing common sparse supports are acquired by…

Information Theory · Computer Science 2018-10-17 Junan Zhu , Dror Baron

With the introduction of spectrum sharing and heterogeneous services in next-generation networks, the base stations need to sense the wideband spectrum and identify the spectrum resources to meet the quality-of-service, bandwidth, and…

Signal Processing · Electrical Eng. & Systems 2022-09-07 Rohith Rajesh , Sumit J. Darak , Akshay Jain , Shivam Chandhok , Animesh Sharma

We consider the joint estimation of multipath channels obtained with a set of receiving antennas and uniformly probed in the frequency domain. This scenario fits most of the modern outdoor communication protocols for mobile access or…

Systems and Control · Computer Science 2012-04-23 Y. Barbotin , M. Vetterli

Integrated sensing and communication (ISAC) is widely recognized as a pivotal enabling technique for the advancement of future wireless networks. This paper aims to efficiently exploit the inherent sparsity of echo signals for the…

Information Theory · Computer Science 2024-01-01 Zichao Xiao , Rang Liu , Ming Li , Wei Wang , Qian Liu

This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. Numerous renowned algorithms for tackling the compressed sensing problem…

Information Theory · Computer Science 2026-03-11 Xu Zhu , Yufei Ma , Xiaoguang Li , Tiejun Li

This work establishes the design, analysis, and fine-tuning of a Peak-to-Average-Power-Ratio (PAPR) reducing system, based on compressed sensing at the receiver of a peak-reducing sparse clipper applied to an OFDM signal at the transmitter.…

Information Theory · Computer Science 2015-05-27 Ebrahim B. Al-Safadi , Tareq Y. Al-Naffouri

Several problems in imaging acquire multiple measurement vectors (MMVs) of Fourier samples for the same underlying scene. Image recovery techniques from MMVs aim to exploit the joint sparsity across the measurements in the sparse domain.…

Numerical Analysis · Mathematics 2019-10-21 Theresa Scarnati , Anne Gelb

This paper considers the massive connectivity application in which a large number of potential devices communicate with a base-station (BS) in a sporadic fashion. The detection of device activity pattern together with the estimation of the…

Information Theory · Computer Science 2018-03-14 Zhilin Chen , Foad Sohrabi , Wei Yu

The problem of recovering signals of high complexity from low quality sensing devices is analyzed via a combination of tools from signal processing and harmonic analysis. By using the rich structure offered by the recent development in…

Information Theory · Computer Science 2020-03-16 Roza Aceska , Jean-Luc Bouchot , Shidong Li

Given an overcomplete dictionary $A$ and a signal $b$ that is a linear combination of a few linearly independent columns of $A$, classical sparse recovery theory deals with the problem of recovering the unique sparse representation $x$ such…

Machine Learning · Statistics 2015-07-07 C. You , R. Vidal

This paper demonstrates that if the restricted isometry constant $\delta_{K+1}$ of the measurement matrix $A$ satisfies $$ \delta_{K+1} < \frac{1}{\sqrt{K}+1}, $$ then a greedy algorithm called Orthogonal Matching Pursuit (OMP) can recover…

Information Theory · Computer Science 2012-01-16 Qun Mo , Yi Shen

Recently, there has been a significant interest in developing cooperative sensing systems for certain types of wireless applications. In such systems, a group of sensing nodes periodically collect measurements about the signals being…

Information Theory · Computer Science 2015-06-11 Harish Ganapathy , Constantine Caramanis , Lei Ying
‹ Prev 1 8 9 10 Next ›