Efficient and Robust Iris Localization Framework for Real-World Noisy Images
Bibliographic record
Abstract
The iris pattern is one of the most precise and dependable biometrics that is frequently used for user authentication systems because of its stability and uniqueness.Delineating the inner and outer boundaries of the actual iris in the eye's part is the goal of the iris localization.Dealing with less-than-ideal iris images can result in an inaccurate location, making this localization process difficult.To describe the pupillary boundaries in facial images with varying skin colors, eye colors, and eye sizes, the traditional methods can be noisy, antiquated, and possibly inaccurate.In order to solve this problem, this paper introduced a robust framework that uses the AdaBoost and Haar Cascade to localize iris in complex conditions.Five phases that the introduced framework goes through.It was evaluated on both standard and non-standard photos using three datasets: the Labeled Faces in the Wild (LFW), the MMU V1.0, and the Iris Super Resolution (ISR), from which images of entire faces and images of eyes only were chosen.According to the experiments, the introduced algorithm rate was 100% for 220 eye images in the ISR, 99.33% for 300 eye images in the MMU, and 98.88% for 180 face photos in the LFW.
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.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.001 |
| 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".