CONTENT BASED IMAGE RETRIEVAL USING DISCRETE WAVELET TRANSFORM
Bibliographic record
Abstract
Image retrieval plays an important role in a broad spectrum of applications. Contentbased retrieval (CBR) is one of the popular choices in many biomedical and industrial applications. Discrete image transforms have been widely studied and suggested for many image retrieval applications. The Discrete Wavelet Transform (DWT) is one of the most popular transforms recently applied to many image processing applications. The Daubechies wavelet can be used to form the basis for extracting features in retrieving images based on the description of a particular object within the scene. This wavelet is widely used for image compression. In this paper we highlight the common features between compression and retrieval. Several examples are used to test the DWT retrieval system. A comparison between DWT and Discrete Cosine Transform (DCT) is also made. The retrieval system using DWT requires preprocessing and normalization of images, which might slow down the retrieval process. The accuracy of the retrieval using DWT has been significantly improved by incorporating efficient K-Neighbor Nearest Distance (KNND) measure in our system.
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.004 | 0.004 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.004 |
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".