3-D Point Cloud Object Detection Based on Supervoxel Neighborhood With Hough Forest Framework
Bibliographic record
Abstract
Object detection in three-dimensional (3-D) laser scanning point clouds of complex urban environment is a challenging problem. Existing methods are limited by their robustness to complex situations such as occlusion, overlap, and rotation or by their computational efficiency. This paper proposes a high computationally efficient method integrating supervoxel with Hough forest framework for detecting objects from 3-D laser scanning point clouds. First, a point cloud is over-segmented into spatially consistent supervoxels. Each supervoxel together with its first-order neighborhood is grouped into one local patch. All the local patches are described by both structure and reflectance features, and then used in the training stage for learning a random forest classifier as well as the detection stage to vote for the possible location of the object center. Second, local reference frame and circular voting strategies are introduced to achieve the invariance to the azimuth rotation of objects. Finally, objects are detected at the peak points in 3-D Hough voting space. The performance of our proposed method is evaluated on real-world point cloud data collected by the up-to-date mobile laser scanning system. Experimental results demonstrate that our proposed method outperforms state-of-the-art 3-D object detection methods with high computational efficiency.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".