Automatic absolute orientation of scanned aerial photographs

Image orientation is a basic problem in Digital Photogrammetry. While interior and relative orientations were succesfully automated, the same can not be said about absolute orientation. This process can be automated by using an approach based on relational matching and a heuristic that uses the analytical relation between straight features in the object space and its homologous in the image space. A build-in self-diagnosis is also used in this method, that is based on the implementation of data snooping statistic test in the process of spatial resection, using the Iterated Extended Kalman Filtering (IEKF). The aim of this paper is to present the basic principles of the proposed approach and results based on real data.

Strategy to detect ground control in digital images

The identification of ground control on photographs or images is usually carried out by a human operator, who uses his natural skills to make interpretations. In Digital Photogrammetry, which uses techniques of digital image processing extraction of ground control can be automated by using an approach based on relational matching and a heuristic that uses the analytical relation between straight features of object space and its homologous in the image space. A build-in self-diagnosis is also used in this method. It is based on implementation of data snooping statistic test in the process of spatial resection using the Iterated Extended Kalman Filtering (IEKF). The aim of this paper is to present the basic principles of the proposed approach and results based on real data.

Orientação semi-automática de imagens CBERS usando rodovias como controle de campo

In this paper is proposed a methodology for semiautomatic CBERS image orientation using roads as ground control. It is based on an iterative strategy involving three steps. In the first step, an operator identifies on the image the ground control roads and supplies along them a few seed points, which could be sparsely and coarsely distributed. These seed points are used by the dynamic programming algorithm for extracting the ground control roads from the image. In the second step, it is established the correspondences between points describing the ground control roads and the corresponding ones extracted from the image. In the last step, the corresponding points are used to orient the CBERS image by using the DLT (Direct Linear Transformation). The two last steps are iterated until the convergence of the orientation process is verified. Experimental results showed that the proposed methodology was efficient with several test images. In all cases the orientation process converged. Moreover, the estimated orientation parameters allowed the registration of check roads with pixel accuracy or better.

Boundary of the rauzy fractal sets in ℝ×ℂgenerated by p(x) = x 4- x 3 - x 2 -x- 1

We study the boundary of the 3-dimensional Rauzy fractal ε ⊂ ℝ×ℂ generated by the polynomial P(x) Dx 4-x 3-x 2-x-1. The finite automaton characterizing the boundary of ε is given explicitly. As a consequence we prove that the set ε has 18 neighboors where 6 of them intersect the central tile ε in a point. Our construction shows that the boundary is generated by an iterated function system starting with 2 compact sets.

A semi-automatic method for indirect orientation of aerial images using ground control lines extracted from airborne laser scanner data

This paper presents a method for indirect orientation of aerial images using ground control lines extracted from airborne Laser system (ALS) data. This data integration strategy has shown good potential in the automation of photogrammetric tasks, including the indirect orientation of images. The most important characteristic of the proposed approach is that the exterior orientation parameters (EOP) of a single or multiple images can be automatically computed with a space resection procedure from data derived from different sensors. The suggested method works as follows. Firstly, the straight lines are automatically extracted in the digital aerial image (s) and in the intensity image derived from an ALS data-set (S). Then, correspondence between s and S is automatically determined. A line-based coplanarity model that establishes the relationship between straight lines in the object and in the image space is used to estimate the EOP with the iterated extended Kalman filtering (IEKF). Implementation and testing of the method have employed data from different sensors. Experiments were conducted to assess the proposed method and the results obtained showed that the estimation of the EOP is function of ALS positional accuracy.

Stable singularities of co-rank one quasi homogeneous map germs from (ℂn+1, 0) to (ℂn, 0), n = 2, 3

In this article, we investigate the geometry of quasi homogeneous corank one finitely determined map germs from (ℂn+1, 0) to (ℂn, 0) with n = 2, 3. We give a complete description, in terms of the weights and degrees, of the invariants that are associated to all stable singularities which appear in the discriminant of such map germs. The first class of invariants which we study are the isolated singularities, called 0-stable singularities because they are the 0-dimensional singularities. First, we give a formula to compute the number of An points which appear in any stable deformation of a quasi homogeneous co-rank one map germ from (ℂn+1, 0) to (ℂn, 0) with n = 2, 3. To get such a formula, we apply the Hilbert's syzygy theorem to determine the graded free resolution given by the syzygy modules of the associated iterated Jacobian ideal. Then we show how to obtain the other 0-stable singularities, these isolated singularities are formed by multiple points and here we use the relation among them and the Fitting ideals of the discriminant. For n = 2, there exists only the germ of double points set and for n = 3 there are the triple points, named points A1,1,1 and the normal crossing between a germ of a cuspidal edge and a germ of a plane, named A2,1. For n = 3, there appear also the one-dimensional singularities, which are of two types: germs of cuspidal edges or germs of double points curves. For these singularities, we show how to compute the polar multiplicities and also the local Euler obstruction at the origin in terms of the weights and degrees. © 2013 Pushpa Publishing House.

