Thesis (M.S.) -- Mississippi State University. Department of Computer Science and Engineering. / Title from title screen. Includes bibliographical references.

Thesis (Ph.D.)--Albert-Ludwigs-Universität Freiburg im Breisgau, 2006. / DatabaseEbrary. EAN: 9781586036744. Includes bibliographical references (p. 201-221) and index.

Thesis (MEng)--University of Stellenbosch, 2000. / ENGLISH ABSTRACT: Handwritten signature verification (HSV) is the process through which handwritten signatures are analysed in an attempt to determine whether the person who made the signature is who he claims to be. Banks and other financial institutions lose billions of rands annually to cheque fraud and other crimes that are preventable with the aid of good signature verification techniques. Unfortunately, the volume of cheques that are processed precludes a thorough HSV process done in the traditional manner by human operators. It is the aim of this research to investigate new methods to compare signatures automatically, to eventually speed up the HSV process and improve on the accuracy of existing systems. The new technology that is investigated is the use of the so-called hidden Markov models (HMMs). It is only quite recently that the computing power has become commonly available to make the real-time use of HMMs in pattern recognition a possibility. Two demonstration programs, SigGrab and Securitlheque, have been developed that make use of this technology, and show excellent improvements over other techniques and competing products. HSV accuracies in excess of99% can be attained. / AFRIKAANSE OPSOMMING: Handgeskrewe handtekening verifikasie (HHV) is die proses waardeur handgeskrewe handtekeninge ondersoek word in 'n poging om te bevestig of die persoon wat die handtekening gemaak het werklik is wie hy voorgee om te wees. Banke en ander finansiele instansies verloor jaarliks biljoene rande aan tjekbedrog en ander misdrywe wat voorkom sou kon word indien goeie metodes van handtekening verifikasie daargestel kon word. Ongelukkig is die volume van tjeks wat hanteer word so groot, dat tradisionele HHV deur menslike operateurs 'n onbegonne taak is. Dit is die doel van hierdie navorsmg om nuwe metodes te ondersoek om handtekeninge outomaties te kan vergelyk en so die HHV proses te bespoedig en ook te verbeter op die akkuraatheid van bestaande stelsels. Die nuwe tegnologie wat ondersoek is is die gebruik van die sogenaamde verskuilde Markov modelle (VMMs). Dit is eers redelik onlangs dat die rekenaar verwerkingskrag algemeen beskikbaar geraak het om die intydse gebruik van VMMs in patroonherkenning prakties moontlik te maak. Twee demonstrasieprogramme, SigGrab en SecuriCheque, is ontwikkel wat gebruik maak van hierdie tegnologie en toon uitstekende verbeterings teenoor ander tegnieke en kompeterende produkte. 'n Akkuraatheid van 99% of hoer word tipies verkry.

Thesis (MScEng)--Stellenbosch University, 2002. / Some digitised pages may appear illegible due to the condition of the original hard copy. / ENGLISH ABSTRACT: Speaker recognition systems have evolved to a point where near perfect performance can be obtained under ideal conditions, even if the system must distinguish between a large number of speakers. Under adverse conditions, such as when high noise levels are present or when the transmission channel deforms the speech, the performance is often less than satisfying. This project investigated the performance of a popular speaker recognition system, that use Gaussian mixture models, on speech transmitted over a high frequency channel. Initial experiments demonstrated very unsatisfactory results for the base line system. We investigated a number of robust techniques. We implemented and applied some of them in an attempt to improve the performance of the speaker recognition systems. The techniques we tested showed only slight improvements. We also investigates the effects of a high frequency channel and single sideband modulation on the speech features of speech processing systems. The effects that can deform the features, and therefore reduce the performance of speech systems, were identified. One of the effects that can greatly affect the performance of a speech processing system is noise. We investigated some speech enhancement techniques and as a result we developed a new statistical based speech enhancement technique that employs hidden Markov models to represent the clean speech process. / AFRIKAANSE OPSOMMING: Sprekerherkenning-stelsels het 'n punt bereik waar nabyaan perfekte resultate verwag kan word onder ideale kondisies, selfs al moet die stelsel tussen 'n groot aantal sprekers onderskei. Wanneer nie-ideale kondisies, soos byvoorbeeld hoë ruisvlakke of 'n transmissie kanaal wat die spraak vervorm, teenwoordig is, is die resultate gewoonlik nie bevredigend nie. Die projek ondersoek die werksverrigting van 'n gewilde sprekerherkenning-stelsel, wat gebruik maak van Gaussiese mengselmodelle, op spraak wat oor 'n hoë frekwensie transmissie kanaal gestuur is. Aanvanklike eksperimente wat gebruik maak van 'n basiese stelsel het nie goeie resultate opgelewer nie. Ons het 'n aantal robuuste tegnieke ondersoek en 'n paar van hulle geïmplementeer en getoets in 'n poging om die resultate van die sprekerherkenning-stelsel te verbeter. Die tegnieke wat ons getoets het, het net geringe verbetering getoon. Die studie het ook die effekte wat die hoë-frekwensie kanaal en enkel-syband modulasie op spraak kenmerkvektore, ondersoek. Die effekte wat die spraak kenmerkvektore kan vervorm en dus die werkverrigting van spraak stelsels kan verlaag, is geïdentifiseer. Een van die effekte wat 'n groot invloed op die werkverrigting van spraakstelsels het, is ruis. Ons het spraak verbeterings metodes ondersoek en dit het gelei tot die ontwikkeling van 'n statisties gebaseerde spraak verbeteringstegniek wat gebruik maak van verskuilde Markov modelle om die skoon spraakproses voor te stel.

