Recursive hierarchic segmentation analysis of bone mineral density changes on digital panoramic images

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

Recursive renormalization of the singlet one-pion-exchange plus point-like interactions

The subtracted kernel approach is shown to be a powerful method to be implemented recursively in scattering equations with regular plus point-like interactions. The advantages of the method allows one to recursively renormalize the potentials, with higher derivatives of the Dirac-delta, improving previous results. The applicability of the method is verified in the calculation of the 1 So nucleon-nucleon phase-shifts, when considering a potential with one-pion-exchange plus a contact interaction and its derivatives. The S-1(0) renormalization parameters are fitted to the data. The method can in principle be extended to any derivative order of the contact interaction, to higher partial waves and to coupled channels. (c) 2005 Elsevier B.V. All rights reserved.

A recursive approach to space resection using straight lines

An approach using straight lines as features to solve the photogrammetric space resection problem is presented. An explicit mathematical model relating straight lines, in both object and image space, is used. Based on this model, Kalman Filtering is applied to solve the space resection problem. The recursive property of the filter is used in an iterative process which uses the sequentially estimated camera location parameters to feedback to the feature extraction process in the image. This feedback process leads to a gradual reduction of the image space for feature searching, and consequently eliminates the bottleneck due to the high computational cost of the image segmentation phase. It also enables feature extraction and the determination of feature correspondence in image and object space in an automatic way, i.e., without operator interference. Results obtained from simulated and real data show that highly accurate space resection parameters are obtained as well as a progressive processing time reduction. The obtained accuracy, the automatic correspondence process, and the short related processing time show that the proposed approach can be used in many real-time machine vision systems, making possible the implementation of applications not feasible until now.

Differential dispersion relations with an arbitrary number of subtractions: A recursive approach

Making use of a recursive approach, derivative dispersion relations are generalized for an arbitrary number of subtractions. The results for both cross even and odd amplitudes are theoretically consistent at sufficiently high energies and in the region of small momentum transfer. © 1999 Published by Elsevier Science B.V. All rights reserved.

Clássicos versus Keynes: a abordagem formal de David Champernowne

Este texto tem por objetivo ressaltar um aspecto que não tem sido tratado com a devida profundidade na literatura que estuda a formalização da Teoria Geral do Emprego, dos Juros e da Moeda de John Maynard Keynes (1936). Mais precisamente, o texto destaca a estratégia de formalização adotada por David G. Champernowne em seu artigo intitulado Unemployment, Basic and Monetary: the classical analysis and the keynesian, publicado em 1935-36 na Review of Economic Studies. Chamamos a atenção para o fato dele distinguir a teoria clássica da teoria de Keynes não apenas pelos pressupostos adotados por cada teoria, mas principalmente pela construção de subsistemas a partir de um sistema geral, com características recursivas (relações de causalidade) distintas. As explicações em prosa, a descrição algébrica das funções comportamentais e condições de equilíbrio e a ilustração por meio de diagramas, além da escolha de conjuntos específicos de variáveis para representar cada uma das teorias e suas diferentes versões são aspectos deste artigo de Champernowne que merecem uma análise mais minuciosa.

Extraction of Building Roof Contours From LiDAR Data Using a Markov-Random-Field-Based Approach

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

Extração automática de contornos de telhados usando dados de varredura a laser e campos randômicos de Markov

This paper proposes a methodology for automatic extraction of building roof contours from a Digital Elevation Model (DEM), which is generated through the regularization of an available laser point cloud. The methodology is based on two steps. First, in order to detect high objects (buildings, trees etc.), the DEM is segmented through a recursive splitting technique and a Bayesian merging technique. The recursive splitting technique uses the quadtree structure for subdividing the DEM into homogeneous regions. In order to minimize the fragmentation, which is commonly observed in the results of the recursive splitting segmentation, a region merging technique based on the Bayesian framework is applied to the previously segmented data. The high object polygons are extracted by using vectorization and polygonization techniques. Second, the building roof contours are identified among all high objects extracted previously. Taking into account some roof properties and some feature measurements (e. g., area, rectangularity, and angles between principal axes of the roofs), an energy function was developed based on the Markov Random Field (MRF) model. The solution of this function is a polygon set corresponding to building roof contours and is found by using a minimization technique, like the Simulated Annealing (SA) algorithm. Experiments carried out with laser scanning DEM's showed that the methodology works properly, as it delivered roof contours with approximately 90% shape accuracy and no false positive was verified.

Adaptive filter feature identification for structural health monitoring in an aeronautical panel

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

Design of a reconfigurable pseudorandom number generator for use in intelligent systems

