Efficient color image retrieval method using deep stacked sparse autoencoder
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
The recent advancement in deep learning-based approaches vastly outperforms the traditional image descriptors. Deep learning models, such as residual networks (ResNet), are well known for finding salient features. Although effective, high-level description often has a high dimensionality that increases computational overhead. The autoencoders find the useful approximation of the input data without losing critical information. Considering this, we propose a content-based image retrieval system for natural color images using a deep stacked sparse autoencoder (DSSA). The DSSA model learns latent features in an unsupervised way from the high-level description obtained using ResNet. The DSSA model achieves a nearly 50% reduction in size compared with the full-length features for the simple distance-based retrieval approach while increasing accuracy. The image retrieval efficacy of the learned latent features is also evaluated for two classifier-based methods using a Softmax classifier. Further, this study investigates the impact of unsupervised feature learning on retrieval using three benchmark natural color image databases of varying complexities, viz., Corel-1K, Corel-10K, and Canadian Institute for Advanced Research (CIFAR)-10. The latent features learned by the DSSA model with the fuzzy class membership-based retrieval method achieve promising improvements and yield a highly competitive retrieval performance with the large-size CIFAR-10 database.
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.003 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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