Image pattern recognition using phase-based local features and their flexible spatial configuration
Bibliographic record
Abstract
We propose a new image pattern recognition system that is applicable to several computer vision tasks, such as long range motion matching and object recognition. The main strength of our system is its ability to handle substantial image deformations without significantly sacrificing the expressiveness of the model representation. This system is divided into three steps, namely: (a) feature extraction, (b) similarity search, and (c) hypothesis verification. The phase-based local feature proposed for step (a) is shown to be distinctive and robust to 2-D rigid deformations and severe brightness changes. The step (b) pairs similar model and test image features, producing the correspondence set, which is usually densely populated with outliers. Hence, the rejection of outliers from this set is necessary to reduce the number of hypotheses to be verified in step (c). We propose two methods to reject outliers that are robust to rigid and non-rigid deformations. Quantitative evaluations for both the local feature extractor and the outlier rejection methods are also provided. Comparison results produced by these evaluations show that our feature is more robust and distinctive than state-of-the-art features proposed in the literature, and our methods to reject outliers are more robust to 3-D rigid and non-rigid deformations than the Hough transform, which is a common method used to reject outliers. Finally, our last contribution is a probabilistic verification for step (c) that uses local and semi-local similarities between test and model images. The effectiveness of our system is tested in several recognition problems.
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.002 |
| Science and technology studies | 0.000 | 0.001 |
| 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.002 | 0.002 |
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".