Storage Space Reduction of Biometric Iris Databases by Successive Images Differences and Quadtree Decomposition
Bibliographic record
Abstract
In recent years, the rise of biometric applications, particularly those centered around iris-based systems, has been significant.High data volumes inherent in these applications and the potential vulnerability of network links necessitate data compression in certain instances.The advantage of lossless compression methods is twofold: they maintain recognition performance without degradation while necessitating fewer computations for differentiation compared to their lossy counterparts.This study proposes a novel approach for lossless/lossy compression of iris biometric sample data across various public iris databases.Initially, the differences between successive images within each class are calculated, leveraging the strong correlation of images within each class.Subsequently, these differences are compressed using quadtree decomposition.This methodology was tested on six renowned iris databases: CASIA V1, CASIA V3, MMU1, MMU2, and UBIRIS Iris, all of which contain 8-bit grayscale images.The results indicate that the proposed strategy offers superior compression performance across different iris databases in comparison to existing methods.Notably, the results suggest that this method can be effectively integrated into an iris biometric recognition system, providing efficient iris image compression, especially when applied in its lossless form.
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.000 | 0.000 |
| 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.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".