Multiobjective Genetic Optimization of Terrain-Independent RFMs for VHSR Satellite Images
Bibliographic record
Abstract
Rational polynomial coefficients (RPCs) biases and over-fitting phenomenon are two major issues in terrain-independent rational function models. These problems degrade the accuracy of extracted spatial information from very high spatial resolution (VHSR) satellite images. This study particularly focused on overcoming the over-fitting problem through an optimal term selection approach. To this end, multiobjective genetic algorithm was used in order to optimize three effective objective functions: the RMSE of ground control points (GCPs), the number, and the distribution of both RPCs and GCPs. Finally, the technique for order of preference by similarity to ideal solution, as an efficient multicriteria decision-making method, was applied to select the best solution, i.e., the optimum terms of RPCs, through the ranking of solutions in the optimum set. The performance of the proposed method was evaluated by using three VHSR images acquired by GeoEye-1, Worldview-3, and Pleiades satellite sensors. Experimental results show that subpixel accuracy can be nearly achieved in all data sets, when over-fitting problem is addressed. The optimal selected terms leaded to a significant improvement compared to the original RPCs. Indeed, our method, which is independent of GCPs distribution, not only requires a small number of GCPs, but also leads to a 30% to 75% improvement when compared to the original RPCs. This improvement in VHSR images, usually makes no more need to remove the RPCs biases.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| 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".