Automatic Road Extraction using High Resolution Satellite Image Based on Texture Progressive Analysis and Normalized Cut Method

In this paper the approach for automatic road extraction for an urban region using structural, spectral and geometric characteristics of roads has been presented. Roads have been extracted based on two levels: Pre-processing and road extraction methods. Initially, the image is pre-processed to improve the tolerance by reducing the clutter (that mostly represents the buildings, parking lots, vegetation regions and other open spaces). The road segments are then extracted using Texture Progressive Analysis (TPA) and Normalized cut algorithm. The TPA technique uses binary segmentation based on three levels of texture statistical evaluation to extract road segments where as, Normalizedcut method for road extraction is a graph based method that generates optimal partition of road segments. The performance evaluation (quality measures) for road extraction using TPA and normalized cut method is compared. Thus the experimental result show that normalized cut method is efficient in extracting road segments in urban region from high resolution satellite image.

Phase unwrapping based on branch cut placing and reliability ordering

A new 2-D quality-guided phase-unwrapping algorithm, based on the placement of the branch cuts, is presented. Its framework consists of branch cut placing guided by an original quality map and reliability ordering performed on a final quality map. To improve the noise immunity of the new algorithm, a new quality map, which is used as the original quality map to guide the placement of the branch cuts, is proposed. After a complete description of the algorithm and the quality map, several wrapped images are used to examine the effectiveness of the algorithm. Computer simulation and experimental results make it clear that the proposed algorithm works effectively even when a wrapped phase map contains error sources, such as phase discontinuities, noise, and undersampling. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

Phase unwrapping based on branch cut placing and reliability ordering

A new 2-D quality-guided phase-unwrapping algorithm, based on the placement of the branch cuts, is presented. Its framework consists of branch cut placing guided by an original quality map and reliability ordering performed on a final quality map. To improve the noise immunity of the new algorithm, a new quality map, which is used as the original quality map to guide the placement of the branch cuts, is proposed. After a complete description of the algorithm and the quality map, several wrapped images are used to examine the effectiveness of the algorithm. Computer simulation and experimental results make it clear that the proposed algorithm works effectively even when a wrapped phase map contains error sources, such as phase discontinuities, noise, and undersampling. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

Hierarchical clustering with multiple-height branch-cut applied to short time-series gene expression data.

Rigid adherence to pre-specified thresholds and static graphical representations can lead to incorrect decisions on merging of clusters. As an alternative to existing automated or semi-automated methods, we developed a visual analytics approach for performing hierarchical clustering analysis of short time-series gene expression data. Dynamic sliders control parameters such as the similarity threshold at which clusters are merged and the level of relative intra-cluster distinctiveness, which can be used to identify "weak-edges" within clusters. An expert user can drill down to further explore the dendrogram and detect nested clusters and outliers. This is done by using the sliders and by pointing and clicking on the representation to cut the branches of the tree in multiple-heights. A prototype of this tool has been developed in collaboration with a small group of biologists for analysing their own datasets. Initial feedback on the tool has been positive.

Refractive and geometric lens characterization through multi-wavelength digital speckle pattern interferometry

Physical parameters of different types of lenses were measured through digital speckle pattern interferometry (DSPI) using a multimode diode laser as light source. When such lasers emit two or more longitudinal modes simultaneously the speckle image of an object appears covered of contour fringes. By performing the quantitative fringe evaluation the radii of curvature as well as the refractive indexes of the lenses were determined. The fringe quantitative evaluation was carried out through the four- and the eight-stepping techniques and the branch-cut method was employed for phase unwrapping. With all these parameters the focal length was calculated. This whole-field multi-wavelength method does enable the characterization of spherical and aspherical lenses and of positive and negative ones as well. (C) 2007 Elsevier B.V. All rights reserved.

Measurement of low-derivative surface lenses by two-laser holography with Bi12TiO20 crystals

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

Profilometry of semiconductor components by two-colour holography with Bi12TiO20 crystals

