Oriented texture classification based on self-organizing neural network and Hough transform

This paper presents a technique for oriented texture classification which is based on the Hough transform and Kohonen's neural network model. In this technique, oriented texture features are extracted from the Hough space by means of two distinct strategies. While the first operates on a non-uniformly sampled Hough space, the second concentrates on the peaks produced in the Hough space. The described technique gives good results for the classification of oriented textures, a common phenomenon in nature underlying an important class of images. Experimental results are presented to demonstrate the performance of the new technique in comparison, with an implemented technique based on Gabor filters.

Symmetry transform in Faddeev-Jackiw quantization of dual models

We study the presence of symmetry transformations in the Faddeev-Jackiw approach for constrained systems. Our analysis is based in the case of a particle submitted to a particular potential which depends on an arbitrary function. The method is implemented in a natural way and symmetry generators are identified. These symmetries permit us to obtain the absent elements of the sympletic matrix which complement the set of Dirac brackets of such a theory. The study developed here is applied in two different dual models. First, we discuss the case of a two-dimensional oscillator interacting with an electromagnetic potential described by a Chern-Simons term and second the Schwarz-Sen gauge theory, in order to obtain the complete set of non-null Dirac brackets and the correspondent Maxwell electromagnetic theory limit. ©1999 The American Physical Society.

Common architecture for discrete wavelet transform analysis and synthesis with sequential and constant processing elements

This paper adresses the problem on processing biological data such as cardiac beats, audio and ultrasonic range, calculating wavelet coefficients in real time, with processor clock running at frequency of present ASIC's and FPGA. The Paralell Filter Architecture for DWT has been improved, calculating wavelet coefficients in real time with hardware reduced to 60%. The new architecture, which also processes IDWT, is implemented with the Radix-2 or the Booth-Wallace Constant multipliers. Including series memory register banks, one integrated circuit Signal Analyzer, ultrasonic range, is presented.

Discrete wavelet transform signal analyzer

This paper addresses the problem of processing biological data, such as cardiac beats in the audio and ultrasonic range, and on calculating wavelet coefficients in real time, with the processor clock running at a frequency of present application-specified integrated circuits and field programmable gate array. The parallel filter architecture for discrete wavelet transform (DWT) has been improved, calculating the wavelet coefficients in real time with hardware reduced up to 60%. The new architecture, which also processes inverse DWT, is implemented with the Radix-2 or the Booth-Wallace constant multipliers. One integrated circuit signal analyzer in the ultrasonic range, including series memory register banks, is presented. © 2007 IEEE.

Microcalcification enhancement and classification on mammograms using the wavelet transform

This paper presents a method to enhance microcalcifications and classify their borders by applying the wavelet transform. Decomposing an image and removing its low frequency sub-band the microcalcifications are enhanced. Analyzing the effects of perturbations on high frequency subband it's possible to classify its borders as smooth, rugged or undefined. Results show a false positive reduction of 69.27% using a region growing algorithm. © 2008 IEEE.

HTS: A new shape descriptor based on Hough Transform

In this paper we propose a novel method for shape analysis called HTS (Hough Transform Statistics), which uses statistics from Hough Transform space in order to characterize the shape of objects in digital images. Experimental results showed that the HTS descriptor is robust and presents better accuracy than some traditional shape description methods. Furthermore, HTS algorithm has linear complexity, which is an important requirement for content based image retrieval from large databases. © 2013 IEEE.

Análise da saliva de pacientes com ardência bucal por espectroscopia de Fourier Transform Infrared (FT-IR)

Pós-graduação em Biopatologia Bucal - ICT

Flame retardant properties of the bark powder of Anadenanthera peregrina var. falcata (Benth.) Altschul (angico) studied by coupled thermogravimetry-Fourier transform infrared spectroscopy

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

A Laplace transform approach to the quantum harmonic oscillator

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

Adherence to statin treatment and associated factors in female users from the Unified Health System (SUS)

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

HTS and HTSn: New shape descriptors based on Hough transform statistics

With the widespread proliferation of computers, many human activities entail the use of automatic image analysis. The basic features used for image analysis include color, texture, and shape. In this paper, we propose a new shape description method, called Hough Transform Statistics (HTS), which uses statistics from the Hough space to characterize the shape of objects or regions in digital images. A modified version of this method, called Hough Transform Statistics neighborhood (HTSn), is also presented. Experiments carried out on three popular public image databases showed that the HTS and HTSn descriptors are robust, since they presented precision-recall results much better than several other well-known shape description methods. When compared to Beam Angle Statistics (BAS) method, a shape description method that inspired their development, both the HTS and the HTSn methods presented inferior results regarding the precision-recall criterion, but superior results in the processing time and multiscale separability criteria. The linear complexity of the HTS and the HTSn algorithms, in contrast to BAS, make them more appropriate for shape analysis in high-resolution image retrieval tasks when very large databases are used, which are very common nowadays. (C) 2014 Elsevier Inc. All rights reserved.

Classification of histological images based on the stationary wavelet transform

Non-Hodgkin lymphomas are of many distinct types, and different classification systems make it difficult to diagnose them correctly. Many of these systems classify lymphomas only based on what they look like under a microscope. In 2008 the World Health Organisation (WHO) introduced the most recent system, which also considers the chromosome features of the lymphoma cells and the presence of certain proteins on their surface. The WHO system is the one that we apply in this work. Herewith we present an automatic method to classify histological images of three types of non-Hodgkin lymphoma. Our method is based on the Stationary Wavelet Transform (SWT), and it consists of three steps: 1) extracting sub-bands from the histological image through SWT, 2) applying Analysis of Variance (ANOVA) to clean noise and select the most relevant information, 3) classifying it by the Support Vector Machine (SVM) algorithm. The kernel types Linear, RBF and Polynomial were evaluated with our method applied to 210 images of lymphoma from the National Institute on Aging. We concluded that the following combination led to the most relevant results: detail sub-band, ANOVA and SVM with Linear and RBF kernels.

Rotor Failure Diagnosis of Induction Motors by Wavelet Transform and Fourier Transform in Function of the Load

This paper presents two diagnostic methods for the online detection of broken bars in induction motors with squirrel-cage type rotors. The wavelet representation of a function is a new technique. Wavelet transform of a function is the improved version of Fourier transform. Fourier transform is a powerful tool for analyzing the components of a stationary signal. But it is failed for analyzing the non-stationary signal whereas wavelet transform allows the components of a non-stationary signal to be analyzed. In this paper, our main goal is to find out the advantages of wavelet transform compared to Fourier transform in rotor failure diagnosis of induction motors.

A unified solution to the small scale problems of the Lambda CDM model II: introducing parent-satellite interaction

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