Blind Deconvolution Using Convex Programming
نویسندگان
چکیده
منابع مشابه
From Blind deconvolution to Blind Super-Resolution through convex programming
This paper discusses the recovery of an unknown signal x ∈ R through the result of its convolution with an unknown filter h ∈ R. This problem, also known as blind deconvolution, has been studied extensively by the signal processing and applied mathematics communities, leading to a diversity of proofs and algorithms based on various assumptions on the filter and its input. Sparsity of this filte...
متن کاملMultichannel blind seismic deconvolution using dynamic programming
In this paper, we present an algorithm for multichannel blind deconvolution of seismic signals, which exploits lateral continuity of earth layers by dynamic programming approach. We assume that reflectors in consecutive channels, related to distinct layers, form continuous paths across channels. We introduce a quality measure for evaluating the quality of a continuous path, and iteratively appl...
متن کاملConvex Blind Deconvolution with Random Masks
We solve blind deconvolution problems where one signal is modulated by multiple random masks using nuclear norm minimization. Theoretical analysis shows the number of masks for successful recovery scales as poly-logarithm of the problem dimension. OCIS codes: 100.1455, 100.3190.
متن کاملDynamic Programming for Multichannel Blind Seismic Deconvolution
We present an algorithm for multichannel blind deconvolution of seismic signals, which exploits lateral continuity of earth layers by dynamic programming approach. We assume that reflectors in consecutive channels, related to distinct layers, form continuous paths across channels. We introduce a quality measure for evaluating the quality of a continuous path, and iteratively apply dynamic progr...
متن کاملBlind deconvolution using temporal predictability
A measure of temporal predictability is de-ned, and used for blind deconvolution of sound signals. The method is based on the observation that physical environments act as smoothing -lters, and therefore increase the predictability of signals. These smoothing e0ects can be reversed by a deconvolution -lter which minimises a measure of temporal predictability. This -lter is obtained as the close...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2294644