Utilização de índices de estabilidade transitória para a avaliação de segurança dinâmica

Indices that report how much a contingency is stable or unstable in an electrical power system have been the object of several studies in the last decades. In some approaches, indices are obtained from time-domain simulation; others explore the calculation of the stability margin from the so-called direct methods, or even by neural networks.The goal is always to obtain a fast and reliable way of analysing large disturbance that might occur on the power systems. A fast classification in stable and unstable, as a function of transient stability is crucial for a dynamic security analysis. All good propositions as how to analyse contingencies must present some important features: classification of contingencies; precision and reliability; and efficiency computation. Indices obtained from time-domain simulations have been used to classify the contingencies as stable or unstable. These indices are based on the concepts of coherence, transient energy conversion between kinetic energy and potential energy, and three dot products of state variable. The classification of the contingencies using the indices individually is not reliable, since the performance of these indices varies with each simulated condition. However, collapsing these indices into a single one can improve the analysis significantly. In this paper, it is presented the results of an approach to filter the contingencies, by a simple classification of them into stable, unstable or marginal. This classification is performed from the composite indices obtained from step by step simulation with a time period of the clearing time plus 0.5 second. The contingencies originally classified as stable or unstable do not require this extra simulation. The methodology requires an initial effort to obtain the values of the intervals for classification, and the weights. This is performed once for each power system and can be used in different operating conditions and for different contingencies. No misplaced classification o- - ccurred in any of the tests, i.e., we detected no stable case classified as unstable or otherwise. The methodology is thus well fitted for it allows for a rapid conclusion about the stability of th system, for the majority of the contingencies (Stable or Unstable Cases). The tests, results and discussions are presented using two power systems: (1) the IEEE17 system, composed of 17 generators, 162 buses and 284 transmission lines; and (2) a South Brazilian system configuration, with 10 generators, 45 buses and 71 lines.

Ultrasonic sensor signals and optimum path forest classifier for the microstructural characterization of thermally-aged inconel 625 alloy

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A Fast Large Scale Iris Database Classification with Optimum-Path Forest Technique: A Case Study

Majority of biometric researchers focus on the accuracy of matching using biometrics databases, including iris databases, while the scalability and speed issues have been neglected. In the applications such as identification in airports and borders, it is critical for the identification system to have low-time response. In this paper, a graph-based framework for pattern recognition, called Optimum-Path Forest (OPF), is utilized as a classifier in a pre-developed iris recognition system. The aim of this paper is to verify the effectiveness of OPF in the field of iris recognition, and its performance for various scale iris databases. This paper investigates several classifiers, which are widely used in iris recognition papers, and the response time along with accuracy. The existing Gauss-Laguerre Wavelet based iris coding scheme, which shows perfect discrimination with rotary Hamming distance classifier, is used for iris coding. The performance of classifiers is compared using small, medium, and large scale databases. Such comparison shows that OPF has faster response for large scale database, thus performing better than more accurate but slower Bayesian classifier.

Efficient supervised optimum-path forest classification for large datasets

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Classification of lumber of Eucalyptus using non-destructive tests

Classification and standardization of the sawn wood is a usual activity, developed by countries that come as great consumers of this material. Brazil does not practice the classification of sawn wood. This work had the main objective of evaluating the sensibility of most common non-destructive tests in the classification of dimension lumber from fast grown Eucalyptus plantation. Wood was obtained from genetic material cultivated at Minas Gerais State, Brazil. 296 beams of structural dimensions (6 cm × 12 cm × 280 cm) from 10 different clones of Eucalyptus were sampled. Beams were non-destructively (stress wave, ultrasound and transverse vibration) and destructively (static bending and compression parallel to grain) tested. Non-destructive results showed sensibility in the classification of structural dimension lumber, being possible to establish wave velocity intervals that attend to the main strength classes reported by Wooden Structures Brazilian Code.

Fast automatic microstructural segmentation of ferrous alloy samples using optimum-path forest

In this work we propose a novel automatic cast iron segmentation approach based on the Optimum-Path Forest classifier (OPF). Microscopic images from nodular, gray and malleable cast irons are segmented using OPF, and Support Vector Machines (SVM) with Radial Basis Function and SVM without kernel mapping. Results show accurate and fast segmented images, in which OPF outperformed SVMs. Our work is the first into applying OPF for automatic cast iron segmentation. © 2010 Springer-Verlag.

Robust and fast vowel recognition using optimum-path forest

The applications of Automatic Vowel Recognition (AVR), which is a sub-part of fundamental importance in most of the speech processing systems, vary from automatic interpretation of spoken language to biometrics. State-of-the-art systems for AVR are based on traditional machine learning models such as Artificial Neural Networks (ANNs) and Support Vector Machines (SVMs), however, such classifiers can not deal with efficiency and effectiveness at the same time, existing a gap to be explored when real-time processing is required. In this work, we present an algorithm for AVR based on the Optimum-Path Forest (OPF), which is an emergent pattern recognition technique recently introduced in literature. Adopting a supervised training procedure and using speech tags from two public datasets, we observed that OPF has outperformed ANNs, SVMs, plus other classifiers, in terms of training time and accuracy. ©2010 IEEE.

Is it possible to make pixel-based radar image classification user-friendly?

In this paper we would like to shed light the problem of efficiency and effectiveness of image classification in large datasets. As the amount of data to be processed and further classified has increased in the last years, there is a need for faster and more precise pattern recognition algorithms in order to perform online and offline training and classification procedures. We deal here with the problem of moist area classification in radar image in a fast manner. Experimental results using Optimum-Path Forest and its training set pruning algorithm also provided and discussed. © 2011 IEEE.

ECG arrhythmia classification based on optimum-path forest

An important tool for the heart disease diagnosis is the analysis of electrocardiogram (ECG) signals, since the non-invasive nature and simplicity of the ECG exam. According to the application, ECG data analysis consists of steps such as preprocessing, segmentation, feature extraction and classification aiming to detect cardiac arrhythmias (i.e.; cardiac rhythm abnormalities). Aiming to made a fast and accurate cardiac arrhythmia signal classification process, we apply and analyze a recent and robust supervised graph-based pattern recognition technique, the optimum-path forest (OPF) classifier. To the best of our knowledge, it is the first time that OPF classifier is used to the ECG heartbeat signal classification task. We then compare the performance (in terms of training and testing time, accuracy, specificity, and sensitivity) of the OPF classifier to the ones of other three well-known expert system classifiers, i.e.; support vector machine (SVM), Bayesian and multilayer artificial neural network (MLP), using features extracted from six main approaches considered in literature for ECG arrhythmia analysis. In our experiments, we use the MIT-BIH Arrhythmia Database and the evaluation protocol recommended by The Association for the Advancement of Medical Instrumentation. A discussion on the obtained results shows that OPF classifier presents a robust performance, i.e.; there is no need for parameter setup, as well as a high accuracy at an extremely low computational cost. Moreover, in average, the OPF classifier yielded greater performance than the MLP and SVM classifiers in terms of classification time and accuracy, and to produce quite similar performance to the Bayesian classifier, showing to be a promising technique for ECG signal analysis. © 2012 Elsevier Ltd. All rights reserved.

EEG signal classification for epilepsy diagnosis via optimum path forest - A systematic assessment

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Classification of intact fresh plums according to sweetness using time-domain nuclear magnetic resonance and chemometrics

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)