English
Related papers

Related papers: High-resolution distributed sampling of bandlimite…

200 papers

We propose a distributed algorithm for sparse signal recovery in sensor networks based on Iterative Hard Thresholding (IHT). Every agent has a set of measurements of a signal x, and the objective is for the agents to recover x from their…

Information Theory · Computer Science 2013-02-22 Stacy Patterson , Yonina C. Eldar , Idit Keidar

Sampling theory encompasses all aspects related to the conversion of continuous-time signals to discrete streams of numbers. The famous Shannon-Nyquist theorem has become a landmark in the development of digital signal processing. In modern…

Information Theory · Computer Science 2015-03-19 Moshe Mishali , Yonina C. Eldar

In this paper, we consider compressive sensing (CS)-based recovery of delays and Doppler frequencies of targets in high resolution radars. We propose a novel sub-Nyquist sampling method in the Fourier domain based on difference sets (DS),…

Information Theory · Computer Science 2018-11-02 Iman Taghavi , Mohamad F. Sabahi , Farzad Parvaresh , Mohsen Mivehchy

We study sparse linear regression over a network of agents, modeled as an undirected graph (with no centralized node). The estimation problem is formulated as the minimization of the sum of the local LASSO loss functions plus a quadratic…

Machine Learning · Computer Science 2023-06-23 Yao Ji , Gesualdo Scutari , Ying Sun , Harsha Honnappa

It is of particular interest to reconstruct or estimate bandlimited graph signals, which are smoothly varying signals defined over graphs, from partial noisy measurements. However, choosing an optimal subset of nodes to sample is NP-hard.…

Signal Processing · Electrical Eng. & Systems 2017-11-21 Xuan Xie , Hui Feng , Junlian Jia , Bo Hu

This paper deals with the problem of reconstructing a band-limited signal when a finite subset of its samples and of its derivative are missing. The technique used, due to P.J.S.G. Ferreira, is based on the use of a particular frame for…

Functional Analysis · Mathematics 2010-09-13 Paola Brianzi , Vincenza Del Prete

We consider deterministic distributed communication in wireless ad hoc networks of identical weak devices under the SINR model without predefined infrastructure. Most algorithmic results in this model rely on various additional features or…

Data Structures and Algorithms · Computer Science 2018-01-15 Tomasz Jurdzinski , Dariusz R. Kowalski , Michal Rozanski , Grzegorz Stachowiak

We study the following one-way asymmetric transmission problem, also a variant of model-based compressed sensing: a resource-limited encoder has to report a small set $S$ from a universe of $N$ items to a more powerful decoder (server). The…

Data Structures and Algorithms · Computer Science 2018-07-30 Alexandr Andoni , Javad Ghaderi , Daniel Hsu , Dan Rubenstein , Omri Weinstein

We study the problem of sampling a random signal with sparse support in frequency domain. Shannon famously considered a scheme that instantaneously samples the signal at equispaced times. He proved that the signal can be reconstructed as…

Information Theory · Computer Science 2012-11-22 Adel Javanmard , Andrea Montanari

This paper is concerned with the state estimation problem for two-dimensional systems with asynchronous multichannel delays and energy harvesting constraints. In the system, each smart sensor has a certain probability of harvesting energy…

Systems and Control · Electrical Eng. & Systems 2024-05-15 Yu Chen , Wei Wang

The reconstruction of a deterministic data field from binary-quantized noisy observations of sensors which are randomly deployed over the field domain is studied. The study focuses on the extremes of lack of deterministic control in the…

Information Theory · Computer Science 2007-12-13 Ye Wang , Prakash Ishwar

Distributed optimization plays an important role in modern large-scale machine learning and data processing systems by optimizing the utilization of computational resources. One of the classical and popular approaches is Local Stochastic…

Optimization and Control · Mathematics 2024-12-19 Andrey Sadchikov , Savelii Chezhegov , Aleksandr Beznosikov , Alexander Gasnikov

This paper investigates the information rate loss in analog channels when the sampler is designed to operate independent of the instantaneous channel occupancy. Specifically, a multiband linear time-invariant Gaussian channel under…

Information Theory · Computer Science 2017-03-14 Yuxin Chen , Andrea Goldsmith , Yonina C. Eldar

Efficient estimation of wideband spectrum is of great importance for applications such as cognitive radio. Recently, sub-Nyquist sampling schemes based on compressed sensing have been proposed to greatly reduce the sampling rate. However,…

Signal Processing · Electrical Eng. & Systems 2018-05-23 Haoyu Fu , Yuejie Chi

Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…

Information Theory · Computer Science 2024-03-01 Deheng Yuan , Tao Guo , Zhongyi Huang , Shi Jin

Single image superresolution has been a popular research topic in the last two decades and has recently received a new wave of interest due to deep neural networks. In this paper, we approach this problem from a different perspective. With…

Computer Vision and Pattern Recognition · Computer Science 2018-10-03 Weifeng Ge , Bingchen Gong , Yizhou Yu

For systems and devices, such as cognitive radio and networks, that need to be aware of available frequency bands, spectrum sensing has an important role. A major challenge in this area is the requirement of a high sampling rate in the…

Information Theory · Computer Science 2014-08-21 M. R. Avendi , K. Haghighi , A. Panahi , M. Viberg

We investigate the problem of a monostatic pulse-Doppler radar transceiver trying to detect targets, sparsely populated in the radar's unambiguous time-frequency region. Several past works employ compressed sensing (CS) algorithms to this…

Information Theory · Computer Science 2013-09-24 Omer Bar-Ilan , Yonina C. Eldar

We study the maximum $k$-set coverage problem in the following distributed setting. A collection of sets $S_1,\ldots,S_m$ over a universe $[n]$ is partitioned across $p$ machines and the goal is to find $k$ sets whose union covers the most…

Data Structures and Algorithms · Computer Science 2018-08-24 Sepehr Assadi , Sanjeev Khanna

Our work focuses on addressing sample deficiency from low-density regions of data manifold in common image datasets. We leverage diffusion process based generative models to synthesize novel images from low-density regions. We observe that…

Computer Vision and Pattern Recognition · Computer Science 2022-06-28 Vikash Sehwag , Caner Hazirbas , Albert Gordo , Firat Ozgenel , Cristian Canton Ferrer