A Logarithmic Function-Based Novel Representation Algorithm for Image Classification
Bibliographic record
Abstract
Salient feature extraction is an important task in image classification and recognition. Although classification techniques focus on the bright part of an image, many pixels of the image are of similar saliency. To address the issue, this paper proposes the logarithmic function-based novel representation algorithm (LFNR) to apply a novel representation for each image. The original and novel representations were fused to improve the classification accuracy. Experimental results show that, thanks to the simultaneous use of original and novel representations, the test samples could be better classified. The classification algorithms coupled with the LFNR all witnessed lower error rates than the original algorithms. In particular, the collaboration representation-based classification coupled with the LFNR significantly outperformed the other sparse representation algorithms, such as homotopy, primal augmented Lagrangian method (PALM), and sparse reconstruction by separable approximation algorithm (SpaRSA). The no-parameter property of the LFNR is also noteworthy.
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 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.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".