Open AccessWeighted‐graph‐based supervoxel segmentation of 3D point clouds in complex urban environment
Author(s) -
Kim Je Seok,
Park Jahng Hyon
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2015.1580
Subject(s) - segmentation , graph , point cloud , computer science , shortest path problem , precision and recall , artificial intelligence , algorithm , pattern recognition (psychology) , theoretical computer science
A new method for supervoxel segmentation based on a weighted graph in complex urban environment is proposed. The proposed algorithm is designed to minimise the cost of the shortest path in the weighted graph with consideration of characteristics of the sensor for complex urban environment. We collected point clouds in a complex urban environment to evaluate the proposed method. The performance of the proposed algorithm was evaluated using boundary recall and under‐segmentation errors.