Evidence map›Paper›PMID 42515486›Full record

ArticleSensors (Basel, Switzerland)2026

Fast Grid-Based Ground Segmentation of LiDAR Point Clouds Using Dual-Seed Expansion.

Jongyun Lee, Manbok Park

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Jongyun LeeDepartment of Electronics Engineering, Korea National University of Transportation, Chungju-si 27469, Republic of Korea.
Manbok ParkDepartment of Electronics Engineering, Korea National University of Transportation, Chungju-si 27469, Republic of Korea.ORCID 0000-0001-5976-0539

Funding

Ministry of Education (MOE) and the (Chungcheongbuk-do) 2026-RISE-11-004-03Ministry of Land, Infrastructure and Transport RS-2021-KA160501Ministry of Trade, Industry and Energy 20018055
6 · The paper itself

Abstract

Ground segmentation is an essential preprocessing step for LiDAR-based perception in autonomous driving, as it directly affects subsequent object clustering and obstacle detection. This paper proposes a fast grid-based ground segmentation method for 3D Light Detection and Ranging (LiDAR) point clouds using dual-seed expansion. The input point cloud is projected onto a two-dimensional Cartesian grid, where cell-wise height statistics, including minimum height, maximum height, mean height, and height variance, are computed. Initial ground candidates are selected by combining a global height-distribution-based seed and a LiDAR-mounting-height-based seed to reduce missed ground candidates in sloped or sparse regions. Ground cells are then expanded to nearby cells based on the local height difference. To reduce misclassification in cells containing both ground and non-ground points, a local height-band criterion is applied for point-level refinement. The proposed method was implemented in Robot Operating System 1 (ROS 1) and evaluated on the SemanticKITTI dataset. Experimental results showed an average accuracy of 96.34%, an F1-score of 97.11%, and a ground Intersection over Union (IoU) of 94.40%. The average processing time over SemanticKITTI sequences 00-10 was 12.15 ms per frame. These results demonstrate that the proposed method is suitable as a fast preprocessing module for LiDAR-based autonomous driving perception.

Indexed as

autonomous drivinggrid-based segmentationground segmentationLiDAR point cloudSemanticKITTI

Identifiers

PMID42515486
PMCPMC13417310

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.