AN ORTHONORMAL–SHELL–FOURIER DESCRIPTOR FOR RAPID MATCHING OF PATTERNS IN IMAGE DATABASE
Bibliographic record
Abstract
Invariance and low dimension of features are of crucial significance in pattern recognition. This paper proposes a novel orthonormal shell Fourier descriptor that satisfies all of these demands. This method first performs orthonormal shell decomposition on the line moment that is obtained from the 2-D pattern, then applies Fourier transform on each scale of the shell coefficients. Unlike other existing wavelet-based methods, our method allows applying common orthonormal wavelets, such as Daubechies, Symmlet and Coiflet, therefore it is simple to implement. We study the structure of the filter used and develop a fast algorithm to rapidly compute the spectra of orthonormal shell coefficients. The complexity of the proposed descriptor is O(n log n). We apply a coarse-to-fine strategy to search the image database; the matching is very quick because of the multiscale feature structure. The effectiveness of this new descriptor is demonstrated by a series of experiments as well as the comparison with other descriptors. The proposed descriptor is robust to white noise.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".