IDENTIFICATION AND MATCHING OF PLANES IN A PAIR OF UNCALIBRATED IMAGES
Bibliographic record
Abstract
In this paper, we propose a new method to simultaneously achieve segmentation and dense matching in a pair of stereo images. In contrast to conventional methods that are based on similarity or correlation techniques, this method is based on geometry, and uses correlations only on a limited number of key points. Stemming from the observation that our environment is abundant in planes, this method focuses on segmentation and matching of planes in an observed scene. Neither prior knowledge about the scene nor camera calibration are needed. Using two uncalibrated images as inputs, the method starts with a rough identification of a potential plane, defined by three points only. Based on these three points, a plane homography is then calculated and, used for validation. Starting from a seed region defined by the original three points, the method grows the current region by successive move/confirmation steps until occlusions and/or surface discontinuity occur. In this case, the homography-based mapping of points between the two images will not be valid anymore. This condition is detected by the correlation, used in the confirmation process. In particular, this method grows a region even across different colors as long as the region is planar. Experiments on real images validated our method and showed its capability and performance.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| 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".