This paper deals with the design of a network-on-chip reconfigurable pseudorandom number generation unit that can map and execute meta-heuristic algorithms in hardware. The unit can be configured to implement one of the following five linear generator algorithms: a multiplicative congruential, a mixed congruential, a standard multiple recursive, a mixed multiple recursive, and a multiply-with-carry. The generation unit can be used both as a pseudorandom and a message passing-based server, which is able to produce pseudorandom numbers on demand, sending them to the network-on-chip blocks that originate the service request. The generator architecture has been mapped to a field programmable gate array, and showed that millions of numbers in 32-, 64-, 96-, or 128-bit formats can be produced in tens of milliseconds. (C) 2011 Elsevier B.V. All rights reserved.

Renormalizing the NN interaction with multiple subtractions

The aim of this work is to show how to renormalize the nucleon-nucleon interaction at next-to-next-to-leading order using a. systematic subtractive renormalization approach with multiple subtractions. As an example, we calculate the phase shifts for the partial waves with total angular momentum J = 2. The intermediate driving terms at each recursive step as well as the renormalized T-matrix are also shown. We conclude that our method is reliable for singular potentials such as the two-pion exchange and derivative contact interactions.

Nucleon-nucleon scattering within a multiple subtractive renormalization approach

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

Subtractive renormalization of one-pion-exchange and contact interactions

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

Metodologia para identificação do componente fundamental da tensão da rede baseada no algoritmo recursivo da TDF

Considerando a crescente utilização de técnicas de processamento digital de sinais em aplicações de sistemas eletrônicos e ou de potência, este artigo discute o uso da Transformada Discreta de Fourier Recursiva (TDFR) para identificação do ângulo de fase, da freqüência e da amplitude das tensões fundamentais da rede, independente de distorções na forma de onda ou de transitórios na amplitude. Será discutido que, se a freqüência fundamental das tensões medidas coincide com a freqüência a qual a TDF foi projetada, um simples algoritmo TDFR é completamente capaz de fornecer as informações requeridas de fase, freqüência e amplitude. Dois algoritmos adicionais são propostos para garantir seu desempenho correto quando a freqüência difere do seu valor nominal: um deles para a correção do erro de fase do sinal de saída e outro para identificação da amplitude do componente fundamental. Além disto, destaca-se que através dos algoritmos propostos, independentemente do sinal de entrada, a identificação do componente fundamental pode ser realizada em, no máximo, 2 ciclos da rede. Uma análise dos resultados evidenciados pela TDFR foi desenvolvida através de simulações computacionais. Também serão apresentados resultados experimentais referentes ao sincronismo de um gerador síncrono com a rede elétrica, através dos sinais fornecidos pela TDFR.

Effect of tillage on fractal indices describing soil surface microrelief of a Brazilian Alfisol

Soil surface roughness is known to influence water infiltration, runoff and erosion. Soil surface roughness changes with management and weather and its mathematical description still remains an important issue. The main objective of this study was to investigate the effect of tillage on the two fractal indices, fractal dimension, D, and crossover length, 1, currently used in characterizing soil surface microrelief. The statistical index random roughness, RR, was also assessed. Field experiments were done on an Alfisol located at Rio Grande do Sul State (Brazil). Two tillage treatments (conventional versus direct drilling) were tested. The soil surface microrelief was assessed by point elevation measurements in 16 plots for each treatment. The sampling scheme was a square grid with 20 x 20 mm between point spacing and the plot size was 280 x 280 mm, so that each data set consisted of 225 individual elevation points. All indices were calculated after trend removal, both by slope correction, i.e., oriented microrelief, and by slope plus tillage marks correction, i.e., random microrelief. The implemented algorithm for estimating D and 1 consisted in evaluating the roughness around the local root mean square deviation (RMS) of the point elevation values. Irrespective of tillage treatment and detrending procedure, fractal behavior extended only over a bounded range of scales, from 40 to 100 mm, due to the experimental setup. In these conditions, assessing fractal indices was not always straightforward. The statistical index RR and the fractal index I were significantly different between tillage treatments for oriented and random surface conditions. D values of random soil surfaces were not affected by tillage treatment, whereas D values of oriented microrelief were significantly lower in the direct drilled plots. Removal of tillage marks trend resulted in a significant increase in D values. Within each tillage treatment, 1 and D were significantly correlated. (c) 2006 Elsevier B.V. All rights reserved.

Simple orbit determination using GPS based on a least-squares algorithm employing sequential givens rotations

A low-cost computer procedure to determine the orbit of an artificial satellite by using short arc data from an onboard GPS receiver is proposed. Pseudoranges are used as measurements to estimate the orbit via recursive least squares method. The algorithm applies orthogonal Givens rotations for solving recursive and sequential orbit determination problems. To assess the procedure, it was applied to the TOPEX/POSEIDON satellite for data batches of one orbital period (approximately two hours), and force modelling, due to the full JGM-2 gravity field model, was considered. When compared with the reference Precision Orbit Ephemeris (POE) of JPL/NASA, the results have indicated that precision better than 9 m is easily obtained, even when short batches of data are used. Copyright (c) 2007.