Thesis (MScEng)--University of Stellenbosch, 2003. / ENGLISH ABSTRACT: Handwritten signatures are provided extensively to verify identity for all types of transactions and documents. However, they are very rarely actually verified. This is because of the high cost of training and employing enough human operators (who are still fallible) to cope with the demand. They are a very well known, yet under-utilised biometric currently performing far below their potential. We present an on-line/dynamic handwritten signature verification system based on Hidden Markov Models, that far out performs human operators in both accuracy and speed. It uses only the local signature features-sampled from an electronic writing tablet-after some novel preprocessing steps, and is a fully automated system in that there are no parameters that need to be manually fine-tuned for different users. Novel verifiers are investigated which attain best equal error rates of between 2% and 5% for different types of high quality deliberate forgeries, and take a fraction of a second to accept or reject an identity claim on a 700 MHz computer. / AFRIKAANSE OPSOMMING: Geskrewe handtekeninge word gereeld gebruik om die identiteit van dokumente en transaksies te bevestig. Aangesien dit duur is in terme van menslike hulpbronne, word die integrit eit daarvan selde nagegaan. Om handtekeninge deur menslike operateurs te verifieër. is ook feilbaar-lOO% akkurate identifikasie is onrealisties. Handtekeninge is uiters akkurate en unieke identifikasie patrone wat in die praktyk nie naastenby tot hul volle potensiaal gebruik word nie. In hierdie navorsing gebruik ons verskuilde Markov modelle om dinamiese handtekeningherkenningstelsels te ontwikkel wat, in terme van spoed en akkuraatheid heelwat meer effektief as operateurs is. Die stelsel maak gebruik van slegs lokale handtekening eienskappe (en verwerkings daarvan) soos wat dit verkry word vanaf 'n elektroniese skryftablet. Die stelsel is ten volle outomaties en geen parameters hoef aangepas te word vir verskillende gebruikers nie. 'n Paar tipes nuwe handtekeningverifieërders word ondersoek en die resulterende gelykbreekpunt vir vals-aanvaardings- en vals-verwerpingsfoute lê tussen 2% en 5% vir verskillende tipes hoë kwaliteit vervalsde handtekeninge. Op 'n tipiese 700 MHz verwerker word die identiteit van 'n persoon ill minder as i sekonde bevestig.

We are concerned with the quantum inverse scattering problem. The corresponding Marchenko integral equation is solved by using the collocation method together with piece-wise polynomials, namely, Hermite splines. The scarcity of experimental data and the lack of phase information necessitate the generation of the input reflection coefficient by choosing a specific profile and then applying our method to reconstruct it. Various aspects of the single and coupled channels inverse problem and details about the numerical techniques employed are discussed. We proceed to apply our approach to synthetic seismic reflection data. The transformation of the classical one-dimensional wave equation for elastic displacement into a Schr¨odinger-like equation is presented. As an application of our method, we consider the synthetic reflection travel-time data for a layered substrate from which we recover the seismic impedance of the medium. We also apply our approach to experimental seismic reflection data collected from a deep water location in the North sea. The reflectivity sequence and the relevant seismic wavelet are extracted from the seismic reflection data by applying the statistical estimation procedure known as Markov Chain Monte Carlo method to the problem of blind deconvolution. In order to implement the Marchenko inversion method, the pure spike trains have been replaced by amplitudes having a narrow bell-shaped form to facilitate the numerical solution of the Marchenko integral equation from which the underlying seismic impedance profile of the medium is obtained. / Physics / D.Phil.(Physics)

