Content-Based Image Retrieval System Based on Fusion of Wavelet Transform, Texture and Shape Features
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In the last few years, Content-Based Image Retrieval (CBIR) has received wide attention. Compared to text-based image retrieval contents of the image are more in information for efficient retrieval by Content-Based Image Retrieval. The single feature cannot be applied to all the images and provides lower performance. In this paper, we have put forward a proposal on an image retrieval using multi-feature fusion. The concept of multi-resolution has been exploited with the help of a wavelet transform. This method combines Local Binary Pattern (LBP) with Fast and Accurate Exponent Fourier Moments (FAEFM’s) with the wavelet decomposition of an image using multiple resolutions. In order to extract the feature of texture from image, LBP codes of Discrete Wavelet Transform (DWT), the image coefficients are estimated followed by the computation of Fast and Accurate Exponent Fourier Moments to these LBP codes so as to extract features of shape to construct the required feature vector. These constructed vectors aid us in exactly finding out and retrieving visually similar images from existing databases. The benchmark databases Corel-1k and Olivia 2688 are used to test the proposed method. The proposed method achieves 99.99% of precision and 93.15% of recall on Corel-1k database and 99.99% of precision and recall of 93.63% on Olivia-2688 database, which are higher than the existing methods.
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.
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 it