2,837 research outputs found

    Method to Automatically Register Scattered Point Clouds Based on Principal Pose Estimation

    Get PDF
    Three dimensional (3-D) modeling is important in applications ranging from manufacturing to entertainment. Multiview registration is one of the crucial steps in 3-D model construction. The automatic establishment of correspondences between overlapping views, without any known initial information, is the main challenge in point clouds registration. An automatic registration algorithm is proposed to solve the registration problem of rigid, unordered, scattered point clouds. This approach is especially suitable for registering datasets that are lacking in features or texture. In general, the existing techniques exhibit significant limitations in the registration of these types of point cloud data. The presented method automatically determines the best coarse registration results by exploiting the statistical technique principal component analysis and outputs translation matrices as the initial estimation for fine registration. Then, the translation matrices obtained from coarse registration algorithms are used to update the original point cloud and the optimal translation matrices are solved using an iterative algorithm. Experimental results show that the proposed algorithm is time efficient and accurate, even if the point clouds are partially overlapped and containing large missing regions

    Saliency-guided integration of multiple scans

    Get PDF
    we present a novel method..

    Comparison of Several Different Registration Algorithms

    Get PDF

    AN INCREMENTAL BASED APPROACH FOR 3D MULTI-ANGLE POINT CLOUD STITCHING USING ICP AND KNN

    Get PDF
    The basic principle of stitching is joining or merging any two materials or objects. 3D point cloud stitching is basically stitching two 3D point cloud together. 3D point cloud stitching is an emerging topic and there are multiple ways to achieve it. There are various methods for stitching which all have changes throughout the time. The existing methods do have shortcomings and have ignored the multiangle stitching of a same model or an object. This shortfall leads to many deficiencies in the ability of a stitching algorithm to maintain accuracy over the period. In this work I have introduced a new approach for an iterative based approach for 3d multi-angle point cloud stitching using ICP (Iterative closest point algorithm) and KNN (K-nearest neighbor). The design follows an incremental approach to achieve the results. This is a novel approach of stitching multiple 3D point clouds taken from multiple angles of a single bust. The framework is evaluated based on the stitching results provided by the algorithm capability of stitching multiple point cloud into a solid model

    Feature-based hybrid inspection planning for complex mechanical parts

    Get PDF
    Globalization and emerging new powers in the manufacturing world are among many challenges, major manufacturing enterprises are facing. This resulted in increased alternatives to satisfy customers\u27 growing needs regarding products\u27 aesthetic and functional requirements. Complexity of part design and engineering specifications to satisfy such needs often require a better use of advanced and more accurate tools to achieve good quality. Inspection is a crucial manufacturing function that should be further improved to cope with such challenges. Intelligent planning for inspection of parts with complex geometric shapes and free form surfaces using contact or non-contact devices is still a major challenge. Research in segmentation and localization techniques should also enable inspection systems to utilize modern measurement technologies capable of collecting huge number of measured points. Advanced digitization tools can be classified as contact or non-contact sensors. The purpose of this thesis is to develop a hybrid inspection planning system that benefits from the advantages of both techniques. Moreover, the minimization of deviation of measured part from the original CAD model is not the only characteristic that should be considered when implementing the localization process in order to accept or reject the part; geometric tolerances must also be considered. A segmentation technique that deals directly with the individual points is a necessary step in the developed inspection system, where the output is the actual measured points, not a tessellated model as commonly implemented by current segmentation tools. The contribution of this work is three folds. First, a knowledge-based system was developed for selecting the most suitable sensor using an inspection-specific features taxonomy in form of a 3D Matrix where each cell includes the corresponding knowledge rules and generate inspection tasks. A Travel Salesperson Problem (TSP) has been applied for sequencing these hybrid inspection tasks. A novel region-based segmentation algorithm was developed which deals directly with the measured point cloud and generates sub-point clouds, each of which represents a feature to be inspected and includes the original measured points. Finally, a new tolerance-based localization algorithm was developed to verify the functional requirements and was applied and tested using form tolerance specifications. This research enhances the existing inspection planning systems for complex mechanical parts with a hybrid inspection planning model. The main benefits of the developed segmentation and tolerance-based localization algorithms are the improvement of inspection decisions in order not to reject good parts that would have otherwise been rejected due to misleading results from currently available localization techniques. The better and more accurate inspection decisions achieved will lead to less scrap, which, in turn, will reduce the product cost and improve the company potential in the market
    corecore