• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 26
  • 21
  • 4
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 68
  • 68
  • 19
  • 12
  • 11
  • 11
  • 11
  • 11
  • 11
  • 10
  • 10
  • 9
  • 9
  • 8
  • 8
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
31

CLASSIFICAÇÃO DE PADRÕES ATRAVÉS DE WAVELETS E MÉTODOS BAYESIANOS / PATTERN CLASSIFICATION USING WAVELETS AND BAYESIAN METHODS

Foster, Douglas Camargo 24 March 2011 (has links)
The interest in the pattern classification field has increased due to challenging applications and also due to computational demands, specially when big datasets have to be analyzed. Statistical classification methods, as the based Bayes rules decision theory, apply the parameter estimation from a training dataset for recognizing different classes inside the dataset. In this work it is investigated the contribution of using the discrete wavelet transformation (DWT) for feature extraction during the classification process. From the scale coefficients of different decomposition levels, new training datasets, which are used in Bayesian classifier, are formed. For the one and two dimensional transforms the Daubechies wavelet family is considered. Three specifically wavelet functions are analyzed (Haar, Daubechies Db2 and Db8). Also, a hybrid methodology is proposed, in which 2D and 1D wavelet transformations are applied in consecutive stages of data analysis. For the evaluation of the one dimensional transform methodology, two different unidimensional datasets are used: one is composed by synthetic data, and the other is composed by network traffic data (DARPA1999 dataset). For the evaluation of 2D and hybrid methodologies two-dimensional data are considered. The two-dimensional data are images with different digital pictures with and without using ash light. One advantage of applying the hybrid methodology is the maintenance of the classification regularity and the increase of correct classification in some cases. / O interesse na área de classificação de padrões tem aumentado ultimamente devido a grande demanda computacional para a manipulação de grandes conjuntos de dados, e também ao aumento de aplicações desafidoras. Métodos de classificação estatística, como os métodos baseados na teoria de decisão das regras de Bayes, aplicam a abordagem de estimação de parâmetros a partir de um conjunto de dados de treinamento que definem as diferentes classes dentro de uma base de dados. Neste trabalho é avaliada a contribuição da transformada wavelet discreta (TWD) na extração de variáveis para a realização de classificação. A partir dos coeficientes de escala de diferentes níveis de TWD serão compostos novos conjuntos de dados de treinamento para serem aplicados em métodos de classificação Bayesiano. Para as transformadas uni- e bidimensionais são consideradas funções da família de wavelets ortonormais de Daubechies (Haar, Daubechies Db2 e Db8). Também é proposta uma metodologia híbrida para o tratamento de dados bidimensionais que compreende em aplicar tanto a transformada uni- quanto a bidimensional em estágios consecutivos da análise dos dados. Para a avaliação da metodologia de classificação associada à transformada unidimensional são utilizados dois conjuntos de dados unidimensionais diferentes: o primeiro é composto por dados gerados sinteticamente, e o outro é composto por informações de tráfego de dados em rede (base DARPA 1999). Para avaliar as metodologias bidimensional e híbrida são utilizados dados bidimensionais (imagens originadas de fotografias digitais, com e sem uso de ash). Uma vantagem da aplicação da metodologia híbrida é a manutenção da regularidade de classificação e o aumento nas classificações corretas em alguns casos.
32

Heterogeneous networking for beyond 3G system in a high-speed train environment : investigation of handover procedures in a high-speed train environment and adoption of a pattern classification neural-networks approach for handover management

Ong, Felicia Li Chin January 2016 (has links)
Based on the targets outlined by the EU Horizon 2020 (H2020) framework, it is expected that heterogeneous networking will play a crucial role in delivering seamless end-to-end ubiquitous Internet access for users. In due course, the current GSM-Railway (GSM-R) will be deemed unsustainable, as the demand for packet-oriented services continues to increase. Therefore, the opportunity to identify a plausible replacement system conducted in this research study is timely and appropriate. In this research study, a hybrid satellite and terrestrial network for enabling ubiquitous Internet access in a high-speed train environment is investigated. The study focuses on the mobility management aspect of the system, primarily related to the handover management. A proposed handover strategy, employing the RACE II MONET and ITU-T Q.65 design methodology, will be addressed. This includes identifying the functional model (FM) which is then mapped to the functional architecture (FUA), based on the Q.1711 IMT-2000 FM. In addition, the signalling protocols, information flows and message format based on the adopted design methodology will also be specified. The approach is then simulated in OPNET and the findings are then presented and discussed. The opportunity of exploring the prospect of employing neural networks (NN) for handover is also undertaken. This study focuses specifically on the use of pattern classification neural networks to aid in the handover process, which is then simulated in MATLAB. The simulation outcomes demonstrated the effectiveness and appropriateness of the NN algorithm and the competence of the algorithm in facilitating the handover process.
33

