English
Related papers

Related papers: Accelerated reconstruction of a compressively samp…

200 papers

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

Compressed sensing has shown that it is possible to reconstruct sparse high dimensional signals from few linear measurements. In many cases, the solution can be obtained by solving an L1-minimization problem, and this method is accurate…

Numerical Analysis · Mathematics 2009-04-27 Deanna Needell

In this paper, we consider a strongly convex finite-sum minimization problem over a decentralized network and propose a communication-efficient decentralized Newton's method for solving it. We first apply dynamic average consensus (DAC) so…

Optimization and Control · Mathematics 2022-10-04 Huikang Liu , Jiaojiao Zhang , Anthony Man-Cho So , Qing Ling

The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least l0-norm among all signals…

Information Theory · Computer Science 2013-02-07 Lixin Shen , Bruce W. Suter

What learning algorithms can be run directly on compressively-sensed data? In this work, we consider the question of accurately and efficiently computing low-rank matrix or tensor factorizations given data compressed via random projections.…

Machine Learning · Computer Science 2019-05-28 Vatsal Sharan , Kai Sheng Tai , Peter Bailis , Gregory Valiant

Due to excessive need for faster propagations of signals and necessity to reduce number of measurements and rapidly increase efficiency, new sensing theories have been proposed. Conventional sampling approaches that follow Shannon-Nyquist…

Signal Processing · Electrical Eng. & Systems 2019-02-21 Milan Resetar , Gojko Ratkovic , Svetlana Zecevic

Increasing the imaging speed is a central aim in photoacoustic tomography. This issue is especially important in the case of sequential scanning approaches as applied for most existing optical detection schemes. In this work we address this…

Numerical Analysis · Mathematics 2016-11-23 Markus Haltmeier , Thomas Berer , Sunghwan Moon , Peter Burgholzer

Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common methods the signal is recovered in the sparse domain. A method for the reconstruction of sparse signal which reconstructs the…

Information Theory · Computer Science 2015-04-28 Ljubisa Stankovic , Milos Dakovic

In oversampled adaptive sensing (OAS), noisy measurements are collected in multiple subframes. The sensing basis in each subframe is adapted according to some posterior information exploited from previous measurements. The framework is…

Information Theory · Computer Science 2019-12-11 Ali Bereyhi , Ralf R. Müller

In this paper, data-aided sensing as a cross-layer approach in Internet-of-Things (IoT) applications is studied, where multiple IoT nodes collect measurements and transmit them to an Access Point (AP). It is assumed that measurements have a…

Information Theory · Computer Science 2019-04-30 Jinho Choi

Recent results from compressive sampling (CS) have demonstrated that accurate reconstruction of sparse signals often requires far fewer samples than suggested by the classical Nyquist--Shannon sampling theorem. Typically, signal…

Fluid Dynamics · Physics 2014-04-24 Gudmundur F. Adalsteinsson , Nicholas K. -R. Kevlahan

Compressive sensing(CS) has drawn much attention in recent years due to its low sampling rate as well as high recovery accuracy. As an important procedure, reconstructing a sparse signal from few measurement data has been intensively…

Information Theory · Computer Science 2018-06-25 Yicong He , Fei Wang , Shiyuan Wang , Badong Chen

The problem of data-driven recursive computation of receding horizon LQR control through a randomized combination of online/current and historical/recorded data is considered. It is assumed that large amounts of historical input-output data…

Systems and Control · Electrical Eng. & Systems 2023-11-23 Vatsal Kedia , Sneha Susan George , Debraj Chakraborty

We consider reconstruction of an ambient signal in a compressed sensing (CS) setup where the ambient signal has a neural network based generative model. The generative model has a sparse-latent input and we refer to the generated ambient…

Machine Learning · Computer Science 2023-10-24 Antoine Honoré , Anubhab Ghosh , Saikat Chatterjee

Presented is a novel way to combine snapshot compressive imaging and lateral shearing interferometry in order to capture the spatio-spectral phase of an ultrashort laser pulse in a single shot. A deep unrolling algorithm is utilised for the…

Compressed sensing is triggering a major evolution in signal acquisition. It consists in sampling a sparse signal at low rate and later using computational power for its exact reconstruction, so that only the necessary information is…

Statistical Mechanics · Physics 2012-06-07 Florent Krzakala , Marc Mézard , François Sausset , Yifan Sun , Lenka Zdeborová

Recent research has shown that performance in signal processing tasks can often be significantly improved by using signal models based on sparse representations, where a signal is approximated using a small number of elements from a fixed…

Optimization and Control · Mathematics 2011-11-18 Adam S. Charles , Pierre Garrigues , Christopher J. Rozell

Compressed sensing is a signal processing scheme that reconstructs high-dimensional sparse signals from a limited number of observations. In recent years, various problems involving signals with a finite number of discrete values have been…

Statistical Mechanics · Physics 2024-08-20 Mikiya Doi , Masayuki Ohzeki

We consider a distributed learning setup where a sparse signal is estimated over a network. Our main interest is to save communication resource for information exchange over the network and reduce processing time. Each node of the network…

Machine Learning · Statistics 2018-04-03 Ahmed Zaki , Saikat Chatterjee , Partha P. Mitra , Lars K. Rasmussen

We present a smooth probabilistic reformulation of $\ell_0$ regularized regression that does not require Monte Carlo sampling and allows for the computation of exact gradients, facilitating rapid convergence to local optima of the best…

Machine Learning · Computer Science 2025-09-19 Lukas Silvester Barth , Paulo von Petersenn
‹ Prev 1 3 4 5 6 7 10 Next ›