English
Related papers

Related papers: Leveraging Diversity and Sparsity in Blind Deconvo…

200 papers

We study identifiability for bilinear inverse problems under sparsity and subspace constraints. We show that, up to a global scaling ambiguity, almost all such maps are injective on the set of pairs of sparse vectors if the number of…

Information Theory · Computer Science 2016-03-24 Michael Kech , Felix Krahmer

In this work we characterize all ambiguities of the linear (aperiodic) one-dimensional convolution on two fixed finite-dimensional complex vector spaces. It will be shown that the convolution ambiguities can be mapped one-to-one to…

Information Theory · Computer Science 2017-01-19 Philipp Walk , Peter Jung , Götz E. Pfander , Babak Hassibi

Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or super-resolution, can be addressed by maximizing the posterior distribution of a sparse linear model (SLM). We…

Machine Learning · Statistics 2010-08-16 Matthias W. Seeger , Hannes Nickisch

Many applications concern sparse signals, for example, detecting anomalies from the differences between consecutive images taken by surveillance cameras. This paper focuses on the problem of recovering a K-sparse signal x in N dimensions.…

Machine Learning · Statistics 2013-02-06 Ping Li , Cun-Hui Zhang

Let $X_1, ..., X_m$ be a set of $m$ statistically dependent sources over the common alphabet $\mathbb{F}_q$, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation…

Information Theory · Computer Science 2016-11-17 V. Lalitha , N. Prakash , K. Vinodh , P. Vijay Kumar , S. Sandeep Pradhan

We consider the task of recovering two real or complex $m$-vectors from phaseless Fourier measurements of their circular convolution. Our method is a novel convex relaxation that is based on a lifted matrix recovery formulation that allows…

Information Theory · Computer Science 2019-05-14 Ali Ahmed , Alireza Aghasi , Paul Hand

We consider a general spectral coexistence scenario, wherein the channels and transmit signals of both radar and communications systems are unknown at the receiver. In this \textit{dual-blind deconvolution} (DBD) problem, a common receiver…

Signal Processing · Electrical Eng. & Systems 2021-11-12 Edwin Vargas , Kumar Vijay Mishra , Roman Jacome , Brian M. Sadler , Henry Arguello

Remarkable mathematical properties of the integrable nonlinear Schr\"odinger equation (NLSE) can offer advanced solutions for the mitigation of nonlinear signal distortions in optical fibre links. Fundamental optical soliton, continuous and…

Exactly Solvable and Integrable Systems · Physics 2017-06-07 L. L. Frumin , A. A. Gelash , S. K. Turitsyn

Suppose the signal x is realized by driving a k-sparse signal u through an arbitrary unknown stable discrete-linear time invariant system H. These types of processes arise naturally in Reflection Seismology. In this paper we are interested…

Information Theory · Computer Science 2016-09-08 V. Saligrama , M. Zhao

We consider spectrally-efficient communication over a Rayleigh N-block-fading channel with a K- sparse L-length discrete-time impulse response (for 0<K<L<N), where neither the transmitter nor receiver know the channel's coefficients nor its…

Information Theory · Computer Science 2011-06-01 Philip Schniter

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an $N$ dimensional signal with a $K$-sparse WHT, where $N$ is a power of two and $K = O(N^\alpha)$, scales sub-linearly in $N$…

Information Theory · Computer Science 2019-05-08 Robin Scheibler , Saeid Haghighatshoar , Martin Vetterli

In this work, an efficient numerical scheme is presented for seismic blind deconvolution in a multichannel scenario. The proposed method iterate with wo steps: first, wavelet estimation across all channels and second, refinement of the…

Computational Physics · Physics 2020-10-20 Naveed Iqbal , Entao Liu , James H. McClellan , Abdullatif A. Al-Shuhail

We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block code to exploit soft information obtained…

Information Theory · Computer Science 2009-05-18 Christian Senger , Vladimir Sidorenko , Victor Zyablov

We establish the fundamental limits of lossless linear analog compression by considering the recovery of random vectors ${\boldsymbol{\mathsf{x}}}\in{\mathbb R}^m$ from the noiseless linear measurements…

Information Theory · Computer Science 2016-05-06 Giovanni Alberti , Helmut Bölcskei , Camillo De Lellis , Günther Koliander , Erwin Riegler

Computing the convolution $A\star B$ of two length-$n$ vectors $A,B$ is an ubiquitous computational primitive. Applications range from string problems to Knapsack-type problems, and from 3SUM to All-Pairs Shortest Paths. These applications…

Data Structures and Algorithms · Computer Science 2021-05-17 Karl Bringmann , Nick Fischer , Vasileios Nakos

Sparsity is one of the key concepts that allows the recovery of signals that are subsampled at a rate significantly lower than required by the Nyquist-Shannon sampling theorem. Our proposed framework uses arbitrary multiscale transforms,…

Optimization and Control · Mathematics 2017-05-31 Jackie Ma , Maximilian März

Vector orthogonal frequency division multiplexing (V-OFDM) is a general system that builds a bridge between OFDM and single-carrier frequency domain equalization in terms of intersymbol interference and receiver complexity. In this paper,…

Information Theory · Computer Science 2015-12-22 Qi Feng , Xiang-Gen Xia , Zhihui Ye , Naitong Zhang

Diffusion MRI is a well established imaging modality providing a powerful way to probe the structure of the white matter non-invasively. Despite its potential, the intrinsic long scan times of these sequences have hampered their use in…

Quantitative Methods · Quantitative Biology 2013-12-31 Alessandro Daducci , Dimitri Van De Ville , Jean-Philippe Thiran , Yves Wiaux

Short-and-sparse deconvolution (SaSD) is the problem of extracting localized, recurring motifs in signals with spatial or temporal structure. Variants of this problem arise in applications such as image deblurring, microscopy, neural spike…

Signal Processing · Electrical Eng. & Systems 2019-10-02 Yenson Lau , Qing Qu , Han-Wen Kuo , Pengcheng Zhou , Yuqian Zhang , John Wright

We study the multi-channel sparse blind deconvolution (MCS-BD) problem, whose task is to simultaneously recover a kernel $\mathbf a$ and multiple sparse inputs $\{\mathbf x_i\}_{i=1}^p$ from their circulant convolution $\mathbf y_i =…

Signal Processing · Electrical Eng. & Systems 2020-03-03 Qing Qu , Xiao Li , Zhihui Zhu