Weighted-graph-based supervoxel segmentation of 3D point clouds in complex urban environment

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

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 undersegmentation errors.

Cite

CITATION STYLE

APA

Kim, J. S., & Park, J. H. (2015). Weighted-graph-based supervoxel segmentation of 3D point clouds in complex urban environment. Electronics Letters, 51(22), 1789–1791. https://doi.org/10.1049/el.2015.1580

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free