169,383 research outputs found

    Approximate credibility intervals on electromyographic decomposition algorithms within a Bayesian framework

    Get PDF
    This thesis develops a framework to uncover the probability of correctness of algorithmic results. Specifically, this thesis is not concerned with the correctness of these algorithms, but with the uncertainty of their results arising from existing uncertainty in their inputs. This is achieved using a Bayesian approach. This framework is then demonstrated using independent component analysis with electromyographic data. Blind source separation (BSS) algorithms, such as independent component analysis (ICA), are often used to solve the inverse problem arising when, for example, attempting to retrieve the activation patterns of motor units (MUs) from electromyographic (EMG) data. BSS, or similar algorithms, return a result but do not generally provide any indication on the quality of that result or certainty one can have in it being the actual original pattern and not one strongly altered by the noise/errors in the input. This thesis uses Bayesian inference to extend ICA both to incorporate prior physiological information, thus making it in effect a semi-blind source separation (SBSS) algorithm, and to quantify the uncertainties around the values of the sources as estimated by ICA. To this end, this thesis also presents a way to put a prior on a mixing matrix given a physiological model as well as a re-parametrisation of orthogonal matrices which is helpful in pre-empting floating point errors when incorporating this prior of the mixing matrix into an algorithm which estimates the un-mixing matrix. In experiments done using EMG data, it is found that the addition of the prior is of benefit when the input is very noisy or very short in terms of samples or both. The experiments also show that the information about the certainty can be used as a heuristic for feature extraction or general quality control provided an appropriate baseline has been determined

    Probabilistic Modeling Paradigms for Audio Source Separation

    Get PDF
    This is the author's final version of the article, first published as E. Vincent, M. G. Jafari, S. A. Abdallah, M. D. Plumbley, M. E. Davies. Probabilistic Modeling Paradigms for Audio Source Separation. In W. Wang (Ed), Machine Audition: Principles, Algorithms and Systems. Chapter 7, pp. 162-185. IGI Global, 2011. ISBN 978-1-61520-919-4. DOI: 10.4018/978-1-61520-919-4.ch007file: VincentJafariAbdallahPD11-probabilistic.pdf:v\VincentJafariAbdallahPD11-probabilistic.pdf:PDF owner: markp timestamp: 2011.02.04file: VincentJafariAbdallahPD11-probabilistic.pdf:v\VincentJafariAbdallahPD11-probabilistic.pdf:PDF owner: markp timestamp: 2011.02.04Most sound scenes result from the superposition of several sources, which can be separately perceived and analyzed by human listeners. Source separation aims to provide machine listeners with similar skills by extracting the sounds of individual sources from a given scene. Existing separation systems operate either by emulating the human auditory system or by inferring the parameters of probabilistic sound models. In this chapter, the authors focus on the latter approach and provide a joint overview of established and recent models, including independent component analysis, local time-frequency models and spectral template-based models. They show that most models are instances of one of the following two general paradigms: linear modeling or variance modeling. They compare the merits of either paradigm and report objective performance figures. They also,conclude by discussing promising combinations of probabilistic priors and inference algorithms that could form the basis of future state-of-the-art systems

    SZ and CMB reconstruction using Generalized Morphological Component Analysis

    Full text link
    In the last decade, the study of cosmic microwave background (CMB) data has become one of the most powerful tools to study and understand the Universe. More precisely, measuring the CMB power spectrum leads to the estimation of most cosmological parameters. Nevertheless, accessing such precious physical information requires extracting several different astrophysical components from the data. Recovering those astrophysical sources (CMB, Sunyaev-Zel'dovich clusters, galactic dust) thus amounts to a component separation problem which has already led to an intense activity in the field of CMB studies. In this paper, we introduce a new sparsity-based component separation method coined Generalized Morphological Component Analysis (GMCA). The GMCA approach is formulated in a Bayesian maximum a posteriori (MAP) framework. Numerical results show that this new source recovery technique performs well compared to state-of-the-art component separation methods already applied to CMB data.Comment: 11 pages - Statistical Methodology - Special Issue on Astrostatistics - in pres

    Semi-blind Bayesian inference of CMB map and power spectrum

    Full text link
    We present a new blind formulation of the Cosmic Microwave Background (CMB) inference problem. The approach relies on a phenomenological model of the multi-frequency microwave sky without the need for physical models of the individual components. For all-sky and high resolution data, it unifies parts of the analysis that have previously been treated separately, such as component separation and power spectrum inference. We describe an efficient sampling scheme that fully explores the component separation uncertainties on the inferred CMB products such as maps and/or power spectra. External information about individual components can be incorporated as a prior giving a flexible way to progressively and continuously introduce physical component separation from a maximally blind approach. We connect our Bayesian formalism to existing approaches such as Commander, SMICA and ILC, and discuss possible future extensions.Comment: 11 pages, 9 figure

    Wavelet Domain Image Separation

    Full text link
    In this paper, we consider the problem of blind signal and image separation using a sparse representation of the images in the wavelet domain. We consider the problem in a Bayesian estimation framework using the fact that the distribution of the wavelet coefficients of real world images can naturally be modeled by an exponential power probability density function. The Bayesian approach which has been used with success in blind source separation gives also the possibility of including any prior information we may have on the mixing matrix elements as well as on the hyperparameters (parameters of the prior laws of the noise and the sources). We consider two cases: first the case where the wavelet coefficients are assumed to be i.i.d. and second the case where we model the correlation between the coefficients of two adjacent scales by a first order Markov chain. This paper only reports on the first case, the second case results will be reported in a near future. The estimation computations are done via a Monte Carlo Markov Chain (MCMC) procedure. Some simulations show the performances of the proposed method. Keywords: Blind source separation, wavelets, Bayesian estimation, MCMC Hasting-Metropolis algorithm.Comment: Presented at MaxEnt2002, the 22nd International Workshop on Bayesian and Maximum Entropy methods (Aug. 3-9, 2002, Moscow, Idaho, USA). To appear in Proceedings of American Institute of Physic
    • …
    corecore