0
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Geometrical Segmentation of Multi-Shape Point Clouds Based on Adaptive Shape Prediction and Hybrid Voting RANSAC

      , , , , , , ,
      Remote Sensing
      MDPI AG

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          This work proposes the use of a robust geometrical segmentation algorithm to detect inherent shapes from dense point clouds. The points are first divided into voxels based on their connectivity and normal consistency. Then, the voxels are classified into different types of shapes through a multi-scale prediction algorithm and multiple shapes including spheres, cylinders, and cones are extracted. Next, a hybrid voting RANSAC algorithm is adopted to separate the point clouds into corresponding segments. The point–shape distance, normal difference, and voxel size are all considered as weight terms when evaluating the proposed shape. Robust voxels are weighted as a whole to ensure efficiency, while single points are considered to achieve the best performance in the disputed region. Finally, graph-cut-based optimization is adopted to deal with the competition among different segments. Experimental results and comparisons indicate that the proposed method can generate reliable segmentation results and provide the best performance compared to the benchmark methods.

          Related collections

          Most cited references41

          • Record: found
          • Abstract: not found
          • Article: not found

          Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            SLIC superpixels compared to state-of-the-art superpixel methods.

            Computer vision applications have come to rely increasingly on superpixels in recent years, but it is not always clear what constitutes a good superpixel algorithm. In an effort to understand the benefits and drawbacks of existing methods, we empirically compare five state-of-the-art superpixel algorithms for their ability to adhere to image boundaries, speed, memory efficiency, and their impact on segmentation performance. We then introduce a new superpixel algorithm, simple linear iterative clustering (SLIC), which adapts a k-means clustering approach to efficiently generate superpixels. Despite its simplicity, SLIC adheres to boundaries as well as or better than previous methods. At the same time, it is faster and more memory efficient, improves segmentation performance, and is straightforward to extend to supervoxel generation.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Mean shift: a robust approach toward feature space analysis

                Bookmark

                Author and article information

                Contributors
                Journal
                Remote Sensing
                Remote Sensing
                MDPI AG
                2072-4292
                May 2022
                April 22 2022
                : 14
                : 9
                : 2024
                Article
                10.3390/rs14092024
                fe7750df-b2f4-41ba-ad34-ca14aa7e3335
                © 2022

                https://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article