A Hybrid Kernel-Based Change Detection Method for Remotely Sensed Data in a Similarity Space
Bibliographic record
Abstract
Detection of damages caused by natural disasters is a delicate and difficult task due to the time constraints imposed by emergency situations. Therefore, an automatic Change Detection (CD) algorithm, with less user interaction, is always very interesting and helpful. So far, there is no existing CD approach that is optimal and applicable in the case of (a) labeled samples not existing in the study area; (b) multi-temporal images being corrupted by either noise or non-normalized radiometric differences; (c) difference images having overlapped change and no-change classes that are non-linearly separable from each other. Also, a low degree of automation is not optimal for real-time CD applications and also one-dimensional representations of classical CD methods hide the useful information in multi-temporal images. In order to resolve these problems, two automatic kernel-based CD algorithms (KCD) were proposed based on kernel clustering and support vector data description (SVDD) algorithms in high dimensional Hilbert space. In this paper (a( a new similarity space was proposed in order to increase the separation between change and no-change classes, and also to decrease the processing time, (b) three kernel-based approaches were proposed for transferring the multi-temporal images from spectral space into high dimensional Hilbert space, (c) automatic approach was proposed to extract the precise labeled samples; (d) kernel parameter was selected automatically by optimizing an improved cost function and (e) initial value of the kernel parameter was estimated by a statistical method based on the L2-norm distance. Two different datasets including Quickbird and Landsat TM/ETM+ imageries were used for the accuracy of analysis of proposed methods. The comparative analysis showed the accuracy improvements of kernel clustering based CD and SVDD based CD methods with respect to the conventional CD techniques such as Minimum Noise Fraction, Independent Component Analysis, Spectral Angle Mapper, Simple Image differencing and Image Rationing, and also the computational cost analysis showed that implementation of the proposed CD method in similarity space decreases the processing runtime.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| 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.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".