Developing an Algorithm for Buildings Extraction and Determining Changes from Airborne LiDAR, and Comparing with R-CNN Method from Drone Images
Bibliographic record
Abstract
The world has experienced urban changes rapidly, and this phenomenon encourages authors to contribute to the United Nations sustainable development goals (SDGs) 2030 and geospatial information. This study presents a proposed algorithm of change detection and extracting the borders of buildings. This proposed algorithm provides a set of instructions to describe the method of solving the problem of how extracting the boundary of buildings from the light detection and ranging (LiDAR) input data incorporating with the firefly and ant colony algorithms. The method has used two different epochs to compare buildings and to identify the type of changes in selected buildings. These changes are based on the newly built or demolished buildings. We also used drone images and mask the region-based convolutional neural network (R-CNN) method to compare the results of roof extraction of buildings vs. the proposed algorithm. This study shows that the proposed algorithm identifies the changes of all buildings with higher accuracy of extracting border of buildings than the existing methods, successfully. This study also determines that the amount of root mean square error (RMSE) is 2.40 m2 when we use LiDAR. This proposed algorithm contributes to identifying rapidly changed buildings, and it is helpful for global geospatial information of urban management that can add best practice and solution toward the UN SDGs connectivity dilemma of urban settlement, resilience, and sustainability.
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.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".