English
Related papers

Related papers: Compressed Sensing Based on Random Symmetric Berno…

200 papers

The goal of compressed sensing is to reconstruct a sparse signal under a few linear measurements far less than the dimension of the ambient space of the signal. However, many real-life applications in physics and biomedical sciences carry…

Optimization and Control · Mathematics 2017-08-29 Angang Cui , Jigen Peng , Haiyang Li

The problem of compressing a real-valued sparse source using compressive sensing techniques is studied. The rate distortion optimality of a coding scheme in which compressively sensed signals are quantized and then reconstructed is…

Information Theory · Computer Science 2010-11-09 Rajiv Soundararajan , Sriram Vishwanath

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

We consider designing a robust structured sparse sensing matrix consisting of a sparse matrix with a few non-zero entries per row and a dense base matrix for capturing signals efficiently We design the robust structured sparse sensing…

Signal Processing · Electrical Eng. & Systems 2019-02-06 Tao Hong , Xiao Li , Zhihui Zhu , Qiuwei Li

Compressive sensing is a novel approach that linearly samples sparse or compressible signals at a rate much below the Nyquist-Shannon sampling rate and outperforms traditional signal processing techniques in acquiring and reconstructing…

Information Theory · Computer Science 2019-01-03 Ramin Ayanzadeh , Seyedahmad Mousavi , Milton Halem , Tim Finin

We introduce the broad subclass of algebraic compressed sensing problems, where structured signals are modeled either explicitly or implicitly via polynomials. This includes, for instance, low-rank matrix and tensor recovery. We employ…

Numerical Analysis · Mathematics 2024-07-02 Paul Breiding , Fulvio Gesmundo , Mateusz Michałek , Nick Vannieuwenhoven

This paper tackles algorithmic and theoretical aspects of dictionary learning from incomplete and random block-wise image measurements and the performance of the adaptive dictionary for sparse image recovery. This problem is related to…

Computer Vision and Pattern Recognition · Computer Science 2015-08-04 Mohammad Aghagolzadeh , Hayder Radha

Compressive sensing (CS) is well-known for its unique functionalities of sensing, compressing, and security (i.e. CS measurements are equally important). However, there is a tradeoff. Improving sensing and compressing efficiency with prior…

Signal Processing · Electrical Eng. & Systems 2020-02-19 Thuong Nguyen Canh , Byeungwoo Jeon

Compressed sensing (CS) is a sampling theory that allows reconstruction of sparse (or compressible) signals from an incomplete number of measurements, using of a sensing mechanism implemented by an appropriate projection matrix. The CS…

Computer Vision and Pattern Recognition · Computer Science 2017-08-29 Duc Minh Nguyen , Evaggelia Tsiligianni , Nikos Deligiannis

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 linear measurements,…

Functional Analysis · Mathematics 2017-05-23 Agnieszka Badeńska , Łukasz Błaszczyk

Compressed Sensing (CS) is an appealing framework for applications such as Magnetic Resonance Imaging (MRI). However, up-to-date, the sensing schemes suggested by CS theories are made of random isolated measurements, which are usually…

Information Theory · Computer Science 2016-06-14 Claire Boyer , Jérémie Bigot , Pierre Weiss

We give the first computationally tractable and almost optimal solution to the problem of one-bit compressed sensing, showing how to accurately recover an s-sparse vector x in R^n from the signs of O(s log^2(n/s)) random linear measurements…

Information Theory · Computer Science 2015-03-19 Yaniv Plan , Roman Vershynin

This article proposes a novel algorithm for solving mismatch problem in compressed sensing. Its core is to transform mismatch problem into matched by constructing a new measurement matrix to match measurement value under unknown measurement…

Signal Processing · Electrical Eng. & Systems 2024-10-31 Le Yang

Let $x\in\mathbb{C}^n$ be a spectrally sparse signal consisting of $r$ complex sinusoids with or without damping. We consider the spectral compressed sensing problem, which is about reconstructing $x$ from its partial revealed entries. By…

Optimization and Control · Mathematics 2017-08-01 Jian-Feng Cai , Tianming Wang , Ke Wei

In this paper, a class of deterministic sensing matrices are constructed by selecting rows from Fourier matrices. These matrices have better performance in sparse recovery than random partial Fourier matrices. The coherence and restricted…

Information Theory · Computer Science 2015-09-10 Shan Huang , Hong Sun , Lei Yu , Haijian Zhang

Compressive sensing (CS) is a technique for estimating a sparse signal from the random measurements and the measurement matrix. Traditional sparse signal recovery methods have seriously degeneration with the measurement matrix uncertainty…

Information Theory · Computer Science 2011-06-21 Yipeng Liu , Qun Wan , Fei Wen , Jia Xu , Yingning Peng

The problem of recovering a structured signal from its linear measurements in the presence of speckle noise is studied. This problem appears in many imaging systems such as synthetic aperture radar and optical coherence tomography. The…

Information Theory · Computer Science 2021-08-03 Wenda Zhou , Shirin Jalali , Arian Maleki

Compressed sensing (CS) is a sampling paradigm that allows to simultaneously measure and compress signals that are sparse or compressible in some domain. The choice of a sensing matrix that carries out the measurement has a defining impact…

Information Theory · Computer Science 2017-08-02 Anastasia Lavrenko , Florian Roemer , Giovanni Del Galdo , Reiner Thomae

Compressed sensing is a technique to sample compressible signals below the Nyquist rate, whilst still allowing near optimal reconstruction of the signal. In this paper we present a theoretical analysis of the iterative hard thresholding…

Information Theory · Computer Science 2008-05-06 Thomas Blumensath , Mike E. Davies

In many applications in compressed sensing, the measurement matrix is a Fourier matrix, i.e., it measures the Fourier transform of the underlying signal at some specified `base' frequencies $\{u_i\}_{i=1}^M$, where $M$ is the number of…

Information Theory · Computer Science 2018-02-09 Eeshan Malhotra , Himanshu Pandotra , Ajit Rajwade , Karthik S. Gurumoorthy
‹ Prev 1 4 5 6 7 8 10 Next ›