Orientação semi-automática de imagens CBERS usando rodovias como controle de campo

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

Dimensões fractais para certos sistemas dinâmicos discretos

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

Sequenciamento de lotes em prensas de alta capacidade com tempo de setup dependente da sequência

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

Métodos de solução para um problema de sequenciamento da produção com sincronismo de execução de tarefas

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

Detecção do contato entre camadas através do perfil de indução

Dois dos principais objetivos da interpretação petrofísica de perfis são a determinação dos limites entre as camadas geológicas e o contato entre fluidos. Para isto, o perfil de indução possui algumas importantes propriedades: É sensível ao tipo de fluido e a distribuição do mesmo no espaço poroso; e o seu registro pode ser modelado com precisão satisfatória como sendo uma convolução entre a condutividade da formação e a função resposta da ferramenta. A primeira propriedade assegura uma boa caracterização dos reservatórios e, ao mesmo tempo, evidencia os contatos entre fluidos, o que permite um zoneamento básico do perfil de poço. A segunda propriedade decorre da relação quasi-linear entre o perfil de indução e a condutividade da formação, o que torna possível o uso da teoria dos sistemas lineares e, particularmente, o desenho de filtros digitais adaptados à deconvolução do sinal original. A idéia neste trabalho é produzir um algoritmo capaz de identificar os contatos entre as camadas atravessadas pelo poço, a partir da condutividade aparente lida pelo perfil de indução. Para simplificar o problema, o modelo de formação assume uma distribuição plano-paralela de camadas homogêneas. Este modelo corresponde a um perfil retangular para condutividade da formação. Usando o perfil de entrada digitalizado, os pontos de inflexão são obtidos numericamente a partir dos extremos da primeira derivada. Isto gera uma primeira aproximação do perfil real da formação. Este perfil estimado é então convolvido com a função resposta da ferramenta gerando um perfil de condutividade aparente. Uma função custo de mínimos quadrados condicionada é definida em termos da diferença entre a condutividade aparente medida e a estimada. A minimização da função custo fornece a condutividade das camadas. O problema de otimização para encontrar o melhor perfil retangular para os dados de indução é linear nas amplitudes (condutividades das camadas), mas uma estimativa não linear para os contatos entre as camadas. Neste caso as amplitudes são estimadas de forma linear pelos mínimos quadrados mantendo-se fixos os contatos. Em um segundo passo mantem-se fixas as amplitudes e são calculadas pequenas mudanças nos limites entre as camadas usando uma aproximação linearizada. Este processo é interativo obtendo sucessivos refinamentos até que um critério de convergência seja satisfeito. O algoritmo é aplicado em dados sintéticos e reais demonstrando a robustez do método.

COINCIDENCES OF FIBREWISE MAPS BETWEEN SPHERE BUNDLES OVER THE CIRCLE

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

Resolução do problema de sequenciamento de múltiplas linhas de montagem de modelos mistos em ambiente de produção enxuta

This work deals with the sequencing of Multi-Mixed-Model Assembly Lines in a lean manufacturing environment, where an operational structure where several kanbans support several mixed-model assembly lines, so that all assembly lines can receive parts or sub-assemblies from all suppliers. To optimize this system, the sequencing seeks to minimize the distance between the real consumption and the constant ideal consumption of parts or subassemblies, thereby reducing the scaling of kanbans and intermediate stocks. To solve the sequencing problems, the method Clustering Search was applied along with the metaheuristics Variable Neighborhood Search, Simulation Annealing and Iterative Local Search. Instances from the literature and generated instances were tested, thus allowing comparing the methods to each other and with other methods presented in the literature. The performance of the Clustering Search with Iterated Local Search stands out by the quality and robustness of their solutions, and mainly for its efficiency, whereas it converges to better results at a lower computational cost

Meta-heurísticas para o problema de planejamento de expansão da rede de transmissão de energia elétrica considerando restrições de segurança

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

Towards automated first-order abduction: the cut-based approach

Traditional abduction imposes as a precondition the restriction that the background information may not derive the goal data. In first-order logic such precondition is, in general, undecidable. To avoid such problem, we present a first-order cut-based abduction method, which has KE-tableaux as its underlying inference system. This inference system allows for the automation of non-analytic proofs in a tableau setting, which permits a generalization of traditional abduction that avoids the undecidable precondition problem. After demonstrating the correctness of the method, we show how this method can be dynamically iterated in a process that leads to the construction of non-analytic first-order proofs and, in some terminating cases, to refutations as well.