1,181 research outputs found

    3D Geometric Analysis of Tubular Objects based on Surface Normal Accumulation

    Get PDF
    This paper proposes a simple and efficient method for the reconstruction and extraction of geometric parameters from 3D tubular objects. Our method constructs an image that accumulates surface normal information, then peaks within this image are located by tracking. Finally, the positions of these are optimized to lie precisely on the tubular shape centerline. This method is very versatile, and is able to process various input data types like full or partial mesh acquired from 3D laser scans, 3D height map or discrete volumetric images. The proposed algorithm is simple to implement, contains few parameters and can be computed in linear time with respect to the number of surface faces. Since the extracted tube centerline is accurate, we are able to decompose the tube into rectilinear parts and torus-like parts. This is done with a new linear time 3D torus detection algorithm, which follows the same principle of a previous work on 2D arc circle recognition. Detailed experiments show the versatility, accuracy and robustness of our new method.Comment: in 18th International Conference on Image Analysis and Processing, Sep 2015, Genova, Italy. 201

    Cleaning sky survey databases using Hough Transform and Renewal String approaches

    Get PDF
    Large astronomical databases obtained from sky surveys such as the SuperCOSMOS Sky Survey (SSS) invariably suffer from spurious records coming from artefactual effects of the telescope, satellites and junk objects in orbit around earth and physical defects on the photographic plate or CCD. Though relatively small in number these spurious records present a significant problem in many situations where they can become a large proportion of the records potentially of interest to a given astronomer. Accurate and robust techniques are needed for locating and flagging such spurious objects, and we are undertaking a programme investigating the use of machine learning techniques in this context. In this paper we focus on the four most common causes of unwanted records in the SSS: satellite or aeroplane tracks, scratches, fibres and other linear phenomena introduced to the plate, circular halos around bright stars due to internal reflections within the telescope and diffraction spikes near to bright stars. Appropriate techniques are developed for the detection of each of these. The methods are applied to the SSS data to develop a dataset of spurious object detections, along with confidence measures, which can allow these unwanted data to be removed from consideration. These methods are general and can be adapted to other astronomical survey data.Comment: Accepted for MNRAS. 17 pages, latex2e, uses mn2e.bst, mn2e.cls, md706.bbl, shortbold.sty (all included). All figures included here as low resolution jpegs. A version of this paper including the figures can be downloaded from http://www.anc.ed.ac.uk/~amos/publications.html and more details on this project can be found at http://www.anc.ed.ac.uk/~amos/sattrackres.htm

    Methods for Ellipse Detection from Edge Maps of Real Images

    Get PDF

    The use of 3D surface fitting for robust polyp detection and classification in CT colonography

    Get PDF
    In this paper we describe the development of a computationally efficient computer-aided detection (CAD) algorithm based on the evaluation of the surface morphology that is employed for the detection of colonic polyps in computed tomography (CT) colonography. Initial polyp candidate voxels were detected using the surface normal intersection values. These candidate voxels were clustered using the normal direction, convexity test, region growing and Gaussian distribution. The local colonic surface was classified as polyp or fold using a feature normalized nearest neighborhood classifier. The main merit of this paper is the methodology applied to select the robust features derived from the colon surface that have a high discriminative power for polyp/fold classification. The devised polyp detection scheme entails a low computational overhead (typically takes 2.20 min per dataset) and shows 100% sensitivity for phantom polyps greater than 5 mm. It also shows 100% sensitivity for real polyps larger than 10 mm and 91.67% sensitivity for polyps between 5 to 10 mm with an average of 4.5 false positives per dataset. The experimental data indicates that the proposed CAD polyp detection scheme outperforms other techniques that identify the polyps using features that sample the colon surface curvature especially when applied to low-dose datasets

    An investigation on methods for axis detection of high-density generic axially symmetric mechanical surfaces for automatic geometric inspection

    Get PDF
    none2noThe detection of the symmetry axis from discrete axially symmetric surfaces is an interesting topic, which is transversal to various fields: from geometric inspection to reverse engineering, archeology, etc. In the literature, several approaches have been proposed for estimating the axis from high-density triangular models of surfaces acquired by three-dimensional (3D) scanning. The axis evaluation from discrete models is, in fact, a very complex task to accomplish, due to several factors that inevitably influence the quality of the estimation and the accuracy of the measurements and evaluations depending on it. The underlying principle of each one of these approaches takes advantage of a specific property of axially symmetric surfaces. No investigations, however, have been carried out so far in order to support in the selection of the most suitable algorithms for applications aimed at automatic geometric inspection. In this regard, ISO standards currently do not provide indications on how to perform the axis detection in the case of generic axially symmetric surfaces, limiting themselves to addressing the issue only in the case of cylindrical or conical surfaces. This paper first provides an overview of the approaches that can be used for geometric inspection purposes; then, it applies them to various case studies involving one or more generic axially symmetric surfaces, functionally important and for which the axis must be detected since necessary for geometric inspection. The aim is to compare, therefore, the performances of the various methodologies by trying to highlight the circumstances in which these ones may fail. Since this investigation requires a reference (i.e. the knowledge of the true axis), the methodologies have been applied to discrete models suitably extracted from CAD surfaces.openE Guardiani; A MorabitoGuardiani, E; Morabito,

    A fully automatic CAD-CTC system based on curvature analysis for standard and low-dose CT data

    Get PDF
    Computed tomography colonography (CTC) is a rapidly evolving noninvasive medical investigation that is viewed by radiologists as a potential screening technique for the detection of colorectal polyps. Due to the technical advances in CT system design, the volume of data required to be processed by radiologists has increased significantly, and as a consequence the manual analysis of this information has become an increasingly time consuming process whose results can be affected by inter- and intrauser variability. The aim of this paper is to detail the implementation of a fully integrated CAD-CTC system that is able to robustly identify the clinically significant polyps in the CT data. The CAD-CTC system described in this paper is a multistage implementation whose main system components are: 1) automatic colon segmentation; 2) candidate surface extraction; 3) feature extraction; and 4) classification. Our CAD-CTC system performs at 100% sensitivity for polyps larger than 10 mm, 92% sensitivity for polyps in the range 5 to 10 mm, and 57.14% sensitivity for polyps smaller than 5 mm with an average of 3.38 false positives per dataset. The developed system has been evaluated on synthetic and real patient CT data acquired with standard and low-dose radiation levels

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

    Get PDF
    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

    Automated segmentation, detection and fitting of piping elements from terrestrial LIDAR data

    Get PDF
    Since the invention of light detection and ranging (LIDAR) in the early 1960s, it has been adopted for use in numerous applications, from topographical mapping with airborne LIDAR platforms to surveying of urban sites with terrestrial LIDAR systems. Static terrestrial LIDAR has become an especially effective tool for surveying, in some cases replacing traditional techniques such as electronic total stations and GPS methods. Current state-of-the-art LIDAR scanners have very fine spatial resolution, generating precise 3D point cloud data with millimeter accuracy. Therefore, LIDAR data can provide 3D details of a scene with an unprecedented level of details. However, automated exploitation of LIDAR data is challenging, due to the non-uniform spatial sampling of the point clouds as well as to the massive volumes of data, which may range from a few million points to hundreds of millions of points depending on the size and complexity of the scene being scanned. ^ This dissertation focuses on addressing these challenges to automatically exploit large LIDAR point clouds of piping systems in industrial sites, such as chemical plants, oil refineries, and steel mills. A complete processing chain is proposed in this work, using raw LIDAR point clouds as input and generating cylinder parameter estimates for pipe segments as the output, which could then be used to produce computer aided design (CAD) models of pipes. The processing chain consists of three stages: (1) segmentation of LIDAR point clouds, (2) detection and identification of piping elements, and (3) cylinder fitting and parameter estimation. The final output of the cylinder fitting stage gives the estimated orientation, position, and radius of each detected pipe element. ^ A robust octree-based split and merge segmentation algorithm is proposed in this dissertation that can efficiently process LIDAR data. Following octree decomposition of the point cloud, graph theory analysis is used during the splitting process to separate points within each octant into components based on spatial connectivity. A series of connectivity criteria (proximity, orientation, and curvature) are developed for the merging process, which exploits contextual information to effectively merge cylindrical segments into complete pipes and planar segments into complete walls. Furthermore, by conducting surface fitting of segments and analyzing their principal curvatures, the proposed segmentation approach is capable of detecting and identifying the piping segments. ^ A novel cylinder fitting technique is proposed to accurately estimate the cylinder parameters for each detected piping segment from the terrestrial LIDAR point cloud. Specifically, the orientation, radius, and position of each piping element must be robustly estimated in the presence of noise. An original formulation has been developed to estimate the cylinder axis orientation using gradient descent optimization of an angular distance cost function. The cost function is based on the concept that surface normals of points in a cylinder point cloud are perpendicular to the cylinder axis. The key contribution of this algorithm is its capability to accurately estimate the cylinder orientation in the presence of noise without requiring a good initial starting point. After estimation of the cylinder\u27s axis orientation, the radius and position are then estimated in the 2D space formed from the projection of the 3D cylinder point cloud onto the plane perpendicular to the cylinder\u27s axis. With these high quality approximations, a least squares estimation in 3D is made for the final cylinder parameters. ^ Following cylinder fitting, the estimated parameters of each detected piping segment are used to generate a CAD model of the piping system. The algorithms and techniques in this dissertation form a complete processing chain that can automatically exploit large LIDAR point cloud of piping systems and generate CAD models

    Extraction robuste de primitives géométriques 3D dans un nuage de points et alignement basé sur les primitives

    Get PDF
    Dans ce projet, nous Ă©tudions les problĂšmes de rĂ©tro-ingĂ©nierie et de contrĂŽle de la qualitĂ© qui jouent un rĂŽle important dans la fabrication industrielle. La rĂ©tro-ingĂ©nierie tente de reconstruire un modĂšle 3D Ă  partir de nuages de points, qui s’apparente au problĂšme de la reconstruction de la surface 3D. Le contrĂŽle de la qualitĂ© est un processus dans lequel la qualitĂ© de tous les facteurs impliquĂ©s dans la production est abordĂ©e. En fait, les systĂšmes ci-dessus nĂ©cessitent beaucoup d’intervention de la part d’un utilisateur expĂ©rimentĂ©, rĂ©sultat souhaitĂ© est encore loin soit une automatisation complĂšte du processus. Par consĂ©quent, de nombreux dĂ©fis doivent encore ĂȘtre abordĂ©s pour atteindre ce rĂ©sultat hautement souhaitable en production automatisĂ©e. La premiĂšre question abordĂ©e dans la thĂšse consiste Ă  extraire les primitives gĂ©omĂ©triques 3D Ă  partir de nuages de points. Un cadre complet pour extraire plusieurs types de primitives Ă  partir de donnĂ©es 3D est proposĂ©. En particulier, une nouvelle mĂ©thode de validation est proposĂ©e pour Ă©valuer la qualitĂ© des primitives extraites. À la fin, toutes les primitives prĂ©sentes dans le nuage de points sont extraites avec les points de donnĂ©es associĂ©s et leurs paramĂštres descriptifs. Ces rĂ©sultats pourraient ĂȘtre utilisĂ©s dans diverses applications telles que la reconstruction de scĂšnes on d’édifices, la gĂ©omĂ©trie constructive et etc. La seconde question traiĂ©e dans ce travail porte sur l’alignement de deux ensembles de donnĂ©es 3D Ă  l’aide de primitives gĂ©omĂ©triques, qui sont considĂ©rĂ©es comme un nouveau descripteur robuste. L’idĂ©e d’utiliser les primitives pour l’alignement arrive Ă  surmonter plusieurs dĂ©fis rencontrĂ©s par les mĂ©thodes d’alignement existantes. Ce problĂšme d’alignement est une Ă©tape essentielle dans la modĂ©lisation 3D, la mise en registre, la rĂ©cupĂ©ration de modĂšles. Enfin, nous proposons Ă©galement une mĂ©thode automatique pour extraire les discontinutĂ©s Ă  partir de donnĂ©es 3D d’objets manufacturĂ©s. En intĂ©grant ces discontinutĂ©s au problĂšme d’alignement, il est possible d’établir automatiquement les correspondances entre primitives en utilisant l’appariement de graphes relationnels avec attributs. Nous avons expĂ©rimentĂ© tous les algorithmes proposĂ©s sur diffĂ©rents jeux de donnĂ©es synthĂ©tiques et rĂ©elles. Ces algorithmes ont non seulement rĂ©ussi Ă  accomplir leur tĂąches avec succĂšs mais se sont aussi avĂ©rĂ©s supĂ©rieus aux mĂ©thodes proposĂ©es dans la literature. Les rĂ©sultats prĂ©sentĂ©s dans le thĂšse pourraient s’avĂ©rĂ©r utilises Ă  plusieurs applications.In this research project, we address reverse engineering and quality control problems that play significant roles in industrial manufacturing. Reverse engineering attempts to rebuild a 3D model from the scanned data captured from a object, which is the problem similar to 3D surface reconstruction. Quality control is a process in which the quality of all factors involved in production is monitored and revised. In fact, the above systems currently require significant intervention from experienced users, and are thus still far from being fully automated. Therefore, many challenges still need to be addressed to achieve the desired performance for automated production. The first proposition of this thesis is to extract 3D geometric primitives from point clouds for reverse engineering and surface reconstruction. A complete framework to extract multiple types of primitives from 3D data is proposed. In particular, a novel validation method is also proposed to assess the quality of the extracted primitives. At the end, all primitives present in the point cloud are extracted with their associated data points and descriptive parameters. These results could be used in various applications such as scene and building reconstruction, constructive solid geometry, etc. The second proposition of the thesis is to align two 3D datasets using the extracted geometric primitives, which is introduced as a novel and robust descriptor. The idea of using primitives for alignment is addressed several challenges faced by existing registration methods. This alignment problem is an essential step in 3D modeling, registration and model retrieval. Finally, an automatic method to extract sharp features from 3D data of man-made objects is also proposed. By integrating the extracted sharp features into the alignment framework, it is possible implement automatic assignment of primitive correspondences using attribute relational graph matching. Each primitive is considered as a node of the graph and an attribute relational graph is created to provide a structural and relational description between primitives. We have experimented all the proposed algorithms on different synthetic and real scanned datasets. Our algorithms not only are successful in completing their tasks with good results but also outperform other methods. We believe that the contribution of them could be useful in many applications
    • 

    corecore