FRCNN-GNB: Cascade Faster R-CNN With Gabor Filters and Naïve Bayes for Enhanced Eye Detection
Bibliographic record
Abstract
Research into biometric identification technologies has evolved in recent years, as most secure facilities and applications are now based on digital technology. Among the available biometric identification technologies is eye detection. The relevance and impact of the use of eye detection in a variety of biometric authentication systems are very high. The main problems associated with the accuracy of eye detection methods are occlusion or reflections from glass. In view of this, we propose a hybridized and enhanced eye detection method that uses a faster region-based convolutional neural network with Gabor filters and naive Bayes (FRCNN-GNB) model to address the problems associated with eye detection schemes. The proposed method consists of four components: convolution layers, a region proposal network, a detection network, and a decision model. The enhancement method is based on a cascade Faster R-CNN with Gabor filters and the naïve Bayes model, in which the initial bounding boxes of the eye region are detected using Faster R-CNN and the decision step is carried out using Gabor filters and the naïve Bayes model to determine which of the bounding boxes belong to the eye region. Experiments on the proposed FRCNN-GNB eye detection scheme are performed on the CASIA-IrisV4 database, and show that the accuracy in terms of eye detection is 100%. The results of the study demonstrate the efficiency of the proposed solution.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| 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.002 | 0.001 |
| 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".