Change Detection in Remote Sensing Image Data Comparing Algebraic and Machine Learning Methods
Bibliographic record
Abstract
Remote sensing technology has penetrated all the natural resource segments as it provides precise information in an image mode. Remote sensing satellites are currently the fastest-growing source of geographic area information. With the continuous change in the earth’s surface and the wide application of remote sensing, change detection is very useful for monitoring environmental and human needs. So, it is necessary to develop automatic change detection techniques to improve the quality and reduce the time required by manual image analysis. This work focuses on the improvement of the classification accuracy of the machine learning techniques by reviewing the training samples and comparing the post-classification comparison with the image differencing in the algebraic technique. Landsat data are medium spatial resolution data; that is why pixel-wise computation has been applied. Two change detection techniques have been studied by applying a decision tree algorithm using a separability matrix and image differencing. The first change detection, e.g., the separability matrix, is a post-classification comparison in which individual images are classified by a decision tree algorithm. The second change detection is, e.g., the image differencing change detection technique in which changed and unchanged pixels are determined by applying the corner method to calculate the threshold on the changing image. The performance of the machine learning algorithm has been validated by 10-fold cross-validation. The experimental results show that the change detection using the post-classification method produced better results when compared to the image differencing of the algebraic change detection technique.
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.004 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 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".