We studied the shape measurement of semiconductor components by holography with photorefractive Bi12TiO20 crystal as holographic medium and two diode lasers emitting in the red region as light sources. By properly tuning and aligning the lasers a synthetic wavelength was generated and the resulting holographic image of the studied object appears modulated by cos2-contour fringes which correspond to the intersection of the object surface with planes of constant elevation. The position of such planes as a function of the illuminating beam angle and the tuning of the lasers was studied, as well as the fringe visibility. The fringe evaluation was performed by the four stepping technique for phase mapping and through the branch-cut method for phase unwrapping. A damage in an integrated circuit was analysed as well as the relief of a coin was measured, and a precision up to 10 μm was estimated. © 2009 SPIE.

Lensometry by two-laser holography with photorefractive Bi12TiO20

Refractive and profilometric measurements of lenses were performed through holography with a photorefractive Bi12TiO20 crystal as the recording medium. Two properly aligned diode lasers emitting in the red region were employed as light sources. Both lasers were tuned in order to provide millimetric and sub-millimetric synthetic wavelengths. The surfaces of the test lens were covered by a 25-μm opaque plastic tape in order to allow the lens profilometry upon illuminating them with a collimated beam. The resulting holographic images appear covered by interference fringes corresponding to the wavefront geometry of the wave scattered by the lens. For refractive index measurement a diffusely scattering flat surface was positioned behind the uncovered lens which was also illuminated by a plane wave. The resulting contour interferogram describes the form of the wavefront after the beam traveled back and forth through the lens. The fringe quantitative evaluation was carried out through the four-stepping technique and the resulting phase map and the Branch-cut method was employed for phase unwrapping. The only non-optical procedure for lens characterization was the thickness measurement, made by a dial caliper. Exact ray tracing calculation was performed in order to establish a relation between the output wavefront geometry and the lens parameters like radii of curvature, thickness and refractive index. By quantitatively comparing the theoretical wavefront geometry with the experimental results relative uncertainties bellow 3% for refractive index and 1 % for focal length were obtained. © 2008 American Institute of Physics.

L'algorithme de Branch and Price and Cut pour le problème de conception de réseaux avec coûts fixes et sans capacité

Le problème de conception de réseaux est un problème qui a été beaucoup étudié dans le domaine de la recherche opérationnelle pour ses caractéristiques, et ses applications dans des nombreux domaines tels que le transport, les communications, et la logistique. Nous nous intéressons en particulier dans ce mémoire à résoudre le problème de conception de réseaux avec coûts fixes et sans capacité, en satisfaisant les demandes de tous les produits tout en minimisant la somme des coûts de transport de ces produits et des coûts fixes de conception du réseau. Ce problème se modélise généralement sous la forme d’un programme linéaire en nombres entiers incluant des variables continues. Pour le résoudre, nous avons appliqué la méthode exacte de Branch-and-Bound basée sur une relaxation linéaire du problème avec un critère d’arrêt, tout en exploitant les méthodes de génération de colonnes et de génération de coupes. Nous avons testé la méthode de Branch-and-Price-and-Cut sur 156 instances divisées en cinq groupes de différentes tailles, et nous l’avons comparée à Cplex, l’un des meilleurs solveurs d’optimisation mathématique, ainsi qu’à la méthode de Branch-and- Cut. Notre méthode est compétitive et plus performante sur les instances de grande taille ayant un grand nombre de produits.

Uma nova abordagem branch and cut aplicada ao problema de planejamento da expansão de redes de transmissão de grande porte

Neste artigo propomos um algoritmo branch and cut com novas inequações específicas ao problema de planejamento da expansão de redes de transmissão de energia elétrica. Todas as inequações propostas neste trabalho são válidas tanto para os modelos lineares como para os modelos não lineares do problema. Os testes computacionais têm mostrado a eficiência do método proposto neste trabalho quando aplicado a subsistemas reais brasileiros e ao sistema colombiano.

Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes

In this paper, some new constraints and an extended formulation are presented for a Lot Sizing and Scheduling Model proposed in the literature. In the production process considered a key material is prepared and is transformed into different final items. The sequencing decisions are related to the order in which the materials are processed and the lot sizing decisions are related to the final items production. The mathematical formulation considers sequence-dependent setup costs and times. Results of the computational tests executed using the software Cplex 10.0 showed that the performance of the branch-and-cut method can be improved by the proposed a priori reformulation.

Métodos híbridos de pontos interiores e de programação inteira 0-1 para problemas de custo de colheita da cana-de-açúcar e de custo de coleta e geração de energia relacionados à sua biomassa

