Recognition of feature curves on 3D shapes using an algebraic approach to Hough transforms

Feature curves are largely adopted to highlight shape features, such as sharp lines, or to divide surfaces into meaningful segments, like convex or concave regions. Extracting these curves is not sufficient to convey prominent and meaningful information about a shape. We have first to separate the curves belonging to features from those caused by noise and then to select the lines, which describe non-trivial portions of a surface. The automatic detection of such features is crucial for the identification and/or annotation of relevant parts of a given shape. To do this, the Hough transform (HT) is a feature extraction technique widely used in image analysis, computer vision and digital image processing, while, for 3D shapes, the extraction of salient feature curves is still an open problem. Thanks to algebraic geometry concepts, the HT technique has been recently extended to include a vast class of algebraic curves, thus proving to be a competitive tool for yielding an explicit representation of the diverse feature lines equations. In the paper, for the first time we apply this novel extension of the HT technique to the realm of 3D shapes in order to identify and localize semantic features like patterns, decorations or anatomical details on 3D objects (both complete and fragments), even in the case of features partially damaged or incomplete. The method recognizes various features, possibly compound, and it selects the most suitable feature profiles among families of algebraic curves

Reconstruction of industrial piping installations from laser point clouds using profiling techniques

Includes abstract.Includes bibliographical references (leaves 143-152).As-built models of industrial piping installations are essential for planning applications in industry. Laser scanning has emerged as the preferred data acquisition method of as built information for creating these three dimensional (3D) models. The product of the scanning process is a cloud of points representing scanned surfaces. From this point cloud, 3D models of the surfaces are reconstructed. Most surfaces are of piping elements e.g. straight pipes, t-junctions, elbows, spheres. The automatic detection of these piping elements in point clouds has the greatest impact on the reconstructed model. Various algorithms have been proposed for detecting piping elements in point clouds. However, most algorithms detect cylinders (straight pipes) and planes which make up a small percentage of piping elements found in industrial installations. In addition, these algorithms do not allow for deformation detection in pipes. Therefore, the work in this research is aimed at the detection of piping elements (straight pipes, elbows, t-junctions and flange) in point clouds including deformation detection

3D Reconstruction Using High Resolution Implicit Surface Representations and Memory Management Strategies

La disponibilité de capteurs de numérisation 3D rapides et précis a permis de capturer de très grands ensembles de points à la surface de différents objets qui véhiculent la géométrie des objets. La métrologie appliquée consiste en l'application de mesures dans différents domaines tels que le contrôle qualité, l'inspection, la conception de produits et la rétroingénierie. Une fois que le nuage de points 3D non organisés couvrant toute la surface de l'objet a été capturé, un modèle de la surface doit être construit si des mesures métrologiques doivent être effectuées sur l'objet. Dans la reconstruction 3D en temps réel, à l'aide de scanners 3D portables, une représentation de surface implicite très efficace est le cadre de champ vectoriel, qui suppose que la surface est approchée par un plan dans chaque voxel. Le champ vectoriel contient la normale à la surface et la matrice de covariance des points tombant à l'intérieur d'un voxel. L'approche globale proposée dans ce projet est basée sur le cadre Vector Field. Le principal problème abordé dans ce projet est la résolution de l'incrément de consommation de mémoire et la précision du modèle reconstruit dans le champ vectoriel. Ce tte approche effectue une sélection objective de la taille optimale des voxels dans le cadre de champ vectoriel pour maintenir la consommation de mémoire aussi faible que possible et toujours obtenir un modèle précis de la surface. De plus, un ajustement d e surface d'ordre élevé est utilisé pour augmenter la précision du modèle. Étant donné que notre approche ne nécessite aucune paramétrisation ni calcul complexe, et qu'au lieu de travailler avec chaque point, nous travaillons avec des voxels dans le champ vectoriel, cela réduit la complexité du calcul.The availability of fast and accurate 3D scanning sensors has made it possible to capture very large sets of points at the surface of different objects that convey the geometry of the objects. A pplied metrology consists in the application of measurements in different fields such as quality control, inspection, product design and reverse engineering. Once the cloud of unorganized 3D points covering the entire surface of the object has been capture d, a model of the surface must be built if metrologic measurements are to be performed on the object. In realtime 3D reconstruction, using handheld 3D scanners a very efficient implicit surface representation is the Vector Field framework, which assumes that the surface is approximated by a plane in each voxel. The vector field contains the normal to the surface and the covariance matrix of the points falling inside a voxel. The proposed global approach in this project is based on the Vector Field framew ork. The main problem addressed in this project is solving the memory consumption increment and the accuracy of the reconstructed model in the vector field. This approach performs an objective selection of the optimal voxels size in the vector field frame work to keep the memory consumption as low as possible and still achieve an accurate model of the surface. Moreover, a highorder surface fitting is used to increase the accuracy of the model. Since our approach do not require any parametrization and compl ex calculation, and instead of working with each point we are working with voxels in the vector field, then it reduces the computational complexity

Computer-Aided Geometry Modeling

Techniques in computer-aided geometry modeling and their application are addressed. Mathematical modeling, solid geometry models, management of geometric data, development of geometry standards, and interactive and graphic procedures are discussed. The applications include aeronautical and aerospace structures design, fluid flow modeling, and gas turbine design

Multiscale Representations for Manifold-Valued Data