Orientador: Rafael Santos Mendes / Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecânica / Made available in DSpace on 2018-08-18T03:24:20Z (GMT). No. of bitstreams: 1 Prado_Daniel_M.pdf: 1023728 bytes, checksum: 9342e53e6ff7f169478722c6bcd70fc0 (MD5) Previous issue date: 2011 / Resumo: Este projeto tem por objetivo estudar um problema de projeto para realizar o handoff vertical entre canais de comunicação GPRS e Satélite em um cenário que otimize o tempo e o custo através de equações probabilísticas. Através de um modelo de estados que descreve as diferentes possibilidades de comunicação entre sistemas GPRS e Satélite, o objetivo é determinar os tempos dos eventos controláveis que fazem a mudança entre os estados de modo a otimizar o tempo de comunicação num cenário probabilístico de handoff vertical entre canais de comunicação. Os resultados das simulações realizadas nesta dissertação em diferentes situações de qualidade dos sinais de transmissão GPRS e Satélite, mostram que através dos algoritmos de handoff desenvolvidos, a probabilidade estacionária de permanência nos estados de transmissão é aumentada / Abstract: This project aims to study a design problem to carry-out the handoff vertical of communication between communication channels GPRS and Satellite in a scenario that optimizes time and cost by probabilistic equations. Through a state model that describes the different possibilities of communication between GPRS and satellite systems, the goal is to set the times of the controllable events that do the changes between states in order to optimize the communication time in a probabilistic scenario of handoff vertical for communication channels. The results of the simulations in this work in different situations, quality of transmission signals GPRS and Satellite, show that through the handoff algorithms developed, the stationary probability of staying in the states of transmission is increased / Mestrado / Eletrônica / Mestre em Engenharia Automobilistica

Orientador: Jose Claudio Geromel / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-06T08:10:58Z (GMT). No. of bitstreams: 1 Goncalves_AlimPedrodeCastro_M.pdf: 293253 bytes, checksum: 4365f5ae19ae33e8d97053c2c57ad15d (MD5) Previous issue date: 2006 / Resumo: Este trabalho aborda alguns dos aspectos mais relevantes relacionados à estabilidade e norma H2 de sistemas lineares discretos sujeitos a saltos markovianos, bem como as estratégias para a síntese de controle por realimentação de estado. A maior contribuição apresentada é um método para calcular os ganhos de realimentação de estado sem a necessidade de observar, em cada instante, todos os estados da cadeia de Markov / Abstract: This work discusses some of the most relevant aspects of stability and H2 norm of discrete-time markov jump linear systems, as well as a method for state feedback contraI design. Our major contribution is on the definition of a procedure to determine the state feedback gains without the complete knowledge, at each instant of time, of the Markov chain state / Mestrado / Automação / Mestre em Engenharia Elétrica