Pós-graduação em Engenharia Elétrica - FEB

Migração por equação de onda em meios anisotrópicos com correção de amplitude

Este trabalho discute dois aspectos da migração em profundidade através da continuação para baixo dos campos de onda: o tratamento de modos evanescentes e a correção da amplitude dos eventos migrados. Estes dois aspectos são discutidos em meios isotrópicos e para uma classe de meios anisotrópicos. Migrações por diferenças finitas (FD) e por diferenças finitas e Fourier (FFD) podem ser instáveis em meios com forte variação lateral de velocidade. Estes métodos utilizam aproximações de Padé reais para representar o operador que descreve a propagação de ondas descendentes. Estas abordagens não são capazes de tratar corretamente os modos evanescentes, o que pode levar à instabilidades numéricas em meios com forte variação lateral de velocidade. Uma solução possível para esse problema é utilizar aproximação de Padé complexa, que consegue melhor representar os modos evanescentes associados às reflexões pós-críticas, e neste trabalho esta aproximação é utilizada para obter algoritmos FD e híbrido FD/FFD estáveis para migração em meios transversalmente isotrópicos com eixo de simetria vertical (VTI), mesmo na presença de forte variação nas propriedades elásticas do meio. A estabilidade dos algoritmos propostos para meios VTI foi validada através da resposta ao impulso do operador de migração e pela sua aplicação na migração de dados sintéticos, em meios fortemente heterogêneos. Métodos de migração por equação de onda em meios heterogêneos não tratam corretamente a amplitude dos eventos durante a propagação. As equações de onda unidirecionais tradicionais descrevem corretamente apenas a parte cinemática da propagação do campo de onda. Assim, para uma descrição correta das amplitudes deve-se usar as equações de onda unidirecionais de amplitude verdadeira. Em meios verticalmente heterogêneos, as equações de onda unidirecionais de amplitude verdadeira podem ser resolvidas analiticamente. Em meios lateralmente heterogêneos, essas equações não possuem uma solução analítica. Mesmo soluções numéricas tendem a ser instáveis. Para melhorar a compensação de amplitude na migração, em meios com variação lateral de velocidade, é proposto uma aproximação estável para solução da equação de onda unidirecional de amplitude verdadeira. Esta nova aproximação é implementada nas migrações split-step e diferenças finitas e Fourier (FFD). O algoritmo split-step com correção de amplitude foi estendido para meios VTI. A migração pré e pós-empilhamento de dados sintéticos, em meios isotrópicos e anisotrópicos, confirmam o melhor tratamento das amplitudes e estabilidade dos algoritmos propostos.

Low mass enhanced probability of pion in hadronic matter due to its Landau cut contributions

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

Patient Variability in Sciatic Nerve Branch Point Distance Using Ultrasound Guided Localization

Background and Objectives: Improved ultrasound and needle technology make popliteal sciatic nerve blockade a popular anesthetic technique and imaging to localize the branch point of the common peroneal and posterior tibial components is important because successful blockade techniques vary with respect to injection of the common trunk proximally or separate injections distally. Nerve stimulation, ultrasound, cadaveric and magnetic resonance studies demonstrate variability in distance and discordance between imaging and anatomic examination of the branch point. The popliteal crease and imprecise, inaccessible landmarks render measurement of the branch point variable and inaccurate. The purpose of this study was to use the tibial tuberosity, a fixed bony reference, to measure the distance of the branch point. Method: During popliteal sciatic nerve blockade in the supine position the branch point was identified by ultrasound and the block needle was inserted. The vertical distance from the tibial tuberosity prominence and needle insertion point was measured. Results: In 92 patients the branch point is a mean distance of 12.91 cm proximal to the tibial tuberosity and more proximal in male (13.74 cm) than female patients (12.08 cm). Body height is related to the branch point distance and is more proximal in taller patients. Separation into two nerve branches during local anesthetic injection supports notions of more proximal neural anatomic division. Limitations: Imaging of the sciatic nerve division may not equal its true anatomic separation. Conclusion: Refinements in identification and resolution of the anatomic division of the nerve branch point will determine if more accurate localization is of any clinical significance for successful nerve blockade.