Result: Sparse Signal Blind Deconvolution using Bayesian MAP Estimation
collection:CNRS
collection:UNIV-UBS
collection:LAB-STICC_UBO
collection:LORIA2
collection:ENIB
collection:LAB-STICC
collection:LAB-STICC_IMTA
collection:IMT-ATLANTIQUE
collection:PRACOM
collection:IP_PARIS
collection:INSTITUTS-TELECOM
collection:IMTA_MEE
collection:LAB-STICC_2AI_IMTA
collection:LAB-STICC_COSYDE_IMTA
collection:LAB-STICC_2AI
collection:LAB-STICC_COSYDE
collection:LAB-STICC_T2I3
collection:INSTITUT-MINES-TELECOM
collection:IP-PARIS-INFORMATION-COMMUNICATION-ELECTRONIQUE
Further Information
Blind deconvolution tackles the issue of recovering a signal from a convolution between an initial signal and a filter with an unknown kernel. To address the ill-posed nature of blind deconvolution, we leverage the sparse characteristics of the signals in a pre-existent dictionary. Rather than imposing sparsity directly on the signal using L0 or L1 penalties, we express it as a prior on the signal's covariance matrix. The hierarchical prior acts like a decoupling between the signal and its sparsity, making estimation a classical a posteriori problem. The proposition revolves around a maximum a posteriori estimation in an Expectation -Maximization framework for alternate optimization of the signal and the filter. We give simulation results in comparison with MAP oracle values for any sparse basis.