HIERARCHICAL PROXIMITY-BASED OVER-SEGMENTATION OF 3-D POINT CLOUDS FOR EFFICIENT GRAPH FEATURE DETECTION

Point cloud simplification is empowered by the definition of similarity metrics which we aim to identify homogeneous regions within the point-cloud. Nonetheless, the variety of shapes and clutter in natural scenes, along with the significant resolution variations, occlusions, and noise, contribute t...

Full description

Bibliographic Details
Main Authors: Z. Shtain, S. Filin
Format: Article
Language:English
Published: Copernicus Publications 2020-08-01
Series:ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Online Access:https://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/V-2-2020/273/2020/isprs-annals-V-2-2020-273-2020.pdf
id doaj-b1684cad761a48fbb52dfefed066c11f
record_format Article
spelling doaj-b1684cad761a48fbb52dfefed066c11f2020-11-25T02:50:48ZengCopernicus PublicationsISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences2194-90422194-90502020-08-01V-2-202027328010.5194/isprs-annals-V-2-2020-273-2020HIERARCHICAL PROXIMITY-BASED OVER-SEGMENTATION OF 3-D POINT CLOUDS FOR EFFICIENT GRAPH FEATURE DETECTIONZ. Shtain0S. Filin1Mapping and Geo-Information Engineering, Technion – Israel Institute of Technology, Haifa, IsraelMapping and Geo-Information Engineering, Technion – Israel Institute of Technology, Haifa, IsraelPoint cloud simplification is empowered by the definition of similarity metrics which we aim to identify homogeneous regions within the point-cloud. Nonetheless, the variety of shapes and clutter in natural scenes, along with the significant resolution variations, occlusions, and noise, contribute to inconsistencies in the geometric properties, thereby making the homogeneity measurement challenging. Thus, the objective of this paper is to develop a point-cloud simplification model by means of data segmentation and to extract information in a better-suited way. The literature shows that most approaches either apply volumetric data strategies and/or resort to simplified planar geometries, which relate to only part of the entities found within a natural scene. To provide a more general strategy, we propose a proximity-based approach that allows an efficient and reliable surface characterization with no limitation on the number or shape of the primitives which in turn, enables detecting free-form objects. To achieve this, a local, computationally efficient and scalable metric is developed, which captures resolution variation and allows for short processing time. Our proposed scheme is demonstrated on datasets featuring a variety of surface types and characteristics. Experiments show high precision rates while exhibiting robustness to the varying resolution, texture, and occlusions that exist within the sets.https://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/V-2-2020/273/2020/isprs-annals-V-2-2020-273-2020.pdf
collection DOAJ
language English
format Article
sources DOAJ
author Z. Shtain
S. Filin
spellingShingle Z. Shtain
S. Filin
HIERARCHICAL PROXIMITY-BASED OVER-SEGMENTATION OF 3-D POINT CLOUDS FOR EFFICIENT GRAPH FEATURE DETECTION
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
author_facet Z. Shtain
S. Filin
author_sort Z. Shtain
title HIERARCHICAL PROXIMITY-BASED OVER-SEGMENTATION OF 3-D POINT CLOUDS FOR EFFICIENT GRAPH FEATURE DETECTION
title_short HIERARCHICAL PROXIMITY-BASED OVER-SEGMENTATION OF 3-D POINT CLOUDS FOR EFFICIENT GRAPH FEATURE DETECTION
title_full HIERARCHICAL PROXIMITY-BASED OVER-SEGMENTATION OF 3-D POINT CLOUDS FOR EFFICIENT GRAPH FEATURE DETECTION
title_fullStr HIERARCHICAL PROXIMITY-BASED OVER-SEGMENTATION OF 3-D POINT CLOUDS FOR EFFICIENT GRAPH FEATURE DETECTION
title_full_unstemmed HIERARCHICAL PROXIMITY-BASED OVER-SEGMENTATION OF 3-D POINT CLOUDS FOR EFFICIENT GRAPH FEATURE DETECTION
title_sort hierarchical proximity-based over-segmentation of 3-d point clouds for efficient graph feature detection
publisher Copernicus Publications
series ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
issn 2194-9042
2194-9050
publishDate 2020-08-01
description Point cloud simplification is empowered by the definition of similarity metrics which we aim to identify homogeneous regions within the point-cloud. Nonetheless, the variety of shapes and clutter in natural scenes, along with the significant resolution variations, occlusions, and noise, contribute to inconsistencies in the geometric properties, thereby making the homogeneity measurement challenging. Thus, the objective of this paper is to develop a point-cloud simplification model by means of data segmentation and to extract information in a better-suited way. The literature shows that most approaches either apply volumetric data strategies and/or resort to simplified planar geometries, which relate to only part of the entities found within a natural scene. To provide a more general strategy, we propose a proximity-based approach that allows an efficient and reliable surface characterization with no limitation on the number or shape of the primitives which in turn, enables detecting free-form objects. To achieve this, a local, computationally efficient and scalable metric is developed, which captures resolution variation and allows for short processing time. Our proposed scheme is demonstrated on datasets featuring a variety of surface types and characteristics. Experiments show high precision rates while exhibiting robustness to the varying resolution, texture, and occlusions that exist within the sets.
url https://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/V-2-2020/273/2020/isprs-annals-V-2-2020-273-2020.pdf
work_keys_str_mv AT zshtain hierarchicalproximitybasedoversegmentationof3dpointcloudsforefficientgraphfeaturedetection
AT sfilin hierarchicalproximitybasedoversegmentationof3dpointcloudsforefficientgraphfeaturedetection
_version_ 1724736315722825728