Classification-assisted Deep Sparse Image Recognition
Bibliographic record
Abstract
This paper proposes a classification-assisted deep sparse network (CDSRC) model to achieve the purpose of image classification. The proposed algorithm consists of four parts: Encoder, Self-representer, Decoder and Classifier. The Encoder part can extract the high-level feature map of the input image, and Self-representer can establish the representational relationship between the test set and the training set image, so as to reconstruct the image of the test set. The Decoder can restore the reconstructed sample to the original image in the form of deconvolution, which is used to supervise the Self-representer. Next, the Encoder can effectively extract the feature map of the original image and the reconstruction of the test set sample. In addition, in order to increase the robustness of image recognition, a Classifier part is added after the Encoder. The Classifier is mainly used to classify training samples while extracting features in the training phase. This will increase the feature similarity of images of the same category, increase the difference of image features of different categories, and reduce the noise interference formed by individual samples. After the algorithm training is completed, the test sample is imported into the Encoder to extract the feature map, the feature map is combined with the sparse matrix of the Self-representer part, and then the test sample category is predicted. Experiments show that the algorithm(CDSRC) in this paper has better results than the SRC-related algorithms that have been proposed.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".