SEMI-AUTOMATIC APPROACH FOR OPTICAL AND LIDAR DATA INTEGRATION USING PHASE CONGRUENCY MODEL AT MULTIPLE RESOLUTIONS
Bibliographic record
Abstract
Abstract. In light of the ongoing urban sprawl reported in recent studies, accurate urban mapping is essential for assessing current status and evolve new policies, to overcome various social, environmental, and economic consequence. Imagery and LiDAR data integration densifies remotely sensed data with radiometric and geometric characteristics, respectively, for a precise segregation of different urban features. This study integrated aerial and LiDAR images using point primitives, which were obtained from running the Phase Congruency model as an image filter to detect edges and corner. The main objective is to study the effect of applying the filter at different spatial resolutions on the registration accuracy and processing time. The detected edge/corner points that are mutual in both datasets, were identified as candidate points. The Shape Context Descriptor method paired-up candidate points as final points based on a minimum correlation of 95%. Affine, second and third order polynomials, in addition to the Direct Linear Transformation models were applied for the image registration process using the two sets of final points. The models were solved using Least Squares adjustments, and validated by a set of 55 checkpoints. It was observed that with the decrease in spatial resolution, on one hand, the registration accuracy did not significantly vary. However, the consistency of the model development and model validation accuracies were enhanced, especially with the third order polynomial model. On the other hand, the number of candidate points decreased; consequently, the processing time significantly declined. The 3D LiDAR points were visualised based on the Red, Green, and Blue radiometric values that were inherited from the aerial photo. The qualitative inspection was very satisfactory, especially when examining the scene’s tiny details. In spite of the interactivity in determining the candidate points, the proposed procedure overcomes the dissimilarity between datasets in terms of acquisition technique and time, and widens the tolerance of accepting points as candidates by including points that are not traditionally considered (i.e. road intersections).
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 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.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".