Spelling suggestions: "subject:"subspace 3methods"" "subject:"subspace 4methods""
21 |
FIR System Identification Using Higher Order Cumulants -A Generalized ApproachSrinivas, L 07 1900 (has links)
The thesis presents algorithms based on a linear algebraic solution for the identification of the parameters of the FIR system using only higher order statistics when only the output of the system corrupted by additive Gaussian noise is observed.
All the traditional parametric methods of estimating the parameters of the system have been based on the 2nd order statistics of the output of the system. These methods suffer from the deficiency that they do not preserve the phase response of the system and hence cannot identify non-minimum phase systems. To circumvent this problem, higher order statistics which preserve the phase characteristics of a process and hence are able to identify a non-minimum phase system and also are insensitive to additive Gaussian noise have been used in recent years.
Existing algorithms for the identification of the FIR parameters based on the higher order cumulants use the autocorrelation sequence as well and give erroneous results in the presence of additive colored Gaussian noise. This problem can be overcome by obtaining algorithms which do not utilize the 2nd order statistics.
An existing relationship between the 2nd order and any Ith order cumulants is generalized to a relationship between any two arbitrary k, Ith order cumulants. This new relationship is used to obtain new algorithms for FIR system identification which use only cumulants of order > 2 and with no other restriction than the Gaussian nature of the additive noise sequence. Simulation studies are presented to demonstrate the failure of the existing algorithms when the imposed constraints on the 2nd order statistics of the additive noise are violated while the proposed algorithms perform very well and give consistent results.
Recently, a new algebraic approach for parameter estimation method denoted the Linear Combination of Slices (LCS) method was proposed and was based on expressing the FIR parameters as a linear combination of the cumulant slices. The rank deficient cumulant matrix S formed in the LCS method can be expressed as a product of matrices which have a certain structure. The orthogonality property of the subspace orthogonal to S and the range space of S has been exploited to obtain a new class of algorithms for the estimation of the parameters of a FIR system. Numerical simulation studies have been carried out to demonstrate the good behaviour of the proposed algorithms.
Analytical expressions for the covariance of the estimates of the FIR parameters of the different algorithms presented in the thesis have been obtained and numerical comparison has been done for specific cases.
Numerical examples to demonstrate the application of the proposed algorithms for channel equalization in data communication and as an initial solution to the cumulant matching nonlinear optimization methods have been presented.
|
22 |
Automatic target recognition using passive bistatic radar signals.Pisane, Jonathan 04 April 2013 (has links) (PDF)
We present the design, development, and test of three novel, distinct automatic target recognition (ATR) systems for the recognition of airplanes and, more specifically, non-cooperative airplanes, i.e. airplanes that do not provide information when interrogated, in the framework of passive bistatic radar systems. Passive bistatic radar systems use one or more illuminators of opportunity (already present in the field), with frequencies up to 1 GHz for the transmitter part of the systems considered here, and one or more receivers, deployed by the persons managing the system, and not co-located with the transmitters. The sole source of information are the signal scattered on the airplane and the direct-path signal that are collected by the receiver, some basic knowledge about the transmitter, and the geometrical bistatic radar configuration. The three distinct ATR systems that we built respectively use the radar images, the bistatic complex radar cross-section (BS-RCS), and the bistatic radar cross-section (BS-RCS) of the targets. We use data acquired either on scale models of airplanes placed in an anechoic, electromagnetic chamber or on real-size airplanes using a bistatic testbed consisting of a VOR transmitter and a software-defined radio (SDR) receiver, located near Orly airport, France. We describe the radar phenomenology pertinent for the problem at hand, as well as the mathematical underpinnings of the derivation of the bistatic RCS values and of the construction of the radar images.For the classification of the observed targets into pre-defined classes, we use either extremely randomized trees or subspace methods. A key feature of our approach is that we break the recognition problem into a set of sub-problems by decomposing the parameter space, which consists of the frequency, the polarization, the aspect angle, and the bistatic angle, into regions. We build one recognizer for each region. We first validate the extra-trees method on the radar images of the MSTAR dataset, featuring ground vehicles. We then test the method on the images of the airplanes constructed from data acquired in the anechoic chamber, achieving a probability of correct recognition up to 0.99.We test the subspace methods on the BS-CRCS and on the BS-RCS of the airplanes extracted from the data acquired in the anechoic chamber, achieving a probability of correct recognition up to 0.98, with variations according to the frequency band, the polarization, the sector of aspect angle, the sector of bistatic angle, and the number of (Tx,Rx) pairs used. The ATR system deployed in the field gives a probability of correct recognition of $0.82$, with variations according to the sector of aspect angle and the sector of bistatic angle.
|
23 |
Uma formulação implícita para o método Smoothed Particle Hydrodynamics / An implicit formulation for the Smoothed Particle Hydrodynamics MethodRicardo Dias dos Santos 17 February 2014 (has links)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Em uma grande gama de problemas físicos, governados por equações diferenciais, muitas
vezes é de interesse obter-se soluções para o regime transiente e, portanto, deve-se empregar
técnicas de integração temporal. Uma primeira possibilidade seria a de aplicar-se métodos
explícitos, devido à sua simplicidade e eficiência computacional. Entretanto, esses métodos frequentemente
são somente condicionalmente estáveis e estão sujeitos a severas restrições na
escolha do passo no tempo. Para problemas advectivos, governados por equações hiperbólicas,
esta restrição é conhecida como a condição de Courant-Friedrichs-Lewy (CFL). Quando temse
a necessidade de obter soluções numéricas para grandes períodos de tempo, ou quando o
custo computacional a cada passo é elevado, esta condição torna-se um empecilho. A fim de
contornar esta restrição, métodos implícitos, que são geralmente incondicionalmente estáveis,
são utilizados. Neste trabalho, foram aplicadas algumas formulações implícitas para a integração
temporal no método Smoothed Particle Hydrodynamics (SPH) de modo a possibilitar o uso
de maiores incrementos de tempo e uma forte estabilidade no processo de marcha temporal.
Devido ao alto custo computacional exigido pela busca das partículas a cada passo no tempo,
esta implementação só será viável se forem aplicados algoritmos eficientes para o tipo de estrutura
matricial considerada, tais como os métodos do subespaço de Krylov. Portanto, fez-se um
estudo para a escolha apropriada dos métodos que mais se adequavam a este problema, sendo
os escolhidos os métodos Bi-Conjugate Gradient (BiCG), o Bi-Conjugate Gradient Stabilized
(BiCGSTAB) e o Quasi-Minimal Residual (QMR). Alguns problemas testes foram utilizados a
fim de validar as soluções numéricas obtidas com a versão implícita do método SPH. / In a wide range of physical problems governed by differential equations, it is often of
interest to obtain solutions for the unsteady state and therefore it must be employed temporal
integration techniques. One possibility could be the use of an explicit methods due to its
simplicity and computational efficiency. However, these methods are often only conditionally
stable and are subject to severe restrictions for the time step choice. For advective problems
governed by hyperbolic equations, this restriction is known as the Courant-Friedrichs-Lewy
(CFL) condition. When there is the need to obtain numerical solutions for long periods of time,
or when the computational cost for each time step is high, this condition becomes a handicap.
In order to overcome this restriction implicit methods can be used, which are generally unconditionally
stable. In this study, some implicit formulations for time integration are used in the
Smoothed Particle Hydrodynamics (SPH) method to enable the use of larger time increments
and obtain a strong stability in the time evolution process. Due to the high computational cost
required by the particles tracking at each time step, the implementation will be feasible only if
efficient algorithms were applied for this type of matrix structure such as Krylov subspace methods.
Therefore, we carried out a study for the appropriate choice of methods best suited to this
problem, and the methods chosen were the Bi-Conjugate Gradient (BiCG), the Bi-Conjugate
Gradient Stabilized (BiCGSTAB) and the Quasi-Minimal Residual(QMR). Some test problems
were used to validate the numerical solutions obtained with the implicit version of the SPH
method.
|
24 |
Uma formulação implícita para o método Smoothed Particle Hydrodynamics / An implicit formulation for the Smoothed Particle Hydrodynamics MethodRicardo Dias dos Santos 17 February 2014 (has links)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Em uma grande gama de problemas físicos, governados por equações diferenciais, muitas
vezes é de interesse obter-se soluções para o regime transiente e, portanto, deve-se empregar
técnicas de integração temporal. Uma primeira possibilidade seria a de aplicar-se métodos
explícitos, devido à sua simplicidade e eficiência computacional. Entretanto, esses métodos frequentemente
são somente condicionalmente estáveis e estão sujeitos a severas restrições na
escolha do passo no tempo. Para problemas advectivos, governados por equações hiperbólicas,
esta restrição é conhecida como a condição de Courant-Friedrichs-Lewy (CFL). Quando temse
a necessidade de obter soluções numéricas para grandes períodos de tempo, ou quando o
custo computacional a cada passo é elevado, esta condição torna-se um empecilho. A fim de
contornar esta restrição, métodos implícitos, que são geralmente incondicionalmente estáveis,
são utilizados. Neste trabalho, foram aplicadas algumas formulações implícitas para a integração
temporal no método Smoothed Particle Hydrodynamics (SPH) de modo a possibilitar o uso
de maiores incrementos de tempo e uma forte estabilidade no processo de marcha temporal.
Devido ao alto custo computacional exigido pela busca das partículas a cada passo no tempo,
esta implementação só será viável se forem aplicados algoritmos eficientes para o tipo de estrutura
matricial considerada, tais como os métodos do subespaço de Krylov. Portanto, fez-se um
estudo para a escolha apropriada dos métodos que mais se adequavam a este problema, sendo
os escolhidos os métodos Bi-Conjugate Gradient (BiCG), o Bi-Conjugate Gradient Stabilized
(BiCGSTAB) e o Quasi-Minimal Residual (QMR). Alguns problemas testes foram utilizados a
fim de validar as soluções numéricas obtidas com a versão implícita do método SPH. / In a wide range of physical problems governed by differential equations, it is often of
interest to obtain solutions for the unsteady state and therefore it must be employed temporal
integration techniques. One possibility could be the use of an explicit methods due to its
simplicity and computational efficiency. However, these methods are often only conditionally
stable and are subject to severe restrictions for the time step choice. For advective problems
governed by hyperbolic equations, this restriction is known as the Courant-Friedrichs-Lewy
(CFL) condition. When there is the need to obtain numerical solutions for long periods of time,
or when the computational cost for each time step is high, this condition becomes a handicap.
In order to overcome this restriction implicit methods can be used, which are generally unconditionally
stable. In this study, some implicit formulations for time integration are used in the
Smoothed Particle Hydrodynamics (SPH) method to enable the use of larger time increments
and obtain a strong stability in the time evolution process. Due to the high computational cost
required by the particles tracking at each time step, the implementation will be feasible only if
efficient algorithms were applied for this type of matrix structure such as Krylov subspace methods.
Therefore, we carried out a study for the appropriate choice of methods best suited to this
problem, and the methods chosen were the Bi-Conjugate Gradient (BiCG), the Bi-Conjugate
Gradient Stabilized (BiCGSTAB) and the Quasi-Minimal Residual(QMR). Some test problems
were used to validate the numerical solutions obtained with the implicit version of the SPH
method.
|
25 |
[pt] AVALIAÇÃO DE DESEMPENHO DE SOLVERS LINEARES PARA SIMULADORES DE RESERVATÓRIO COM FORMULAÇÃO TOTALMENTE IMPLÍCITA / [en] PERFORMANCE ASSESSMENT OF LINEAR SOLVERS FOR FULLY IMPLICIT RESERVOIR SIMULATIONRALPH ENGEL PIAZZA 09 December 2021 (has links)
[pt] Companhias de petróleo investindo no desenvolvimento de campos de hidrocarboneto dependem de estudos de reservatórios para realizarem previsões de produção e quantificarem os riscos associados à economicidade dos projetos. Neste sentido, a área de modelagem de reservatórios é de suma importância, sendo responsável por prever o desempenho futuro do reservatório sob diversas condições operacionais. Considerando que a solução dos sistemas de equações construídos a cada passo de tempo de uma simulação, durante o ciclo de linearização, é a parte que apresenta a maior demanda computacional, esta dissertação foca na análise de diferentes técnicas de solvers numéricos que podem ser aplicadas a simuladores, para mensurar seus desempenhos. Os solvers numéricos mais adequados para a solução de grandes sistemas de equações, tais como os encontrados em simulações de reservatórios, são os denominados solvers iterativos, que gradativamente aproximam a solução de um dado problema por meio da combinação de um método iterativo e um precondicionador. Os métodos iterativos avaliados nesta pesquisa foram o Gradiente Biconjugado Estabilizado (BiCGSTAB), Mínimos Resíduos Generalizado (GMRES) e Minimização Ortogonal (ORTHOMIN). Além disso, três técnicas de precondicionamento foram implementadas para auxiliar os métodos iterativos, sendo estas a Decomposição LU Incompleta (ILU), Fatoração Aninhada (NF) e Pressão Residual Restrita (CPR). A combinação destes diferentes métodos iterativos e precondicionadores permite a avaliação de diversas configurações distintas de solvers, em termos de seus desempenhos em um simulador. Os testes numéricos conduzidos neste trabalho utilizaram um novo simulador de reservatórios que está sendo desenvolvido pela Pontifícia Universidade Católica (PUC-Rio) em conjunto com a Petrobras. O objetivo dos testes foi analisar a robustez e eficiência de cada um dos solvers quanto à sua capacidade de resolver as equações de escoamento multifásico no meio poroso, visando assim auxiliar na seleção do solver mais adequado para o simulador. / [en] Petroleum companies investing in the development of hydrocarbon fields rely upon a variety of reservoir studies to perform production forecasts and quantify the risks associated with the economics of their projects. Integral to these studies is the discipline of reservoir modeling, responsible for predicting future reservoir performance under various operational conditions. Considering that the most time-demanding aspect of reservoir simulations is the solution of the systems of equations that arise within the linearization cycles at each time-step, this research focuses on analyzing different numerical solver techniques to be applied to a simulator, in order to assess their performance. The numerical solvers most suited for the solution of very large systems of equations, such as those encountered in reservoir simulations, are the so-called iterative solvers, which gradually approach the solution to a problem by combining an iterative strategy with a preconditioning method. The iterative methods examined in this research were the Stabilized Biconjugate Gradient (BiCGSTAB), the Generalized Minimum Residual (GMRES), and the Orthogonal Minimization (ORTHOMIN) methods. Furthermore, three preconditioning techniques were implemented to aid the iterative methods, namely the Incomplete LU Factorization (ILU), the Nested Factorization (NF), and the Constrained Pressure Residual (CPR) methods. The combination of these different iterative methods and preconditioners enables the appraisal of several distinct solver configurations, in terms of their performance in a simulator. The numerical tests conducted in this work made use of a new reservoir simulator currently under development at Pontifical Catholic University of Rio de Janeiro (PUC-Rio), as part of a joint project with Petrobras. The objective of these tests was to assess the robustness and efficiency of each solver in the solution of the multiphase flow equations in porous media, and support the selection of the solver most suited for the simulator.
|
26 |
Automatic target recognition using passive bistatic radar signals. / Reconnaissance automatique de cibles par utilisation de signaux de radars passifs bistatiquesPisane, Jonathan 04 April 2013 (has links)
Dans cette thèse, nous présentons la conception, le développement et le test de trois systèmes de reconnaissance automatique de cibles (ATR) visant à reconnaître des avions non-coopératifs, c’est-à-dire des avions ne fournissant par leur identité, en utilisant des signaux de radars passifs bistatiques. Les radars passifs bistatiques utilisent un ou plusieurs émetteurs d’opportunité (déjà présents sur le terrain), avec des fréquences allant jusqu’à 1 GHz pour les émetteurs considérés ici, et un ou plusieurs récepteurs déployés par le gestionnaire du système et non-colocalisés avec les émetteurs. Les seules informations utilisées sont les signaux réfléchis sur les avions et les signaux directement reçus qui sont tous les deux collectés par le récepteur, quelques informations concernant l’émetteur, et la configuration géométrique du radar bistatique.Les trois systèmes ATR que nous avons construits utilisent respectivement les images radar, les surfaces équivalentes radar (SER) complexes bistatiques et les SER réelles bistatiques. Nous utilisons des données acquises soit sur des modèles d’avions placés en chambre anéchoique à l’ONERA, soit sur des avions réels en utilisant un banc d’essai bistatique consistant en un émetteur VOR et un récepteur basé sur la radio-logicielle (SDR), et que nous avons déployé aux alentours de l’aéroport d’Orly. Nous décrivons d’abord la phénoménologie radar pertinente pour notre problème ainsi que les fondements mathématiques pour la dérivation de la SER bistatique d’un objet, et pour la construction d’images radar d’un objet.Nous utilisons deux méthodes pour la classification de cibles en classes prédéfinies : les arbres extrêmement aléatoires (extra-trees) et les méthodes de sous-espaces. Une caractéristique-clé de notre approche est que nous divisons le problème de reconnaissance global en un ensemble de sous-problèmes par décomposition de l’espace des paramètres (fréquence, polarisation, angle d’aspect et angle bistatique) en régions. Nous construisons un classificateur par région.Nous validons en premier lieu la méthode des extra-trees sur la base de données MSTAR, composée d’images radar de véhicules terrestres. Ensuite, nous testons cette méthode sur des images radar d’avions que nous avons construites à partir des données acquises en chambre anéchoique. Nous obtenons un pourcentage de classification allant jusqu’à 99%. Nous testons ensuite la méthode de sous-espaces sur les SER bistatiques (complexes et réelles) des avions que nous avons extraits des données de chambre anéchoique. Nous obtenons un pourcentage de classification allant jusqu’à 98%, avec des variations suivant la fréquence, la polarisation, l’angle d’aspect, l’angle bistatique et le nombre de paires émetteur-récepteur utilisées. Nous testons enfin la méthode de sous-espaces sur les SER bistatiques (réelles) extraites des signaux acquis par le banc d’essai déployé à Orly. Nous obtenons une probabilité de classification de 82%, avec des variations suivant l’angle d’aspect et l’angle bistatique. On a donc démontré dans cette thèse que l’on peut reconnaitre des cibles aériennes à partir de leur SER acquise en utilisant des signaux de radars passifs bistatiques. / We present the design, development, and test of three novel, distinct automatic target recognition (ATR) systems for the recognition of airplanes and, more specifically, non-cooperative airplanes, i.e. airplanes that do not provide information when interrogated, in the framework of passive bistatic radar systems. Passive bistatic radar systems use one or more illuminators of opportunity (already present in the field), with frequencies up to 1 GHz for the transmitter part of the systems considered here, and one or more receivers, deployed by the persons managing the system, and not co-located with the transmitters. The sole source of information are the signal scattered on the airplane and the direct-path signal that are collected by the receiver, some basic knowledge about the transmitter, and the geometrical bistatic radar configuration. The three distinct ATR systems that we built respectively use the radar images, the bistatic complex radar cross-section (BS-RCS), and the bistatic radar cross-section (BS-RCS) of the targets. We use data acquired either on scale models of airplanes placed in an anechoic, electromagnetic chamber or on real-size airplanes using a bistatic testbed consisting of a VOR transmitter and a software-defined radio (SDR) receiver, located near Orly airport, France. We describe the radar phenomenology pertinent for the problem at hand, as well as the mathematical underpinnings of the derivation of the bistatic RCS values and of the construction of the radar images.For the classification of the observed targets into pre-defined classes, we use either extremely randomized trees or subspace methods. A key feature of our approach is that we break the recognition problem into a set of sub-problems by decomposing the parameter space, which consists of the frequency, the polarization, the aspect angle, and the bistatic angle, into regions. We build one recognizer for each region. We first validate the extra-trees method on the radar images of the MSTAR dataset, featuring ground vehicles. We then test the method on the images of the airplanes constructed from data acquired in the anechoic chamber, achieving a probability of correct recognition up to 0.99.We test the subspace methods on the BS-CRCS and on the BS-RCS of the airplanes extracted from the data acquired in the anechoic chamber, achieving a probability of correct recognition up to 0.98, with variations according to the frequency band, the polarization, the sector of aspect angle, the sector of bistatic angle, and the number of (Tx,Rx) pairs used. The ATR system deployed in the field gives a probability of correct recognition of $0.82$, with variations according to the sector of aspect angle and the sector of bistatic angle.
|
27 |
Modelagem computacional de dados e controle inteligente no espaço de estado / State space computational data modelling and intelligent controlDel Real Tamariz, Annabell 15 July 2005 (has links)
Orientador: Celso Pascoli Bottura / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-04T18:33:31Z (GMT). No. of bitstreams: 1
DelRealTamariz_Annabell_D.pdf: 5783881 bytes, checksum: 21a1a2e27552398a982a934513988a24 (MD5)
Previous issue date: 2005 / Resumo: Este estudo apresenta contribuições para modelagem computacional de dados multivariáveis no espaço de estado, tanto com sistemas lineares invariantes como com variantes no tempo. Propomos para modelagem determinística-estocástica de dados ruidosos, o Algoritmo MOESP_AOKI. Propomos, utilizando Redes Neurais Recorrentes multicamadas, algoritmos para resolver a Equação Algébrica de Riccati Discreta bem como a Inequação Algébrica de Riccati Discreta, via Desigualdades Matriciais Lineares. Propomos um esquema de controle adaptativo com Escalonamento de Ganhos, baseado em Redes Neurais, para sistemas multivariáveis discretos variantes no tempo, identificados pelo algoritmo MOESP_VAR, também proposto nesta tese. Em síntese, uma estrutura de controle inteligente para sistemas discretos multivariáveis variantes no tempo, através de uma abordagem que pode ser chamada ILPV (Intelligent Linear Parameter Varying), é proposta e implementada. Um controlador LPV Inteligente, para dados computacionalmente modelados pelo algoritmo MOESP_VAR, é concretizado, implementado e testado com bons resultados / Abstract: This study presents contributions for state space multivariable computational data modelling with discrete time invariant as well as with time varying linear systems. A proposal for Deterministic-Estocastica Modelling of noisy data, MOESP_AOKI Algorithm, is made. We present proposals forsolving the Discrete-Time Algebraic Riccati Equation as well as the associate Linear Matrix Inequalityusing a multilayer Recurrent Neural Network approaches. An Intelligent Linear Parameter Varying(ILPV) control approach for multivariable discrete Linear Time Varying (LTV) systems identified bythe MOESP_VAR algorithm, are both proposed. A gain scheduling adaptive control scheme based on neural networks is designed to tune on-line the optimal controllers. In synthesis, an Intelligent Linear Parameter Varying (ILPV) Control approach for multivariable discrete Linear Time Varying Systems (LTV), identified by the algorithm MOESP_VAR, is proposed. This way an Intelligent LPV Control for multivariable data computationally modeled via the MOESP_VAR algorithm is structured, implemented and tested with good results / Doutorado / Automação / Doutor em Engenharia Elétrica
|
Page generated in 0.0486 seconds