Cascaded Homography-Constrained Local Feature Matching for Optical and SAR Images
Bibliographic record
Abstract
Due to significant nonlinear radiation distortion and inherent speckle noise in SAR images, reliable matching between optical and SAR images remains a critical challenge. Current deep learning-based methods for optical and SAR image matching typically enhance specific steps of traditional algorithms, such as feature detection or description, but lack a comprehensive end-to-end solution. In response, we propose an end-to-end cascaded homography-constrained image matching (CHCIM) method for optical and SAR images. First, we combine CNN and transformers to efficiently fuse and extract similar features between optical and SAR images. In addition, a bilateral matching and homography-based cascade matching strategy is introduced for supervision and inference, which first refines the matching range using homography constraints and then employs random uniform sampling to select candidate features for further refinement. Extensive experiments demonstrate that CHCIM significantly outperforms the state-of-the-art baselines (e.g., RIFT and LoFTR) in matching accuracy (91.90% versus 50.10% and 44.37%), achieving the highest scores in mean matching accuracy (66.18% versus 4.01% and 4.67%) and the number of correct matches (1378 versus 43 and 26). Furthermore, CHCIM is effective in weak texture scenarios and robust to large scale and rotation variations. The code will be publicly available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/LJY-RS</uri>.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".