Object-Oriented Unsupervised Change Detection Based on Neighborhood Correlation Images and <i>k</i>-Means Clustering for the Multispectral and High Spatial Resolution Images
Bibliographic record
Abstract
An unsupervised change-detection problem is formulated as a binary classification problem corresponding to the change and no change areas. This paper proposes a novel unsupervised object-oriented change detection method based on neighborhood correlation images (NCIs) and k-means clustering for high-resolution remote sensing images. We tested our proposed method in two study areas of Beijing with RapidEye images and compared it with three other popular change detection methods based on different images: change vector analysis (CVA), principal component analysis (PCA), and multivariate alteration detection (MAD). The results indicate that our method has the highest overall accuracy (90.80% in Shunyi District, Beijing and 90.40% in Daxing District, Beijing) and Kappa coefficient (0.7922 in Shunyi District, Beijing and 0.7796 in Daxing District, Beijing). In addition, the McNemar test indicates that our method is robust and stable across different study areas. We concluded that the object-oriented NCIs method outperforms traditional difference images (CVA, PCA, and MAD) in unsupervised change detection. The experimental results demonstrate the effectiveness of the proposed approach in solving the problem of unsupervised change detection for high-resolution images.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".