Blind Identification of Invertible Graph Filters with Multiple Sparse Inputs
نویسندگان
چکیده
This paper deals with problem of blind identification of a graph filter and its sparse input signal, thus broadening the scope of classical blind deconvolution of temporal and spatial signals to irregular graph domains. While the observations are bilinear functions of the unknowns, a mild requirement on invertibility of the filter enables an efficient convex formulation, without relying on matrix lifting that can hinder applicability to large graphs. On top of scaling, it is argued that (non-cyclic) permutation ambiguities may arise with some particular graphs. Deterministic sufficient conditions under which the proposed convex relaxation can exactly recover the unknowns are stated, along with those guaranteeing identifiability under the BernoulliGaussian model for the inputs. Numerical tests with synthetic and real-world networks illustrate the merits of the proposed algorithm, as well as the benefits of leveraging multiple signals to aid the (blind) localization of sources of diffusion.
منابع مشابه
Blind Separation of Delayed and Convolved Sources
We address the difficult problem of separating multiple speakers with multiple microphones in a real room. We combine the work of Torkkola and Amari, Cichocki and Yang, to give Natural Gradient information maximisation rules for recurrent (IIR) networks, blindly adjusting delays, separating and deconvolving mixed signals. While they work well on simulated data, these rules fail in real rooms wh...
متن کاملReducing musical noise in blind source separation by time-domain sparse filters and split bregman method
Musical noise often arises in the outputs of time-frequency binary mask based blind source separation approaches. Postprocessing is desired to enhance the separation quality. An efficient musical noise reduction method by time-domain sparse filters is presented using convex optimization. The sparse filters are sought by l1 regularization and the split Bregman method. The proposed musical noise ...
متن کاملBlind Identification of Fully Observed Discrete-Time Linear Time-Varying Systems via Sparse Recovery
Discrete-time linear time-varying (LTV) systems form a powerful class of models to approximate complex dynamical systems or networks with nonlinear dynamics for the purpose of analysis, design and control. Motivated by inference of spatio-temporal dynamics in breast cancer research, we propose a method to efficiently solve an identification problem for a specific class of discrete-time LTV syst...
متن کاملLinear precoding for spatial multiplexing MIMO systems: blind channel estimation aspects
For the case of white uncorrelated inputs, most of the blind multichannel identification techniques are not very robust and only allow to estimate the channel up to a number of ambiguities, especially in the MIMO case. On the other hand, all current standardized communication systems employ some form of known inputs to allow channel estimation. The channel estimation performance in those cases ...
متن کاملBlind multivariable ARMA subspace identification
In this paper, we study the deterministic blind identification of multiple channel state-space models having a common unknown input using measured output signals that are perturbed by additive white noise sequences. Different from traditional blind identification problems, the considered system is an autoregressive system rather than an FIR system; hence, the concerned identification problem is...
متن کامل