English
Related papers

Related papers: Compressed sensing for inverse problems and the sa…

200 papers

Fusion frames are collection of subspaces which provide a redundant representation of signal spaces. They generalize classical frames by replacing frame vectors with frame subspaces. This paper considers the sparse recovery of a signal from…

Information Theory · Computer Science 2018-04-09 Ulaş Ayaz

We consider the problem of spectral compressed sensing in continuous domain, which aims to recover a 2-dimensional spectrally sparse signal from partially observed time samples. The signal is assumed to be a superposition of s complex…

Signal Processing · Electrical Eng. & Systems 2019-03-05 Jian-Feng Cai , Weiyu Xu , Yang Yang

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

Compressive sensing relies on the sparse prior imposed on the signal of interest to solve the ill-posed recovery problem in an under-determined linear system. The objective function used to enforce the sparse prior information should be…

Information Theory · Computer Science 2020-02-25 Shuai Huang , Trac D. Tran

We propose a robust and efficient approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on…

Information Theory · Computer Science 2015-10-28 Sohail Bahmani , Justin Romberg

In this paper, we consider the problem of sparse signal detection based on partial support set estimation with compressive measurements in a distributed network. Multiple nodes in the network are assumed to observe sparse signals which…

Applications · Statistics 2016-08-10 Thakshila Wimalajeewa , Pramod K. Varshney

Wideband spectrum sensing detects the unused spectrum holes for dynamic spectrum access (DSA). Too high sampling rate is the main problem. Compressive sensing (CS) can reconstruct sparse signal with much fewer randomized samples than…

Information Theory · Computer Science 2012-04-16 Yipeng Liu , Qun Wan

Compressed Sensing decoding algorithms can efficiently recover an N dimensional real-valued vector x to within a factor of its best k-term approximation by taking m = 2klog(N/k) measurements y = Phi x. If the sparsity or approximate…

Numerical Analysis · Mathematics 2008-12-09 Rachel Ward

To obtain the best resolution for any measurement there is an ever-present challenge to achieve maximal differentiation between signal and noise over as fine of sampling dimensions as possible. In diffraction science these issues are…

Instrumentation and Detectors · Physics 2023-10-23 James Weng , Niklas B. Thompson , Christopher Folmar , James D. Martin , Christina Hoffman

Parsimony in signal representation is a topic of active research. Sparse signal processing and representation is the outcome of this line of research which has many applications in information processing and has shown significant…

Computer Vision and Pattern Recognition · Computer Science 2018-05-15 Hojjat Seyed Mousavi

Inverse imaging problems that are ill-posed can be encountered across multiple domains of science and technology, ranging from medical diagnosis to astronomical studies. To reconstruct images from incomplete and distorted data, it is…

Image and Video Processing · Electrical Eng. & Systems 2023-11-30 Cesar F. Caiafa , Ramiro M. Irastorza

This chapter gives an overview over recovery guarantees for total variation minimization in compressed sensing for different measurement scenarios. In addition to summarizing the results in the area, we illustrate why an approach that is…

Information Theory · Computer Science 2017-11-06 Felix Krahmer , Christian Kruschel , Michael Sandbichler

Numerous applications in signal processing have benefited from the theory of compressed sensing which shows that it is possible to reconstruct signals sampled below the Nyquist rate when certain conditions are satisfied. One of these…

Multimedia · Computer Science 2012-03-27 Cagdas Bilen , Yao Wang , Ivan Selesnick

The reconstruction of three-dimensional sparse volume functions from few tomographic projections constitutes a challenging problem in image reconstruction and turns out to be a particular instance problem of compressive sensing. The…

Numerical Analysis · Mathematics 2012-08-31 Stefania Petra , Christoph Schnörr

In this paper, the theoretical analysis of compressive sensing via random filter, firstly outlined by J. Romberg [compressive sensing by random convolution, submitted to SIAM Journal on Imaging Science on July 9, 2008], has been refined or…

Information Theory · Computer Science 2008-11-04 Lianlin Li , Yin Xiang , Fang Li

Compressive Sensing theory says that it is possible to reconstruct a measured signal if an enough sparse representation of this signal exists in comparison to the number of random measurements. This theory was applied to reconstruct signals…

The problem of imaging extended targets (sources or scatterers) is formulated in the framework of compressed sensing with emphasis on subwavelength resolution. The proposed formulation of the problems of inverse source/scattering is…

Optics · Physics 2009-09-15 Albert C. Fannjiang

Due to the many applications in Magnetic Resonance Imaging (MRI), Nuclear Magnetic Resonance (NMR), radio interferometry, helium atom scattering etc., the theory of compressed sensing with Fourier transform measurements has reached a mature…

Numerical Analysis · Mathematics 2021-03-31 Laura Thesing , Anders Christian Hansen

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 study the use of very sparse random projections for compressed sensing (sparse signal recovery) when the signal entries can be either positive or negative. In our setting, the entries of a Gaussian design matrix are randomly sparsified…

Methodology · Statistics 2014-08-12 Ping Li , Cun-Hui Zhang