Bibliographic record
Abstract
Deep learning is well known as a method to extract hierarchical representations of data. This method has been widely implemented in many fields, including image classification, speech recognition, natural language processing, etc. Over the past decade, deep learning has made a great progress in solving face recognition problems due to its effectiveness. In this thesis a novel deep learning multilayer hierarchy based methodology, named Local Binary Pattern Network (LBPNet), is proposed. Unlike the shallow LBP method, LBPNet performs multi-scale analysis and gains high-level representations from low-level overlapped features in a systematic manner. The LBPNet deep learning network is generated by retaining the topology of Convolutional Neural Network (CNN) and replacing its trainable kernel with the off-the-shelf computer vision descriptor, the LBP descriptor. This enables LBPNet to achieve a high recognition accuracy without requiring costly model learning approach on massive data. LBPNet progressively extracts features from input images from test and training data through multiple processing layers, pairwisely measures the similarity of extracted features in regional level, and then performs the classification based on the aggregated similarity values. Through extensive numerical experiments using the popular benchmarks (i.e., FERET, LFW and YTF), LBPNet has shown the promising results. Its results out-perform (on FERET) or are comparable (on LFW and FERET) to other methods in the same categories, which are single descriptor based unsupervised learning methods on FERET and LFW, and single descriptor based supervise learning methods with image-restricted no outside data settings on LFW and YTF, respectively. --Leaves i-ii.
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.001 | 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.003 | 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".