Spelling suggestions: "subject:"nonlinear mixtures"" "subject:"onlinear mixtures""
1 |
Proposta de metodos de separação cega de fontes para misturas convolutivas e não-lineares / Proposal of blind source separation methods for convolutive and nonlinear mixturesSuyama, Ricardo 09 August 2018 (has links)
Orientador: João Marcos Travassos Romano / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-09T16:56:34Z (GMT). No. of bitstreams: 1
Suyama_Ricardo_D.pdf: 28793623 bytes, checksum: cf06bdad425402b4624bbd169bfad249 (MD5)
Previous issue date: 2007 / Resumo: O problema de separação cega de fontes (BSS - Blind Source Separation) vem despertando o interesse de um número crescente de pesquisadores. Esse destaque é devido, em grande parte, à formulação abrangente do problema, que torna possível o uso das técnicas desenvolvidas no contexto de BSS nas mais diversas áreas de aplicação. O presente trabalho tem como objetivo propor novos métodos de solução do problema de separação cega de fontes, nos casos de mistura convolutiva e mistura não-linear. Para o primeiro caso propomos um método baseado em predição não-linear, cujo intuito é eliminar o caráter convolutivo da mistura e, dessa forma, separar os sinais utilizando ferramentas bem estabelecidas no contexto de misturas lineares sem memória. No contexto de misturas não-lineares, propomos uma nova metodologia para separação de sinais em um modelo específico de mistura denominado modelo com não-linearidade posterior (PNL - Post Nonlinear ). Com o intuito de minimizar problemas de convergência para mínimos locais no processo de adaptação do sistema separador, o método proposto emprega um algoritmo evolutivo como ferramenta de otimização, e utiliza um estimador de entropia baseado em estatísticas de ordem para avaliar a função custo. A eficácia de ambos os métodos é verificada através de simulações em diferentes cenários / Abstract: The problem of blind source separation (BSS) has attracted the attention of agrowing number of researchers, mostly due to its potential applications in a significant number of different areas. The objective of the present work is to propose new methods to solve the problem of BSS in the cases of convolutive mixtures and nonlinear mixtures. For the first case, we propose a new method based on nonlinear prediction filters. The nonlinear structure is employed to eliminate the convolutive character of the mixture, hence converting the problem into an instantaneous mixture, to which several well established tools may be used to recover the sources. In the context of nonlinear mixtures, we present a new methodology for signal separation in the so-called post-nonlinear mixing models (PNL). In order to avoid convergence to local minima, the proposed method uses an evolutionary algorithm to perform the optimization of the separating system. In addition to that, we employ an entropy estimator based on order-statistics to evaluate the cost function. The effectiveness of both methods is assessed through simulations in different scenarios / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica
|
2 |
Séparation de Sources Dans des Mélanges non-Lineaires / Blind Source Separation in Nonlinear MixturesEhsandoust, Bahram 30 April 2018 (has links)
La séparation aveugle de sources aveugle (BSS) est une technique d’estimation des différents signaux observés au travers de leurs mélanges à l’aide de plusieurs capteurs, lorsque le mélange et les signaux sont inconnus. Bien qu’il ait été démontré mathématiquement que pour des mélanges linéaires, sous des conditions faibles, des sources mutuellement indépendantes peuvent être estimées, il n’existe dans de résultats théoriques généraux dans le cas de mélanges non-linéaires. La littérature sur ce sujet est limitée à des résultats concernant des mélanges non linéaires spécifiques.Dans la présente étude, le problème est abordé en utilisant une nouvelle approche utilisant l’information temporelle des signaux. L’idée originale conduisant à ce résultat, est d’étudier le problème de mélanges linéaires, mais variant dans le temps, déduit du problème non linéaire initial par dérivation. Il est démontré que les contre-exemples déjà présentés, démontrant l’inefficacité de l’analyse par composants indépendants (ACI) pour les mélanges non-linéaires, perdent leur validité, considérant l’indépendance au sens des processus stochastiques, au lieu de l’indépendance au sens des variables aléatoires. Sur la base de cette approche, de bons résultats théoriques et des développements algorithmiques sont fournis. Bien que ces réalisations ne soient pas considérées comme une preuve mathématique de la séparabilité des mélanges non-linéaires, il est démontré que, compte tenu de quelques hypothèses satisfaites dans la plupart des applications pratiques, elles sont séparables.De plus, les BSS non-linéaires pour deux ensembles utiles de signaux sources sont également traités, lorsque les sources sont (1) spatialement parcimonieuses, ou (2) des processus Gaussiens. Des méthodes BSS particulières sont proposées pour ces deux cas, dont chacun a été largement étudié dans la littérature qui correspond à des propriétés réalistes pour de nombreuses applications pratiques.Dans le cas de processus Gaussiens, il est démontré que toutes les applications non-linéaires ne peuvent pas préserver la gaussianité de l’entrée, cependant, si on restreint l’étude aux fonctions polynomiales, la seule fonction préservant le caractère gaussiens des processus (signaux) est la fonction linéaire. Cette idée est utilisée pour proposer un algorithme de linéarisation qui, en cascade par une méthode BSS linéaire classique, sépare les mélanges polynomiaux de processus Gaussiens.En ce qui concerne les sources parcimonieuses, on montre qu’elles constituent des variétés distinctes dans l’espaces des observations et peuvent être séparées une fois que les variétés sont apprises. À cette fin, plusieurs problèmes d’apprentissage multiple ont été généralement étudiés, dont les résultats ne se limitent pas au cadre proposé du SRS et peuvent être utilisés dans d’autres domaines nécessitant un problème similaire. / Blind Source Separation (BSS) is a technique for estimating individual source components from their mixtures at multiple sensors, where the mixing model is unknown. Although it has been mathematically shown that for linear mixtures, under mild conditions, mutually independent sources can be reconstructed up to accepted ambiguities, there is not such theoretical basis for general nonlinear models. This is why there are relatively few results in the literature in this regard in the recent decades, which are focused on specific structured nonlinearities.In the present study, the problem is tackled using a novel approach utilizing temporal information of the signals. The original idea followed in this purpose is to study a linear time-varying source separation problem deduced from the initial nonlinear problem by derivations. It is shown that already-proposed counter-examples showing inefficiency of Independent Component Analysis (ICA) for nonlinear mixtures, loose their validity, considering independence in the sense of stochastic processes instead of simple random variables. Based on this approach, both nice theoretical results and algorithmic developments are provided. Even though these achievements are not claimed to be a mathematical proof for the separability of nonlinear mixtures, it is shown that given a few assumptions, which are satisfied in most practical applications, they are separable.Moreover, nonlinear BSS for two useful sets of source signals is also addressed: (1) spatially sparse sources and (2) Gaussian processes. Distinct BSS methods are proposed for these two cases, each of which has been widely studied in the literature and has been shown to be quite beneficial in modeling many practical applications.Concerning Gaussian processes, it is demonstrated that not all nonlinear mappings can preserve Gaussianity of the input. For example being restricted to polynomial functions, the only Gaussianity-preserving function is linear. This idea is utilized for proposing a linearizing algorithm which, cascaded by a conventional linear BSS method, separates polynomial mixturesof Gaussian processes.Concerning spatially sparse sources, it is shown that spatially sparsesources make manifolds in the observations space, and can be separated once the manifolds are clustered and learned. For this purpose, multiple manifold learning problem has been generally studied, whose results are not limited to the proposed BSS framework and can be employed in other topics requiring a similar issue.
|
Page generated in 0.0623 seconds