We describe multiscale representations for data observed on equispaced grids and taking values in manifolds such as the sphere $S^2$, the special orthogonal group $SO(3)$, the positive definite matrices $SPD(n)$, and the Grassmann manifolds $G(n,k)$. The representations are based on the deployment of Deslauriers--Dubuc and average-interpolating pyramids "in the tangent plane" of such manifolds, using the $Exp$ and $Log$ maps of those manifolds. The representations provide "wavelet coefficients" which can be thresholded, quantized, and scaled in much the same way as traditional wavelet coefficients. Tasks such as compression, noise removal, contrast enhancement, and stochastic simulation are facilitated by this representation. The approach applies to general manifolds but is particularly suited to the manifolds we consider, i.e., Riemannian symmetric spaces, such as $S^{n-1}$, $SO(n)$, $G(n,k)$, where the $Exp$ and $Log$ maps are effectively computable. Applications to manifold-valued data sources of a geometric nature (motion, orientation, diffusion) seem particularly immediate. A software toolbox, SymmLab, can reproduce the results discussed in this paper

Automatic High-Fidelity 3D Road Network Modeling

Many computer applications such as racing games and driving simulations frequently make use of 3D high-fidelity road network models for a variety of purposes. However, there are very few existing methods for automatic generation of 3D realistic road networks, especially for those in the real world. On the other hand, vast road network GIS data have been collected in the past and used by a wide range of applications, such as navigation and evaluation. A method that can automatically produce 3D high-fidelity road network models from 2D real road GIS data will significantly reduce both the labor and time needed to generate these models, and greatly benefit numerous applications involving road networks. Based on a set of selected civil engineering rules for road design, this dissertation research addresses this problem with a novel approach which transforms existing road GIS data that contain only 2D road centerline information into 3D road network models. The proposed method consists of several components, mainly including road GIS data preprocessing, 3D centerline modeling and 3D geometry modeling. During road data preprocessing, topology of the road network is extracted from raw road data as a graph composed of road nodes and road links; road link information is simplified and classified. In the 3D centerline modeling part, the missing height information of the road centerline is inferred based on 2D road GIS data, intersections are extracted from road nodes and the whole road network is represented as road intersections and road segments in parametric forms. Finally, the 3D road centerline models are converted into various 3D road geometry models consisting of triangles and textures in the 3D geometry modeling phase. With this approach, basic road elements such as road segments, road intersections and traffic interchanges are generated automatically to compose sophisticated road networks. Results show that this approach provides a rapid and efficient 3D road modeling method for applications that have stringent requirements on high-fidelity road models

Automatic mesh generation

The objective of this thesis project is a study of Pre-Processors and development of an Automatic Mesh Generator for Finite Element Analysis. The Mesh Generator developed in this thesis project can create triangular finite elements from the geometric database of Macintosh Applications. The user is required to give the density parameter to the program for mesh generation. The research is limited to Mesh Generators of planar surfaces. Delauny Triangulation method maximizes the minimum angles of a triangle. Watson\u27s Delauny Triangulation method can mesh only the \u27convex hull\u27 of a set of nodes. This algorithm has been modified to create triangular elements in convex and non-convex surfaces. The surfaces can have holes also. A node generation algorithm to place nodes on and inside a geometry has been developed in this thesis project. The mesh generation is very efficient and flexible. Geometric modeling methods have been studied to understand and integrate the Geometric Modeler with the Finite Element Mesh Generator. Expert Systems can be integrated with Finite Element Analysis. This will make Finite Element Method fully automatic. In this thesis project, Expert Systems in Finite Element Analysis are reviewed. Proposals are made for future approach for the integration of the two fields

A novel parallel algorithm for surface editing and its FPGA implementation

A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirements for the degree of Doctor of PhilosophySurface modelling and editing is one of important subjects in computer graphics. Decades of research in computer graphics has been carried out on both low-level, hardware-related algorithms and high-level, abstract software. Success of computer graphics has been seen in many application areas, such as multimedia, visualisation, virtual reality and the Internet. However, the hardware realisation of OpenGL architecture based on FPGA (field programmable gate array) is beyond the scope of most of computer graphics researches. It is an uncultivated research area where the OpenGL pipeline, from hardware through the whole embedded system (ES) up to applications, is implemented in an FPGA chip. This research proposes a hybrid approach to investigating both software and hardware methods. It aims at bridging the gap between methods of software and hardware, and enhancing the overall performance for computer graphics. It consists of four parts, the construction of an FPGA-based ES, Mesa-OpenGL implementation for FPGA-based ESs, parallel processing, and a novel algorithm for surface modelling and editing. The FPGA-based ES is built up. In addition to the Nios II soft processor and DDR SDRAM memory, it consists of the LCD display device, frame buffers, video pipeline, and algorithm-specified module to support the graphics processing. Since there is no implementation of OpenGL ES available for FPGA-based ESs, a specific OpenGL implementation based on Mesa is carried out. Because of the limited FPGA resources, the implementation adopts the fixed-point arithmetic, which can offer faster computing and lower storage than the floating point arithmetic, and the accuracy satisfying the needs of 3D rendering. Moreover, the implementation includes Bézier-spline curve and surface algorithms to support surface modelling and editing. The pipelined parallelism and co-processors are used to accelerate graphics processing in this research. These two parallelism methods extend the traditional computation parallelism in fine-grained parallel tasks in the FPGA-base ESs. The novel algorithm for surface modelling and editing, called Progressive and Mixing Algorithm (PAMA), is proposed and implemented on FPGA-based ES’s. Compared with two main surface editing methods, subdivision and deformation, the PAMA can eliminate the large storage requirement and computing cost of intermediated processes. With four independent shape parameters, the PAMA can be used to model and edit freely the shape of an open or closed surface that keeps globally the zero-order geometric continuity. The PAMA can be applied independently not only FPGA-based ESs but also other platforms. With the parallel processing, small size, and low costs of computing, storage and power, the FPGA-based ES provides an effective hybrid solution to surface modelling and editing