English
Related papers

Related papers: Deterministic Compressed Sensing Matrices from Mul…

200 papers

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

This paper proposes a compressed sensing (CS) framework for the acquisition and reconstruction of frequency-sparse signals with chaotic dynamical systems. The sparse signal is acting as an excitation term of a discrete-time chaotic system…

Information Theory · Computer Science 2016-12-21 Zhong Liu , Shengyao Chen , Feng Xi

We give a new, very general, formulation of the compressed sensing problem in terms of coordinate projections of an analytic variety, and derive sufficient sampling rates for signal reconstruction. Our bounds are linear in the coherence of…

Machine Learning · Computer Science 2013-11-05 Franz J. Király , Louis Theran

Compressed sensing is a technique for recovering a high-dimensional signal from lower-dimensional data, whose components represent partial information about the signal, utilizing prior knowledge on the sparsity of the signal. For further…

Information Theory · Computer Science 2014-02-18 Yingying Xu , Yoshiyuki Kabashima

This paper addresses the classical problem of one-bit compressed sensing using a deep learning-based reconstruction algorithm that leverages a trained generative model to enhance the signal reconstruction performance. The generator, a…

Machine Learning · Computer Science 2025-02-19 Swatantra Kafle , Geethu Joseph , Pramod K. Varshney

We investigate a power-constrained sensing matrix design problem for a compressed sensing framework. We adopt a mean square error (MSE) performance criterion for sparse source reconstruction in a system where the source-to-sensor channel…

Information Theory · Computer Science 2014-09-29 Amirpasha Shirazinia , Subhrakanti Dey

We introduce a learning-based algorithm to obtain a measurement matrix for compressive sensing related recovery problems. The focus lies on matrices with a constant modulus constraint which typically represent a network of analog phase…

Signal Processing · Electrical Eng. & Systems 2021-10-15 Michael Koller , Wolfgang Utschick

As an alternative to the traditional sampling theory, compressed sensing allows acquiring much smaller amount of data, still estimating the spectra of frequency-sparse signals accurately. However, compressed sensing usually requires random…

Information Theory · Computer Science 2016-07-22 Shan Huang , Hong Sun , Haijian Zhang , Lei Yu

Compressed sensing and its extensions have recently triggered interest in randomized signal acquisition. A key finding is that random measurements provide sparse signal reconstruction guarantees for efficient and stable algorithms with a…

Information Theory · Computer Science 2014-07-08 Felix Krahmer , Holger Rauhut

This letter proposes a novel distributed compressed estimation scheme for sparse signals and systems based on compressive sensing techniques. The proposed scheme consists of compression and decompression modules inspired by compressive…

Information Theory · Computer Science 2015-02-05 S. Xu , R. C. de Lamare , H. V. Poor

In this paper, deterministic construction of measurement matrices in Compressive Sensing (CS) is considered. First, by employing the column replacement concept, a theorem for construction of large minimum distance linear codes containing…

Signal Processing · Electrical Eng. & Systems 2018-02-06 MohamadMahdi Mohades , Mohamad Hossein Kahaei

Compressive sensing is a powerful technique for recovering sparse solutions of underdetermined linear systems, which is often encountered in uncertainty quantification analysis of expensive and high-dimensional physical models. We perform…

The article concerns compressed sensing methods in the quaternion algebra. We prove that it is possible to uniquely reconstruct - by $\ell_1$ norm minimization - a sparse quaternion signal from a limited number of its real linear…

Functional Analysis · Mathematics 2016-05-26 Agnieszka Badenska , Łukasz Błaszczyk

Conventional compressed sensing theory assumes signals have sparse representations in a known, finite dictionary. Nevertheless, in many practical applications such as direction-of-arrival (DOA) estimation and line spectral estimation, the…

Information Theory · Computer Science 2014-12-19 Jun Fang , Huiping Duan , Jing Li , Hongbin Li , Rick S. Blum

Signal models formed as linear combinations of few atoms from an over-complete dictionary or few frame vectors from a redundant frame have become central to many applications in high dimensional signal processing and data analysis. A core…

Information Theory · Computer Science 2024-08-30 Xuemei Chen , Christian Kümmerle , Rongrong Wang

A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N by N grid. Assuming the number of targets K is small (i.e., K much less than N^2), then we can transmit a sufficiently "incoherent"…

Numerical Analysis · Mathematics 2015-05-13 Matthew A. Herman , Thomas Strohmer

Is it possible to detect a feature in an image without ever looking at it? Images are known to have sparser representation in Wavelets and other similar transforms. Compressed Sensing is a technique which proposes simultaneous acquisition…

Image and Video Processing · Electrical Eng. & Systems 2020-06-09 Suyash Shandilya

In many practical applications such as direction-of-arrival (DOA) estimation and line spectral estimation, the sparsifying dictionary is usually characterized by a set of unknown parameters in a continuous domain. To apply the conventional…

Information Theory · Computer Science 2015-06-18 Jun Fang , Jing Li , Yanning Shen , Hongbin Li , Shaoqian Li

The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measurements. However, prior knowledge of the sparsity basis is…

Information Theory · Computer Science 2010-04-29 Sivan Gleichman , Yonina C. Eldar

We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in compressed sensing of structured high-dimensional signals such…

Information Theory · Computer Science 2012-02-22 John Wright , Arvind Ganesh , Kerui Min , Yi Ma
‹ Prev 1 4 5 6 7 8 10 Next ›