English
Related papers

Related papers: Simultaneous Sparse Recovery and Blind Demodulatio…

200 papers

The problem of estimating a sparse signal from low dimensional noisy observations arises in many applications, including super resolution, signal deconvolution, and radar imaging. In this paper, we consider a sparse signal model with…

Information Theory · Computer Science 2020-06-24 Youye Xie , Michael B. Wakin , Gongguo Tang

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

The blind deconvolution problem amounts to reconstructing both a signal and a filter from the convolution of these two. It constitutes a prominent topic in mathematical and engineering literature. In this work, we analyze a sparse version…

Information Theory · Computer Science 2021-11-08 Axel Flinth , Ingo Roth , Benedikt Groß , Jens Eisert , Gerhard Wunder

Subsampled blind deconvolution is the recovery of two unknown signals from samples of their convolution. To overcome the ill-posedness of this problem, solutions based on priors tailored to specific application have been developed in…

Information Theory · Computer Science 2015-11-23 Kiryung Lee , Yanjun Li , Marius Junge , Yoram Bresler

This paper develops new theory and algorithms to recover signals that are approximately sparse in some general dictionary (i.e., a basis, frame, or over-/incomplete matrix) but corrupted by a combination of interference having a sparse…

Information Theory · Computer Science 2013-09-06 Christoph Studer , Richard G. Baraniuk

This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple sensing matrices, under the assumption that the unknown signals…

Information Theory · Computer Science 2015-03-19 Jorge Silva , Minhua Chen , Yonina C. Eldar , Guillermo Sapiro , Lawrence Carin

This paper concerns solving the sparse deconvolution and demixing problem using $\ell_{1,2}$-minimization. We show that under a certain structured random model, robust and stable recovery is possible. The results extend results of Ling and…

Statistics Theory · Mathematics 2017-05-11 Axel Flinth

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 investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise admitting a sparse representation in another general dictionary.…

Information Theory · Computer Science 2011-12-08 Christoph Studer , Patrick Kuppinger , Graeme Pope , Helmut Bölcskei

Natural signals and images are well-known to be approximately sparse in transform domains such as Wavelets and DCT. This property has been heavily exploited in various applications in image processing and medical imaging. Compressed sensing…

Machine Learning · Computer Science 2015-10-26 Saiprasad Ravishankar , Yoram Bresler

In this paper the problem of blind super-resolution of sparse signals using arbitrary sampling scheme and atomic lift is discussed. After comprehensive description on blind superresolution problem, it is shown that using Prolate Spheroidal…

Signal Processing · Electrical Eng. & Systems 2019-07-09 Hoomaan Hezaveh , Milad Javadzadeh , MohammadHossein Kahaei

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

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

Demixing refers to the challenge of identifying two structured signals given only the sum of the two signals and prior information about their structures. Examples include the problem of separating a signal that is sparse with respect to…

Information Theory · Computer Science 2015-03-20 Michael B. McCoy , Joel A. Tropp

This article addresses the image denoising problem in the situations of strong noise. We propose a dual sparse decomposition method. This method makes a sub-dictionary decomposition on the over-complete dictionary in the sparse…

Computer Vision and Pattern Recognition · Computer Science 2017-04-25 Hong Sun , Chen-guang Liu , Cheng-wei Sang

Super-resolution is generally referred to as the task of recovering fine details from coarse information. Motivated by applications such as single-molecule imaging, radar imaging, etc., we consider parameter estimation of complex…

Information Theory · Computer Science 2016-08-10 Dehui Yang , Gongguo Tang , Michael B. Wakin

We present a novel approach for recovering a sparse signal from cross-correlated data. Cross-correlations naturally arise in many fields of imaging, such as optics, holography and seismic interferometry. Compared to the sparse signal…

Signal Processing · Electrical Eng. & Systems 2021-04-28 Miguel Moscoso , Alexei Novikov , George Papanicolaou , Chrysoula Tsogka

Blind deconvolution is a ubiquitous problem of recovering two unknown signals from their convolution. Unfortunately, this is an ill-posed problem in general. This paper focuses on the {\em short and sparse} blind deconvolution problem,…

Signal Processing · Electrical Eng. & Systems 2019-07-23 Yuqian Zhang , Han-Wen Kuo , John Wright

Non-stationary blind super-resolution is an extension of the traditional super-resolution problem, which deals with the problem of recovering fine details from coarse measurements. The non-stationary blind super-resolution problem appears…

Information Theory · Computer Science 2019-10-09 Shuang Li , Michael B. Wakin , Gongguo Tang

Neural recordings, returns from radars and sonars, images in astronomy and single-molecule microscopy can be modeled as a linear superposition of a small number of scaled and delayed copies of a band-limited or diffraction-limited point…

Information Theory · Computer Science 2016-05-25 Yuejie Chi
‹ Prev 1 2 3 10 Next ›