A Multi-class SVM Based Content Based Image Retrieval System Using Hybrid Optimization Techniques
Bibliographic record
Abstract
Due to the increasing usage of multimedia and storage devices accessible, searching for large image databases has become imperative.Furthermore, the handiness of high-speed internet has escalated the exchange of images by users enormously.Content-Based Image Retrieval is proposed in this work, taking features based on Exact Legendre Moments, HVS color quantization with dc coefficient and statistical properties such as variance, mean, and skew of Conjugate Symmetric Sequency Complex Hadamard Transform (CS-SCHT).In most of the machine learning tasks, the quality of the learning process depends on dimensionality.High dimensional datasets can influence the classification outcome and training time.To overcome this problem, we use DE (Differential Evolution) to generate the optimal feature subsets.The features scaled by weights derived from the firefly algorithm, which fed to Multi-Class SVM.The fitness function taken for the firefly algorithm is the classification error of SVM.By minimizing fitness function, optimum weights are obtained.When these optimal weights are applied to SVM, the proposed algorithm exhibits better precision, recall, and accuracy when compared to some of the existing algorithms in the literature.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".