Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

An Extension of "SEQ-NV-RANSAC" Approach To Avoid Bad-Segmentation Cases From Unstructured 3D Point Clouds Using Topology Information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Awwad, T.M. ; State Key Lab. of Inf. Eng. in Surveying, Wuhan Univ., Wuhan, China ; Qing Zhu ; Qiaoxiong Li

Recently many applications require an automatic processing of massive unstructured 3D point clouds in order to extract planar surfaces of man-made objects. While segmentation is the essential step in feature extracting process, but bad-segmentation results (i.e. under and over-segmentation) are still standing as a big obstacle to extract planar surfaces with best fit reality. In this paper, we propose an extension of "SEQ-NVRANSAC" approach to avoid the bad-segmentation problems using topology information and intuitive threshold value. First, in order to avoid the under-segmentation problem, we check each one group which resulted from original "SEQ-NV-RANSAC" approach to get all neighbours points which have Euclidean distance less than the threshold value as a one surface group. This process will be repeated until no more points can be adding to that surface group. Then a new surface group will be created to check the remaining points. Second, in order to solve the oversegmentation, we propose three checks; the similarity of normal vectors (NV), the perpendicular distance and the intersection zone using bounding box test.

Published in:

Information Engineering and Computer Science, 2009. ICIECS 2009. International Conference on

Date of Conference:

19-20 Dec. 2009