Dissertations / Theses on the topic 'MESH POINTS'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'MESH POINTS.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Itier, Vincent. "Nouvelles méthodes de synchronisation de nuages de points 3D pour l'insertion de données cachées." Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS017/document.
Full textThis thesis addresses issues relating to the protection of 3D object meshes. For instance, these objects can be created using CAD tool developed by the company STRATEGIES. In an industrial context, 3D meshes creators need to have tools in order to verify meshes integrity, or check permission for 3D printing for example.In this context we study data hiding on 3D meshes. This approach allows us to insert information in a secure and imperceptible way in a mesh. This may be an identifier, a meta-information or a third-party content, for instance, in order to transmit secretly a texture. Data hiding can address these problems by adjusting the trade-off between capacity, imperceptibility and robustness. Generally, data hiding methods consist of two stages, the synchronization and the embedding. The synchronization stage consists of finding and ordering available components for insertion. One of the main challenges is to propose an effective synchronization method that defines an order on mesh components. In our work, we propose to use mesh vertices, specifically their geometric representation in space, as basic components for synchronization and embedding. We present three new synchronisation methods based on the construction of a Hamiltonian path in a vertex cloud. Two of these methods jointly perform the synchronization stage and the embedding stage. This is possible thanks to two new high-capacity embedding methods (from 3 to 24 bits per vertex) that rely on coordinates quantization. In this work we also highlight the constraints of this kind of synchronization. We analyze the different approaches proposed with several experimental studies. Our work is assessed on various criteria including the capacity and imperceptibility of the embedding method. We also pay attention to security aspects of the proposed methods
Parisot, Pascaline. "Suivi d’objets dans des séquences d’images de scènes déformables : de l’importance des points d’intérêt et du maillage 2D." Thesis, Toulouse, INPT, 2009. http://www.theses.fr/2009INPT012H/document.
Full textWe deal with object tracking in videos of non-rigid scenes with two main purposes. We aim at determining the transformations of an object, from one frame to the next, when it may be distorted or moved and when the camera focus may change (movement, zoom...). To do this, we were inspired by the Jurie and Dhome algorithm, which enables the tracking of plane rigid objects. On the one hand, we improve its performance. On the other hand, we generalize it to non-rigid objects. The first goal consists in improving the performance of the Jurie and Dhome algorithm, in terms of accuracy and robustness. The tracking is based on a set of interest points, which has a great effect on the algorithm’s performance. These interest points come from a selection among the points extracted with some common detectors: SIFT, KLT, SUSAN, HARRIS, and MORAVEC.With various pictures classes, we have studied and implemented some selection heuristics based on statistical or algebraic approaches. We show that : • there is no universal detector, • the statistical approach is the best in all cases. The second goal is a proposal of a new tracking algorithm based on a 2D mesh of the video frames. This algorithm generalizes the Jurie and Dhome one for non-rigid scenes. It is based on : • elementary (nodal), direct or inverse, mesh transformations that we geometrically and analytically characterize, • generalized barycentric coordinates to approximate the composition of two mesh transformations. This algorithm gives similar results to the hexagonal matching algorithm of Nakaya and Harashima while being faster
Loménie, Nicolas. "Interprétation de nuages de points : application à la modélisaion d'environnements 3D en robotique mobile." Phd thesis, Université René Descartes - Paris V, 2001. http://tel.archives-ouvertes.fr/tel-00136113.
Full textAkdag, Osman. "Incompressible Flow Simulations Using Least Squares Spectral Element Method On Adaptively Refined Triangular Grids." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614944/index.pdf.
Full textBen, salah Imeen. "Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis." Thesis, Normandie, 2019. http://www.theses.fr/2019NORMR070/document.
Full textCameras have become increasingly common in vehicles, smart phones, and advanced driver assistance systems. The areas of application of these cameras in the world of intelligent transportation systems are becoming more and more varied : pedestrian detection, line crossing detection, navigation ... Vision-based navigation has reached a certain maturity in recent years through the use of advanced technologies. Vision-based navigation systems have the considerable advantage of being able to directly use the visual information already existing in the environment without having to adapt any element of the infrastructure. In addition, unlike systems using GPS, they can be used outdoors and indoors without any loss of precision. This guarantees the superiority of these systems based on computer vision. A major area of {research currently focuses on mapping, which represents an essential step for navigation. This step generates a problem of memory management quite substantial required by these systems because of the huge amount of information collected by each sensor. Indeed, the memory space required to accommodate the map of a small city is measured in tens of GB or even thousands when one wants to cover large spaces. This makes impossible to integrate this map into a mobile system such as smartphones , cameras embedded in vehicles or robots. The challenge would be to develop new algorithms to minimize the size of the memory needed to operate this navigation system using only computer vision. It's in this context that our project consists in developing a new system able to summarize a3D map resulting from the visual information collected by several sensors. The summary will be a set of spherical views allow to keep the same level of visibility in all directions. It would also guarantee, at a lower cost, a good level of precision and speed during navigation. The summary map of the environment will contain geometric, photometric and semantic information
Vasiliauskienė, Lina. "Prisitaikančiosios baigtinių elementų strategijos plokštuminiams tamprumo teorijos uždaviniams." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060622_134743-74080.
Full textSantoso, Mas Simon. "Simulation d'écoulements fluides à partir de données réelles." Thesis, Ecole centrale de Nantes, 2018. http://www.theses.fr/2018ECDN0011.
Full textPoints clouds are mathematical objects that allows to describe discretely multivariable functions. They are mainly used in the statistical domain but also in geometrical manifolds. It is nowadays a real challenge to immerse the previous manifolds in finite element computation. Indeed, the immersion of those points clouds requires the reconstruction of the surface of the manifold and the generation of a surfacic mesh. As those operations are often based on an iterative process, they are extremely time-consuming as points clouds are usually massive. The method developed in this thesis allows to immerse points clouds in a meshed domain without the surface reconstruction and mesh generations steps. For that purpose, we use the Volume Immersion Method adapted to point clouds. We coupled this method with an adaped mesh generation technique. Then we are able to generate a monolithic anisotropic mesh, adapted around interest zones. We also use the variational multi-scale method to simulate fluid flow. This method is an extension of the classical finite element method and allows to simulate fluid flow. The last part of this thesis introduce some applications cases in the aerodynamic and urbans domains
El, Sayed Abdul Rahman. "Traitement des objets 3D et images par les méthodes numériques sur graphes." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMLH19/document.
Full textSkin detection involves detecting pixels corresponding to human skin in a color image. The faces constitute a category of stimulus important by the wealth of information that they convey because before recognizing any person it is essential to locate and recognize his face. Most security and biometrics applications rely on the detection of skin regions such as face detection, 3D adult object filtering, and gesture recognition. In addition, saliency detection of 3D mesh is an important pretreatment phase for many computer vision applications. 3D segmentation based on salient regions has been widely used in many computer vision applications such as 3D shape matching, object alignments, 3D point-point smoothing, searching images on the web, image indexing by content, video segmentation and face detection and recognition. The detection of skin is a very difficult task for various reasons generally related to the variability of the shape and the color to be detected (different hues from one person to another, orientation and different sizes, lighting conditions) and especially for images from the web captured under different light conditions. There are several known approaches to skin detection: approaches based on geometry and feature extraction, motion-based approaches (background subtraction (SAP), difference between two consecutive images, optical flow calculation) and color-based approaches. In this thesis, we propose numerical optimization methods for the detection of skins color and salient regions on 3D meshes and 3D point clouds using a weighted graph. Based on these methods, we provide 3D face detection approaches using Linear Programming and Data Mining. In addition, we adapted our proposed methods to solve the problem of simplifying 3D point clouds and matching 3D objects. In addition, we show the robustness and efficiency of our proposed methods through different experimental results. Finally, we show the stability and robustness of our methods with respect to noise
Bouchiba, Hassan. "Contributions en traitements basés points pour le rendu et la simulation en mécanique des fluides." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEM076/document.
Full textMost surface 3D scanning techniques produce 3D point clouds. This thesis tackles the problem of using points as only explicit surface representation. It presents two contributions in point-based processing. The first contribution is a new raw and massive point cloud screen-space rendering algorithm. This new method can be applied to a wide variety of data from small objects to complex scenes. A sequence of screen-space pyramidal operators is used to reconstruct in real-time a surface and estimate its normals, which are later used to perform deferred shading. In addition, the use of pyramidal operators allows to achieve framerate one order of magnitude higher than state of the art methods. The second proposed contribution is a new immersed boundary computational fluid dynamics method by extended implicit surface reconstruction. The proposed method is based on a new implicit surface definition from a point cloud by extended moving least squares. This surface is then used to define the boundary conditions of a finite-elements immersed boundary transient Navier-Stokes solver, which is used to compute flows around the object sampled by the point cloud. The solver is interfaced with an anisotropic and adaptive meshing algorithm which refines the computational grid around both the geometry defined by point cloud and the flow at each timestep of the simulation
Fang, Hao. "Modélisation géométrique à différent niveau de détails d'objets fabriqués par l'homme." Thesis, Université Côte d'Azur (ComUE), 2019. http://www.theses.fr/2019AZUR4002/document.
Full textGeometric modeling of man-made objects from 3D data is one of the biggest challenges in Computer Vision and Computer Graphics. The long term goal is to generate a CAD-style model in an as-automatic-as-possible way. To achieve this goal, difficult issues have to be addressed including (i) the scalability of the modeling process with respect to massive input data, (ii) the robustness of the methodology to various defect-laden input measurements, and (iii) the geometric quality of output models. Existing methods work well to recover the surface of free-form objects. However, in case of manmade objects, it is difficult to produce results that approach the quality of high-structured representations as CAD models.In this thesis, we present a series of contributions to the field. First, we propose a classification method based on deep learning to distinguish objects from raw 3D point cloud. Second, we propose an algorithm to detect planar primitives in 3D data at different level of abstraction. Finally, we propose a mechanism to assemble planar primitives into compact polygonal meshes. These contributions are complementary and can be used sequentially to reconstruct city models at various level-of-details from airborne 3D data. We illustrate the robustness, scalability and efficiency of our methods on both laser and multi-view stereo data composed of man-made objects
Lee, Kai-wah, and 李啟華. "Mesh denoising and feature extraction from point cloud data." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B42664330.
Full textCardote, André Amorim de Faria. "WiMax point-to-multipoint and mesh mode network planning." Master's thesis, Universidade de Aveiro, 2009. http://hdl.handle.net/10773/4003.
Full textNuma sociedade em que, crescentemente, utilizamos a Internet como meio de trabalho, lúdico ou simplesmente informativo, são necessários novos meios de levar esta tecnologia até todos, de maneira a que possamos tirar partido e evoluir com ela. Sendo a falta de cobertura dos actuais operadores de telecomunicações, em certas partes do território mais recônditas, um dos impedimentos para que toda a população possa ter ligação à Internet a preços acessíveis, o WiMAX surge como uma solução sem fios de banda larga com grande cobertura e baixo custo de implementação, que possibilita tanto o acesso directo por parte dos utilizadores como o funcionamento em modo de backhaul para redes Wi-Fi ou de outro tipo. O objecto de estudo desta dissertação é o planeamento de redes WiMAX ao nível físico, ou seja, a disposição dos diversos elementos constituintes da rede da melhor forma possível para maximizar a cobertura da rede ao menor custo. No âmbito deste trabalho foram efectuados diversos estudos ao nível de propagação de ondas para a tecnologia WiMAX e planeamento de redes ponto-multiponto e em malha. Foram desenvolvidos algoritmos que permitem o planeamento de redes em diversos cenários, tais como: acesso em zonas de grande densidade populacional, acesso em zonas longínquas, até onde se torna difícil a passagem de um cabo, ou mesmo cenários em que seja mais proveitoso utilizar o Wi-Fi como tecnologia de acesso para os utilizadores, ficando o WiMAX como tecnologia de backhaul. Foi também criado um mecanismo de posicionamento automático e optimizado dos componenentes de uma rede em malha. Como resultado do estudo realizado foram desenvolvidas com sucesso, a partir dos algoritmos estudados, duas aplicações para planeamento de redes WiMAX, uma em modo ponto-multiponto e outra em modo de malha, que serão devidamente apresentadas ao longo do texto. Utilizando as aplicações desenvolvidas, foi possível obter vários resultados que permitirão uma melhor compreensão e avaliação de redes WiMAX.
In a society where the Internet is increasingly used for working, playing or simply watching the news, new ways to get this technology to everyone are required, so that each and everyone can take part on this great global community. One of the major barriers for the widespread of the low-cost Internet is the unlikelihood to reach very remote locations of the territory. WiMAX appears as a promising broadband wireless access technology with low deployment cost and high coverage, allowing users to access directly to the network using this technology or providing backhaul connections for other technologies, such as Wi-Fi. The aim of this MSc thesis is the physical WiMAX network planning, i.e. the placement of the various elements of a network in order to maximize de coverage with the lowest cost. In the scope of this work, several studies in wave propagation for the WiMAX technology point-to-multipoint and mesh mode network planning were per- formed. Some algorithms that allow network planning in various scenarios, such as access in highly populated areas, isolated places, where it is hard to run a wire or even in scenarios where it is preferable to make the last mile access in Wi-Fi were developed, as well as a mechanism to select the positions of the elements in a WiMAX mesh network. As a result of this study two applications for WiMAX network planning were successfully developed, based on the formulated algorithms: one for point- to-multipoint mode and the other for mesh mode operation, which will be properly presented through this text. Using the developed applications, it has been possible to perform several essays that will allow a better comprehension and evaluation of WiMAX networks.
Lee, Kai-wah. "Mesh denoising and feature extraction from point cloud data." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B42664330.
Full textŠuľak, Andrej. "Rekonstrukce povrchu vozovky." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2019. http://www.nusl.cz/ntk/nusl-401550.
Full textWang, Yawen. "Torque Load Effect on Multi-Point Mesh and Dynamics of Right-angle Geared Drives." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1384870250.
Full textYanagita, Tamaki. "MESH-FREE MODELING OF ULTRASONIC FIELDS GENERATED BY TRANSDUCERS AND ACOUSTIC MICROSCOPES." Diss., The University of Arizona, 2009. http://hdl.handle.net/10150/195234.
Full textBrown, Steven W. "Interactive Part Selection for Mesh and Point Models Using Hierarchical Graph-cut Partitioning." Diss., CLICK HERE for online access, 2008. http://contentdm.lib.byu.edu/ETD/image/etd2420.pdf.
Full textMbayi, Charles K. "Efficient Variable Mesh Techniques to solve Interior Layer Problems." University of Western Cape, 2020. http://hdl.handle.net/11394/7324.
Full textSingularly perturbed problems have been studied extensively over the past few years from different perspectives. The recent research has focussed on the problems whose solutions possess interior layers. These interior layers appear in the interior of the domain, location of which is difficult to determine a-priori and hence making it difficult to investigate these problems analytically. This explains the need for approximation methods to gain some insight into the behaviour of the solution of such problems. Keeping this in mind, in this thesis we would like to explore a special class of numerical methods, namely, fitted finite difference methods to determine reliable solutions. As far as the fitted finite difference methods are concerned, they are grouped into two categories: fitted mesh finite difference methods (FMFDMs) and the fitted operator finite difference methods (FOFDMs). The aim of this thesis is to focus on the former. To this end, we note that FMFDMs have extensively been used for singularly perturbed two-point boundary value problems (TPBVPs) whose solutions possess boundary layers. However, they are not fully explored for problems whose solutions have interior layers. Hence, in this thesis, we intend firstly to design robust FMFDMs for singularly perturbed TPBVPs whose solutions possess interior layers and to improve accuracy of these approximation methods via methods like Richardson extrapolation. Then we extend these two ideas to solve such singularly perturbed TPBVPs with variable diffusion coefficients. The overall approach is further extended to parabolic singularly perturbed problems having constant as well as variable diffusion coefficients.
2023-08-31
Liu, Yong-Jin. "Complex shape modeling with point sampled geometry /." View abstract or full-text, 2003. http://library.ust.hk/cgi/db/thesis.pl?MECH%202003%20LIUY.
Full textJoshi, Shriyanka. "Reverse Engineering of 3-D Point Cloud into NURBS Geometry." University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1595849563494564.
Full textAzeredo, Daniel Mendes. "Simulação numérica de uma função indicadora de fluidos tridimensional empregando refinamento adaptativo de malhas." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45132/tde-15082013-160020/.
Full textThe scientific motivation of the present work is the mathematical modeling and the computational simulation of multiphase flows. Specifically, the equations of a two-phase flow are written by combining the Immersed Boundary Method with a suitable fluid indicator function. It is assumed that the fluid equations are discretized on an Eulerian mesh covering completely the flow domain and that the interface between the fluid phases is discretized by a non-structured Lagrangian mesh formed by triangles. In this context, employing tools commonly found in Computational Geometry, the computation of the fluid indicator function is efficiently performed on a block-structured Eulerian mesh bearing dynamical refinement patches. Formed by a set of triangles, the Lagrangian mesh, which is initally generated employing the free software GMSH, is stored in a Halfedge data structure, a data structure which is widely used in Computer Graphics to represent bounded, orientable closed surfaces. Once the Lagrangian mesh has been generated, next, one deals with the hipothetical situation of dealing with the one-way dynamical interaction between the immersed boundary and the fluid flow, that is, considering the non-slip condition, only the action of the flow on the interface is studied. No forces arising on the interface affects the flow, the interface passively being advect with the flow under a prescribed, imposed velocity field. In particular, the Navier-Stokes equations are not solved. The fluid indicator function is given by a signed distance function in a vicinity of the immersed boundary. It is employed to identify interior/exterior points with respect to the bounded, closed region which is assumed to contain one of the fluid phases in its interior. The signed distance is update every time step employing Computational Geometry methods with optimal cost. Several examples in three dimensions, showing the efficiency and efficacy in the computation of the fluid indicator function, are given which employ the dynamical adaptive properties of the Eurlerian mesh for a moving interface.
Raška, Martin. "Mobile IP v sítích MANET." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218096.
Full textEllyson, Laura Jean. "Resource Intensification of Small Game Use at Goodman Point, Southwestern Colorado." Thesis, University of North Texas, 2014. https://digital.library.unt.edu/ark:/67531/metadc699883/.
Full textMojžyšek, Tomáš. "Možnosti vytvoření mračna bodů a síťového modelu místa dopravní nehody z fotografií." Master's thesis, Vysoké učení technické v Brně. Ústav soudního inženýrství, 2019. http://www.nusl.cz/ntk/nusl-399590.
Full textKolářová, Eva. "Vliv přídavku vícesměrně orientované výztuže na mechanické vlastnosti materiálu pro přípravu celkově snímatelných náhrad." Master's thesis, Vysoké učení technické v Brně. Fakulta chemická, 2014. http://www.nusl.cz/ntk/nusl-217087.
Full textLounsbury, Robert Lee. "Optimum antenna configuration for maximizing access point range of an IEEE 802.11 wireless mesh network in support of multi-mission operations relative to hastily formed scalable deployments." Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion-image.exe/07Sep%5FLounsbury.pdf.
Full textThesis Advisor(s): Ehlert, James. "September 2007." Description based on title screen as viewed on Oct. 23, 2007. Includes bibliographical references (p. 85-86). Also available in print.
Lounsbury, Jr Robert L. "Optimum Antenna Configuration for Maximizing Access Point Range of an IEEE 802.11 Wireless Mesh Network in Support of Multi-Mission Operations Relative to Hastily Formed Scalable Deployments." Ft. Belvoir : Defense Technical Information Center, 2007. http://handle.dtic.mil/100.2/ADA474138.
Full textFier, Jeffrey Michael Keller Herbert Bishop Keller Herbert Bishop. "Part I. Fold continuation and the flow between rotating, coaxial disks. : Part II. Equilibrium chaos. Part III. A mesh selection algorithm for two-point boundary value problems /." Diss., Pasadena, Calif. : California Institute of Technology, 1985. http://resolver.caltech.edu/CaltechETD:etd-03262008-150456.
Full textNyman, Jonas. "Faster Environment Modelling and Integration into Virtual Reality Simulations." Thesis, Högskolan i Skövde, Institutionen för ingenjörsvetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-19800.
Full textRuest-Paquette, Anne-Sophie. "Le poids des représentations sociales: Les répercussions identitaires et sociales de mes expériences socioscolaires." Thesis, University of Ottawa (Canada), 2009. http://hdl.handle.net/10393/28103.
Full textHoffman, Amy Susan. "Faunal Exploitation during the Depopulation of the Mesa Verde Region (A. D. 1300): A Case Study of Goodman Point Pueblo (5MT604)." Thesis, University of North Texas, 2011. https://digital.library.unt.edu/ark:/67531/metadc84216/.
Full textKjellén, Kevin. "Point Cloud Registration in Augmented Reality using the Microsoft HoloLens." Thesis, Linköpings universitet, Datorseende, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148901.
Full textWinstead, Christy. "The Use of Faunal Remains for Identifying Shifts in Pit Structure Function in the Mesa Verde Region: a Case Study From Goodman Point." Thesis, University of North Texas, 2015. https://digital.library.unt.edu/ark:/67531/metadc804909/.
Full textKroupa, Ondřej. "Digitální model reliéfu v areálu Admas." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2017. http://www.nusl.cz/ntk/nusl-390213.
Full textSilva, Alysson Alexander Naves. "Simulação numérica de escoamentos bidimensionais com superfícies livres e linhas de contato dinâmicas." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-22062010-145307/.
Full textAn arbitrary lagrangian-eulerian finite element method to solve surface tension dominated flows is presented. Such flows are important in many applications, particularly in capillary channels, that appear in microscale flows. The resolution of such flows presents several challenges that are addressed in this work. The flow is solved only in the liquid phase, and proper boundary conditions are applied on the free-surface, bounding the liquid and gas, which is explicitly represented by vertices and edges of the computational mesh. The mesh is moved and deformed, but its quality is kept under control in order to control errors in the numerical solution. The Navier-Stokes equations are discretized by standard Galerkin finite element method in an arbitrary reference. Details of the computation of surface tension and contact line effects are presented. The methodology is validated for a number of simple test cases against known pseudo-analytical solutions, and numerical results are presented, showing the robustness and accuracy of the methodology. Finally, some results about surface-tension-driven flows in capillaries are presented
Vitula, Marek. "Dokumentace části hradu Rokštejn pomocí laserového skenování." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2016. http://www.nusl.cz/ntk/nusl-390174.
Full textBrown, Andrew D. "Looking Outward from the Village: The Contingencies of Soil Moisture on the Prehistoric Farmed Landscape near Goodman Point Pueblo." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc862755/.
Full textYogeswaran, Arjun. "3D Surface Analysis for the Automated Detection of Deformations on Automotive Panels." Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/19992.
Full textNoreikis, Marius. "Image Based Indoor Navigation." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177344.
Full textForskare har de senaste åren framfört olika inomhusnavigations- och lokaliseringssystem. Dock kräver lösningar som använder WiFi eller radiofrekvens identifikation en utbyggdnad av stödjande infrastruktur i navigationsområdena. Även teknikerna som används lider av precisionsfel. I det här examensarbetet redovisar vi en ny taktik för inomhusnavigation som använder sig av datorvisualiserings Structure from Motion-tekniker. Vi implementerade en navigationssystemsprototyp som använder bilder för att bygga en navigationskarta och kartlägga användarens position. I vårt klient-server baserat system är en klient en mobilapplikation som tillåter användaren att hitta sin position genom att ta en bild. På server-sidan hanteras kartor, lokaliseringsförfrågor och mättningar av förfrågorna och algoritmerna som används. Systemet har lyckats navigera genom Aalto Universitets datorvetenskapsbiblioteket. Vi lyckades uppnå en felmarginal pa 0.26 meter för lyckade lokaliseringsbilder. I arbetet redovisar vi utmaningar som vi har löst för att anpassa datorvisualiseringstekniker for lokalisering. Vi har även diskuterat potentialla framtida implementationer for att utvidga systemet.
Tournier, Nicolas. "Synchronisation pour l'insertion de données dans des maillages 3D." Thesis, Montpellier 2, 2014. http://www.theses.fr/2014MON20221/document.
Full textData security is one of the main issue in computer science. We need to develop solutions for confidentiality, communication, fingerprinting or identification applications for exemple. In this thesis made with STRATEGIES S.A., the chosen method to protect 3D meshes is watermarking.Watermarking is divided in two steps, the embedding and the extraction. In both of them a synchronization phase is needed. It is one of the most important step for 3D mesh because it permits to look for areas available to embed information, and order them. All the thesis is devoted to the synchronization step. First of all, we propose a classification of watermarking techniques based on the type of synchronization method instead of evaluation criterions such as robustness or capacity.Then, from methods based on Euclidean minimum spanning tree, we propose a theoritical analysis of the mobility of the vertices in that kind of structure. First, we explain the reasons of the sensibility of the structure. Secondly, we propose another scheme based on the Euclidean minimum spanning tree knowing its fragility
Neeli, Yeshwanth Sai. "Use of Photogrammetry Aided Damage Detection for Residual Strength Estimation of Corrosion Damaged Prestressed Concrete Bridge Girders." Thesis, Virginia Tech, 2020. http://hdl.handle.net/10919/99445.
Full textMaster of Science
Corrosion damage is a major concern for bridges as it reduces their load carrying capacity. Bridge failures in the past have been attributed to corrosion damage. The risk associated with corrosion damage caused failures increases as the infrastructure ages. Many bridges across the world built forty to fifty years ago are now in a deteriorated condition and need to be repaired and retrofitted. Visual inspections to identify damage or deterioration on a bridge are very important to assess the condition of the bridge and determine the need for repairing or for posting weight restrictions for the vehicles that use the bridge. These inspections require close physical access to the hard-to-reach areas of the bridge for physically measuring the damage which involves many resources in the form of experienced engineers, skilled labor, equipment, time, and money. The safety of the personnel involved in the inspections is also a major concern. Nowadays, a lot of research is being done in using Unmanned Aerial Vehicles (UAVs) like drones for bridge inspections and in using artificial intelligence for the detection of cracks on the images of concrete and steel members. Girders or beams in a bridge are the primary longitudinal load carrying members. Concrete inherently is weak in tension. To address this problem, High Strength steel reinforcement (called prestressing steel or prestressing strands) in prestressed concrete beams is pre-loaded with a tensile force before the application of any loads so that the regions which will experience tension under the service loads would be subjected to a pre-compression to improve the performance of the beam and delay cracking. Spalls are a type of corrosion damage on concrete members where portions of concrete fall off (section loss) due to corrosion in the steel reinforcement, exposing the reinforcement to the environment which leads to accelerated corrosion causing a loss of cross-sectional area and ultimately, a rupture in the steel. If the process of detecting the damage (cracks, spalls, exposed or severed reinforcement, etc.) is automated, the next logical step that would add great value would be, to quantify the effect of the damage detected on the load carrying capacity of the bridges. Using a quantified estimate of the remaining capacity of a bridge, determined after accounting for the corrosion damage, informed decisions can be made about the measures to be taken. This research proposes a stepwise framework to forge a link between a semi-automated visual inspection and residual capacity evaluation of actual prestressed concrete bridge girders obtained from two bridges that have been removed from service in Virginia due to extensive deterioration. 3D point clouds represent an object as a set of points on its surface in three dimensional space. These point clouds can be constructed either using laser scanning or using Photogrammetry from images of the girders captured with a digital camera. In this research, 3D point clouds are reconstructed from sequences of overlapping images of the girders using an approach called Structure from Motion (SfM) which locates matched pixels present between consecutive images in the 3D space. Crack-like features were automatically detected and highlighted on the images of the girders that were used to build the 3D point clouds using artificial intelligence (Neural Network). The images with cracks highlighted were applied as texture to the surface mesh on the point cloud to transfer the detail, color, and realism present in the images to the 3D model. Spalls were detected on 3D point clouds based on the orientation of the normals associated with the points with respect to the reference directions. Point clouds and textured meshes of the girders were scaled to real-world dimensions facilitating the measurement of any required dimension on the point clouds, eliminating the need for physical contact in condition assessment. Any cracks or spalls that went unidentified in the damage detection were visible on the textured meshes of the girders improving the performance of the approach. 3D textured mesh models of the girders overlaid with the detected cracks and spalls were used as 3D damage maps in residual strength estimation. Cross-sectional slices were extracted from the dense point clouds at various sections along the length of each girder. The slices were overlaid on the cross-section drawings of the girders, and the prestressing strands affected due to the corrosion damage were identified. They were reduced in cross-sectional area to account for the corrosion damage as per the recommendations of Naito, Jones, and Hodgson (2011) and were used in the calculation of the ultimate moment capacity of the girders using an approach called strain compatibility analysis. Estimated residual capacities were compared to the actual capacities of the girders found from destructive tests conducted by Al Rufaydah (2020). Comparisons are presented for the failure sections in these tests and the results were analyzed to evaluate the effectiveness of this framework. More research is to be done to determine the factors causing rupture in prestressing strands with different degrees of corrosion. This framework was found to give satisfactory estimates of the residual strength. Reduction in resources involved in current visual inspection practices and eliminating the need for physical access, make this approach worthwhile to be explored further to improve the output of each step in the proposed framework.
Chater, Rabah. "Etude des antimonites MeSb 2 O 4 à basse température : évolution structurale, thermodynamique, propriétés élastiques et magnétiques anisotropes ; modélisation." Paris 6, 1986. http://www.theses.fr/1986PA066219.
Full textDoležal, Jan. "Minimalizace vlivu rušení na bezdrátovou síť." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217521.
Full textDiouf, Abdoulaye. "Influence du régime des feux d'aménagement sur la structure ligneuse des savanes nord-soudaniennes dans le Parc du W, Sud Ouest Niger." Doctoral thesis, Universite Libre de Bruxelles, 2012. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209610.
Full texténigmes de l'écologie des plantes. Les origines du difficile équilibre entre ces formes de vie
sur des dizaines de millions de kilomètres carrés à l'échelle mondiale sont en partie attribuées
aux perturbations fréquentes induites par les feux de végétation dont les effets varient dans
l'espace et dans le temps selon les conditions environnementales. Les résultats de recherche
dépendent de l’échelle et les conclusions tirées d’études locales sont rarement transposables à
d’autres échelles. La question du transfert d'échelle s’avère donc cruciale dans l'étude des
effets du feu, et nécessite une approche transdisciplinaire.
En raison de la variété des échelles couvertes, cette étude constitue une première dans la
confrontation de données sur l’historique des feux dérivé de l'imagerie satellitaire à des
données de terrain incluant des mesures détaillées sur la structure et la composition de
végétation, ainsi que des propriétés édaphiques et topographiques. Elle s’est focalisée sur la
composante ligneuse de par son caractère pérenne et son influence sur les processus
écologiques majeurs. Sur une zone de plus de 2000 km², le Parc National du W du Niger
(PNWN), où le feu est utilisé comme outil pour la gestion et la conservation des écosystèmes
semi-arides, une carte de l'historique des feux a été élaborée à partir d'images MODIS de 250
m de résolution spatiale et de résolution temporelle journalière couvrant une période de sept
années (2002-2009). Pour comprendre la variabilité, à la fois dans l'espace et le temps, de la
propagation du feu dans la végétation, nous avons étudié les caractéristiques de distribution
des feux en termes de régime du feu (i.e. période d'occurrence et fréquence) et de structure
spatiale (métriques paysagères). Les relations causales plausibles entre les régimes du feu, les
conditions édaphiques et topographiques à l'échelle régionale comme locale, et les
caractéristiques de la végétation ligneuse (composition et structure) ont été examinées à
travers des analyses multivariées et des modèles d'équations structurales. Nous avons aussi
examiné plus en détails les stratégies adaptatives mises en oeuvre par les ligneux, et les
interactions biologiques qui sous-tendent l'organisation spatiale des ligneux à travers une
approche des processus ponctuels.
Les résultats montrent que l'activité du feu dans le PNWN se caractérise par une hétérogénéité
spatio-temporelle induite principalement par les conditions édapho-topographiques via la
structure de la végétation ligneuse. Les feux précoces de gestion créent des pare-feux
efficaces, limitant une large extension des feux de saison tardifs. Cependant, ces feux tardifs
pourraient ne pas être aussi destructifs comme qu’on le suppose généralement. En effet,
l'adaptation des espèces aux différents régimes defeu correspond à des stratégies de croissance
contrastées. Dans le cas des feux tardifs, les surfaces terrières et hauteurs moyennes les plus
fortes sont rencontrées, permettant aux arbres de résister au feu. Quant aux zones non
affectées par les feux l'analyse "patron-processus" désigne clairement la facilitation entre
ligneux comme un processus fondamental de l'organisation spatiale périodique du couvert, une
structure émergente qui empêche le passage du feu. Bien qu’ils ne se substituent pas aux
études expérimentales, ces résultats basés sur une expérimentation naturelle à large échelle
apportent des informations nouvelles précieuses tant au niveau fondamental que pour la mise
en place d'une gestion raisonnée du PNWN.
The tree-grass equilibrium in tropical savanna is recognized as one of plant ecology's main
conundrums. The origins of the difficult balance between these life forms over tens of millions
of square kilometers worldwide are in part attributed to the frequent disturbances caused by
vegetation fires effects of which vary in space and time depending on local environmental
factors. Research results are scale-dependent and findings from local studies are rarely
transposable to higher levels of ecosystem organization. The question of scaling (scale
transfer) is therefore crucial in the study of fire effects, and requires a multidisciplinary
approach.
Because of the variety of scales covered, this study is a premiere in the confrontation of
satellite-imagery derived fire history data with detailed field data including measurements of
vegetation parameters (structure and composition), as well as soil and topographic properties.
The study focuses on the woody component, because of its perennial character and its
influence on major ecological processes. On an area of more than 2000 km², the W National
Park of Niger (WNPN) where fire is used as a tool for the management and conservation of
semi-arid ecosystems, a fire history map was elaborated from MODIS images with a 250 m
spatial resolution and a daily temporal resolution over a period of seven years (2002-2009). To
understand the variability, both in space and time, of fire propagation in vegetation, we studied
the fire distribution characteristics in terms of fire regime (i.e. timing and frequency) and
spatial structure (landscape metrics). Plausible causal relationships at regional and local scales
between fire regimes, edaphic and topographic conditions, and the woody vegetation
(composition and structure) characteristics were examined through multivariate analyses and
structural equations models. We also examined in detail the woody species adaptive strategies
as well biological interactions, which underlie their spatial organization, using point statistics.
Results show that the WNPN fire's activity is characterized by spatial and temporal
heterogeneity induced mainly by edaphic and topographic conditions via the structure of the
ligneous component. Prescribed early season fires create effective firewalls, limiting wide late
season fires. However, these late fires might not be as destructive as is commonly assumed.
Indeed, species adaptation to different fire regimes corresponds to contrasting growth
strategies. In the case of late fires, increased basal areas and mean tree heights were
encountered, enabling trees to resist fire and escape flames. As for the unburned areas, the
"pattern-process" analysis clearly indicates that facilitation between shrubs is a fundamental
process determining the woody cover periodic spatial organization, an emergent structure that
prevents fire spread.
Although they do not replace experimental studies, these results based on a large-scale natural
experiment provide valuable new information both on a fundamental level and for setting up
the rational management of the WNPN.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
"Robust and parallel mesh reconstruction from unoriented noisy points." 2009. http://library.cuhk.edu.hk/record=b5896897.
Full textThesis (M.Phil.)--Chinese University of Hong Kong, 2009.
Includes bibliographical references (p. 65-70).
Abstract also in Chinese.
Abstract --- p.v
Acknowledgements --- p.ix
List of Figures --- p.xiii
List of Tables --- p.xv
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Main Contributions --- p.3
Chapter 1.2 --- Outline --- p.3
Chapter 2 --- Related Work --- p.5
Chapter 2.1 --- Volumetric reconstruction --- p.5
Chapter 2.2 --- Combinatorial approaches --- p.6
Chapter 2.3 --- Robust statistics in surface reconstruction --- p.6
Chapter 2.4 --- Down-sampling of massive points --- p.7
Chapter 2.5 --- Streaming and parallel computing --- p.7
Chapter 3 --- Robust Normal Estimation and Point Projection --- p.9
Chapter 3.1 --- Robust Estimator --- p.9
Chapter 3.2 --- Mean Shift Method --- p.11
Chapter 3.3 --- Normal Estimation and Projection --- p.11
Chapter 3.4 --- Moving Least Squares Surfaces --- p.14
Chapter 3.4.1 --- Step 1: local reference domain --- p.14
Chapter 3.4.2 --- Step 2: local bivariate polynomial --- p.14
Chapter 3.4.3 --- Simpler Implementation --- p.15
Chapter 3.5 --- Robust Moving Least Squares by Forward Search --- p.16
Chapter 3.6 --- Comparison with RMLS --- p.17
Chapter 3.7 --- K-Nearest Neighborhoods --- p.18
Chapter 3.7.1 --- Octree --- p.18
Chapter 3.7.2 --- Kd-Tree --- p.19
Chapter 3.7.3 --- Other Techniques --- p.19
Chapter 3.8 --- Principal Component Analysis --- p.19
Chapter 3.9 --- Polynomial Fitting --- p.21
Chapter 3.10 --- Highly Parallel Implementation --- p.22
Chapter 4 --- Error Controlled Subsampling --- p.23
Chapter 4.1 --- Centroidal Voronoi Diagram --- p.23
Chapter 4.2 --- Energy Function --- p.24
Chapter 4.2.1 --- Distance Energy --- p.24
Chapter 4.2.2 --- Shape Prior Energy --- p.24
Chapter 4.2.3 --- Global Energy --- p.25
Chapter 4.3 --- Lloyd´ةs Algorithm --- p.26
Chapter 4.4 --- Clustering Optimization and Subsampling --- p.27
Chapter 5 --- Mesh Generation --- p.29
Chapter 5.1 --- Tight Cocone Triangulation --- p.29
Chapter 5.2 --- Clustering Based Local Triangulation --- p.30
Chapter 5.2.1 --- Initial Surface Reconstruction --- p.30
Chapter 5.2.2 --- Cleaning Process --- p.32
Chapter 5.2.3 --- Comparisons --- p.33
Chapter 5.3 --- Computing Dual Graph --- p.34
Chapter 6 --- Results and Discussion --- p.37
Chapter 6.1 --- Results of Mesh Reconstruction form Noisy Point Cloud --- p.37
Chapter 6.2 --- Results of Clustering Based Local Triangulation --- p.47
Chapter 7 --- Conclusions --- p.55
Chapter 7.1 --- Key Contributions --- p.55
Chapter 7.2 --- Factors Affecting Our Algorithm --- p.55
Chapter 7.3 --- Future Work --- p.56
Chapter A --- Building Neighborhood Table --- p.59
Chapter A.l --- Building Neighborhood Table in Streaming --- p.59
Chapter B --- Publications --- p.63
Bibliography --- p.65
Liu, L., Y. Sheng, G. Zhang, and Hassan Ugail. "Graph Cut Based Mesh Segmentation Using Feature Points and Geodesic Distance." 2015. http://hdl.handle.net/10454/8220.
Full textBoth prominent feature points and geodesic distance are key factors for mesh segmentation. With these two factors, this paper proposes a graph cut based mesh segmentation method. The mesh is first preprocessed by Laplacian smoothing. According to the Gaussian curvature, candidate feature points are then selected by a predefined threshold. With DBSCAN (Density-Based Spatial Clustering of Application with Noise), the selected candidate points are separated into some clusters, and the points with the maximum curvature in every cluster are regarded as the final feature points. We label these feature points, and regard the faces in the mesh as nodes for graph cut. Our energy function is constructed by utilizing the ratio between the geodesic distance and the Euclidean distance of vertex pairs of the mesh. The final segmentation result is obtained by minimizing the energy function using graph cut. The proposed algorithm is pose-invariant and can robustly segment the mesh into different parts in line with the selected feature points.
Lee, Pai-Feng, and 李白峰. "Reconstruct Object Triangular Mesh by Using Spatial Points Cluster characteristics on Surface." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/7xt9bh.
Full text中原大學
資訊工程研究所
91
Recently, the fast progress of computer technology and cost down of prices progressively, “Virtual Reality” becomes so popular. Many scenes of objects are displayed by 3D’s form, there are almost real effect, such as 3D (three dimension) architecture 、the introduction and trial of merchandise on line. Many object models are necessary to display a scene. Unfortunately, only a little objects of the real world have built its digital form. Therefore users must create digital objects by themselves. To create a digital object, user can use surface reconstruction. It be first proposed on the reconstruction problem by Hoppe in 1992 ; The input is a set of unorganized vertices in 3D, and the output is triangulation mesh models. In this dissertation, we present a proved surface reconstruction algorithm. At first, we stand on the spatial points cluster characteristic on surface to compute every point’s neighbor boundary. To find out the candidate neighbor which can possibly form triangles and do some test to ensure there can’t have narrow triangles. The point which referenced will be called complete point, and we will continue reconstruct along the boundary point. Therefore we use breadth first search to generate triangles progressively.
Lun, Huang-Kuan, and 黃冠綸. "Optical Design and Simulation for UV Curing Mesh Points on Light Guide Plate." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/86180206234567689677.
Full text國立中興大學
精密工程學系所
102
The thesis focuses on developing a high-luminance and thin light guide plate. The research studies a light guide plate in a size of 8 inches with a thickness of 0.6mm and provided with a superficial microstructure of mesh point. The research hereof mainly discusses the optical effect caused by alight guide plate under a back light module in the manufacturing method of Roll-to-Roll with continuous UV curing, while the light guide plate is made of a substrate with high light guidance PC material and processed with an UV coating having different refractive index. In the simulation of Trace Pro, when the UV coating refractive index increases by 0.02, the overall luminance increases by 9% to 11%. When the UV coating refractive index by 1.6, the overall luminance reaches the maximum value; however, if the UV coating refractive index continues to increase, the overall luminance decreases. In the experiment, when the UV coating refractive index by 0.02time to time and does not surpass the value of 1.56, the overall luminance increases by 3% to 4% time to time accordingly. The curve chart presenting the increasing or decreasing phenomenon is constant with the result of the simulation. Therefore, it is proved that the increase of the UV coating refractive index actually causes the increase of overall luminance of the light guide plate.
Han, Jiajia. "Point-to-Point Traffic in Wireless Mesh Networks." Thesis, 2010. http://hdl.handle.net/10012/5319.
Full textWang, Sheng-Wen, and 王聖文. "Regular Mesh Reconstruction from Unorganized Point Cloud." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/44093762722330302491.
Full text中原大學
資訊工程研究所
98
For a regular mesh model, typically constructing a model that usually using two steps model reconstruction and remesh. First unorganized point cloud can be created by 3D scanner. Through point-based reconstruction technique, we can make a model approximate the original object. But the mesh of model always be irregular. Therefore, the second step remesh, adjusting the mesh of model and resampling the point cloud to make the final mesh more regular. For mesh, not only model reconstruction but also remesh, both of them would create a mesh model finally. The difference between model reconstruction and remesh is shape of triangles and degree of vertices in mesh. Therefore, our paper presents a technique about mesh model reconstruction from unorganized points set. This technique can construct a regular mesh model from points set directly, and comparing with original object by eyes the features can be preserved. The most important concept is that regular mesh model reconstructing from unorganized point cloud directly, and no need two steps method to finish model reconstruction.