Metodologia para classificação de padrões de consumo de memória no linux baseada em mapas auto-organizáveis / A Methodology for Classification of Memory use Pattern in Linux based on Auto-Organized Maps.

Lin, Maurício Tia Ni Gong 10 February 2006 (has links)
Made available in DSpace on 2015-04-11T14:02:53Z (GMT). No. of bitstreams: 1 Mauricio Tia Ni Gong Lin.pdf: 636193 bytes, checksum: f576d0b7751120d8c4eaafb2517b1e22 (MD5) Previous issue date: 2006-02-10 / The growth of Linux operating system has taken it to become a worthy competitor to commercial software such as Microsoft s Windows and Sun s Solaris. Although the development and the improvement of several Linux s features, the problem related to Linux out of memory and the current mechanism used to solve it, named as OOM Killer, has brought a long discussion at Linux kernel community. The lack of scientific works related to OOM Killer process selection algorithm motivates this dissertation to propose a mechanism for identifying and classifying memory consumption patterns of Linux applications. Such mechanism is based on a neural network technique known as Self Organizing Maps. The development of a tool based on Self Organizing Maps presented the possibility of applying such approach for memory consumption patterns classification related to Linux applications use cases. / A evolução do sistema operacional Linux possibilitou que o mesmo se tornasse o principal concorrente dos sistemas operacionais do mercado como o Windows da Microsoft e Solaris da Sun. Apesar de diversas funcionalidades e melhorias desenvolvidas no Linux, o problema relacionado à falta de memória e o mecanismo existente de solucioná-lo, chamado de OOM Killer, ainda é motivo de longas discussões na comunidade do kernel Linux. A carência de pesquisas científicas relacionada ao algoritmo de seleção de processos do OOM Killer leva esta dissertação a propor um mecanismo de identificação e classificação de padrões de consumo de memória no Linux baseada no modelo de rede neural auto-organizável. A ferramenta desenvolvida nesta dissertação mostra a possibilidade de utilizar Mapas Auto-Organizáveis para classificar e identificar os padrões de consumo de memória de determinadas aplicações inseridas em contextos de casos de uso.
34

Blur invariant pattern recognition and registration in the Fourier domain

Ojansivu, V. (Ville) 13 October 2009 (has links)
Abstract Pattern recognition and registration are integral elements of computer vision, which considers image patterns. This thesis presents novel blur, and combined blur and geometric invariant features for pattern recognition and registration related to images. These global or local features are based on the Fourier transform phase, and are invariant or insensitive to image blurring with a centrally symmetric point spread function which can result, for example, from linear motion or out of focus. The global features are based on the even powers of the phase-only discrete Fourier spectrum or bispectrum of an image and are invariant to centrally symmetric blur. These global features are used for object recognition and image registration. The features are extended for geometrical invariances up to similarity transformation: shift invariance is obtained using bispectrum, and rotation-scale invariance using log-polar mapping of bispectrum slices. Affine invariance can be achieved as well using rotated sets of the log-log mapped bispectrum slices. The novel invariants are shown to be more robust to additive noise than the earlier blur, and combined blur and geometric invariants based on image moments. The local features are computed using the short term Fourier transform in local windows around the points of interest. Only the lowest horizontal, vertical, and diagonal frequency coefficients are used, the phase of which is insensitive to centrally symmetric blur. The phases of these four frequency coefficients are quantized and used to form a descriptor code for the local region. When these local descriptors are used for texture classification, they are computed for every pixel, and added up to a histogram which describes the local pattern. There are no earlier textures features which have been claimed to be invariant to blur. The proposed descriptors were superior in the classification of blurred textures compared to a few non-blur invariant state of the art texture classification methods.
35

Novel Applications Of Fractal Compression And Wavelet Analysis For Partial Discharge Pattern Classification

