Registration of time of flight terrestrial laser scanner data for stop-and-go mode
Bibliographic record
Abstract
Abstract. Terrestrial Laser Scanners (TLS) are utilized through different data acquisition techniques such as Mobile Laser Scanning (MLS) and the output can be used in different applications such as 3D city modelling, cultural heritage documentations, oil and Gas as built, etc... In this research paper, we will investigate one of the modes of TLS on mobile mapping platform. Namely the Stop-and-Go (SAG) mode. Unlike the continuous mode, the Stop-and-Go mode does not require the use of IMU to estimate the TLS attitude and thus inturn it has an overall reduction in the system cost. Moreover, it decreases the time required for data processing in comparison with the continuous mode. For successful use of SAG mobile mapping in urban areas, it is preferred to use a long range time of flight laser scanner to cover long distances in each scan and minimize the registration error. The problem arise with Long range laser scanners is their low point cloud density. The low point cloud density affects the registration accuracy specially in monitoring applications. The point spacing between points is one of the issues facing the registration especially when the matching points are chosen manually. Since most of TLS nowadays are equipped with camera on-board we can utilize the camera to get an initial estimate of the registration parameters based on image matching. After having an initial approximation of the registration parameters we feed those parameters to the Iterative Closest Point algorithm to obtain more accurate registration result.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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".