Orientador: João Bosco Ribeiro do Val / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-07T09:08:47Z (GMT). No. of bitstreams: 1 Arruda_EdilsonFernandesde_D.pdf: 7031418 bytes, checksum: 5dc90e2d3823b0e6bcf659159d183007 (MD5) Previous issue date: 2006 / Resumo: Apresenta-se um modelo de controle por intervenções para o problema de produção e estoque de vários itens, com diversos estágios de produção. Este problema pode ser solucionado via programação dinâmica discreta (PD) por um operador de custo descontado. Para contornar a dificuldade de obtenção da solução ótima via PD ao se considerar um número razoável de classes de itens e suas etapas de produção, esta tese desenvolve-se em duas linhas. A primeira delas consiste em tomar uma noção de estabilidade estocástica no sentido Foster-Lyapunov para caracterizar a família de soluções candidatas a ótima, originando uma classe de políticas que geram um subconjunto de estados que são recorrentes positivos. Dessa forma, é possível propor políticas sub-ótimas que sejam estáveis, e cuja consideração de otimalidade possa ser desenvolvida apenas no subconjunto de estados recorrentes, simplificando a tarefa da PD e focando nos estados mais freqüentados no longo prazo. A segunda linha de abordagem consiste em desenvolver técnicas de PD aproximada para o problema, através de uma arquitetura de aproximação fixa aplicada a um subconjunto amostra do espaço de estados. Um avanço analítico é alcançado por observar como uma arquitetura de aproximação pode capturar adequadamente a função valor do problema, vista como uma projeção da função valor na arquitetura. Condições para que um algoritmo de PD aproximada convirja para essa projeção são obtidas. Essas condições são independentes da arquitetura utilizada. Um algoritmo derivado dessa análise é proposto, a partir do monitoramento da variação de passos sucessivos / Abstract: We propose an intervention control model for a multi-product, multi-stage, single machine production and storage problem. The optimal policy is obtained by means of discrete dynamic programming (DP), through a discounted cost contraction mapping. In order to overcome the difficulty of obtaining the optimal solution for problems with a reasonable number of products and production stages, we take two different approaches. The first one consists in using a notion of stochastic stability in the Foster-Lyapunov sense to characterize the candidate policies, thus originating a class of policies that induce a subset of positive recurrent states. Therefore, one can propose suboptimal policies that are stable and seek optimality only in the subset of recurrent states, in such a way that simplifies the DP task and focuses on the states which are visited more frequently in the long run. The second approach consists in developing approximate dynamic programming techniques for the problem, by means of a fixed approximation architecture applied to a sample subset of the state space. A novel result is obtained by observing how an approximation architecture can adequately capture the value function of the problem, which is viewed as a projection of the value function into the architecture. We obtain conditions for an approximate DP algorithm to converge to this projection. These conditions are architecture independent. An algorithm derived from this analysis is proposed that monitors the variation between successive iterates / Doutorado / Automação e Controle / Doutor em Engenharia Elétrica

Orientador: João Bosco Ribeiro do Val / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-13T17:57:42Z (GMT). No. of bitstreams: 1 Furloni_Walter_M.pdf: 917619 bytes, checksum: 10cdfc1afdfa09f1573d3e30d14415c4 (MD5) Previous issue date: 2009 / Resumo: O objetivo deste trabalho é propor e resolver o problema de controle em horizonte finito com restrições de Sistemas Lineares Discretos com Saltos Markovianos (SLDSM) na presença de ruído. As restrições dos vetores de estado e de controle não são rígidas e são estabelecidas por valores limites dos seus respectivos primeiro e segundo momentos. O controlador baseia-se numa estrutura de realimentação linear de estados, devendo minimizar uma função custo quadrática. Consideram-se duas situações com respeito à informação disponível da cadeia de Markov associada: num primeiro caso o estado da cadeia de Markov é conhecido em cada instante e num segundo caso dispõe-se apenas de sua distribuição probabilística inicial. Uma formulação determinística do problema estocástico é desenvolvida de modo que as condições necessárias de otimalidade propostas e as restrições possam ser facilmente incluídas utilizando-se desigualdades matriciais lineares (do inglês, Linear Matrix Inequalities - LMI). A inclusão de restrições constitui a principal contribuição, uma vez que elas são pertinentes a vários campos de aplicação tais como indústria química, transporte de massa, economia, etc. Para ilustração do método são apresentadas duas aplicações: uma referente à regulação de tráfego em linhas metroviárias e outra referente ao problema de seleção de ativos de portfólios em aplicações financeiras / Abstract: The purpose of this work is to propose and solve the constrained control problem within a finite horizon of Markovian Jump Discrete Linear Systems (MJDLS) driven by noise. The constraints of the state and control vectors are not rigid and limits are established respectively to their first and second moments. The controller is based on a linear state feedback structure and shall minimize a quadratic cost function. Two cases regarding the available information of the Markovian chain states are considered: firstly the Markov chain states are known at each step and secondly only its initial probability distribution is available. A deterministic formulation to the stochastic problem is developped in order that the proposed necessary optimality conditions and the constraints are easily included by using Linear Matrix Inequalities (LMI). The constraints consideration constitutes the main contribution, since they are pertinent to several application fields as for example chemical industry, mass transportation, economy etc. Two applications are presented for ilustration: one refers to metro lines traffic regulation and another refers to the financial investment income control / Mestrado / Automação / Mestre em Engenharia Elétrica