A Fast Unsupervised Image Stitching Model Based on Homography Estimation
Bibliographic record
Abstract
Image stitching is the synthesis of multiple partial image segments into a complete and continuous panoramic image through effective image alignment and seamless fusion techniques. It can achieve a wider field of view and richer information for display and analysis. Most deep learning-based image stitching methods have significant advantages in improving accuracy, but they are not suitable for real-time applications due to multiple iterations of computation or deeper network depth. To deal with this problem, a fast unsupervised image stitching model is proposed in this article. In the proposed model, an adaptive feature extraction module (FEM) for deformation is designed, and then a fast unsupervised learning-based image alignment network is proposed. In addition, a stitching restoration network with a smaller number of parameters is presented to remove the redundant and unnecessary sampling and convolution operations in general deep learning-based models. Finally, some experiments are conducted on both the synthetic and real-scene datasets. The total stitching accuracy of the proposed model is higher, and the details of the output images are clearer. The proposed can achieve 1.79, 26.54, and 0.86 in RMSE, peak signal-to-noise ratio (PSNR), and structural similarity (SSIM) on the alignment results, respectively, which are better than those of the state-of-the-art methods. Furthermore, the comparison results prove that the proposed model can effectively reduce memory loss, and achieve a fast unsupervised image stitching, with a very small model size.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".