In this technical report, we show that sparse power factorization (SPF) is an effective solution to the subsampled multichannel blind deconvolution (SMBD) problem when the input signal follows a sparse model. SMBD is formulated as the recovery of a sparse rank-one matrix. Unlike the recovery of rank-one matrix or of sparse matrix, when there are multiple priors on the solution simultaneously, SPF outperforms convex relaxation approaches both theoretically and empirically. We confirm that SPF exhibits the same advantage in the context of SMBD.National Science Foundation/CCF 10-18789Ope
This paper considers constrained lscr1 minimization methods in a unified framework for the recovery ...
We consider the problem of recovering two unknown vectors, w and x, of length L from their circular ...
Abstract — Blind deconvolution arises naturally when dealing with finite multipath interference on a...
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Conselho Nacional de Desenvolvime...
In many applications, one is faced with an inverse problem, where the known signal depends in a bili...
The method is a modification of Euclid’s blind deconvolution where the multichannel impulse response...
International audienceThis paper deals with the problem of recovering a sparse unknown signal from a...
Many phenomena can be modeled as systems that preform convolution, including negative effects on dat...
International audienceThis paper introduces $p$-thresholding, an algorithm to compute simultaneous s...
International audienceFormulated as a least square problem under an $\ell_0$ constraint, sparse sign...
International audienceWe propose a solution to the image deconvolution problem where the convolution...
International audienceBlind Source Separation (BSS) is a challenging matrix factorization problem th...
Sparse deconvolution is a classical subject in digital signal processing, having many practical appl...
International audienceWe consider the problem of blind sparse deconvolution, which is common in both...
International audience—The applicability of many signal processing and data analysis techniques is l...
This paper considers constrained lscr1 minimization methods in a unified framework for the recovery ...
We consider the problem of recovering two unknown vectors, w and x, of length L from their circular ...
Abstract — Blind deconvolution arises naturally when dealing with finite multipath interference on a...
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Conselho Nacional de Desenvolvime...
In many applications, one is faced with an inverse problem, where the known signal depends in a bili...
The method is a modification of Euclid’s blind deconvolution where the multichannel impulse response...
International audienceThis paper deals with the problem of recovering a sparse unknown signal from a...
Many phenomena can be modeled as systems that preform convolution, including negative effects on dat...
International audienceThis paper introduces $p$-thresholding, an algorithm to compute simultaneous s...
International audienceFormulated as a least square problem under an $\ell_0$ constraint, sparse sign...
International audienceWe propose a solution to the image deconvolution problem where the convolution...
International audienceBlind Source Separation (BSS) is a challenging matrix factorization problem th...
Sparse deconvolution is a classical subject in digital signal processing, having many practical appl...
International audienceWe consider the problem of blind sparse deconvolution, which is common in both...
International audience—The applicability of many signal processing and data analysis techniques is l...
This paper considers constrained lscr1 minimization methods in a unified framework for the recovery ...
We consider the problem of recovering two unknown vectors, w and x, of length L from their circular ...
Abstract — Blind deconvolution arises naturally when dealing with finite multipath interference on a...