Rapid 3D lidar change detection for geohazard identification using GPU-based alignment and M3C2 algorithms
Bibliographic record
Abstract
Topographic change detection is increasingly being used to identify and monitor landslides and other geohazards in support of risk-informed decision-making. Expanding change detection from site specific to regional scales enables increasingly proactive asset management and contributes to improving the resilience of infrastructure to extreme events. It is widely known that change detection precision can be improved by applying three-dimensional algorithms, such as iterative closest point (ICP) and M3C2, directly to raw point clouds. However, this also increases the computational requirements compared to alternatives such as digital elevation model differencing. This study presents a novel graphics processing unit (GPU)-based implementation of the ICP-M3C2 workflow to address this limitation. In the proposed algorithm, point cloud data segments are automatically queued and served to the working GPU, which efficiently performs point cloud processing operations, while the central processing unit (CPU) performs data management operations in parallel. The developed method is estimated to be up to 54 times faster than CPU-based versions of the same algorithm. In this study, we present how the workflow has been applied to six regional-scale landslide identification and monitoring case studies in which landslides are causing the disruption of pipelines, highways, and rail corridors. Overall, in 2021 and 2022, over 17 500 linear km of change detection were processed using the demonstrated method.
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.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".