• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

3D RECONSTRUCTION USING MULTI-VIEW IMAGING SYSTEM

Huang, Conglin 01 January 2009 (has links)
This thesis presents a new system that reconstructs the 3D representation of dental casts. To maintain the integrity of the 3D representation, a standard model is built to cover the blind spots that the camera cannot reach. The standard model is obtained by scanning a real human mouth model with a laser scanner. Then the model is simplified by an algorithm which is based on iterative contraction of vertex pairs. The simplified standard model uses a local parametrization method to obtain the curvature information. The system uses a digital camera and a square tube mirror in front of the camera to capture multi-view images. The mirror is made of stainless steel in order to avoid double reflections. The reflected areas of the image are considered as images taken by the virtual cameras. Only one camera calibration is needed since the virtual cameras have the same intrinsic parameters as the real camera. Depth is computed by a simple and accurate geometry based method once the corresponding points are identified. Correspondences are selected using a feature point based stereo matching process, including fast normalized cross-correlation and simulated annealing.
2

Iterative edge length interval constraining in triangular meshes based on local parametrization

Hauck, João Vitor de Sá January 2015 (has links)
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-06-06T13:21:41Z No. of bitstreams: 1 joaovitordesahauck.pdf: 33226275 bytes, checksum: b7a8ed469369e9bbccd22738ced13ab0 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-06-06T14:07:12Z (GMT) No. of bitstreams: 1 joaovitordesahauck.pdf: 33226275 bytes, checksum: b7a8ed469369e9bbccd22738ced13ab0 (MD5) / Made available in DSpace on 2017-06-06T14:07:12Z (GMT). No. of bitstreams: 1 joaovitordesahauck.pdf: 33226275 bytes, checksum: b7a8ed469369e9bbccd22738ced13ab0 (MD5) Previous issue date: 2015 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Malhas com restrições no comprimento das arestas são úteis para diversas aplicações, especialmente para simulações de processos químicos e físicos. Este trabalho apresenta um método iterativo para remalhar uma malha triangular arbitraria de variedade 2 em uma malha com o comprimento de todas as arestas dentro de um intervalo de restrição definido pelo usuário. O método usa operações estelares para ajustar a quantidade de vértices e triângulos no modelo e para melhorar a valência dos vértices. Ele também aplica o operador Laplaciano em um espaço paramétrico local para melhorar a distribuição de vértices sobre a superfície. Propõe-se, uma otimização não linear, aplicada localmente, para os casos em que a malha é praticamente regular. Perdas geométricas são evitadas pela realização de uma projeção sobre a superfície original. O método proposto resulta em uma malha praticamente regular, com os vértices distribuídos uniformemente sobre a superfície. A dual da malha é usada em simulações de nano estruturas de carbono como uma aplicação do método. A principal contribuição deste trabalho é uma nova abordagem para restringir explicitamente o comprimento das arestas em um intervalo dado. Nosso método ainda garante baixa perda global de geometria e baixo custo de memória em comparação com métodos disponíveis na literatura. / Meshes with constraints in the edge length are useful for several applications, spe-cially for chemical and physical simulations. This work presents an iterative method for remeshing an arbitrary triangular 2-manifold mesh into a mesh with all edge lengths within an user-defined constraining interval. The method uses stellar operations to adjust the amount of vertices and triangles in the model and for improving the valence of the vertices. It also applies the Laplacian operator in a local parametric space to improve the distribution of the vertices over the surface. We propose a nonlinear optimization, locally applied, for cases in which the mesh is almost regular. Geometric losses are prevented by performing a projection over the original surface. Our method results in a nearly regu-lar mesh, with vertices uniformly distributed over the surface. The dual of the mesh is used in simulations of carbon nanostructures as an application of the method. The main contribution of this work is a new approach for constraining the edge length within an explicitly given interval. Our method also ensures lower global geometry losses and lower memory cost in comparison to methods available in the literature.

Page generated in 0.1048 seconds