Lalitha, E M 05 1900 (has links) (PDF)
No description available.
36

[es] COMBINACIÓN DE REDES NEURALES MLP EN PROBLEMAS DE CLASIFICACIÓN / [pt] COMBINAÇÃO DE REDES NEURAIS MLP EM PROBLEMAS DE CLASSIFICAÇÃO / [en] COMBINING MLP NEURAL NETS FOR CLASSIFICATION

28 August 2001 (has links)
[pt] Esta dissertação investigou a criação de comitês de classificadores baseados em Redes Neurais Multilayer Perceptron (Redes MLP, abreviadamente). Isso foi feito em dois passos: primeiro, aplicando-se procedimentos para criação de redes complementares, i.e, redes individualmente eficazes mas que cometem erros distintos; segundo, testando- se sobre essas redes alguns dos principais métodos de combinação disponíveis. Dentre os procedimentos para criação de redes complementares, foi dado enfoque para os baseados em alteração do conjunto de treinamento. Os métodos Bootstrap e Arc-x4 foram escolhidos para serem utilizados no estudo de casos, juntamente com o método RDP (Replicação Dirigida de Padrões). No que diz respeito aos métodos de combinação disponíveis, foi dada particular atenção ao método de combinação por integrais nebulosas. Além deste método, implementou-se combinação por média, votação por pluralidade e Borda count. As aplicações escolhidas para teste envolveram duas vertentes importantes na área de visão computacional - Classificação de Coberturas de Solo por Imagens de Satélite e Reconhecimento de Expressões Faciais. Embora ambas pertençam à mesma área de conhecimento, foram escolhidas de modo a representar níveis de dificuldade diferentes como tarefas de classificação - enquanto a primeira contou com um grande número de padrões disponíveis, a segunda foi comparativamente limitada nesse sentido. Como resultado final, comprovou-se a viabilidade da utilização de comitês em problemas de classificação, mesmo com as possíveis variações de desempenho relacionadas com a complexidade desses problemas. O método de combinação baseado em integrais nebulosas mostrou-se particularmente eficiente quando associado ao procedimento RDP para formação das redes comissionadas, mas nem sempre foi satisfatório. Considerado individualmente, o RDP tem a limitação de criar, no máximo, tantas redes quanto forem as classes consideradas em um problema; porém, quando este número de redes foi considerado como base de comparação, o RDP se mostrou, na média de todos os métodos de combinação testados, mais eficaz que os procedimentos Bootstrap e Arc-x4. Por outro lado, tanto o Bootstrap quanto o Arc-x4 têm a importante vantagem de permitirem a formação de um número crescente de membros, o que quase sempre acarretou em melhorias de desempenho global em relação ao RDP. / [en] The present dissertation investigated the creation of classifier committees based on Multilayer Perceptron Neural Networks (MLP Networks, for short). This was done in two parts: first, by applying procedures for creating complementary networks, i.e., networks that are individually accurate but cause distinct misclassifications; second, by assessing different combining methods to these network`s outputs. Among the procedures for creating committees members, the main focus was set to the ones based on changes to the training set . Bootstrap and Arc-x4 were chosen to be used at the experiments, along with the RDP procedure (translated as Driven Pattern Replication). With respect to the available combining methods, special attention was paid to fuzzy integrals combination. Average combination, plurality voting and Borda count were also implemented. The chosen experimental applications included interesting branches from computer vision: Land Cover Classification from Satellite Images and Facial Expression Recognition. These applications were specially interesting, in the sense they represent two different levels of difficulty as classification tasks - while the first had a great number of available patterns, the second was comparatively limited in this way. This work proved the viability of using committees in classification problems, despite the small performance fluctuations related to these problems complexity. The fuzzy integrals method has shown to be particularly interesting when coupled with the RDP procedure for committee creation, but was not always satisfactory. Taken alone, the RDP has the limitation of creating, at most, as many networks as there are classes to be considered at the problem at hand; however, when this number of networks was considered as the basis for comparison, this procedure outperformed, taking into account average combining results, both Bootstrap and Arc- x4. On the other hand, these later procedures have the important advantage of allowing the creation of an increasing number of committee members, what almost always increased global performance in comparison to RDP. / [es] Esta disertación investigó la creación de comités de clasificadores basados en Redes Neurales Multilayer Perceptron (Redes MLP, abreviadamente). Esto fue ejecutado en dos pasos: primeiro, aplicando procedimentos para la creación de redes complementares, esto es, redes que individualmente son eficaces pero que cometen erros diferentes; segundo, probando sobre esas redes, algunos de los principales métodos de combinación disponibles. Dentro de los procedimentos para la creación de redes complementares, se eligieron los basados en alteración del conjunto de entrenamiento. Los métodos Bootstrap y Arc-x4 fueron seleccionados para utilizarlos em el estudio de casos, conjuntamente con el método RDP (Replicación Dirigida de Padrones). Con respecto a los métodos de combinación disponibles, se le dió particular atención al método de combinación por integrales nebulosas. Además de este método, se implementaron: combinación por media, votación por pluralidad y Borda cont. Las aplicaciones seleccionadas para pruebas consideran dos vertientes importantes en la área de visión computacional - Clasificación de Coberturas de Suelo por Imágenes de Shastalite y Reconocimiento de Expresiones Faciales. Aunque ambas pertencen a la misma área de conocimento, fueron seleccionadas de modo con diferentes níveles de dificuldad como tareas de clasificación - Mientras la primera contó con un gran número de padrones disponibles, la segunda fue comparativamente limitada em ese sentido. Como resultado final, se comprobó la viabilidad de la utilización de comités en problemas de clasificación, incluso con las posibles variaciones de desempeño relacionadas con la complejidad de esos problemas. El método de combinación basado en integrales nebulosas se mostró particularmente eficiente asociado al procedimiento RDP para formación de las redes comisionadas, pero no siempre fue satisfactorio. Considerado individualmente, el RDP tiene la limitación de crear, como máximo, tantas redes como clases consideradas en un problema; sin embargo, cuando el número de redes fue considerado como base de comparación, el RDP se mostró más eficaz, en la media de todos los métodos de combinación, que los procedimentos Bootstrap y Arc-x4. Por otro lado, tanto el Bootstrap como el Arc-x4 tiene la importante ventaja de permitir la formación de un número cresciente de miembros, lo que generalmente mejora el desempeño global en relación al RDP.
37

Nichtinvasive Erfassung des Hirndrucks mittels des transkraniellen Dopplersignals und der Blutdruckkurve unter Verwendung systemtheoretischer Methoden

Schmidt, Bernhard 17 October 2003 (has links)
Developement of a procedure to calculate intracranial pressure by means of arterial blood pressure and blood flow velocity in a big cerebral artery. Methods of systems theory are used. / Entwicklung eines Verfahrens zur Berechnung des Hirndrucks aus dem Bludrucksignal und der Blutströmungsgeschwindigkeit in einer großen Hirnarterie. Es werden Methoden der Systemtheorie verwendet.
38

Netzverluste in Niederspannungsnetzen

Mehlhorn, Klaus 05 April 2006 (has links)
Die Berechnung der Netzverluste in Niederspannungsnetzen kann nur über Umwege erfolgen, da viele Netzbetreiber keine digitalisierten Daten ihrer Netze besitzen. Hier wird ein Ansatz zur Ermittlung der technischen Verluste anhand vorhandener Netzdaten beschrieben. / The major part of network operator of low voltage nets do not have digitised data of their nets. That’s why net losses must be calculated indirectly. This article describes an approach for getting results in a direct way.
39

[en] AUTOMATIC SYNTHESIS OF FUZZY INFERENCE SYSTEMS FOR CLASSIFICATION / [pt] SÍNTESE AUTOMÁTICA DE SISTEMAS DE INFERÊNCIA FUZZY PARA CLASSIFICAÇÃO

JORGE SALVADOR PAREDES MERINO 25 July 2016 (has links)
[pt] Hoje em dia, grande parte do conhecimento acumulado está armazenado em forma de dados. Para muitos problemas de classificação, tenta-se aprender a relação entre um conjunto de variáveis (atributos) e uma variável alvo de interesse. Dentre as ferramentas capazes de atuar como modelos representativos de sistemas reais, os Sistemas de Inferência Fuzzy são considerados excelentes com respeito à representação do conhecimento de forma compreensível, por serem baseados em regras linguísticas. Este quesito de interpretabilidade linguística é relevante em várias aplicações em que não se deseja apenas um modelo do tipo caixa preta, que, por mais precisão que proporcione, não fornece uma explicação de como os resultados são obtidos. Esta dissertação aborda o desenvolvimento de um Sistema de Inferência Fuzzy de forma automática, buscando uma base de regras que valorize a interpretabilidade linguística e que, ao mesmo tempo, forneça uma boa acurácia. Para tanto, é proposto o modelo AutoFIS-Class, um método automático para a geração de Sistemas de Inferência Fuzzy para problemas de classificação. As características do modelo são: (i) geração de premissas que garantam critérios mínimos de qualidade, (ii) associação de cada premissa a um termo consequente mais compatível e (iii) agregação de regras de uma mesma classe por meio de operadores que ponderem a influência de cada regra. O modelo proposto é avaliado em 45 bases de dados benchmark e seus resultados são comparados com modelos da literatura baseados em Algoritmos Evolucionários. Os resultados comprovam que o Sistema de Inferência gerado é competitivo, apresentando uma boa acurácia com um baixo número de regras. / [en] Nowadays, much of the accumulated knowledge is stored as data. In many classification problems the relationship between a set of variables (attributes) and a target variable of interest must be learned. Among the tools capable of modeling real systems, Fuzzy Inference Systems are considered excellent with respect to the knowledge representation in a comprehensible way, as they are based on inference rules. This is relevant in applications where a black box model does not suffice. This model may attain good accuracy, but does not explain how results are obtained. This dissertation presents the development of a Fuzzy Inference System in an automatic manner, where the rule base should favour linguistic interpretability and at the same time provide good accuracy. In this sense, this work proposes the AutoFIS-Class model, an automatic method for generating Fuzzy Inference Systems for classification problems. Its main features are: (i) generation of premises to ensure minimum, quality criteria, (ii) association of each rule premise to the most compatible consequent term; and (iii) aggregation of rules for each class through operator that weigh the relevance of each rule. The proposed model was evaluated for 45 datasets and their results were compared to existing models based on Evolutionary Algorithms. Results show that the proposed Fuzzy Inference System is competitive, presenting good accuracy with a low number of rules.
40

Nonparametric statistical inference for functional brain information mapping

Stelzer, Johannes 16 April 2014 (has links)
An ever-increasing number of functional magnetic resonance imaging (fMRI) studies are now using information-based multi-voxel pattern analysis (MVPA) techniques to decode mental states. In doing so, they achieve a significantly greater sensitivity compared to when they use univariate analysis frameworks. Two most prominent MVPA methods for information mapping are searchlight decoding and classifier weight mapping. The new MVPA brain mapping methods, however, have also posed new challenges for analysis and statistical inference on the group level. In this thesis, I discuss why the usual procedure of performing t-tests on MVPA derived information maps across subjects in order to produce a group statistic is inappropriate. I propose a fully nonparametric solution to this problem, which achieves higher sensitivity than the most commonly used t-based procedure. The proposed method is based on resampling methods and preserves the spatial dependencies in the MVPA-derived information maps. This enables to incorporate a cluster size control for the multiple testing problem. Using a volumetric searchlight decoding procedure and classifier weight maps, I demonstrate the validity and sensitivity of the new approach using both simulated and real fMRI data sets. In comparison to the standard t-test procedure implemented in SPM8, the new results showed a higher sensitivity and spatial specificity. The second goal of this thesis is the comparison of the two widely used information mapping approaches -- the searchlight technique and classifier weight mapping. Both methods take into account the spatially distributed patterns of activation in order to predict stimulus conditions, however the searchlight method solely operates on the local scale. The searchlight decoding technique has furthermore been found to be prone to spatial inaccuracies. For instance, the spatial extent of informative areas is generally exaggerated, and their spatial configuration is distorted. In this thesis, I compare searchlight decoding with linear classifier weight mapping, both using the formerly proposed non-parametric statistical framework using a simulation and ultra-high-field 7T experimental data. It was found that the searchlight method led to spatial inaccuracies that are especially noticeable in high-resolution fMRI data. In contrast, the weight mapping method was more spatially precise, revealing both informative anatomical structures as well as the direction by which voxels contribute to the classification. By maximizing the spatial accuracy of ultra-high-field fMRI results, such global multivariate methods provide a substantial improvement for characterizing structure-function relationships.

Page generated in 0.0734 seconds