153 research outputs found
Identifiability for Blind Source Separation of Multiple Finite Alphabet Linear Mixtures
We give under weak assumptions a complete combinatorial characterization of
identifiability for linear mixtures of finite alphabet sources, with unknown
mixing weights and unknown source signals, but known alphabet. This is based on
a detailed treatment of the case of a single linear mixture. Notably, our
identifiability analysis applies also to the case of unknown number of sources.
We provide sufficient and necessary conditions for identifiability and give a
simple sufficient criterion together with an explicit construction to determine
the weights and the source signals for deterministic data by taking advantage
of the hierarchical structure within the possible mixture values. We show that
the probability of identifiability is related to the distribution of a hitting
time and converges exponentially fast to one when the underlying sources come
from a discrete Markov process. Finally, we explore our theoretical results in
a simulation study. Our work extends and clarifies the scope of scenarios for
which blind source separation becomes meaningful
Parametric estimation in noisy blind deconvolution model: a new estimation procedure
In a parametric framework, the paper is devoted to the study of a new
estimation procedure for the inverse filter and the level noise in a complex
noisy blind discrete deconvolution model. Our estimation method is a
consequence of the sharp exploitation of the specifical properties of the
Hankel forms. The distribution of the input signal is also estimated. The
strong consistency and the asymptotic distribution of all estimates are
established. A consistent simulation study is added in order to demonstrate
empirically the computational performance of our estimation procedures.Comment: Submitted to the Electronic Journal of Statistics
(http://www.i-journals.org/ejs/) by the Institute of Mathematical Statistics
(http://www.imstat.org
Independent Process Analysis without A Priori Dimensional Information
Recently, several algorithms have been proposed for independent subspace
analysis where hidden variables are i.i.d. processes. We show that these
methods can be extended to certain AR, MA, ARMA and ARIMA tasks. Central to our
paper is that we introduce a cascade of algorithms, which aims to solve these
tasks without previous knowledge about the number and the dimensions of the
hidden processes. Our claim is supported by numerical simulations. As a
particular application, we search for subspaces of facial components.Comment: 9 pages, 2 figure
Performance limits of alphabet diversities for FIR SISO channel identification
10 pagesInternational audienceFinite Impulse Responses (FIR) of Single-Input Single-Output (SISO) channels can be blindly identified from second order statistics of transformed data, for instance when the channel is excited by Binary Phase Shift Keying (BPSK), Minimum Shift Keying (MSK) or Quadrature Phase Shift Keying (QPSK) inputs. Identifiability conditions are derived by considering that noncircularity induces diversity. Theoretical performance issues are addressed to evaluate the robustness of standard subspace-based estimators with respect to these identifiability conditions. Then benchmarks such as asymptotically minimum variance (AMV) bounds based on various statistics are presented. Some illustrative examples are eventually given where Monte Carlo experiments are compared to theoretical performances. These comparisons allow to quantify limits to the use of the alphabet diversities for the identification of FIR SISO channels, and to demonstrate the robustness of algorithms based on High-Order Statistics
Image Restoration
This book represents a sample of recent contributions of researchers all around the world in the field of image restoration. The book consists of 15 chapters organized in three main sections (Theory, Applications, Interdisciplinarity). Topics cover some different aspects of the theory of image restoration, but this book is also an occasion to highlight some new topics of research related to the emergence of some original imaging devices. From this arise some real challenging problems related to image reconstruction/restoration that open the way to some new fundamental scientific questions closely related with the world we interact with
Hybrid solutions to instantaneous MIMO blind separation and decoding: narrowband, QAM and square cases
Future wireless communication systems are desired to support high data rates and high quality transmission when considering the growing multimedia applications. Increasing the channel throughput leads to the multiple input and multiple output and blind equalization techniques in recent years. Thereby blind MIMO equalization has attracted a great interest.Both system performance and computational complexities play important roles in real time communications. Reducing the computational load and providing accurate performances are the main challenges in present systems. In this thesis, a hybrid method which can provide an affordable complexity with good performance for Blind Equalization in large constellation MIMO systems is proposed first. Saving computational cost happens both in the signal sep- aration part and in signal detection part. First, based on Quadrature amplitude modulation signal characteristics, an efficient and simple nonlinear function for the Independent Compo- nent Analysis is introduced. Second, using the idea of the sphere decoding, we choose the soft information of channels in a sphere, and overcome the so- called curse of dimensionality of the Expectation Maximization (EM) algorithm and enhance the final results simultaneously. Mathematically, we demonstrate in the digital communication cases, the EM algorithm shows Newton -like convergence.Despite the widespread use of forward -error coding (FEC), most multiple input multiple output (MIMO) blind channel estimation techniques ignore its presence, and instead make the sim- plifying assumption that the transmitted symbols are uncoded. However, FEC induces code structure in the transmitted sequence that can be exploited to improve blind MIMO channel estimates. In final part of this work, we exploit the iterative channel estimation and decoding performance for blind MIMO equalization. Experiments show the improvements achievable by exploiting the existence of coding structures and that it can access the performance of a BCJR equalizer with perfect channel information in a reasonable SNR range. All results are confirmed experimentally for the example of blind equalization in block fading MIMO systems
- …