English
Related papers

Related papers: Blind Deconvolution with Non-local Sparsity Reweig…

200 papers

Blind deconvolution involves the estimation of a sharp signal or image given only a blurry observation. Because this problem is fundamentally ill-posed, strong priors on both the sharp image and blur kernel are required to regularize the…

Computer Vision and Pattern Recognition · Computer Science 2013-05-13 David Wipf , Haichao Zhang

One popular approach for blind deconvolution is to formulate a maximum a posteriori (MAP) problem with sparsity priors on the gradients of the latent image, and then alternatingly estimate the blur kernel and the latent image. While several…

Computer Vision and Pattern Recognition · Computer Science 2017-08-29 Sunghyun Cho , Seungyong Lee

Blind deconvolution is the problem of recovering a sharp image and a blur kernel from a noisy blurry image. Recently, there has been a significant effort on understanding the basic mechanisms to solve blind deconvolution. While this effort…

Computer Vision and Pattern Recognition · Computer Science 2014-12-02 Daniele Perrone , Paolo Favaro

Blind deconvolution is an ubiquitous non-linear inverse problem in applications like wireless communications and image processing. This problem is generally ill-posed, and there have been efforts to use sparse models for regularizing blind…

Information Theory · Computer Science 2019-04-09 Sunav Choudhary , Urbashi Mitra

We revisit the Blind Deconvolution problem with a focus on understanding its robustness and convergence properties. Provable robustness to noise and other perturbations is receiving recent interest in vision, from obtaining immunity to…

Computer Vision and Pattern Recognition · Computer Science 2018-03-23 Sathya N. Ravi , Ronak Mehta , Vikas Singh

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

Maximum-a-posteriori (MAP) approaches are an effective framework for inverse problems with known forward operators, particularly when combined with expressive priors and careful parameter selection. In blind settings, however, their use…

Information Theory · Computer Science 2026-02-13 Nathan Buskulic , Luca Calatroni

Typical blur from camera shake often deviates from the standard uniform convolutional script, in part because of problematic rotations which create greater blurring away from some unknown center point. Consequently, successful blind…

Computer Vision and Pattern Recognition · Computer Science 2013-06-18 Haichao Zhang , David Wipf

Maximum A Posteriori (MAP) estimation is a cornerstone framework for blind inverse problems, where an image and a forward operator are jointly estimated as the maximizers of a posterior distribution. In this paper, we analyze the recovery…

Computer Vision and Pattern Recognition · Computer Science 2026-03-03 Minh-Hai Nguyen , Edouard Pauwels , Pierre Weiss

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

Multi-channel sparse blind deconvolution, or convolutional sparse coding, refers to the problem of learning an unknown filter by observing its circulant convolutions with multiple input signals that are sparse. This problem finds numerous…

Machine Learning · Statistics 2021-04-07 Laixi Shi , Yuejie Chi

Blind deconvolution is the problem of recovering a convolutional kernel $\boldsymbol a_0$ and an activation signal $\boldsymbol x_0$ from their convolution $\boldsymbol y = \boldsymbol a_0 \circledast \boldsymbol x_0$. This problem is…

Computer Vision and Pattern Recognition · Computer Science 2019-01-08 Yuqian Zhang , Yenson Lau , Han-Wen Kuo , Sky Cheung , Abhay Pasupathy , John Wright

In this paper, we introduce a variational Bayesian algorithm (VBA) for image blind deconvolution. Our generic framework incorporates smoothness priors on the unknown blur/image and possible affine constraints (e.g., sum to one) on the blur…

Computer Vision and Pattern Recognition · Computer Science 2021-10-15 Yunshi Huang , Emilie Chouzenoux , Jean-Christophe Pesquet

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

Marginal MAP inference involves making MAP predictions in systems defined with latent variables or missing information. It is significantly more difficult than pure marginalization and MAP tasks, for which a large class of efficient and…

Machine Learning · Computer Science 2015-11-10 Wei Ping , Qiang Liu , Alexander Ihler

In the blind deconvolution problem, we observe the convolution of an unknown filter and unknown signal and attempt to reconstruct the filter and signal. The problem seems impossible in general, since there are seemingly many more unknowns…

Information Theory · Computer Science 2021-06-15 Qingyun Sun , David Donoho

Multichannel blind deconvolution is the problem of recovering an unknown signal $f$ and multiple unknown channels $x_i$ from their circular convolution $y_i=x_i \circledast f$ ($i=1,2,\dots,N$). We consider the case where the $x_i$'s are…

Information Theory · Computer Science 2019-03-19 Yanjun Li , Yoram Bresler

Blind deconvolution is an ubiquitous non-linear inverse problem in applications like wireless communications and image processing. This problem is generally ill-posed since signal identifiability is a key concern, and there have been…

Information Theory · Computer Science 2019-04-09 Sunav Choudhary , Urbashi Mitra

The marginal maximum a posteriori probability (MAP) estimation problem, which calculates the mode of the marginal posterior distribution of a subset of variables with the remaining variables marginalized, is an important inference problem…

Machine Learning · Statistics 2013-07-19 Qiang Liu , Alexander Ihler

Sparse blind deconvolution is the problem of estimating the blur kernel and sparse excitation, both of which are unknown. Considering a linear convolution model, as opposed to the standard circular convolution model, we derive a sufficient…

Information Theory · Computer Science 2017-10-12 Aniruddha Adiga , Chandra Sekhar Seelamantula
‹ Prev 1 2 3 10 Next ›