A Fast New Rotation Insensitive WP-Based Method for Image Indexing and Retrieval
Bibliographic record
Abstract
Large multimedia databases and digital image archival systems are being created in government, academia, military, hospitals, digital libraries, and businesses. Efficient methods to retrieve images from such large databases have become indispensable. In this chapter, the authors present a novel Wavelet Packet (WP)-based method for image identification and retrieval that enables the recovery of the original image from a database even if the image has been subjected to geometric transformations such as size-conserving rotation or flipping operations. The proposed method uses the correlation of wavelet packet coefficients to create an image signature. This signature is comprised of two parts. The first part is a short signature, SS, that represents the location of specific values of the WP coefficient correlations in each frequency band. The second portion is the basis signature of the image, which is a long signature, LS, of 1296 correlation points produced by summing up the correlation values along all frequency bands. Computer simulation results show that the method is extremely fast, has a perfect image retrieval rates (100%), and perfect geometric transformations recognition, if any. In addition, the simulation results show that target images are perfectly identified from an image database of 7500 image signatures within a short period of time (nearly 8 seconds on the average). This method is robust against geometric transformation and requires minimal data transfer and can be used for online image retrieval.
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.000 |
| 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".