Classificação de cobertura do solo utilizando árvores de decisão e sensoriamento remoto

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

Structure-activity relationship of compounds which are anti-schistosomiasis active

O método do orbital molecular AM1 foi empregado para calcular um conjunto de descritores moleculares para vinte neolignanas sintéticas com atividade anti-esquistossomose. O método de reconhecimento de padrão (análise de componentes principais ACP, análise de conglomerados AC e análise de discriminante) foi utilizado para obter a relação entre a estrutura molecular e a atividade biológica. O conjunto de moléculas foi classificado em dois grupos de acordo com seus graus de atividade biológica. Estes resultados permitem que, projete-se racionalmente novos compostos, potenciais candidatos à síntese e à avaliação biológica.

Análise e extração de características de imagens termográficas utilizando componentes principais

Pós-graduação em Engenharia Mecânica - FEIS

Papel de neutrófilos humanos no direcionamento da resposta imune adaptativa do tipo Th1 contra o Paracoccidioides brasiliensis

Pós-graduação em Doenças Tropicais - FMB

Modulação da proliferação, apoptose e autofagia de linfocitos T por RAGE

Pós-graduação em Odontologia - FOAR

Nature-Inspired Framework for Hyperspectral Band Selection

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

A path- and label-cost propagation approach to speedup the training of the optimum-path forest classifier

In general, pattern recognition techniques require a high computational burden for learning the discriminating functions that are responsible to separate samples from distinct classes. As such, there are several studies that make effort to employ machine learning algorithms in the context of big data classification problems. The research on this area ranges from Graphics Processing Units-based implementations to mathematical optimizations, being the main drawback of the former approaches to be dependent on the graphic video card. Here, we propose an architecture-independent optimization approach for the optimum-path forest (OPF) classifier, that is designed using a theoretical formulation that relates the minimum spanning tree with the minimum spanning forest generated by the OPF over the training dataset. The experiments have shown that the approach proposed can be faster than the traditional one in five public datasets, being also as accurate as the original OPF. (C) 2014 Elsevier B. V. All rights reserved.

Seleção de características utilizando algoritmos evolucionistas e suas aplicações em reconhecimento de padrões

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

Static Video Summarization through Optimum-Path Forest Clustering

This paper introduces the Optimum-Path Forest (OPF) classifier for static video summarization, being its results comparable to the ones obtained by some state-of-the-art video summarization techniques. The experimental section has been conducted using several image descriptors in two public datasets, followed by an analysis of OPF robustness regarding one ad-hoc parameter. Future works are guided to improve OPF effectiveness on each distinct video category.

Metabolic profiling by ultra-performance liquid chromatography-mass spectrometry and parallel factor analysis for the determination of disease biomarkers in Eucalyptus

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

Interferon-gamma production by human neutrophils upon stimulation by IL-12, IL-15 and IL-18 and challenge with Paracoccidioides brasiliensis

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

Optimum-Path Forest Applied for Breast Masses Classification

In Computer-Aided Diagnosis-based schemes in mammography analysis each module is interconnected, which directly affects the system operation as a whole. The identification of mammograms with and without masses is highly needed to reduce the false positive rates regarding the automatic selection of regions of interest for further image segmentation. This study aims to evaluate the performance of three techniques in classifying regions of interest as containing masses or without masses (without clinical findings), as well as the main contribution of this work is to introduce the Optimum-Path Forest (OPF) classifier in this context, which has never been done so far. Thus, we have compared OPF against with two sorts of neural networks in a private dataset composed by 120 images: Radial Basis Function and Multilayer Perceptron (MLP). Texture features have been used for such purpose, and the experiments have demonstrated that MLP networks have been slightly better than OPF, but the former is much faster, which can be a suitable tool for real-time recognition systems.

Compartmentalized gene expression of toll-like receptors 2, 4 and 9 in the brain and peripheral lymphoid organs during canine visceral leishmaniasis

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

Harmony Search applied for Support Vector Machines Training Optimization

Since the beginning, some pattern recognition techniques have faced the problem of high computational burden for dataset learning. Among the most widely used techniques, we may highlight Support Vector Machines (SVM), which have obtained very promising results for data classification. However, this classifier requires an expensive training phase, which is dominated by a parameter optimization that aims to make SVM less prone to errors over the training set. In this paper, we model the problem of finding such parameters as a metaheuristic-based optimization task, which is performed through Harmony Search (HS) and some of its variants. The experimental results have showen the robustness of HS-based approaches for such task in comparison against with an exhaustive (grid) search, and also a Particle Swarm Optimization-based implementation.

Reconhecimento de voz para aplicações em automação implementado em FPGA

In many movies of scientific fiction, machines were capable of speaking with humans. However mankind is still far away of getting those types of machines, like the famous character C3PO of Star Wars. During the last six decades the automatic speech recognition systems have been the target of many studies. Throughout these years many technics were developed to be used in applications of both software and hardware. There are many types of automatic speech recognition system, among which the one used in this work were the isolated word and independent of the speaker system, using Hidden Markov Models as the recognition system. The goals of this work is to project and synthesize the first two steps of the speech recognition system, the steps are: the speech signal acquisition and the pre-processing of the signal. Both steps were developed in a reprogrammable component named FPGA, using the VHDL hardware description language, owing to the high performance of this component and the flexibility of the language. In this work it is presented all the theory of digital signal processing, as Fast Fourier Transforms and digital filters and also all the theory of speech recognition using Hidden Markov Models and LPC processor. It is also presented all the results obtained for each one of the blocks synthesized e verified in hardware